loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC'06)
Snowbird, Utah
March 28-March 30
ISBN: 0-7695-2545-8
ASCII Text
x 
 
Sergio De Agostino, "Lossless Image Compression by Block Matching on a Mesh of Trees," Data Compression Conference, pp. 443, Data Compression Conference (DCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2006.43,
author = {Sergio De Agostino},
title = {Lossless Image Compression by Block Matching on a Mesh of Trees},
journal ={Data Compression Conference},
volume = {0},
year = {2006},
issn = {1068-0314},
pages = {443},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2006.43},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Lossless Image Compression by Block Matching on a Mesh of Trees
SN - 1068-0314
SP
EP
A1 - Sergio De Agostino,
PY - 2006
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Sergio De Agostino, University of Rome "La Sapienza", Italy
Storer suggested that fast encoders are possible for two-dimensional lossless compression by showing a square greedy matching heuristic for bi-level images, which can be implemented by a simple hashing scheme [2]. The technique is a two-dimensional extension of LZ1 compression. Rectangle matching improves the compression performance, but it is slower since it requires O(M log M) time for a single match, where M is the size of the match [3]. Therefore, the sequential time to compress an image of size n by rectangle matching is \Omega(n log M)
Citation:
Sergio De Agostino, "Lossless Image Compression by Block Matching on a Mesh of Trees," dcc, pp.443, Data Compression Conference (DCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.