Points matching via iterative convex hull vertices pairing

被引:0
作者
Yu, XY [1 ]
Sun, H [1 ]
Chen, J [1 ]
机构
[1] Wuhan Univ, Signal Proc Lab, Sch Elect Informat, Hubei 430072, Peoples R China
来源
PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9 | 2005年
关键词
image registration; point matching; convex hull;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Image registration is a fundamental task in image processing. In feature-based image registration, feature matching is the key but difficult step. In this paper, a point matching algorithm, which takes use of convex hull of point set and establishes correspondence between matched hull vertices, is proposed. Mapping parameters and point sets are updated after each step. After all points are processed, the current mapping parameter is the exact parameter between images. Experiment indicated that this method can match two point sets correctly with a little manual interference.
引用
收藏
页码:5350 / 5354
页数:5
相关论文
共 15 条
[1]  
[Anonymous], 1993, Proceedings of the South African Symposium on Communications and Signal Processing
[2]  
[Anonymous], 1987, ISPRS Intercommission workshop, Interlaken
[3]   The Quickhull algorithm for convex hulls [J].
Barber, CB ;
Dobkin, DP ;
Huhdanpaa, H .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04) :469-483
[4]   POINT PATTERN-MATCHING USING CONVEX-HULL EDGES [J].
GOSHTASBY, A ;
STOCKMAN, GC .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1985, 15 (05) :631-637
[5]  
Goshtasby A. A., 2004, 2 D 3 D IMAGE REGIST
[6]  
Jarvis R. A., 1973, Information Processing Letters, V2, P18, DOI 10.1016/0020-0190(73)90020-3
[7]  
Moravec HP, 1979, P 6 INT JOINT C ART
[8]  
Morevec H.P., 1977, P 5 INT JOINT C ART, P584
[9]  
O'Rourke J, 1998, COMPUTATIONAL GEOMET, DOI DOI 10.1017/CBO9780511804120
[10]   CONVEX HULLS OF FINITE SETS OF POINTS IN 2 AND 3 DIMENSIONS [J].
PREPARATA, FP ;
HONG, SJ .
COMMUNICATIONS OF THE ACM, 1977, 20 (02) :87-93