Stereo correspondence through feature grouping and maximal cliques
Horaud, R.
Skordas, T.
LIFIA-IMAG, Grenoble;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Nov 1989
Volume: 11,
Issue: 11
On page(s): 1168-1180
ISSN: 0162-8828
References Cited: 22
CODEN: ITPIDJ
INSPEC Accession Number: 3572664
Digital Object Identifier: 10.1109/34.42855
Current Version Published: 2002-08-06
Abstract
The authors propose a method for solving the stereo correspondence
problem. The method consists of extracting local image structures and
matching similar such structures between two images. Linear edge
segments are extracted from both the left and right images. Each segment
is characterized by its position and orientation in the image as well as
its relationships with the nearby segments. A relational graph is thus
built from each image. For each segment in one image as set of potential
assignments is represented as a set of nodes in a correspondence graph.
Arcs in the graph represent compatible assignments established on the
basis of segment relationships. Stereo matching becomes equivalent to
searching for sets of mutually compatible nodes in this graph. Sets are
found by looking for maximal cliques. The maximal clique best suited to
represent a stereo correspondence is selected using a benefit function.
Numerous results obtained with this method are shown
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
