Motion segmentation by velocity clustering with estimation of subspace dimension

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The performance of clustering based motion segmentation methods depends on the dimension of the subspace where the point trajectories are projected. This paper presents a strategy for estimating the best subspace dimension using a novel clustering error measure. For each obtained segmentation, the proposed measure estimates the average least square error between the point trajectories and synthetic trajectories generated based on the motion models from the segmentation. The second contribution of this paper is the use of the velocity vector instead of the traditional trajectory vector for segmentation. The evaluation on the Hopkins 155 video benchmark database shows that the proposed method is competitive with current state-of-the-art methods both in terms of overall performance and computational speed. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Ding, L., Barbu, A., & Meyer-Baese, A. (2013). Motion segmentation by velocity clustering with estimation of subspace dimension. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7729 LNCS, pp. 491–505). https://doi.org/10.1007/978-3-642-37484-5_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free