Extracting Dense Features for Visual Correspondence with Graph Cuts

Veksler, Olga

doi:10.1109/CVPR.2003.1211420

Extracting Dense Features for Visual Correspondence with Graph Cuts

Olga Veksler

CVPR 2003 pp. 689-694

doi:10.1109/CVPR.2003.1211420 /cvpr/2003/veksler2003cvpr-extracting/

Abstract

We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted during the correspondence process, not in a separate preprocessing step. For dense feature extraction we use the graph cuts algorithm, recently shown to be a powerful optimization tool for vision. Our algorithm produces semi-dense answer, with very accurate results in areas where features are detected, and no matches in featureless regions. Unlike sparse feature based algorithms, we are able to extract accurate correspondences in some untextured regions, provided that there are texture cues on the boundary. Our algorithm is robust and does not require parameter tuning.

PDF CVPR Semantic Scholar

Cite

Text

Veksler. "Extracting Dense Features for Visual Correspondence with Graph Cuts." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003. doi:10.1109/CVPR.2003.1211420

Markdown

[Veksler. "Extracting Dense Features for Visual Correspondence with Graph Cuts." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003.](https://mlanthology.org/cvpr/2003/veksler2003cvpr-extracting/) doi:10.1109/CVPR.2003.1211420

BibTeX

@inproceedings{veksler2003cvpr-extracting,
  title     = {{Extracting Dense Features for Visual Correspondence with Graph Cuts}},
  author    = {Veksler, Olga},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2003},
  pages     = {689-694},
  doi       = {10.1109/CVPR.2003.1211420},
  url       = {https://mlanthology.org/cvpr/2003/veksler2003cvpr-extracting/}
}