Sciweavers

334 search results - page 33 / 67
» On Shift-Invariant Sparse Coding
Sort
View
NECO
2007
127views more  NECO 2007»
13 years 7 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
TWC
2008
133views more  TWC 2008»
13 years 7 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
FCCM
2007
IEEE
165views VLSI» more  FCCM 2007»
13 years 9 months ago
Sparse Matrix-Vector Multiplication Design on FPGAs
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
Junqing Sun, Gregory D. Peterson, Olaf O. Storaasl...
CORR
2006
Springer
131views Education» more  CORR 2006»
13 years 8 months ago
Analysis of LDGM and compound codes for lossy compression and binning
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
Emin Martinian, Martin J. Wainwright
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 7 months ago
Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes
Abstract-- We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function wh...
Shrinivas Kudekar, Rüdiger L. Urbanke