510 search results - page 20 / 102 » Sparse probabilistic projections |
150
Voted
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
The theory of compressed sensing tells a dramatic story that sparse signals can be reconstructed near-perfectly from a small number of random measurements. However, recent work ha...
167
click to vote
IEEECGIV
2009
IEEE
15 years 10 months ago
2009
IEEE
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
127
click to vote
ICPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Face recognition (FR) is an active yet challenging topic in computer vision applications. As a powerful tool to represent high dimensional data, recently sparse representation bas...
130
click to vote
GBRPR
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
153
click to vote
ICDAR
2007
IEEE
15 years 10 months ago
2007
IEEE
Using a lexicon can often improve character recognition under challenging conditions, such as poor image quality or unusual fonts. We propose a flexible probabilistic model for c...