Robust Motion Segmentation from Pairwise Matches
Abstract
In this paper we consider the problem of motion segmentation, where only pairwise correspondences are assumed as input without prior knowledge about tracks. The problem is formulated as a two-step process. First, motion segmentation is performed on image pairs independently. Secondly, we combine independent pairwise segmentation results in a robust way into the final globally consistent segmentation. Our approach is inspired by the success of averaging methods. We demonstrate in simulated as well as in real experiments that our method is very effective in reducing the errors in the pairwise motion segmentation and can cope with large number of mismatches.
Cite
Text
Arrigoni and Pajdla. "Robust Motion Segmentation from Pairwise Matches." Proceedings of the IEEE/CVF International Conference on Computer Vision, 2019. doi:10.1109/ICCV.2019.00076Markdown
[Arrigoni and Pajdla. "Robust Motion Segmentation from Pairwise Matches." Proceedings of the IEEE/CVF International Conference on Computer Vision, 2019.](https://mlanthology.org/iccv/2019/arrigoni2019iccv-robust/) doi:10.1109/ICCV.2019.00076BibTeX
@inproceedings{arrigoni2019iccv-robust,
title = {{Robust Motion Segmentation from Pairwise Matches}},
author = {Arrigoni, Federica and Pajdla, Tomas},
booktitle = {Proceedings of the IEEE/CVF International Conference on Computer Vision},
year = {2019},
doi = {10.1109/ICCV.2019.00076},
url = {https://mlanthology.org/iccv/2019/arrigoni2019iccv-robust/}
}