Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2011.18D.1.009

Efficient Rotation-Invariant Boundary Image Matching Using the Envelope-based Lower Bound  

Kim, Sang-Pil (강원대학교 컴퓨터과학과)
Moon, Yang-Sae (강원대학교 컴퓨터과학과)
Hong, Sun-Kyong (강원대학교 컴퓨터과학과)
Publication Information
The KIPS Transactions:PartD / v.18D, no.1, 2011 , pp. 9-22 More about this Journal
Abstract
In this paper we present an efficient solution to rotation?invariant boundary image matching. Computing the rotation-invariant distance between image time-series is a time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the envelope-based lower bound. To this end, we first present how to construct a single envelope from a query sequence and how to obtain a lower bound of the rotation-invariant distance using the envelope. We then show that the single envelope-based lower bound can reduce a number of distance computations. This approach, however, may cause bad performance since it may incur a larger lower bound by considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using the rotation interval we generalize the envelope-based lower bound by exploiting multiple envelopes rather than a single envelope. We also propose equi-width and envelope minimization divisions as the method of determining rotation intervals in the multiple envelope approach. Experimental results show that our envelope-based solutions outperform existing solutions by one or two orders of magnitude.
Keywords
Boundary Image Matching; Data Mining; Rotation-Invariant Distance; Similar Sequence Matching; Envelope-Based Lower Bound;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Zhang, D. Z. and Lu, G., “Review of Shape Representation and Description Techniques,” Pattern Recognition, Vol. 37, No. 1, pp. 1-19, July 2003.   DOI   ScienceOn
2 Chen, y.-W. and Lee, S. C.,”The C-Chain Code – A New Method For Coding 3D Curves,” In Proc. The 25th Asilomar Conf. on Signals, Systems and Computers, Vol.1, pp.472-476, Nov.1991.   DOI
3 Grosky, W. I., and Mehrotra, R., “Index-Based Object Recognition in Pictorial Data Management,” Computer Vision, Graphics, and Image Processing, Vol. 52, Issue3, pp.416-436, Dec.1990.   DOI
4 Bebis, G., Papadourakis, G., Orphanoudakis, S., “Curvature Scale space driven Object Recognition with an Indexing Scheme Based on Artificial Neural Networks,” Pattern Recognition, Vol.32, No.7, pp.1175-1201, July 1999.   DOI   ScienceOn
5 SQUID: http://www.ee.surrey.ac.uk/CVSSP/demos/css/demo.html
6 Lee, A. J. T. et al., “A Novel Filtration Method in Biological Sequence Databases,” Pattern Recognition Letters, Vol. 28, Issue 4, pp. 447-458, Mar. 2007.   DOI   ScienceOn
7 Kim, B.-S., Moon, Y.-S., and Kim, J., “Noise Control Boundary Image Matching Using Time-Series Moving Average Transform,” In Proc. of the 19th Int'l Conf. on Database and Expert Systems Applications (DEXA 2008), Turin, Italy, Sept. 2008   DOI   ScienceOn
8 Keogh, E. J., Wei, L., Xi, X., Vlachos, M., Lee, S.-H., and Protopapas, P., “Supporting Exact Indexing of Arbitrarily Rotated Shapes and Periodic Time Series under Euclidean and Warping Distance Measures,” The VLDB Journal, Vol. 18, No. 3, pp. 611-630, June 2009.   DOI   ScienceOn
9 Chan, K.-P., Fu, A. W.-C., and Yu, C. T., “Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping,” IEEE Trans. on Knowledge and Data Engineering, Vol. 15, No. 3, pp. 686-705, Jan./Feb. 2003.   DOI   ScienceOn
10 Han, W.-S., Lee, J., Moon, Y.-S., and Jiang, H., “Ranked Subsequence Matching in Time-Series Databases,” In Proc. the 33rd Int'l Conf. on Very Large Data Bases, Vienna, Austria, pp. 423-434, Sept. 2007.
11 Gonzalez, R. C. and Woods, R. E., Digital Image Processing, 2nd Ed., Prentice Hall, New Jersey, 2002.
12 Pratt, W. K., Digital Image Processing, 4th Ed., Eastman Kodak Company, Rochester, New York, 2007.
13 Theoharatos, C., “A Generic Scheme for Color Image Retrieval Based on the Multivariate Wald-Wolfowitz Test,” IEEE Trans. on Knowledge and Data Engineering, Vol. 17, No. 6, pp. 808-819, June 2005.   DOI   ScienceOn
14 Do, M. N., “Wavelet-Based Texture Retrieval Using Generalized Gaussian Density and Kullback–Leibler Distance,” IEEE Trans. on Image Processing, Vol. 11, No. 2, Feb. 2002.   DOI   ScienceOn
15 Wang, Z., Chi, Z., Feng, D., and Wang, Q., “Leaf Image Retrieval with Shape Features,” In Proc. 4th Int'l Conf. on Advances in Visual Information Systems, Lyon, France, pp. 477-487, Nov. 2000.
16 Moon, Y.-S., Whang, K.-Y., and Han, W.-S., “General Match: A Subsequence Matching Method in Time Series Databases Based on Generalized Windows,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Madison, Wisconsin, pp. 382-393, June 2002.
17 Agrawal, R., Faloutsos, C., and Swami, A., “Efficient Similarity Search in Sequence Databases,” In Proc. the 4th Int'l Conf. on Foundations of Data Organization and Algorithms, Chicago, Illinois, pp. 69-84, Oct. 1993.   DOI   ScienceOn
18 Faloutsos, C., Ranganathan, M., and Manolopoulos, Y., “Fast Subsequence Matching in Time Series Databases,” In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp. 419-429, May 1994.   DOI
19 Keogh, E., “Exact Indexing of Dynamic Time Warping,” In Proc. the 28th Int'l Conf. on Very Large Data Bases, Hong Kong, pp. 406-417, Aug. 2002.
20 Loh, W.-K., Park, Y.-H., and Yoon, Y.-I., “Fast Recognition of Asian Characters Based on Database Methodologies,” In Proc. the 24th British Nat'l Conf. on Databases, Glasgow, UK, pp. 37-48, July 2007.
21 Vlachos, M., Vagena, Z., Yu, P. S., and Athitsos, V., “Rotation Invariant Indexing of Shapes and Line Drawings,” In Proc. of ACM Conf. on Information and Knowledge Management, Bremen, Germany, pp. 131-138, Oct. 2005.   DOI