We present an approach for computing dense scene flow from two large displacement RGB-D images. When dealing with large displacements the crucial step is to estimate the overall motion correctly. While state-of-the-art approaches focus on RGB information to establish guiding correspondences, we explore the power of depth edges. To achieve this, we present a new graph matching technique that brings sparse depth edges into correspondence. An additional contribution is the formulation of a continuous-label energy which is used to densify the sparse graph matching output. We present results on challenging Kinect images, for which we outperform state-of-the-art techniques.
CITATION STYLE
Alhaija, H. A., Sellent, A., Kondermann, D., & Rother, C. (2015). Graphflow—6D large displacement scene flow via graph matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9358, pp. 285–296). Springer Verlag. https://doi.org/10.1007/978-3-319-24947-6_23
Mendeley helps you to discover research relevant for your work.