Horaud, R.[Radu], and
Skordas, T.[Thomas],
Stereo Correspondence Through Feature Grouping and Maximal Cliques,
PAMI(11), No. 11, November 1989, pp. 1168-1180.
IEEE Abstract. IEEE Top Reference.
WWW Version.
BibRef
8911
And:
Structural Matching for Stereo Vision,
ICPR88(I: 439-445).
IEEE DOI may work or IEEE-CS DOI may work.
IEEE Top Reference. Stereo matching based on line systems forming a relational graph
structure. Match is converted to a graph with a node for each pair
correspondence (that fits) and a link for compatible matches. The
result is the maximal clique in the graph.
BibRef
Berman, A.,
Dayan, J.,
Piecewise Straight-Line Correlation Algorithm for Navigation of
Autonomous Systems with Robotics Applications,
JIRS(10), No. 3, July 1994, pp. 301-321.
BibRef
9407
Chang, Y.L.,
Aggarwal, J.K.,
Line Correspondences from Cooperating Spatial and Temporal Grouping
Processes for a Sequence of Images,
CVIU(67), No. 2, August 1997, pp. 186-201.
9708
WWW Version.
BibRef
Fitzgibbon, A.W.[Andrew W.],
Robust registration of 2D and 3D point sets,
IVC(21), No. 12-13, December 2003, pp. 1145-1153.
WWW Version.
0401
BibRef
Earlier:
BMVC01(Session 5: Matching & Retrieval).
HTML Version. University of Oxford
0110
BibRef
Marouani, S.,
Huertas, A.,
Medioni, G.,
Model-Based Aircraft Recognition in Perspective Aerial Imagery,
SCV95(371-376).
IEEE Top Reference.
BibRef
9500
USC Computer VisionUniversity of Southern California.
Basic accumlation match on line segments.
BibRef
Chapter on Registration, Matching and Recognition Using Points, Lines, Regions, Areas, Surfaces continues in
2-D Lines with 3-D Structure .