Laplacian Regularized Subspace Learning for interactive image re-ranking
Content-based image retrieval (CBIR) has attracted substantial attention during the past few years for its potential applications. To bridge the gap between low level visual features and high level semantic concepts, various relevance feedback (RF) or interactive re-ranking (IR) schemes have been de...
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/84746 http://hdl.handle.net/10220/12389 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Content-based image retrieval (CBIR) has attracted substantial attention during the past few years for its potential applications. To bridge the gap between low level visual features and high level semantic concepts, various relevance feedback (RF) or interactive re-ranking (IR) schemes have been designed to improve the performance of a CBIR system. In this paper, we propose a novel subspace learning based IR scheme by using a graph embedding framework, termed Laplacian Regularized Subspace Learning (LRSL). The LRSL method can model both within-class compactness and between-class separation by specially designing an intrinsic graph and a penalty graph in the graph embedding framework, respectively. In addition, LRSL can share the popular assumption of the biased discriminant analysis (BDA) for IR but avoid the singular problem in BDA. Extensive experimental results have shown that the proposed LRSL method is effective for reducing the semantic gap and targeting the intentions of users for an image retrieval task. |
|---|