SENSITIVITY ANALYSIS FOR MATCHING AND POSE COMPUTATION USING DIHEDRAL JUNCTIONS

被引:3
作者
BHANDARKAR, SM [1 ]
SUK, M [1 ]
机构
[1] SYRACUSE UNIV,DEPT ELECT & COMP ENGN,SYRACUSE,NY 13244
关键词
MODEL-BASED VISION; POSE CLUSTERING; POSE COMPUTATION; SENSITIVITY ANALYSIS;
D O I
10.1016/0031-3203(91)90017-Y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recognition-via-localization is a popular approach in 3-D object recognition. This approach relies on the propagation of constraints that arise from the matches of local geometric features and could therefore be treated as a constraint satisfaction problem. Hough clustering, which verifies the consistency of local geometric constraints by determining the pose of the object in parameter space, is a popular technique owing to its conceptual simplicity and potential ease of parallelization. Our previous work has shown the usefulness of dihedral junctions for the recognition and localization of polyhedral objects and dihedral feature junctions for the recognition and localization of curved objects made up of piecewise combinations of conical, cylindrical and spherical surfaces. Experimental results from our previous work showed that the computed pose parameters are sensitive to the difference in the included angle between the scene and model dihedral junctions or the scene and model dihedral feature junctions. A formal analysis of the sensitivity of the computed pose to the difference in the included angle between the scene and model dihedral junctions or the scene and model dihedral feature junctions is presented in this paper. The results of the formal sensitivity analysis were found to be in conformity with the experimental results from our previous work and so the work presented in this paper could be treated as a sequel to our previous work. Based on the results of the sensitivity analysis, the rotation parameters were found to be more sensitive than the translation parameters which, in comparison, were far more robust. It is also shown how the introduction of redundancy in parameter space results in greater robustness in the computed pose. Although the analysis in this paper is based on the matching of dihedral junctions or dihedral feature junctions, the approach taken in the sensitivity analysis is general and can be applied to the matching based on other feature types.
引用
收藏
页码:505 / 513
页数:9
相关论文
共 9 条
[1]  
BHANDARKAR SM, IN PRESS MACH VISION
[2]  
BHANDARKAR SM, P IAPR WKSHOP COMPUT, P82
[3]  
BOYTER BA, 1986, IEEE EXPERT, P47
[4]   POLYHEDRA RECOGNITION BY HYPOTHESIS ACCUMULATION [J].
DHOME, M ;
KASVAND, T .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (03) :429-438
[5]   LOCALIZING OVERLAPPING PARTS BY SEARCHING THE INTERPRETATION TREE [J].
GRIMSON, WEL ;
LOZANOPEREZ, T .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (04) :469-482
[6]  
KORN GA, 1972, MATH HDB SCI ENG
[7]   DETERMINING ORIENTATION, LOCATION AND SIZE OF PRIMITIVE SURFACES BY A MODIFIED HOUGH TRANSFORMATION TECHNIQUE [J].
NAGATA, T ;
ZHA, HB .
PATTERN RECOGNITION, 1988, 21 (05) :481-491
[8]  
Paul R. P., 1981, ROBOT MANIPULATORS M
[9]   OBJECT RECOGNITION AND LOCALIZATION VIA POSE CLUSTERING [J].
STOCKMAN, G .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1987, 40 (03) :361-387