Fast landmark-based registration via deterministic and efficient processing, some preliminary results

Preliminary results of a method for range view registration are presented. The method incorporates the LeRP algorithm, which is a deterministic means to approximate subgraph isomorphisms. Graphs are formed that describe salient scene features. Graph matching then provides the scene-to-scene correspondence necessary for registration. A graphical representation is invariant with respect to sensor standoff. Test results from real and synthetic images indicate that a reasonable tradeoff between speed and accuracy is achievable. A mean rotational error of /spl sim/1 degree was found for a variety of test cases. Mean compute times were found to be better than 2 Hz, with image sizes varying from 128/spl times/200 to 240/spl times/320. These tests were run on a 900 MHz PC The greatest challenge to this approach is the stable localization and invariant characterization of image features via fast, deterministic techniques.

[1]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Fred W. DePiero,et al.  An algorithm using length-r paths to approximate subgraph isomorphism , 2003, Pattern Recognit. Lett..

[3]  Ioannis Pitas,et al.  Morphological Iterative Closest Point Algorithm , 1997, CAIP.

[4]  Linda G. Shapiro,et al.  Computer Vision , 2001 .

[5]  Kanti V. Mardia,et al.  Ridge Curves and Shape Analysis , 1996, BMVC.

[6]  E.E. Pissaloux,et al.  Image Processing , 1994, Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing.

[7]  Andrew E. Johnson,et al.  Surface landmark selection and matching in natural terrain , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[8]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[9]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[10]  William H. Press,et al.  Numerical recipes in C , 2002 .

[11]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Ioannis Pitas,et al.  3-D Image Processing Algorithms , 2000 .

[13]  Sing Bing Kang,et al.  Registration and integration of textured 3-D data , 1997, Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134).

[14]  Anastasios Tefas,et al.  Using Support Vector Machines to Enhance the Performance of Elastic Graph Matching for Frontal Face Authentication , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  N. Ayache,et al.  Landmark-based registration using features identified through differential geometry , 2000 .

[16]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[17]  Sang Wook Lee,et al.  ICP Registration Using Invariant Features , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using unit quaternions , 1987 .

[19]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[20]  Mohan M. Trivedi,et al.  Graph matching using a direct classification of node attendance , 1996, Pattern Recognit..

[21]  Andrew E. Johnson,et al.  Registration and integration of textured 3-D data , 1997, Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134).

[22]  Jianzhuang Liu,et al.  A Graph-Based Method for Face Identification from a Single 2D Line Drawing , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Mohan M. Trivedi,et al.  3-D Computer Vision Using Structured Light: Design, Calibration, and Implementation Issues , 1996, Adv. Comput..