A Novel Approach for Computing Partial Similarity Between 3D Models
In this paper, we present our initial solution to partial similarity computation between arbitrary 3D polygon models. The task is considered as the estimation of similarity transformations between the query pattern and target object. Two steps accounting for the scaling and rotation/translation parts are carried out, facilitated by applying EMD (earth mover’s distance) to search the correspondence between focused point sets. In order to reduce the computation complexity involved in the second step, we use K-means algorithm to cluster the vertices of each model. We report our early experiments testing the efficiency of the proposed method on a small database as well as detailed discussions and the outline for the future work.
KeywordsShape Index Partial Match Shape Representation Query Pattern Partial Similarity
Unable to display preview. Download preview PDF.
- 1.Motofumi, T.-S., Yuji, Y.-S.: A search method to find partially similar triangular faces from 3D polygonal models. In: Proceedings of the IASTED International Conference Modeling and Simulation 2003, pp. 323–328. Palm Springs (2003)Google Scholar
- 2.Motofumi, T.-S.: A dynamic programming approach to search similar portions of 3D models. The World Scientific Engineering Academy and Society Transaction on Systems 3(1), 125–132 (2004)Google Scholar
- 3.Funkhouser, T., Kazhdan, M., Shilane, P., Min, P., Kiefer, W., Tal, A., Rusinkiewicz, S., Dobkin, D.: Modeling by example. In: ACM Transactions on Graphics 2004 (SIGGRAPH 2004), vol. 23(3), pp. 652–663 (2004)Google Scholar
- 4.Taubin, G.: Estimating the tensor of curvature of a surface from a polyhedral approximation. In: The fifth International Conference on Computer Vision, June 1995, pp. 902–907 (1995)Google Scholar
- 5.Cohen, S.: Finding color and shape patterns in images. Technical Report STAN-CS-TR-99-1620, Stanford University (May 1999)Google Scholar