Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Motion segmentation via a sparsity constraint|
|Citation:||IEEE Transactions on Intelligent Transportation Systems, 2017; 18(4):973-983|
|Taotao Lai, HanziWang, Yan Yan, Tat-Jun Chin, and Wan-Lei Zhao|
|Abstract:||Motion segmentation is an important task for intelligent transportation systems. In this paper, inspired by the fact that a feature point trajectory can be sparsely represented as a combination of several feature point trajectories that share coherent transformations, an efficient and effective motion segmentation method with a sparsity constraint is proposed. Specifically, we first propose an accumulated scheme to efficiently integrate motion information from all the frames of a video sequence to construct a correlation matrix. Then, a sparse affinity matrix is built on the correlation matrix by using information-theoretic principles, where the nonzero elements in the same row of the sparse affinity matrix correspond to the feature point trajectories more likely belonging to the same motion. Thereafter, a segment and merge procedure is proposed to effectively estimate the number of motions via the sparse affinity matrix. Finally, by applying spectral clustering on the sparse affinitymatrix, different motions in the video sequence are accurately segmented based on the estimated number of motions. Experimental results on the Hopkins 155 and the 62-clip datasets demonstrate that the proposed method achieves superior performance compared with several state-of-the-art methods.|
|Keywords:||Motion segmentation; affinity-based method; residual sorting; sparsity constraint|
|Description:||Date of publication October 7, 2016; date of current version March 27, 2017.|
|Rights:||© 2016 IEEE|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.