Hierarchical partitions for content image retrieval from large-scale database

N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Increasing of multimedia applications in commerce, biometrics, science, entertainments etc. leads to a great need of processing of digital visual content stored in very large databases. Many systems combine visual features and metadata analysis to solve the semantic gap between low-level visual features and high-level human concept, i.e. there arises a great interest in contentbased image retrieval (CBIR) systems. As retrieval is computationally expensive, one of the most challenging moments in CBIR is minimizing of the retrieval process time. Widespread clustering techniques allow to group similar images in terms of their features proximity. The number of matches can be greatly reduced, but there is no guarantee that the global optimum solution is obtained. We propose a novel hierarchical clustering of image collections with objective function encompassing goals to number of matches at a search stage. Offered method enables construction of image retrieval systems with minimal query time. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kinoshenko, D., Mashtalir, V., Yegorova, E., & Vinarsky, V. (2005). Hierarchical partitions for content image retrieval from large-scale database. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3587 LNAI, pp. 445–455). Springer Verlag. https://doi.org/10.1007/11510888_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free