Fast Rigid Motion Segmentation via Incrementally-Complex Local Models

Fernando Flores-Mangas, Allan D. Jepson; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2013, pp. 2259-2266

Abstract


The problem of rigid motion segmentation of trajectory data under orthography has been long solved for nondegenerate motions in the absence of noise. But because real trajectory data often incorporates noise, outliers, motion degeneracies and motion dependencies, recently proposed motion segmentation methods resort to non-trivial representations to achieve state of the art segmentation accuracies, at the expense of a large computational cost. This paper proposes a method that dramatically reduces this cost (by two or three orders of magnitude) with minimal accuracy loss (from 98.8% achieved by the state of the art, to 96.2% achieved by our method on the standard Hopkins 155 dataset). Computational efficiency comes from the use of a simple but powerful representation of motion that explicitly incorporates mechanisms to deal with noise, outliers and motion degeneracies. Subsets of motion models with the best balance between prediction accuracy and model complexity are chosen from a pool of candidates, which are then used for segmentation.

Related Material


[pdf]
[bibtex]
@InProceedings{Flores-Mangas_2013_CVPR,
author = {Flores-Mangas, Fernando and Jepson, Allan D.},
title = {Fast Rigid Motion Segmentation via Incrementally-Complex Local Models},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2013}
}