Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Interactive noise-controlled boundary image matching using the time-series moving average transform

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

In this paper we propose a time-series matching-based approach that provides the interactive boundary image matching with noise control for a large-scale image database. To achieve the noise reduction effect in boundary image matching, we exploit the moving average transform of time-series matching. We are motivated by a simple intuition that the moving average transform might reduce the noise of boundary images as well as that of time-series data. To confirm this intuition, we first propose a new notion of k-order image matching, which applies the moving average transform to boundary image matching. A boundary image can be represented as a sequence in the time-series domain, and our k-order image matching identifies similar boundary images in this time-series domain by comparing the k-moving average transformed sequences. We then propose an index-based method that efficiently performs k-order image matching on a large image database, and formally prove its correctness. We also formally analyze the relationship of orders and their matching results and present an interactive approach of controlling the noise reduction effect. Experimental results show that our k-order image matching exploits the noise reduction effect well, and our index-based method outperforms the sequential scan by one or two orders of magnitude. These results indicate that our k-order image matching and its index-based solution provide a very practical way of realizing the noise control boundary image matching. To our best knowledge, the proposed interactive approach for large-scale image databases is the first attempt to solve the noise control problem in the time-series domain rather than the image domain by exploiting the efficient time-series matching techniques. Thus, our approach can be widely used in removing other types of distortions in image matching areas.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Notes

  1. CCD itself is not our main focus. That is, our focus is not to convert an image to a time-series properly, but is to provide an efficient and noise-controllable matching method by exploiting multidimensional indexes and by supporting arbitrary moving average orders. Thus, as the boundary extraction method, we handle CCD only in this paper, and we leave the effect of different methods as the future work.

