Clustering-Based image retrieval using fast exhaustive multi-resolution search algorithm

Authors:
Byung Cheol Song;Kang Wook Chun
Affiliations:
Digital Media R & D Center, Samsung Electronics Co., Ltd, Suwon City, Republic of Korea;Digital Media R & D Center, Samsung Electronics Co., Ltd, Suwon City, Republic of Korea
Venue:
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part III
Year:
2004

Citing 5
Cited 0

Texture Features for Browsing and Retrieval of Image Data

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Branch and Bound Algorithm for Computing k-Nearest Neighbors

IEEE Transactions on Computers
Quantization

IEEE Transactions on Information Theory
Successive elimination algorithm for motion estimation

IEEE Transactions on Image Processing
Extracting color features and dynamic matching for image database retrieval

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a fast exhaustive multi-resolution search algorithm in a clustered image database. Prior to search process, the whole image data set is partitioned into a pre-defined number of clusters having similar feature contents. For a given query, the proposed algorithm first checks the lower bound of distances in each cluster, eliminating disqualified clusters. Next, it only examines the candidates in the surviving clusters through feature matching. Simulation results show that the proposed algorithm guarantees very rapid exhaustive search ...