Sciweavers

540 search results - page 7 / 108
» A New Compression Method for Compressed Matching
Sort
View
ICIP
2006
IEEE
14 years 11 months ago
Lossy-to-Lossless Compression of Images Based on Binary Tree Decomposition
A new lossy-to-lossless quality-progressive method for image coding is presented. This method is based on binary tree decomposition and context-based arithmetic coding. Experiment...
António J. R. Neves, Armando J. Pinho
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 4 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
SPIESR
2000
130views Database» more  SPIESR 2000»
13 years 11 months ago
Compression of large binary images in digital spatial libraries
A method for lossless compression of large binary images is proposed for applications where spatial access to the image is needed. The method utilizes the advantages of (1) variabl...
Eugene I. Ageenko, Pasi Fränti
DCC
1991
IEEE
14 years 1 months ago
New Methods for Lossless Image Compression Using Arithmetic Coding
d abstract) Paul G. Howard' and Jeffrey Scott Vitter2 Department of Computer Science Brown University Providence, R. I. 02912-1910
Paul G. Howard, Jeffrey Scott Vitter
DLT
2004
13 years 11 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda