Abstract

We present a motion segmentation algorithm that partitions the image plane into disjoint regions based on their parametric motion. It relies on a finer partitioning of the image domain into regions of uniform photometric properties, with motion segments made of unions of such ¿superpixels¿. We exploit recent advances in combinatorial graph optimization that yield computationally efficient estimates. The energy functional is built on a superpixel graph, and is iteratively minimized by computing a parametric motion model in closed-form, followed by a graph cut of the superpixel adjacency graph. It generalizes naturally to multi-label partitions that can handle multiple motions.

Keywords

Computer visionArtificial intelligenceComputer scienceSegmentationMotion (physics)GraphImage segmentationPattern recognition (psychology)Theoretical computer science

Affiliated Institutions

Related Publications

Normalized cuts and image segmentation

We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach...

2000 IEEE Transactions on Pattern Analysis... 15440 citations

Publication Info

Year
2009
Type
article
Volume
5302
Pages
727-734
Citations
33
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

33
OpenAlex

Cite This

Alper Ayvacı, Stefano Soatto (2009). Motion segmentation with occlusions on the superpixel graph. , 5302 , 727-734. https://doi.org/10.1109/iccvw.2009.5457630

Identifiers

DOI
10.1109/iccvw.2009.5457630