Region Correspondence by Global Configuration Matching and Progressive Delaunay Triangulation
Abstract
In this paper, we present a novel algorithm for establishing region correspondences across images by first matching global region configuration and then propagating the matches locally constrained by Delaunay triangulation. We exploit a global configuration constraint, which has not been explicitly used in existing matching algorithms. The proposed algorithm is comprised of two stages: first, stable regions are matched by enforcing the global configuration constraint. This yields a set of global matches corresponding to stable regions distributed over the images. In the second stage, these matches are used to guide the matching of the remaining unmatched regions in the intervening spaces. This is done by enforcing local positioning constraint, which starts with the Delaunay triangulation defined by the global matches and performs progressive Delaunay triangulation for local matching. Experiments on both stereo and motion images are presented to show the effectiveness of the proposed algorithm.
Cite
Text
Ma and Ahuja. "Region Correspondence by Global Configuration Matching and Progressive Delaunay Triangulation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000. doi:10.1109/CVPR.2000.854932Markdown
[Ma and Ahuja. "Region Correspondence by Global Configuration Matching and Progressive Delaunay Triangulation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000.](https://mlanthology.org/cvpr/2000/ma2000cvpr-region/) doi:10.1109/CVPR.2000.854932BibTeX
@inproceedings{ma2000cvpr-region,
title = {{Region Correspondence by Global Configuration Matching and Progressive Delaunay Triangulation}},
author = {Ma, Jianbo and Ahuja, Narendra},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2000},
pages = {2637-},
doi = {10.1109/CVPR.2000.854932},
url = {https://mlanthology.org/cvpr/2000/ma2000cvpr-region/}
}