Multi-modal image registration via depth information based on point set matching

Author(s):  
Qi Yang ◽  
Bin Sun ◽  
Kai Hu ◽  
Honglin Bai
2014 ◽  
Vol 13 (Suppl 2) ◽  
pp. S2 ◽  
Author(s):  
Xuan Yang ◽  
Jihong Pei ◽  
Jingli Shi
Keyword(s):  

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Xue Mei ◽  
Zhenhua Li ◽  
Songsong Xu ◽  
Xiaoyan Guo

Multimodality image registration and fusion has complementary significance for guiding dental implant surgery. As the needs of the different resolution image registration, we develop an improved Iterative Closest Point (ICP) algorithm that focuses on the registration of Cone Beam Computed Tomography (CT) image and high-resolution Blue-light scanner image. The proposed algorithm includes two major phases, coarse and precise registration. Firstly, for reducing the matching interference of human subjective factors, we extract feature points based on curvature characteristics and use the improved three point’s translational transformation method to realize coarse registration. Then, the feature point set and reference point set, obtained by the initial registered transformation, are processed in the precise registration step. Even with the unsatisfactory initial values, this two steps registration method can guarantee the global convergence and the convergence precision. Experimental results demonstrate that the method has successfully realized the registration of the Cone Beam CT dental model and the blue-ray scanner model with higher accuracy. So the method could provide researching foundation for the relevant software development in terms of the registration of multi-modality medical data.


Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.


Endoscopy ◽  
2012 ◽  
Vol 44 (10) ◽  
Author(s):  
H Córdova ◽  
R San José Estépar ◽  
A Rodríguez-D'Jesús ◽  
G Martínez-Pallí ◽  
P Arguis ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document