Efficient registration of stereo images by matching graph descriptions of edge segments | Zendy

Nicholas Ayache | Zendy; B. Faverjon | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient registration of stereo images by matching graph descriptions of edge segments

Author(s) -

Nicholas Ayache,

B. Faverjon

Publication year - 1987

Publication title -

international journal of computer vision

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.78

H-Index - 199

eISSN - 1573-1405

pISSN - 0920-5691

DOI - 10.1007/bf00123161

Subject(s) - artificial intelligence , computer science , computer vision , matching (statistics) , graph , mobile robot , robot , pattern recognition (psychology) , mathematics , theoretical computer science , statistics

We present a new approach to the stereo-matching problem. Images are individually described by aneighborhood graph of line segments coming from a polygonal approximation of the contours. The matching process is defined as the exploration of the largest components of adisparity graph built from the descriptions of the two images, and is performed by an efficient prediction and propagation technique. This approach was tested on a variety of man-made environments, and it appears to be fast and robust enough for mobile robot navigation and three-dimensional part-positioning applications

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research