Plane-fitting robust registration for complex 3D models

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In surgery planning, forensic and archeology, there is a need to perform analysis and synthesis of complex 3D models. One common first step of 3D model analysis and synthesis is to register a reference model to a target model using similarity transformation. In practice, the models usually contain noise and outliers, and are sometimes incomplete. These facts make the 3D similarity registration challenging. Existing similarity registration methods such as Iterative Closest Point algorithm (ICP) [1] and Fractional Iterative Closest Point algorithm (FICP) [2] are misled by the outliers and are not able to register these models properly. This paper presents a plane-fitting registration algorithm that is more robust than existing registration algorithms. It achieves its robustness by ensuring that the symmetric plane of the reference model is registered to the planar landmarks of the target model. Experiments on patients’ skull models show that the proposed algorithm is robust, accurate and efficient in registering complex models.

Cite

CITATION STYLE

APA

Cheng, Y., Xie, S., Leow, W. K., & Zhang, K. (2015). Plane-fitting robust registration for complex 3D models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9257, pp. 640–651). Springer Verlag. https://doi.org/10.1007/978-3-319-23117-4_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free