cvpr cvpr2013 cvpr2013-244 cvpr2013-244-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Zhuoyuan Chen, Hailin Jin, Zhe Lin, Scott Cohen, Ying Wu
Abstract: We present an optical flow algorithm for large displacement motions. Most existing optical flow methods use the standard coarse-to-fine framework to deal with large displacement motions which has intrinsic limitations. Instead, we formulate the motion estimation problem as a motion segmentation problem. We use approximate nearest neighbor fields to compute an initial motion field and use a robust algorithm to compute a set of similarity transformations as the motion candidates for segmentation. To account for deviations from similarity transformations, we add local deformations in the segmentation process. We also observe that small objects can be better recovered using translations as the motion candidates. We fuse the motion results obtained under similarity transformations and under translations together before a final refinement. Experimental validation shows that our method can successfully handle large displacement motions. Although we particularly focus on large displacement motions in this work, we make no sac- rifice in terms of overall performance. In particular, our method ranks at the top of the Middlebury benchmark.
[1] L. Alvarez, J. Weickert, and J. Sanchez. Reliable estimation of dense optical flow fields with large displacements. IJCV,
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11] 39(1):41–56, 2000. Anandan. A computational framework and an algorithm for the measurement of visual motion. IJCV, 2(3):283–3 10, 1989. W. Andreas, D. Cremers, T. Pock, and H. Bischof. Structureand motion-adaptive regularization for high accuracy optic flow. ICCV, 2009. S. Baker, D. Scharstein, J. P. Lewis, S. Roth, M. J. Black, and R. Szeliski. A database and evaluation methodology for optical flow. IJCV, 92(1): 1–31, 2011. C. Barnes, E. Shechtman, A. Finkelstein, and D. B. Goldman. Patchmatch: a randomized correspondence algorithm for structural image editing. ACM SIGGRAPH, 24, 2009. F. Besse, C. Rother, A. Fitzgibbon, and J. Kautz. PMBP: Patchmatch belief propagation for correspondence field estimation. In BMVC, 2012. M. J. Black and A. D. Jepson. Estimating optical flow in segmented images using variable-order parametric models with local deformations. PAMI, 18(10):972–986, 1996. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 23(1 1): 1222–1239, 2001. T. Brox and J. Malik. Large displacement optical flow: descriptor matching in variational motion estimation. PAMI, 33(3):500–513, 2011. R. Carsten, V. Kolmogorov, V. Lempitsky, and M. Szummer. Optimizing binary mrfs via extended roof duality. CVPR, 2007. B. Connelly, E. Shechtman, D. Goldman, and A. Finkelstein. The generalized patchmatch correspondence algorithm. ECCV, 2010.
[12] W. Enkelmann. Investigations of multigrid algorithms for the estimation of optical flow fields in image sequences. In Computer Vision, Graphics, and Image Processing, 1988.
[13] K. He and J. Sun. Computing nearest-neighbor fields via propagation-assisted kd-trees. CVPR, 2012.
[14] K. He and J. Sun. Statistics of patch offsets for image completion. ECCV, 2012.
[15] B. Horn and B. Schunck. Determining optical flow. Artificial Intelligence, 16: 185–203, 1981 .
[16] W. Josh, S. Agarwal, and S. Belongie. What went where. CVPR, 2003.
[17] S. Korman and S. Avidan. Coherency sensitive hashing. ICCV, 2011.
[18] V. Lempitsky, S. Roth, and C. Rother. Fusionflow: Discretecontinuous optimization for optical flow estimation. CVPR, 2008.
[19] D. G. Lowe. Object recognition from local scale-invariant features. ICCV, 1999.
[20] F. Martin and R. C. Bolles. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications ofthe ACM, 24(6):381–395, 1981.
[21] I. Olonetsky and S. Avidan. Treecann - k-d tree coherence approximate nearest neighbor algorithm. In ECCV, 2012.
[22] F. Steinbruecker, T. Pock, and D. Cremers. Large displacement optical flow computation without warping. In ICCV, 2009.
[23] D. Sun, S. Roth, and M. J. Black. Secrets of optical flow estimation and their principles. CVPR, 2010.
[24] D. Sun, E. B. Sudderth, and M. J. Black. Layered image motion with explicit occlusions, temporal consistency, and depth ordering. In NIPS, 2010.
[25] M. Unger, M. Werlberger, T. Pock, and H. Bischof. Joint motion estimation and segmentation of complex scenes with label costs and occlusion modeling. In CVPR, 2012.
[26] L. Xu, J. Jia, and Y. Matsushita. Motion detail preserving optical flow estimation. PAMI, 16(9): 1744–1757, 2012. 222444445088