Advertisement

Multimedia Tools and Applications

, Volume 73, Issue 3, pp 1983–2008 | Cite as

Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces

  • Carles Ventura
  • Verónica Vilaplana
  • Xavier Giró-i-Nieto
  • Ferran Marqués
Article
  • 112 Downloads

Abstract

Metric Access Methods (MAMs) are indexing techniques which allow working in generic metric spaces. Therefore, MAMs are specially useful for Content-Based Image Retrieval systems based on features which use non L p norms as similarity measures. MAMs naturally allow the design of image browsers due to their inherent hierarchical structure. The Hierarchical Cellular Tree (HCT), a MAM-based indexing technique, provides the starting point of our work. In this paper, we describe some limitations detected in the original formulation of the HCT and propose some modifications to both the index building and the search algorithm. First, the covering radius, which is defined as the distance from the representative to the furthest element in a node, may not cover all the elements belonging to the node’s subtree. Therefore, we propose to redefine the covering radius as the distance from the representative to the furthest element in the node’s subtree. This new definition is essential to guarantee a correct construction of the HCT. Second, the proposed Progressive Query retrieval scheme can be redesigned to perform the nearest neighbor operation in a more efficient way. We propose a new retrieval scheme which takes advantage of the benefits of the search algorithm used in the index building. Furthermore, while the evaluation of the HCT in the original work was only subjective, we propose an objective evaluation based on two aspects which are crucial in any approximate search algorithm: the retrieval time and the retrieval accuracy. Finally, we illustrate the usefulness of the proposal by presenting some actual applications.

Keywords

Multimedia retrieval Content-based image retrieval Indexing techniques Metric access methods Hierarchical cellular tree 

Notes

Acknowledgements

This work was partially founded by the Catalan Broadcasting Corporation through the Spanish project CENIT-2009-1026 BuscaMedia, by TEC2010-18094 MuViPro project of the Spanish Government, and by FPU-2010 Research Fellowship Program of the Spanish Ministry of Education.

