Abstract
We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affine projections which utilizes two properties of trajectory data: geometric constraint and locality. The geometric constraint states that the trajectories of the same motion lie in a low dimensional linear manifold and different motions result in different linear manifolds; locality, by which we mean in a transformed space a data and its neighbors tend to lie in the same linear manifold, provides a cue for efficient estimation of these manifolds. Our algorithm estimates a number of linear manifolds, whose dimensions are unknown beforehand, and segment the trajectories accordingly. It first transforms and normalizes the trajectories; secondly, for each trajectory it estimates a local linear manifold through local sampling; then it derives the affinity matrix based on principal subspace angles between these estimated linear manifolds; at last, spectral clustering is applied to the matrix and gives the segmentation result. Our algorithm is general without restriction on the number of linear manifolds and without prior knowledge of the dimensions of the linear manifolds. We demonstrate in our experiments that it can segment a wide range of motions including independent, articulated, rigid, non-rigid, degenerate, non-degenerate or any combination of them. In some highly challenging cases where other state-of-the-art motion segmentation algorithms may fail, our algorithm gives expected results.
The support of the NSF ITR grant IIS-0313047 is gratefully acknowledged.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Fischler, M.A., Bolles, R.C.: Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Comm. of the ACM 24, 381–395 (1981)
Costeira, J.P., Kanade, T.: A Multibody Factorization Method for Independently Moving Objects. IJCV 29(3), 159–179 (1998)
Bregler, C., Hertzmann, A., Biermann, H.: Recovering Non-Rigid 3D Shape from Image Streams. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2000) (June 2000)
Brand, M.: Morphable 3D models from video. In: CVPR, vol. II, pp. 456–463 (2001)
Xiao, J., Chai, J.-x., Kanade, T.: A closed-form solution to non-rigid shape and motion recovery. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3024, pp. 573–587. Springer, Heidelberg (2004)
Ullman, S.: Maximizing rigidity: The incremental recovery of 3D structure from rigid and rubbery motion. Technical Report A.I. Memo No. 721, MIT (1983)
Sinclair, D.: Motion segmentation and local structure. In: Proceedings of the 4th International Conference on Computer Vision (1993)
Boult, T., Brown, L.: Factorization-based segmentation of motions. In: Proceedings of the IEEE Workshop on Visual Motion (1991)
Gear, C.W.: Feature grouping in moving objects. In: Proceedings of the Workshop on Motion of Non-Rigid and Articulated Objects, Austin, Texas (1994)
Ichimura, N.: Motion segmentation based on factorization method and discriminant criterion. In: Proc. IEEE Int. Conf. Computer Vision, pp. 600–605 (1999)
Kanatani, K.: Motion segmentation by subspace separation and model selection:model selection and reliability evaluation. Intl. J. of Image and Graphics 2(2), 179–197 (2002)
Zelnik-Manor, L., Irani, M.: Degeneracies, dependencies and their implications in multi-body and multi-sequence factorizations. In: Proc. IEEE Computer Vision and Pattern Recognition (2003)
Ferrari-Trecate, G., Muselli, M., Liberati, D., Morari, M.: A clustering technique for the identification of piecewise affine and hybrid systems. Automatica 39, 205–217 (2003)
Weiss, Y.: Segmentation using eigenvectors: A unifying view. In: International Conference on Computer Vision, Corfu, Greece, September 1999, pp. 975–982 (1999)
Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems 14, MIT Press, Cambridge (2002)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) (2000)
Tomasi, C., Kanade, T.: Shape and motion from image streams under orthography: a factorization method. IJCV 9(2), 137–154 (1992)
Vidal, R., Hartley, R.: Motion Segmentation with Missing Data using PowerFactorization and GPCA. In: IEEE Conference on Computer Vision and Pattern Recognition (2004)
Vidal, R., Ma, Y., Sastry, S.: Generalized Principal Component Analysis (GPCA). In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2003) (June 2003)
Vidal, R., Ma, Y., Piazzi, J.: A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2004), June 27-July 02 (2004)
Yan, J., Pollefeys, M.: A Factorization-based Approach to Articulated Motion Recovery. In: IEEE Conf. on Computer Vision and Pattern Recognition (2005)
Tresadern, P., Reid, I.: Articulated Structure From Motion by Factorization. In: Proc. IEEE Conf on Computer Vision and Pattern Recognition (2005)
Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2002)
Golub, G., van Loan, A.: Matrix Computations. Johns Hopkins U. Press (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yan, J., Pollefeys, M. (2006). A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate. In: Leonardis, A., Bischof, H., Pinz, A. (eds) Computer Vision – ECCV 2006. ECCV 2006. Lecture Notes in Computer Science, vol 3954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11744085_8
Download citation
DOI: https://doi.org/10.1007/11744085_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33838-3
Online ISBN: 978-3-540-33839-0
eBook Packages: Computer ScienceComputer Science (R0)