Sciweavers

1542 search results - page 151 / 309
» A compressive beamforming method
Sort
View
SPIRE
2009
Springer
16 years 28 days ago
Directly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
DCC
2000
IEEE
15 years 10 months 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.
GEM
2008
15 years 7 months ago
Better Huffman Coding via Genetic Algorithm
Abstract--We present an approach to compress arbitrary files using a Huffman-like prefix-free code generated through the use of a genetic algorithm, thus requiring no prior knowled...
Cody Boisclair, Markus Wagner
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 6 months ago
Minimum cost distributed source coding over a network
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Aditya Ramamoorthy
ICIP
2006
IEEE
16 years 8 months ago
Low-Rate Reduced Complexity Image Compression using Directionlets
The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth...
Vladan Velisavljevic, Baltasar Beferull-Lozano, Ma...