Sciweavers

31 search results - page 5 / 7
» Transductive Learning via Spectral Graph Partitioning
Sort
View
ICASSP
2008
IEEE
14 years 1 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
COMBINATORICA
2010
13 years 2 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
ICCV
2007
IEEE
14 years 9 months ago
Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval
Closing the semantic gap in content based image retrieval (CBIR) basically requires the knowledge of the user's intention which is usually translated into a sequence of quest...
Hichem Sahbi, Jean-Yves Audibert, Renaud Keriven
CVPR
2008
IEEE
14 years 9 months ago
Large-scale manifold learning
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Ameet Talwalkar, Sanjiv Kumar, Henry A. Rowley
ICML
2007
IEEE
14 years 8 months ago
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
Sridhar Mahadevan