References

  1. 1.
    Ahmad I, Gabbouj M (2011) A generic content-based image retrieval framework for mobile devices. Multimed Tools Appl 55:423–442CrossRefGoogle Scholar
  2. 2.
    Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun ACM 51:117CrossRefGoogle Scholar
  3. 3.
    Bayer R, McCreight EM (1972) Organization and maintenance of large ordered indexes. Acta Inform 1(3):173–189CrossRefGoogle Scholar
  4. 4.
    Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18:509–517CrossRefzbMATHGoogle Scholar
  5. 5.
    CENIT Buscamedia Project (2012) www.cenitbuscamedia.es
  6. 6.
    Chávez E, Navarro G, Baeza-Yates R, Marroquín JL (2001) Searching in metric spaces. ACM Comput Surv (CSUR) 33:273–321CrossRefGoogle Scholar
  7. 7.
    Chierichetti F, Panconesi A, Raghavan P, Sozio M, Tiberi A, Upfal E (2007) Finding near neighbors through cluster pruning. In: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS ’07. ACM, New York, USA, pp 103–112CrossRefGoogle Scholar
  8. 8.
    Ciaccia P, Patella M, Rabitti F, Zezula P (1997) Indexing metric spaces with mtree. In: Proc. Quinto convegno Nazionale SEBD, pp 67–86Google Scholar
  9. 9.
    Fagin R, Kumar R, Sivakumar D (2003) Comparing top k lists. In: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SODA ’03. Society for Industrial and Applied Mathematics. Philadelphia, USA, pp 28–36Google Scholar
  10. 10.
    Geraci F (2007) Fast clustering for web information retrieval. Ph.D. thesis, Universita degli Studio di Siena, Facoltá di Ingegnieria, Dipartaminto di Ingegnieria dell’InformazioneGoogle Scholar
  11. 11.
    Giró X, Ventura C, Pont-Tuset J, Cortés S, Marqués F (2010) System architecture of a web service for content-based image retrieval. In: ACM international conference on image and video retrieval 2010, pp 358–365Google Scholar
  12. 12.
    Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on theory of computing, STOC ’98. ACM, New York, USA, pp 604–613CrossRefGoogle Scholar
  13. 13.
    Kendall MG (1970) Rank correlation methods, 4th edn. In: Kendall K (ed). Griffin, London (English)Google Scholar
  14. 14.
    Kiranyaz S, Gabbouj M (2005) Novel multimedia retrieval technique: progressive query (why wait?) IEEE Proc Vision Image Signal Process 152:356–366CrossRefGoogle Scholar
  15. 15.
    Kiranyaz S, Gabbouj M (2007) Hierarchical cellular tree: an efficient indexing scheme for content-based retrieval on multimedia databases. IEEE Trans Multimedia 9:102–119CrossRefGoogle Scholar
  16. 16.
    Kiranyaz S, Ince T, Pulkkinen J, Gabbouj M, Ärje J, Kärkkäinen S, Tirronen V, Juhola M, Turpeinen T, Meissner K (2011) Classification and retrieval on macroinvertebrate image databases. Comput Biol Med 41:463–472CrossRefGoogle Scholar
  17. 17.
    Ling H, Okada K (2007) An efficient earth mover’s distance algorithm for robust histogram comparison. IEEE Trans Pattern Anal Mach Intell 29:840–853CrossRefGoogle Scholar
  18. 18.
    Lowe DG (1999) Object recognition from local scale-invariant features. In: Proceedings of the seventh IEEE international conference on computer vision, vol 2, pp 1150–1157Google Scholar
  19. 19.
    Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: International conference on computer vision theory and application VISSAPP’09. INSTICC Press, pp 331–340Google Scholar
  20. 20.
    Niblack W, Barber R, Equitz W, Flickner M, Glasman EH, Petkovic D, Yanker P, Faloutsos C, Taubin G (1993) The qbic project: Querying images by content, using color, texture, and shape. In: Niblack W (ed) Proceedings SPIE storage and retrieval for image and video databases, vol. 1908, pp 173–187Google Scholar
  21. 21.
    Novak D, Kyselak M, Zezula P (2010) On locality-sensitive indexing in generic metric spaces. In: Proceedings of the third international conference on similarity search and applications, SISAP ’10. ACM, New York, USA, pp 59–66CrossRefGoogle Scholar
  22. 22.
    Patella M, Ciaccia P (2009) Approximate similarity search: a multi-faceted problem. J Discrete Algorithms 7:36–48CrossRefzbMATHMathSciNetGoogle Scholar
  23. 23.
    Pele O, Werman M (2008) A linear time histogram metric for improved sift matching. In: Proceedings of the 10th European conference on computer vision: part III, ECCV ’08. Springer, Heidelberg, pp 495–508Google Scholar
  24. 24.
    Rubner Y, Tomasi C, Guibas LJ (2000) The earth mover’s distance as a metric for image retrieval. Int J Comput Vis 40:99–121CrossRefzbMATHGoogle Scholar
  25. 25.
    Salembier P, Manjunath BS, Sikora T (2002) Introduction to mpeg-7, multimedia content description interface. Wiley, LtdGoogle Scholar
  26. 26.
    Singitham PKC, Mahabhashyam MS, Raghavan P (2004) Efficiency-quality tradeoffs for vector score aggregation. In: Proceedings of the thirtieth international conference on very large data bases, VLDB ’04, vol 40. VLDB Endowment, pp 624–635Google Scholar
  27. 27.
    Ventura C, Martos M, Giró X, Vilaplana V, Marqués F (2012) Hierarchical navigation and visual search for video keyframe retrieval. In: Proceedings of the 18th international conference on advances in multimedia modeling, MMM’12. Springer, Heidelberg, pp 652–654Google Scholar
  28. 28.
    Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the 24rd international conference on very large data bases, VLDB ’98. Morgan Kaufmann Publishers Inc., San Francisco, USA, pp 194–205Google Scholar
  29. 29.
    Yang JC, Ding XR (2013) Movie audio retrieval based on HCT. Appl Mech Mater 321–324:1129–1132Google Scholar
  30. 30.
    Yang J-C, Li Y-X, Feng XH, He QH, He J (2011) Speaker retrieval based on minimum distance in HCT. In: IET international communication conference on wireless mobile and computing, (CCWMC 2011), pp 274–277Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Carles Ventura
    • 1
  • Verónica Vilaplana
    • 1
  • Xavier Giró-i-Nieto
    • 1
  • Ferran Marqués
    • 1
  1. 1.Technical University of Catalonia (UPC)BarcelonaSpain

Personalised recommendations