Multi-Scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation

Abstract

We present an approach for motion segmentation using independently detected keypoints instead of commonly used tracklets or trajectories. This allows us to establish correspondences over non- consecutive frames, thus we are able to handle multiple object occlusions consistently. On a frame-to-frame level, we extend the classical split-and-merge algorithm for fast and precise motion segmentation. Globally, we cluster multiple of these segmentations of different time scales with an accurate estimation of the number of motions. On the standard benchmarks, our approach performs best in comparison to all algorithms which are able to handle unconstrained missing data. We further show that it works on benchmark data with more than 98% of the input data missing. Finally, the performance is evaluated on a mobile-phone-recorded sequence with multiple objects occluded at the same time.

Cite

Text

Dragon et al. "Multi-Scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation." European Conference on Computer Vision, 2012. doi:10.1007/978-3-642-33709-3_32

Markdown

[Dragon et al. "Multi-Scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation." European Conference on Computer Vision, 2012.](https://mlanthology.org/eccv/2012/dragon2012eccv-multi/) doi:10.1007/978-3-642-33709-3_32

BibTeX

@inproceedings{dragon2012eccv-multi,
  title     = {{Multi-Scale Clustering of Frame-to-Frame Correspondences for Motion Segmentation}},
  author    = {Dragon, Ralf and Rosenhahn, Bodo and Ostermann, Jörn},
  booktitle = {European Conference on Computer Vision},
  year      = {2012},
  pages     = {445-458},
  doi       = {10.1007/978-3-642-33709-3_32},
  url       = {https://mlanthology.org/eccv/2012/dragon2012eccv-multi/}
}