![]() |
CiteULike | ![]() |
Group: Blog_and_Wiki_Research | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
A robust and efficient motion segmentation based on orthogonal projection matrix of shape spaceby: N. Ichimura
Computer Vision and Pattern Recognition, 2000. Proceedings. IEEE Conference on, Vol. 2 (2000), pp. 446-452 vol.2.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractA novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Thus motion segmentation is done as the decomposition of shape space of multiple objects into a set of 4 dimensional subspace. The decomposition is realized using the discriminant analysis of orthogonal projection matrix of shape space. Since only discriminant analysis of ID data is needed, this analysis is quite simple. The algorithm based on the analysis is robust for data with noise and outliers, because the analysis can extract useful information for motion segmentation while rejecting useless one. The implementation results show that the proposed method is robust and efficient enough to do online task for real scenes
BibTeX record
RIS record