Horaud, R.[Radu], and
Stereo Correspondence Through Feature Grouping and Maximal Cliques,
PAMI(11), No. 11, November 1989, pp. 1168-1180.
IEEE DOI BibRef 8911
Structural Matching for Stereo Vision,
IEEE DOI 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
Piecewise Straight-Line Correlation Algorithm for Navigation of Autonomous Systems with Robotics Applications,
JIRS(10), No. 3, July 1994, pp. 301-321. BibRef 9407
Line Correspondences from Cooperating Spatial and Temporal Grouping Processes for a Sequence of Images,
CVIU(67), No. 2, August 1997, pp. 186-201.
DOI Link 9708
Fitzgibbon, A.W.[Andrew W.],
Robust registration of 2D and 3D point sets,
IVC(21), No. 12-13, December 2003, pp. 1145-1153.
Elsevier DOI 0401
Earlier: BMVC01(Session 5: Matching & Retrieval).
HTML Version. 0110
University of Oxford. General-purpose non-linear optimization, Levenberg-Marquardt. ICP. BibRef
Fitting 3D point distribution models of fish to stereo images,
HTML Version. 0209
Model-Based Aircraft Recognition in Perspective Aerial Imagery,
IEEE DOI 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 .