2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2 Multibody Grouping via Orthogonal Subspace Decomposition Kauai, Hawaii December 08-December 14 ISBN: 0-7695-1272-0
Multibody structure from motion could be solved by the factorization approach. However, the noise measurements would make the segmentation difficult when anaylyzing the shape interaction martix. This paper presents an orthogonal subspace decomposition and grouping technique to approach such a problem. We decompose the object shape spaces into signal subspaces and noise subspaces. We show that the signal subspaces of the object shape spaces are orthogonal to each other. Instead of using the shape interaction matrix contaminated by noise, we introduce the shape signal subspace distance matrix for shape space grouping. Outliers could be easily indentified by this approach. The robustness of the proposed approach lies in the fact that the shape space decomposition alleviates the influence of noise, and has been verified with extensive experiments.
Citation:
Ying Wu, Zhengyou Zhang, Thomas S. Huang, John Y. Lin, "Multibody Grouping via Orthogonal Subspace Decomposition," cvpr, vol. 2, pp.252, 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2, 2001 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||