DocumentCode :
540130
Title :
Correspondences of straight lines using graph-theoretic approach
Author :
Salari, E. ; Balaji, T.K.S.
fYear :
1990
fDate :
9-11 Aug. 1990
Firstpage :
562
Lastpage :
565
Abstract :
A method of matching straight line segments from image pairs is proposed. Each line has a rich set of features that are used in finding candidate matches to a line. Along with this local property, there is a structural relationship that each line possesses which is exploited for the matching process. This allows each image to be represented as a relational graph with nodes representing lines and with the edges representing the line´s structural relationship with the other lines. An association graph is obtained from the two relational structures. The graph is then refined by an iterative process. The largest maximal clique in the refined graph represents a consistent set of assignments that yields the best match
Keywords :
computerised pattern recognition; computerised picture processing; graph theory; iterative methods; association graph; graph refinement; graph-theoretic approach; image pairs; iterative process; largest maximal clique; line correspondences; relational graph; straight line segment matching; structural relationship;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems Engineering, 1990., IEEE International Conference on
Conference_Location :
Pittsburgh, PA, USA
Print_ISBN :
0-7803-0173-0
Type :
conf
DOI :
10.1109/ICSYSE.1990.203219
Filename :
5725751
Link To Document :
بازگشت