Efficient target search with relevance feedback for large CBIR systems
Proceedings of the 2006 ACM symposium on Applied computing
ViCo: an adaptive distributed video correlation system
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
An in-memory relevance feedback technique for high-performance image retrieval systems
Proceedings of the 6th ACM international conference on Image and video retrieval
Aggregate similarity queries in relevance feedback methods for content-based image retrieval
Proceedings of the 2008 ACM symposium on Applied computing
Handle local optimum traps in CBIR systems
Proceedings of the 2008 ACM symposium on Applied computing
Journal of Systems and Software
Efficiently support concurrent queries in multiuser CBIR systems
Multimedia Tools and Applications
Speed up interactive image retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
A Multi-Directional Search technique for image annotation propagation
Journal of Visual Communication and Image Representation
Fast query point movement techniques with relevance feedback for content-based image retrieval
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Real-Time Query Processing on Live Videos in Networks of Distributed Cameras
International Journal of Interdisciplinary Telecommunications and Networking
Client-Side Relevance Feedback Approach for Image Retrieval in Mobile Environment
International Journal of Multimedia Data Engineering & Management
Hi-index | 0.00 |
Today's Content-Based Image Retrieval (CBIR) techniques are based on the "k-nearest neighbors" (k- NN) model. They retrieve images from a single neighborhood using low-level visual features. In this model, semantically similar images are assumed to be clustered in the high-dimensional feature space. Unfortunately, no visual-based feature vector is sufficient to facilitate perfect semantic clustering; and semantically similar images with different appearances are always clustered into distinct neighborhoods in the feature space. Confinement of the search results to a single neighborhood is an inherent limitation of the k-NN techniques. In this paper we consider a new image retrieval paradigm — the Query Decomposition model - that facilitates retrieval of semantically similar images from multiple neighborhoods in the feature space. The retrieval results are the k most similar images from different relevant clusters. We introduce a prototype, and present experimental results to illustrate the effectiveness and efficiency of this new approach to content-based image retrieval.