Sciweavers

335 search results - page 13 / 67
» Non-negative sparse coding
Sort
View
CORR
2006
Springer
81views Education» more  CORR 2006»
14 years 9 months ago
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
Emin Martinian, Martin J. Wainwright
IPPS
1997
IEEE
15 years 1 months ago
The Sparse Cyclic Distribution against its Dense Counterparts
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
Gerardo Bandera, Manuel Ujaldon, María A. T...
NIPS
2008
14 years 11 months ago
Differentiable Sparse Coding
Prior work has shown that features which appear to be biologically plausible as well as empirically useful can be found by sparse coding with a prior such as a laplacian (L1) that...
J. Andrew Bagnell, David M. Bradley
ICASSP
2010
IEEE
14 years 10 months ago
Hierarchical dictionary learning for invariant classification
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...
Leah Bar, Guillermo Sapiro
PROPERTYTESTING
2010
14 years 7 months ago
Some Recent Results on Local Testing of Sparse Linear Codes
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...
Swastik Kopparty, Shubhangi Saraf