The mixtures of Student's t-distributions as a robust framework for rigid registration

被引:47
作者
Gerogiannis, Demetrios [1 ]
Nikou, Christophoros [1 ]
Likas, Aristidis [1 ]
机构
[1] Univ Ioannina, Dept Comp Sci, GR-45110 Ioannina, Greece
关键词
Image registration; Point set registration; Gaussian mixture model; Mixtures of Student's t-distribution; Expectation-Maximization (EM) algorithm; MUTUAL INFORMATION; ALGORITHM; MAXIMIZATION; INTENSITY; IMAGES;
D O I
10.1016/j.imavis.2008.11.013
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The problem of registering images or point sets is addressed. At first, a pixel similarity-based algorithm for the rigid registration between single and multimodal images is presented. The images may present dissimilarities due to noise, missing data or outlying measures. The method relies on the partitioning of a reference image by a Student's t-mixture model (SMM). This partition is then projected onto the image to be registered. The main idea is that a t-component in the reference image corresponds to a t-component in the image to be registered. If the images are correctly registered the distances between the corresponding components is minimized. Moreover, the extension of the method to the registration of point clouds is also proposed. The use of SMM components is justified by the property that they have heavier tails than standard Gaussians, thus providing robustness to outliers. Experimental results indicate that, even in the case of low SNR or important amount of dissimilarities due to temporal changes, the proposed algorithm compares favorably to the mutual information method for image registration and to the Iterative Closest Points (ICP) algorithm for the alignment of point sets. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1285 / 1294
页数:10
相关论文
共 43 条
[1]  
Bankman IN, 2000, HDB MED IMAGE PROCES
[2]   Shape matching and object recognition using shape contexts [J].
Belongie, S ;
Malik, J ;
Puzicha, J .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (04) :509-522
[3]  
Besl PJ, 1992, IEEE Transactions on Pattern Analysis and Machine Intelligence, V14, P239, DOI [DOI 10.1109/34.121791, 10.1109/34.121791]
[4]  
BISHOP C, 2005, NEUROCOMPUTING, P69
[5]  
BISHOP C. M, 2006, Pattern Recognition and Machine Learning. Information Science and Statistics, DOI [10.1007/978-0-387-45528-0, DOI 10.1007/978-0-387-45528-0]
[6]   Maximum likelihood robust regression by mixture models [J].
Brandt, Sami S. .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2006, 25 (01) :25-48
[7]  
CHEN S, 2004, P 3 IEEE INT C IM GR
[8]   Robust euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm [J].
Chetverikov, D ;
Stepanov, D ;
Krsek, P .
IMAGE AND VISION COMPUTING, 2005, 23 (03) :299-309
[9]  
CHUI H, 2000, P INT C COMP VIS PAT, V2
[10]   A new point matching algorithm for non-rigid registration [J].
Chui, HL ;
Rangarajan, A .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2003, 89 (2-3) :114-141