Multimedia Tools and Applications

, Volume 76, Issue 6, pp 8471–8496 | Cite as

Boundary image matching supporting partial denoising using time-series matching techniques

Article
  • 236 Downloads

Abstract

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.

Keywords

Time-series databases Data mining Boundary image matching Time-series matching Moving average transform Partial denoising 

References

  1. 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
  2. 2.
    Belongie S, Malik J, Puzicha J (2002) Shape matching and object recognition using shape contexts. IEEE Trans. on Pattern Analysis and Machine Intelligence 24 (4):509–522CrossRefGoogle Scholar
  3. 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
  4. 4.
    Do MN (2002) Wavelet-based texture retrieval using generalized gaussian density and Kullback-Leibler distance. IEEE Trans Image Processing 11(2):146–158MathSciNetCrossRefGoogle Scholar
  5. 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. 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
  7. 7.
    Gil M-S, Moon Y-S, Kim B-S (2011) Linear detrending subsequence matching in time-series databases. IEICE Trans Information and Systems E94-D(4):917–920CrossRefGoogle Scholar
  8. 8.
    Gonzalez RC, Woods RE (2008) Digital image processing, 3rd Edn. Prentice Hall, New JerseyGoogle Scholar
  9. 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
  10. 10.
    Holte MB, Moeslund TB, Fihl P (2010) View-invariant gesture recognition using 3D optical flow and harmonic motion context. Comput Vis Image Underst 114 (12):1353–1361CrossRefGoogle Scholar
  11. 11.
    Kim B-S, Moon Y-S, Choi M-J, Kim J (2014) Interactive noise-controlled boundary image matching using the time-series moving average transform. Multimedia Tools and Applications 72(3):2543– 2571CrossRefGoogle Scholar
  12. 12.
    Lin C-H, Lin W-C (2011) Image retrieval system based on adaptive color histogram and texture features. Comput J 54(7):1136–1147CrossRefGoogle Scholar
  13. 13.
    Liu H, Frishkoff G, Frank R, Dou D (2012) Sharing and integration of cognitive neuroscience data: Metric and pattern matching across heterogeneous ERP datasets. Neurocomputing 92:156– 169CrossRefGoogle Scholar
  14. 14.
    Loh W-K, Kim S-W, Whang K-Y (2004) A subsequence matching algorithm that supports normalization transform in time-series databases. Data Min Knowl Disc 9(1):5–28MathSciNetCrossRefGoogle Scholar
  15. 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
  16. 16.
    Moon Y-S, Kim J (2007) Efficient moving average transform-based subsequence matching algorithms in time-series databases. Inf Sci 177(23):5415–5431CrossRefMATHGoogle Scholar
  17. 17.
    Moon Y-S, Kim B-S, Kim MS, Whang K-Y (2010) Scaling-invariant boundary image matching using time-series matching techniques. Data Knowl Eng 69 (10):1022–1042CrossRefGoogle Scholar
  18. 18.
    Moon Y-S, Lee BS (2014) Safe MBR-transformation in similar sequence matching. Inf Sci 270(2):28–40MathSciNetCrossRefMATHGoogle Scholar
  19. 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
  20. 20.
    Pratt WK (2007) Digital image processing, 4th Edn. Eastman Kodak Company, RochesterCrossRefMATHGoogle Scholar
  21. 21.
    Rafiei D, Mendelzon AO (2000) Querying time series data based on similarity. IEEE Trans Knowl Data Eng 12(5):675–693CrossRefGoogle Scholar
  22. 22.
    Suetens P, Fua P, Hanson AJ (1992) Computational strategies for object recognition. ACM Comput Surv 24(1):5–62CrossRefGoogle Scholar
  23. 23.
    Shumway RH, Stoffer DS (2006) Time series analysis and its applications: with r examples(Ed. 2) springer texts in statisticsGoogle Scholar
  24. 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. 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
  26. 26.
    Wang X-Y, Yu Y-J, Yang H-Y (2011) An effective image retrieval scheme using color, texture and shape features. Computer Standards & Interfaces 33(1):59–68CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Knowledge Service EngineeringKAISTDaejeonKorea
  2. 2.Department of Computer ScienceKangwon National UniversityChuncheonKorea

Personalised recommendations