Motion Segmentation with Occlusions on the Superpixel Graph
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.
Cite
Text
Ayvaci and Soatto. "Motion Segmentation with Occlusions on the Superpixel Graph." IEEE/CVF International Conference on Computer Vision Workshops, 2009. doi:10.1109/ICCVW.2009.5457630Markdown
[Ayvaci and Soatto. "Motion Segmentation with Occlusions on the Superpixel Graph." IEEE/CVF International Conference on Computer Vision Workshops, 2009.](https://mlanthology.org/iccvw/2009/ayvaci2009iccvw-motion/) doi:10.1109/ICCVW.2009.5457630BibTeX
@inproceedings{ayvaci2009iccvw-motion,
title = {{Motion Segmentation with Occlusions on the Superpixel Graph}},
author = {Ayvaci, Alper and Soatto, Stefano},
booktitle = {IEEE/CVF International Conference on Computer Vision Workshops},
year = {2009},
pages = {727-734},
doi = {10.1109/ICCVW.2009.5457630},
url = {https://mlanthology.org/iccvw/2009/ayvaci2009iccvw-motion/}
}