Boundary image matching supporting partial denoising using time-series matching techniques
In this paper, we deal with the problem of boundary image matching which finds similar boundary images regardless of partial noise exploiting time-series matching techniques. Time-seris matching techniques make it easier to compute distances for similarity identification, and therefore it is feasible to perform boundary image matching even on a large image database. To solve this problem, we first convert all boundary images into times-series and derive partial denoising time-series. The partial denoising time-series is generated from an original time-series by removing partial noise; that is, it is obtained by changing a position of partial denoising from original time-series. We then introduce the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and propose partial denoising boundary image matching using the partial denoising distance as a similarity measure. Computing the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. Thus, in order to improve its performance, we present a tight lower bound of the partial denoising distance and also optimize the computation of the partial denoising distance. We finally propose range and k-NN query algorithms according to a query processing method for partial denoising boundary image matching. Through extensive experiments, we show that our lower bound-based approach and the optimization method of the partial denoising distance improve search performance by up to an order of magnitude.
KeywordsTime-series databases Data mining Boundary image matching Time-series matching Moving average transform Partial denoising
This research, “Geospatial Big Data Management, Analysis and Service Platform Technology Development,” was supported by the MOLIT(The Ministry of Land, Infrastructure and Transport), Korea, under the national spatial information research program supervised by the KAIA(Korea Agency for Infrastructure Technology Advancement) (16NSIP-B081011-03).
- 1.Agrawal R, Faloutsos C, Swami A (1993) Efficient similarity search in sequence databases. In: Proceedings of the 4th Int’l Conf. on Foundations of Data Organization and Algorithms, Chicago, Illinois, pp 69–84Google Scholar
- 3.Chu KW, Wong MH (1999) Fast time-series searching with scaling and shifting. In: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Philadelphia, Pennsylvania, pp 237–248Google Scholar
- 5.Ding H, Trajcevski G, Scheuermann P, Wang X, Keogh E (2008) Querying and mining of time series data: experimental comparison of representations and distance measures. In: Proceedings of the 34th Int’l Conf. on Very Large Data Bases, Auckland, New Zealand, pp 1542– 1552Google Scholar
- 6.Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. In: Proceedings of the Int’l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp 419–429Google Scholar
- 8.Gonzalez RC, Woods RE (2008) Digital image processing, 3rd Edn. Prentice Hall, New JerseyGoogle Scholar
- 9.Han W-S, Lee J, Moon Y-S, Hwang S-W, Yu H (2011) A new approach for processing ranked subsequence matching based on ranked union. In: Proceedings of Int’l Conf. on Management of Data, ACM SIGMOD, Athens, Greece, pp 457–468Google Scholar
- 15.Moon Y-S, Whang K-Y, Han W-S (2002) General match: a subsequence matching method in time-series databases based on generalized windows. In: proceedings of the Int’l Conf. on Management of Data, ACM SIGMOD, Madison, Wisconsin, pp 382–393Google Scholar
- 19.Mori G, Malik J (2002) Estimating human body configuration using shape context matching. In: Proceedings of the 7th European Conf. on Computer Vision, Copenhagen, Denmark, pp 666– 680Google Scholar
- 23.Shumway RH, Stoffer DS (2006) Time series analysis and its applications: with r examples(Ed. 2) springer texts in statisticsGoogle Scholar
- 24.Vlachos M, Kollios G, Gunopulos D (2002) Discovering similar multidimensional trajectories. In: Proceedings of the 18th IEEE Int’l Conf. on Data Engineering(ICDE), San Jose, California, pp 673– 684Google Scholar
- 25.Vlachos M, Vagena Z, Yu PS, Athitsos V (2005) Rotation invariant indexing of shapes and line drawings. In: Proceedings of ACM Conf. on Information and Knowledge Management, Bremen, Germany, pp 131–138Google Scholar