Transparent motions are additive or multiplicative superpositions of moving patterns and occur due to reflections, semi-transparencies, and partial occlusions. The estimation of transparent motions remained a challenging nonlinear problem. We here first linearize the problem in a way which makes it accessible to the known methods used for the estimation of single motions, such as structure tensor, regularization, block matching, Fourier methods, etc. We present the results for two motion layers but there is no limit to the number of layers. Finally, we present a way to categorize different transparent-motion patterns based on the rank of a generalized structure tensor. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Mota, C., Stuke, I., Aach, T., & Barth, E. (2007). Divide-and-conquer strategies for estimating multiple transparent motions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3417 LNCS, pp. 66–77). Springer Verlag. https://doi.org/10.1007/978-3-540-69866-1_6
Mendeley helps you to discover research relevant for your work.