Sciweavers

280 search results - page 42 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 1 months ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin
PPOPP
2011
ACM
14 years 14 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
ICCV
2003
IEEE
15 years 11 months ago
Recognition with Local Features: the Kernel Recipe
Recent developments in computer vision have shown that local features can provide efficient representations suitable for robust object recognition. Support Vector Machines have be...
Christian Wallraven, Barbara Caputo, Arnulf B. A. ...
TSP
2008
124views more  TSP 2008»
14 years 9 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst
PAMI
2011
14 years 4 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang