Sciweavers

64 search results - page 6 / 13
» Locally Competitive Algorithms for Sparse Approximation
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
On Growth and Formlets: Sparse Multi-Scale Coding of Planar Shape
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...
Timothy Oleskiw, James Elder, Gabriel Peyr
ECCV
2008
Springer
14 years 9 months ago
Online Sparse Matrix Gaussian Process Regression and Vision Applications
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
Ananth Ranganathan, Ming-Hsuan Yang
TIP
2010
255views more  TIP 2010»
13 years 2 months ago
Image Super-Resolution Via Sparse Representation
This paper presents a new approach to single-image superresolution, based on sparse signal representation. Research on image statistics suggests that image patches can be wellrepre...
Jianchao Yang, John Wright, Thomas S. Huang, Yi Ma
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 7 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
CONIELECOMP
2005
IEEE
14 years 29 days ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...