ICIC 2016: Intelligent Computing Theories and Application pp 503-513 | Cite as
A Modified Non-rigid ICP Algorithm for Registration of Chromosome Images
Abstract
As an extension of the classic rigid registration algorithm-Iterative Closest Point (ICP) algorithm, this paper proposes a new non-rigid ICP algorithm to match two point sets. Each point in the data set is supposed to match to the model set via an affine transformation. The proposed registration model is built up with a regularization term based on their average affine transformation. For each iteration of our algorithm, firstly correspondences between two point sets are built by the nearest-point search. Then the non-rigid transform parameters between two correspondence point sets are estimated by the proposed method in the closed form. Finally the average affine transformation is updated. A set of challenging data including single and overlapping chromosome images are tested which have significant local non-rigid transformations. Experimental results demonstrate our algorithm has higher accuracy and faster rate of convergence than other algorithms.
Keywords
ICP Non-rigid registration Average affine transformation ChromosomeNotes
Acknowledgement
This work was in part supported by the National Natural Science Foundation of China (61573274), Postdoctoral Science Foundation of China (2015M582661), Jiangsu Science and Technology Program (BY2014073), and Natural Science Basic Research Plan in Shaanxi Province of China (2015JQ6232).
References
- 1.Besl, P.J., McKay, N.D.: Method for registration of 3-D shapes. In: Robotics-DL tentative. International Society for Optics and Photonics, pp. 586–606 (1992)Google Scholar
- 2.Zhang, Z.: Iterative point matching for registration of free-form curves and surfaces. Int. J. Comput. Vis. 13(2), 119–152 (1994)CrossRefGoogle Scholar
- 3.Chen, Y., Medioni, G.: Object modelling by registration of multiple range images. Image Vis. Comput. 10(3), 145–155 (1992)CrossRefGoogle Scholar
- 4.Chui, H., Rangarajan, A.: A new point matching algorithm for non-rigid registration. Comput. Vis. Image Underst. 89(2), 114–141 (2003)CrossRefMATHGoogle Scholar
- 5.Zheng, Y., Doermann, D.: Robust point matching for nonrigid shapes by preserving local neighborhood structures. IEEE Trans. Pattern Anal. Mach. Intell. 28(4), 643–649 (2006)CrossRefGoogle Scholar
- 6.Jian, B., Vemuri, B.C.: A robust algorithm for point set registration using mixture of gaussians. In: Tenth IEEE International Conference on Computer Vision, ICCV 2005. vol. 2, pp. 1246–1251 (2005)Google Scholar
- 7.Myronenko, A., Song, X.: Point set registration: coherent point drift. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2262–2275 (2010)CrossRefGoogle Scholar
- 8.Hasanbelliu, E., Sanchez Giraldo, L., Principe, J.C.: Information theoretic shape matching. IEEE Trans. Pattern Anal. Mach. Intell. 36(12), 2436–2451 (2014)CrossRefGoogle Scholar
- 9.Du, S., Guo, Y., Sanroma, G., Ni, D., Wu, G., Shen, D.: Building dynamic population graph for accurate correspondence detection. Med. Image Anal. 26(1), 256–267 (2015)CrossRefGoogle Scholar
- 10.Amberg, B., Romdhani, S., Vetter, T.: Optimal step nonrigid ICP algorithms for surface registration. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1–8 (2007)Google Scholar
- 11.Saiyod, S., Wayalun, P.: A hybrid technique for overlapped chromosome segmentation of G-band mataspread images automatic. In: 2014 Fourth International Conference Digital Information and Communication Technology and it’s Applications (DICTAP), pp. 400–404 (2014)Google Scholar
- 12.Poletti, E., Grisan, E., Ruggeri, A.: A modular framework for the automatic classification of chromosomes in Q-band images. Comput. Methods Programs Biomed. 105(2), 120–130 (2012)CrossRefGoogle Scholar