Sciweavers

280 search results - page 24 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
ORL
2011
15 years 12 days ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
MMM
2009
Springer
218views Multimedia» more  MMM 2009»
16 years 2 months ago
Sparse Multiscale Patches (SMP) for Image Categorization
Abstract. In this paper we address the task of image categorization using a new similarity measure on the space of Sparse Multiscale Patches (SMP). SMPs are based on a multiscale t...
Paolo Piro, Sandrine Anthoine, Eric Debreuve, Mich...
ICIP
2004
IEEE
16 years 7 months ago
Learning structured dictionaries for image representation
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...
Gianluca Monaci, Pierre Vandergheynst
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 6 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ISVD
2007
IEEE
16 years 6 days ago
Decoy Discrimination Using Contact Potentials Based on Delaunay Tessellation of Hydrated Proteins
Three strategies are presented for developing a knowledge-based statistical contact potential from computationally hydrated proteins that may be useful in studies of protein foldi...
Gregory M. Reck, Iosif I. Vaisman