Title

Handle Local Optimum Traps In Cbir Systems

Keywords

Content-based image retrieval; Local optimum traps; Query point movement techniques; Relevance feedback

Abstract

Existing CBIR systems, designed around query refinement based on relevance feedback, suffer from local optimum traps. That is, when the user is examining a relevant cluster surrounded by less relevant images, essentially the same set of images will be returned for the user to provide relevance feedback. Since the user would select the same query images again, the relevance feedback process gets trapped in a local optimum. This local-optimum trap problem may severely impair the overall retrieval performance of today's CBIR systems. In this paper, we therefore propose a simulated annealing-based approach to address this important issue. When a stuck-at-a-local-optimum occurs, we employ a neighborhood search technique (i.e., simulated annealing) to escape from the local optimum. We also propose an index structure to speed up such neighborhood search. Our experimental study confirms that our approach can efficiently address the local-optimum trap problem, and therefore can improve the effectiveness of existing CBIR systems. Copyright 2008 ACM.

Publication Date

12-1-2008

Publication Title

Proceedings of the ACM Symposium on Applied Computing

Number of Pages

1202-1206

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1145/1363686.1363965

Socpus ID

56749174188 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/56749174188

This document is currently not available here.

Share

COinS