Share Email Print

Proceedings Paper

Matching algorithm based on Godel coding scheme
Author(s): Neslisah Dicle; Volkan Atalay
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We describe an algorithm for the correspondence of line features between two consecutive images. The algorithm is based on Godel coding of the features and singular value decomposition. First, line segments are extracted by Canny operator followed by the end-point-fit method. Line segments are represented by coordinates of midpoints and the angle of a perpendicular line from a reference point. Then, a proximity matrix is constructed following the minimal mapping theory of Ullman. Thus if two line segments are correlated, the corresponding matrix element is the Godel coded difference of their features; otherwise the element is assigned to a maximum number. Finally, singular value decomposition is applied on the proximity matrix. Godel coded differences strengthens the method due to the fact that not only the norms of the vectors are compared for matching but also their unique Godel numbers are involved. Proposed algorithm is implemented and tested both on calibrated and uncalibrated stereo image pairs and the matching results are promising.

Paper Details

Date Published: 19 April 2000
PDF: 8 pages
Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); doi: 10.1117/12.382992
Show Author Affiliations
Neslisah Dicle, Middle East Technical Univ. (Turkey)
Volkan Atalay, Middle East Technical Univ. (Turkey)

Published in SPIE Proceedings Vol. 3974:
Image and Video Communications and Processing 2000
Bhaskaran Vasudev; T. Russell Hsing; Andrew G. Tescher; Robert L. Stevenson, Editor(s)

© SPIE. Terms of Use
Back to Top