Point signatures: A new representation for 3D object recognition

被引:420
作者
Chua, CS [1 ]
Jarvis, R [1 ]
机构
[1] MONASH UNIV, DEPT ELECT & COMP SYST ENGN, INTELLIGENT ROBOT RES CTR, CLAYTON, VIC 3168, AUSTRALIA
关键词
3D object recognition; model indexing; feature extraction; free-form surface registration; pose estimation;
D O I
10.1023/A:1007981719186
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Few systems capable of recognizing complex objects with free-form (sculptured) surfaces have been developed. The apparent lack of success is mainly due to the lack of a competent modelling scheme for representing such complex objects. In this paper, a new form of point representation for describing 3D free-form surfaces is proposed. This representation, which we call the point signature, serves to describe the structural neighbourhood of a point in a more complete manner than just using the 3D coordinates of the point. Being invariant to rotation and translation, the point signature can be used directly to hypothesize the correspondence to model points with similar signatures. Recognition is achieved by matching the signatures of data points representing the sensed surface to the signatures of data points representing the model surface. The use of point signatures is not restricted to the recognition of a single-object scene to a small library of models. Instead, it can be extended naturally to the recognition of scenes containing multiple partially-overlapping objects (which may also be juxtaposed with each other) against a large model library. No preliminary phase of segmenting the scene into the component objects is required. In searching for the appropriate candidate model, recognition need not proceed in a linear order which can become prohibitive for a large model library. For a given scene, signatures are extracted at arbitrarily spaced seed points. Each of these signatures is used to vote for models that contain points having similar signatures. Inappropriate models with low votes can be rejected while the remaining candidate models are ordered according to the votes they received. In this way, efficient verification of the hypothesized candidates can proceed by testing the most likely model first. Experiments using real data obtained from a range finder have shown fast recognition from a library of fifteen models whose complexities vary from that of simple piecewise quadric shapes to complicated face masks. Results from the recognition of both single-object and multiple-object scenes are presented.
引用
收藏
页码:63 / 85
页数:23
相关论文
共 27 条
[1]  
[Anonymous], 1969, DIFFERENTIAL GEOMETR
[2]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[3]   INVARIANT SURFACE CHARACTERISTICS FOR 3D OBJECT RECOGNITION IN RANGE IMAGES [J].
BESL, PJ ;
JAIN, RC .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 33 (01) :33-80
[4]   SEGMENTATION THROUGH VARIABLE-ORDER SURFACE FITTING [J].
BESL, PJ ;
JAIN, RC .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1988, 10 (02) :167-192
[6]   A ROBOT VISION SYSTEM FOR RECOGNIZING 3-D OBJECTS IN LOW-ORDER POLYNOMIAL-TIME [J].
CHEN, CH ;
KAK, AC .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1989, 19 (06) :1535-1563
[7]  
CHUA CS, 1994, IN PRESS INT J COMPU
[8]  
CHUA CS, 1993, P 6 AUSTR JOINT C AR, P432
[9]  
Delingette H., 1993, [1993] Proceedings Fourth International Conference on Computer Vision, P103, DOI 10.1109/ICCV.1993.378230
[10]  
DUN J, 1990, 160117 GIRD