Shading-Based Two-View Matching
Abstract
This paper presents a region-based stereo matching algorithm, in which the regions are computed from the Gaussian (K) and mean (H) curvature information of the image intensity surface. A region is defined as a connected area of constant K/H sign combination, and thus constitutes the footprint of a local section of the intensity surface, whose shape is a peak, a pit, a positive or a negative saddle. Region adjacency information is explicited by means of a Voronoi graph representation of the region map. Matching between nodes of identical shape types in the two region maps is established by comparing the topological configuration of their immediate neighborhoods. The disparity map is established through a coarseto-fine strategy. 1
Cite
Text
Audette et al. "Shading-Based Two-View Matching." International Joint Conference on Artificial Intelligence, 1991.Markdown
[Audette et al. "Shading-Based Two-View Matching." International Joint Conference on Artificial Intelligence, 1991.](https://mlanthology.org/ijcai/1991/audette1991ijcai-shading/)BibTeX
@inproceedings{audette1991ijcai-shading,
title = {{Shading-Based Two-View Matching}},
author = {Audette, Michel A. and Cohen, Paul R. and Weng, Juyang},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1991},
pages = {1286-1291},
url = {https://mlanthology.org/ijcai/1991/audette1991ijcai-shading/}
}