Sciweavers

334 search results - page 23 / 67
» On Shift-Invariant Sparse Coding
Sort
View
NAA
2004
Springer
178views Mathematics» more  NAA 2004»
14 years 1 months ago
Performance Optimization and Evaluation for Linear Codes
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
Pavel Tvrdík, Ivan Simecek
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 8 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
IPPS
1998
IEEE
14 years 5 days ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...
ECCV
2010
Springer
14 years 1 months ago
Gabor Feature based Sparse Representation for Face Recognition with Gabor Occlusion Dictionary
Abstract. By coding the input testing image as a sparse linear combination of the training samples via l1-norm minimization, sparse representation based classification (SRC) has b...
DCC
2000
IEEE
14 years 10 days ago
The Skip-Innovation Model for Sparse Images
On sparse images, contiguous runs of identical symbols often occur in the same coding context. This paper proposes a model for efficiently encoding such runs in a twodimensional s...
Paul J. Ausbeck Jr.