References

  1. Agrawal R, Faloutsos C, Swami A (1993) 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

  2. Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R ∗ -tree: an efficient and robust access method for points and rectangles. In: Proc. int’l conf. on management of data. ACM SIGMOD, Atlantic City, pp 322–331

    Google Scholar 

  3. Belongie S, Malik J (2000) Matching with shape contexts. In: Proc. IEEE workshop on contentbased access of image and video libraries (CBAIVL-2000). Hilton Head Island, South Carolina, pp 20–26

    Chapter  Google Scholar 

  4. Berchtold S, Bohm C, Kriegel H-P (1998) The pyramid-technique: towards breaking the curse of dimensionality. In: Proc. int’l conf. on management of data. ACM SIGMOD, Seattle, pp 142–153

    Google Scholar 

  5. Brownrigg DRK (1984) The weighted median filter. Commun ACM 27(8):807–818

    Article  Google Scholar 

  6. Chan KP, Fu AW-C, Yu CT (2003) Haar wavelets for efficient similarity search of time-series: with and without time warping. IEEE Trans Knowl Data Eng 15(3):686–705

    Article  Google Scholar 

  7. Chatfield C (1984) The analysis of time series: an introduction, 3rd edn. Chapman and Hall, London

    MATH  Google Scholar 

  8. Do MN (2002) Wavelet-based texture retrieval using generalized Gaussian density and Kullback–Leibler distance. IEEE Trans Image Process 11(2):146–158

    Article  MathSciNet  Google Scholar 

  9. Dong Y, Ma J (2011) Wavelet-based image texture classification using local energy histograms. IEEE Signal Process Lett 18(4):247–250

    Article  Google Scholar 

  10. Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. In: Proc. int’l conf. on management of data. ACM SIGMOD, Minneapolis, pp 419–429

    Google Scholar 

  11. Gonzalez RC, Woods RE (2002) Digital image processing, 2nd edn. Prentice Hall, New Jersey

    Google Scholar 

  12. Hajiaboli MR (2011) An anisotropic fourth-order diffusion filter for image noise removal. Int J Comput Vision 92(2):177–191

    Article  MATH  MathSciNet  Google Scholar 

  13. Han W-S, Lee J, Moon Y-S, Jiang H (2007) Ranked subsequence matching in time-series databases. In: Proc. the 33rd int’l conf. on very large data bases. Vienna, Austria, pp 423–434

  14. Hildebrand FB (1987) Introduction to numerical analysis, 2nd edn. Dover, New York

    MATH  Google Scholar 

  15. 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–1361

    Article  Google Scholar 

  16. Keogh E (2002) Exact indexing of dynamic time warping. In: Proc. the 28th int’l conf. on very large data bases. Hong Kong, pp 406–417

  17. Keogh E et al (2006) LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures. In: Proc. int’l conf. on very large data bases. Seoul, Korea, pp 882–893

  18. Keogh E, Ratanamahatana CA (2007) Indexing and mining large time series databases. In: Proc. the 12th int’l conf. on database systems for advanced applications, tutorial. Bangkok, Thailand

  19. Keogh EJ, Wei L, Xi X, Vlachos M, Lee S-H, Protopapas P (2009) Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures. VLDB J 18(3):611–630

    Article  Google Scholar 

  20. Kim T (2011) Color histogram diffusion for image enhancement. In: Proc. of the 18th IEEE int’l conf. on image processing. Brussels, Belgium, pp 3425–3428

  21. Lee AJT et al (2007) A novel filtration method in biological sequence databases. Pattern Recogn Lett 28(4):447–458

    Article  Google Scholar 

  22. Loh W-K, Kim S-W, Whang K-Y (2000) Index interpolation: a subsequence matching algorithm supporting moving average transform of arbitrary order in time-series databases. IEICE Trans Inf Syst E84-D(1):76–86

    Google Scholar 

  23. Loh W-K, Kim S-W, Whang K-Y (2004) A subsequence matching algorithm that supports normalization transform in time-series databases. Data Mining Knowl Disc 9(1):5–28

    Article  MathSciNet  Google Scholar 

  24. Loh W-K, Park Y-H, Yoon Y-I (2007) Fast recognition of asian characters based on database methodologies. In: Proc. the 24th British nat’l conf. on databases. Glasgow, UK, pp 37–48

  25. Moon Y-S, Kim J (2007) Efficient moving average transform-based subsequence matching algorithms in time-series databases. Inf Sci 177(23):5415–5431

    Article  MATH  Google Scholar 

  26. Moon Y-S, Kim B-S, Kim M S, Whang K-Y (2010) Scaling-invariant boundary image matching using time-series matching techniques. Data Knowl Eng 69(10):1022–1042

    Article  Google Scholar 

  27. 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: Proc. int’l conf. on management of data. ACM SIGMOD, Madison, pp 382–393

    Google Scholar 

  28. Moon Y-S, Whang K-Y, Loh W-K (2001) Duality-based subsequence matching in time-series databases. In: Proc. the 17th int’l conf. on data engineering. IEEE, Heidelberg, pp 263–272

    Google Scholar 

  29. Mori G, Malik J (2002) Estimating human body configurations using shape context matching. In: Proc. the 7th European conference on computer vision. Copenhagen, Denmark, pp 666–680

  30. Pratt WK (2007) Digital image processing, 4th edn. Eastman Kodak, Rochester

    Book  Google Scholar 

  31. Rafiei D (1999) On similarity-based queries for time series data. In: Proc. the 15th int’l conf. on data engineering. IEEE ICDE, Sydney, pp 410–417

    Google Scholar 

  32. Rafiei D, Mendelzon AO (2000) Querying time series data based on similarity. IEEE Trans Knowl Data Eng 12(5):675–693

    Article  Google Scholar 

  33. Rosenfeld A, Kalk AC (1982) Digital picture processing, vols 1/2, 2nd edn. Academic Press, New York

    Google Scholar 

  34. Suetens P, Fua P, Hanson AJ (1992) Computational strategies for object recognition. ACM Comput Surv 24(1):5–62

    Article  Google Scholar 

  35. Vlachos M, Vagena Z, Yu PS, Athitsos V (2005) Rotation invariant indexing of shapes and line drawings. In: Proc. of ACM conf. on information and knowledge management. Bremen, Germany, pp 131–138

  36. Wang Z, Chi Z, Feng D, Wang Q (2000) Leaf image retrieval with shape features. In: Proc. 4th int’l conf. on advances in visual information systems. Lyon, France, pp 477–487

  37. Yang S-M, Tai S-C (2012) A design framework for hybrid approaches of image noise estimation and its application to noise reduction. J Vis Commun Image Represent 23(5):812–826

    Article  Google Scholar 

  38. Zhang DZ, Lu G (2003) Review of shape representation and description techniques. Pattern Recogn 37(1):1–19

    Article  Google Scholar 

  39. Yefeng Zheng’s homepage, http://www.umiacs.umd.edu/~zhengyf/PointMatching.htm

  40. Zhu Y, Shasha D (2003) Warping indexes with envelope transforms for query by humming. In: Proc. of int’l conf. on management of data. ACM SIGMOD, San Diego, pp 181–192

    Google Scholar 

Download references

Acknowledgements

This work was partially supported by Defense Acquisition Program Administration and Agency for Defense Development under the contract.

Author information

Authors and Affiliations

  1. Advanced Information Technology Research Center (AITrc), Korea Advanced Institute of Science and Technology (KAIST), 291 Daehak-ro(373-1 Guseong-dong), Yuseong-gu, Daejeon, 305-701, Korea

    Bum-Soo Kim, Yang-Sae Moon, Mi-Jung Choi & Jinho Kim

Authors
  1. Bum-Soo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang-Sae Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mi-Jung Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jinho Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yang-Sae Moon.

Additional information

The preliminary version of this paper was published in Proc. of the 19th Int’l Conf. on Database and Expert Systems Applications (DEXA 2008), Turin, Italy, pp. 362–375, September 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, BS., Moon, YS., Choi, MJ. et al. Interactive noise-controlled boundary image matching using the time-series moving average transform. Multimed Tools Appl 72, 2543–2571 (2014). https://doi.org/10.1007/s11042-013-1552-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-013-1552-3

Keywords

Search

Navigation