Sciweavers

1245 search results - page 57 / 249
» Binary Sparse Coding
Sort
View
CORR
2004
Springer
144views Education» more  CORR 2004»
15 years 2 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 11 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
Andrew R. Barron, Antony Joseph
ICASSP
2011
IEEE
14 years 6 months ago
Denoising of image patches via sparse representations with learned statistical dependencies
We address the problem of denoising for image patches. The approach taken is based on Bayesian modeling of sparse representations, which takes into account dependencies between th...
Tomer Faktor, Yonina C. Eldar, Michael Elad
ICDM
2006
IEEE
98views Data Mining» more  ICDM 2006»
15 years 8 months ago
What is the Dimension of Your Binary Data?
Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency structure of the variables is simpler than the number of variables would sugge...
Nikolaj Tatti, Taneli Mielikäinen, Aristides ...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 7 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...