Sciweavers

1245 search results - page 146 / 249
» Binary Sparse Coding
Sort
View
134
Voted
IPL
2010
114views more  IPL 2010»
15 years 1 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
125
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 23 days ago
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
Arya Mazumdar, Alexander Barg, Navin Kashyap
125
Voted
TCOM
2010
133views more  TCOM 2010»
14 years 10 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
160
Voted
CVPR
2012
IEEE
13 years 5 months ago
Icon scanning: Towards next generation QR codes
Undoubtedly, a key feature in the popularity of smartmobile devices is the numerous applications one can install. Frequently, we learn about an application we desire by seeing it ...
Itamar Friedman, Lihi Zelnik-Manor
119
Voted
ICIP
2000
IEEE
16 years 5 months ago
Image Compression with Geometrical Wavelets
We introduce a sparse image representation that takes advantage of the geometrical regularity of edges in images. A new class of one-dimensional wavelet orthonormal bases, called ...
Erwan Le Pennec, Stéphane Mallat