Manifold learning using robust graph Laplacian for interactive image search - École des Ponts ParisTech Access content directly
Conference Papers Year : 2008

Manifold learning using robust graph Laplacian for interactive image search

Abstract

Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a very small fraction of an image database and iteratively refining a decision rule using both the labeled and unlabeled data. Training of this decision rule is referred to as transductive learning. Our work is an original approach for relevance feed- back based on Graph Laplacian. We introduce a new graph Laplacian which makes it possible to robustly learn the embedding, of the manifold enclosing the dataset, via a diffusion map. Our approach is three-folds: it allows us (i) to integrate all the unlabeled images in the decision process (ii) to robustly capture the topology of the image set and (iii) to perform the search process inside the manifold. Relevance feedback experiments were conducted on simple databases including Olivetti and Swedish as well as challenging and large scale databases including Corel. Comparisons show clear and consistent gain, of our graph Laplacian method, with respect to state-of-the art relevance feedback approaches.
Fichier principal
Vignette du fichier
CVPR08b.pdf (348.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00834992 , version 1 (18-06-2013)

Identifiers

  • HAL Id : hal-00834992 , version 1

Cite

Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert, Renaud Keriven. Manifold learning using robust graph Laplacian for interactive image search. CVPR, Jun 2008, Anchorage, United States. pp.1-8. ⟨hal-00834992⟩
160 View
166 Download

Share

Gmail Facebook Twitter LinkedIn More