A ranking algorithm using dynamic clustering for content-based image retrieval

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 385
  • Download : 0
In this paper, we propose a ranking algorithm using dynamic clustering for content-based image retrieval(CBIR). In conventional CBIR systems, it is often observed that visually dissimilar images to the query image are located at high ranking. To remedy this problem, we utilize similarity relationship of retrieved results via dynamic clustering. In the first step of our method, images axe retrieved using visual feature such as color histogram, etc. Next, the retrieved images are analyzed using a HACM (Hierarchical Agglomerative Clustering Method) and the ranking of results is adjusted according to distance from a cluster representative to a query. We show the experimental results based on MPEG-7 color test images. According to our experiments, the proposed method achieves more than 10 % improvements of retrieval effectiveness in ANMRR(Average Normalized Modified Retrieval Rank) performance measure.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2002
Language
English
Article Type
Article; Proceedings Paper
Citation

IMAGE AND VIDEO RETRIEVAL BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.2383, pp.328 - 337

ISSN
0302-9743
URI
http://hdl.handle.net/10203/82463
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0