Sciweavers

280 search results - page 26 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
ICIP
2008
IEEE
15 years 11 months ago
Spatio-spectral reconstruction of the multispectral datacube using sparse recovery
Multispectral scene information is useful for radiometric graphics, material identification and imaging systems simulation. The multispectral scene can be described as a datacube,...
Manu Parmar, Steven Lansel, Brian A. Wandell
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
15 years 4 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
ICDM
2009
IEEE
154views Data Mining» more  ICDM 2009»
14 years 7 months ago
GSML: A Unified Framework for Sparse Metric Learning
There has been significant recent interest in sparse metric learning (SML) in which we simultaneously learn both a good distance metric and a low-dimensional representation. Unfor...
Kaizhu Huang, Yiming Ying, Colin Campbell
TIP
2010
189views more  TIP 2010»
14 years 8 months ago
Image Inpainting by Patch Propagation Using Patch Sparsity
Abstract—This paper introduces a novel examplar-based inpainting algorithm through investigating the sparsity of natural image patches. Two novel concepts of sparsity at the patc...
Zongben Xu, Jian Sun
CVPR
2008
IEEE
15 years 11 months ago
Transfer learning for image classification with sparse prototype representations
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
Ariadna Quattoni, Michael Collins, Trevor Darrell