Sciweavers

1038 search results - page 18 / 208
» Code Compression
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
Robust and fast non asymmetric distributed source coding using turbo codes on the syndrome trellis
We consider the distributed compression of two (binary memoryless) correlated sources and propose a unique codec that can reach any point in the Slepian-Wolf region. In a previous...
Velotiaray Toto-Zarasoa, Aline Roumy, Christine Gu...
ICIP
2003
IEEE
16 years 1 months ago
Dither-based secure image hashing using distributed coding
We propose an image hashing algorithm that is based on distributed compression principles. The algorithm assumes the availability of a robust feature vector extracted from the ima...
Mark Johnson, Kannan Ramchandran
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
15 years 5 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
CF
2005
ACM
15 years 1 months ago
Evaluation of extended dictionary-based static code compression schemes
This paper evaluates how much extended dictionary-based code compression techniques can reduce the static code size. In their simplest form, such methods statically identify ident...
Martin Thuresson, Per Stenström
DCC
2008
IEEE
15 years 11 months ago
Word-Based Statistical Compressors as Natural Language Compression Boosters
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow di...
Antonio Fariña, Gonzalo Navarro, José...