A Finding Method of Shape Theme Based on Wavelet Time Series

Abstract:

Finding shape theme has raised great attention in the database of shapes. According to the problem of incompatible about accuracy and complexity in the shape theme search algorithm ,this paper proposed a finding theme algorithm using the multi-resolution analysis of wavelet and the processing capability of reduction dimension of time sequence , accurately calculated the similarity between different objects combining with the Euclidean distance formula, and achieved satisfactory results. Through the comparison between the real data sets to test and traditional shape theme algorithm, it shows that the method has good stability and reliability, and ensure the real-time processing ability of the closed contour shapes overall matching.

• Periodical: Advanced Materials Research (Volumes 756-759)
• Pages: 3199-3203
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.756-759.3199
• Online since: September 2013
• Authors: Qiu Guo, Lu Guo
• Keywords: Euclidean Distance, Haar Wavelet, Shape Matching, Time Series

References

[1] Xiaopeng Xi, Eamonn Keogh, Li Wei, et al. Finding Motifs in Database of Shapes[C]. In Proceedings of the Seventh SIAM.

[2] International Conference on Data Mining, April 26-28, 2007, Minneapolis, Minnesota, USA. SIAM (2007).

[3] Adamek, T. and O'Connor, N.E. A multiscale representation method for nonrigid shapes with a single closed contour. IEEE Circuits and Systems for Video Technology, 2004, 14(5): 742-753.

DOI: 10.1109/tcsvt.2004.826776

[4] Eamonn J. Keogh, Li Wei, Xiaopeng Xi, Sang-Hee Lee, Michail Vlachos: LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures[C]. In Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006. VLDB 2006: 882-893.

DOI: 10.1007/s00778-008-0111-4

[5] Zhang D, Lu G. Review of shape representation and description techniques. Pattern Recognition, 2004, 37(1): 1-19.

[6] Jeremy Buhler, Martin Tompa. Finding motifs using random projections[C]. In Proceedings of the Fifth Annual International Conference on Computational Biology, April 22-25, 2001, Montreal, Canada. ACM, 2001, 67-74.

DOI: 10.1145/369133.369172

[7] Lin J., Keogh E., Lonardi, S, et al. A Symbolic Representation of Time Series, with Implications for Streaming Algorithms[C]. In Proceedings of the 8th ACMSIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2003, 2-11.

DOI: 10.1145/882082.882086

[8] Keogh E., Chakrabarti K., Pazzani M, Mehrotra S. Locally adaptive dimensionality reduction for indexing large time series databases[C]. In proceedings of ACMSIGMOD Conference on Management of Data. Santa Barbara, CA, May 21-24, 2001, 151-162.

DOI: 10.1145/376284.375680

[9] http: /www. efg2. com/Lab/Graphics/PolygonArea. htm, June (2001).

[10] Xiaopeng Xi, Eamonn Keogh, Li Wei, Agenor Mafra-Neto. Finding Motifs in Database of Shapes, (2007).

DOI: 10.1137/1.9781611972771.23