Signal and Data Processing

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

---

3D model segmentation has an important role in 3D model processing programs such as retrieval, compression and watermarking. In this paper, a new 3D model segmentation algorithm is proposed. Cognitive science research introduces 3D object decomposition as a way of object analysis and detection with human. There are two general types of segments which are obtained from decomposition based on this principle: a core and salient parts. In this approach we start with calculating center of the model. Then, a point with maximum Euclidean distance from the center which represents a prominent part is chosen as the first salient point and its geodesic neighborhood points are deleted from salient point’s search domain. This process is continued until all salient points are detected. Then, the core part which connects the other parts to each other is detected. Thus, 3D model segmentation is completed. Considering center of the model as the reference point and utilizing both Euclidean and geodesic distance and deleting salient point’s neighborhood from salient point’s search domain led our proposed approach to be invariant against translation, rotation and pose changes and also decrease operation time of the proposed algorithm in comparison with the other 3D model segmentation algorithms.

Keywords: Segmentation, 3D models, Geodesic Distance, Salient Points, core

Full-Text [PDF 2772 kb]   (1934 Downloads)    

Add your comments about this article : Your username or Email:

---

---