An iterative closest point approach for the registration of volumetric human retina image data obtained by optical coherence tomography
This paper introduces an improved approach for the volume data registration of human retina. Volume data registration refers to calculating out a near optimal transformation between two volumes with overlapping region and stitching them together. Iterative closest point (ICP) algorithm is a registration method that deals with registration between points. Classical ICP is time consuming and often traps in local minimum when the overlapping region is not big enough. Optical Coherence Tomography (OCT) volume data are several separate, partially overlapping tiles. To stitch them together is a technology in computer aided diagnosis. In this paper, a new 3D registration algorithm based on improved ICP is presented. First, the Canny edge detector is applied to generate the point cloud set of OCT images. After the detection step, an initial registration method based on the feature points of the point cloud is proposed to determine an initial transformation matrix by using singular value decomposition (SVD) method. Then, an improved ICP method is presented to accomplish fine registration. Corresponding point in the point cloud is weighted to reduce the iteration times of ICP algorithm. Finally, M estimation is used as the objective function to decrease the impact of outliers. This registration algorithm is used to process human retinal OCT volume pairs that contain an overlapping region of 75 x 500 x 375 voxels approximately. Then a comparative experiment is conducted on some public available datasets. The experimental results show that the proposed method outperforms the classical method.
Multimedia Tools and Applications