Computing Similarity Among 3D Objects Using Dynamic Time Warping
A new model to compute similarity is presented. The representation of a 3D object is reviewed; sequence of vertices and index of vertices are the basic information about the shape of any 3D object. A linear function called Labeling is introduced to create a new sequence or time series from a 3D object. A method to create randomly 3D objects is also described. Experimental results show viability to compute similarity among 3D objects using the extracted sequences and the Dynamic Time Warping algorithm.
KeywordsDynamic Time Warping Computing Similarity Random Modification Dynamic Time Warping Distance Warping Path
- 1.Hlavaty, T., Skala, V.: A Survey of Methods for 3D Model Feature Extraction. In: bulletin of the seminar of Geometry and Graphics in Teaching Contemporary Engineer, Szczyrk, Poland, No: 13/03. pp. 5–8 (2003)Google Scholar
- 2.Angeles-Yreta, A., Solís-Estrella, H., Landassuri-Moreno, V., Figueroa-Nazuno, J.: Similarity Search In Seismological Signals. In: Fifth Mexican Internacional Conference on Computer Science, Colima, México, September 2004, pp. 50–56 (2004)Google Scholar
- 3.Keogh, E., Ratanamahatana, C.: Exact indexing of dynamic time warping. In: 28th International Conference on Very Large Data Bases, pp. 406–417 (2002)Google Scholar
- 4.Hartman, J., Wernecke, J.: The VRML 2.0 handbook: building moving worlds on the web. Addison-Wesley, Reading (1996)Google Scholar
- 5.Leech, J., Brown, P. (eds.): The OpenGL Graphics System: A Specification. Silicon Graphics Press (October 2004)Google Scholar