Unsupervised learning-based long-term superpixel tracking

被引:7
作者
Conze, Pierre-Henri [1 ,2 ]
Tilquin, Florian [3 ]
Lamard, Mathieu [2 ,4 ]
Heitz, Fabrice [3 ]
Quellec, Gwenole [2 ]
机构
[1] IMT Atlantique, Technopole Brest Iroise, F-29238 Brest, France
[2] INSERM, UMR 1101, LaTIM, 22 Av Camille Desmoulins, F-29238 Brest, France
[3] Unistra, CNRS, UMR 7357, ICube, 300 Bd Sebastien Brant, F-67412 Illkirch Graffenstaden, France
[4] Univ Bretagne Occidentale, 2 Av Foch, F-29609 Brest, France
关键词
Superpixel matching; Unsupervised learning; Superpixel tracking; Multi-step integration; Random forests; Forward-backward consistency; FORESTS;
D O I
10.1016/j.imavis.2019.06.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Finding correspondences between structural entities decomposing images is of high interest for computer vision applications. In particular, we analyze how to accurately track superpixels - visual primitives generated by aggregating adjacent pixels sharing similar characteristics - over extended time periods relying on unsupervised learning and temporal integration. A two-step video processing pipeline dedicated to long-term superpixel tracking is proposed. First, unsupervised learning-based superpixel matching provides correspondences between consecutive and distant frames using new context-rich features extended from greyscale to multi-channel and forward-backward consistency constraints. Resulting elementary matches are then combined along multi-step paths running through the whole sequence with various inter-frame distances. This produces a large set of candidate long-term superpixel pairings upon which majority voting is performed. Video object tracking experiments demonstrate the accuracy of our elementary estimator against state-of-the-art methods and proves the ability of multi-step integration to provide accurate long-term superpixel matches compared to usual direct and sequential integration. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:289 / 301
页数:13
相关论文
共 37 条
[1]   SLIC Superpixels Compared to State-of-the-Art Superpixel Methods [J].
Achanta, Radhakrishna ;
Shaji, Appu ;
Smith, Kevin ;
Lucchi, Aurelien ;
Fua, Pascal ;
Suesstrunk, Sabine .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2274-2281
[2]  
[Anonymous], 2010, LECT NOTES COMPUT SC, DOI DOI 10.1007/978-3-642-15558-1
[3]  
[Anonymous], PAC RIM C MULT
[4]  
[Anonymous], 170108936 ARXIV
[5]   PatchMatch: A Randomized Correspondence Algorithm for Structural Image Editing [J].
Barnes, Connelly ;
Shechtman, Eli ;
Finkelstein, Adam ;
Goldman, Dan B. .
ACM TRANSACTIONS ON GRAPHICS, 2009, 28 (03)
[6]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[7]   Large Displacement Optical Flow: Descriptor Matching in Variational Motion Estimation [J].
Brox, Thomas ;
Malik, Jitendra .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (03) :500-513
[8]   A Naturalistic Open Source Movie for Optical Flow Evaluation [J].
Butler, Daniel J. ;
Wulff, Jonas ;
Stanley, Garrett B. ;
Black, Michael J. .
COMPUTER VISION - ECCV 2012, PT VI, 2012, 7577 :611-625
[9]   Semi-Automatic 2D-to-3D Conversion Using Disparity Propagation [J].
Cao, Xun ;
Li, Zheng ;
Dai, Qionghai .
IEEE TRANSACTIONS ON BROADCASTING, 2011, 57 (02) :491-499
[10]  
Chang HS, 2013, IEEE IMAGE PROC, P3835, DOI 10.1109/ICIP.2013.6738790