Matching 2D polygonal arcs by using a subgroup of the unit quaternions

被引:7
作者
Heisterkamp, DR [1 ]
Bhattacharya, P [1 ]
机构
[1] Univ Nebraska, Dept Comp Sci & Engn, Lincoln, NE 68588 USA
关键词
D O I
10.1006/cviu.1997.0566
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A subgroup of the unit quaternions is used to calculate 2D rotations. Benefits of using quaternions over the more common methods include the ability to use the algebra of quaternions to find closed-form solutions and the ability to use the same approach for both 2D and 3D algorithms. The subgroup is applied to matching polygonal arcs of equal length with the resulting solution being the smallest eigenvalue of a 2 x 2 matrix. This result is then used to match a short are to locations on a long are. (C) 1998 Academic Press.
引用
收藏
页码:246 / 249
页数:4
相关论文
共 13 条
[1]  
[Anonymous], 1993, Three-Dimensional Computer Vision: A Geometric Viewpoint
[2]  
BHANU B, 1984, IEEE T PATTERN ANAL, V6, P60
[3]  
EU D, 1994, GRAPH MODEL IM PROC, V56, P231
[4]  
Freeman H., 1961, IRE T ELECTRON COMPU, V10, P260, DOI DOI 10.1109/TEC.1961.5219197
[5]  
Fu K. s., 1987, Robotics: Control, Sensing, Vision
[6]   Matching of 3D polygonal arcs [J].
Heisterkamp, DR ;
Bhattacharya, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (01) :68-73
[7]  
Horn B., 1986, Robot Vision
[8]  
MAILLOT P, 1991, GRAPHIC GEMS, P498
[9]   SCALE-BASED DESCRIPTION AND RECOGNITION OF PLANAR CURVES AND TWO-DIMENSIONAL SHAPES [J].
MOKHTARIAN, F ;
MACKWORTH, A .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1986, 8 (01) :34-43
[10]  
PARSI B, 1991, COMPUTER VISION GRAP, V53, P227