Paper Info
Title
Lossless Image Compression by Block Matching on a Mesh of Trees
Abstract
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)
Year
DOI
Venue
2006
10.1109/DCC.2006.43
DCC
Keywords
Field
DocType
block matching,two-dimensional lossless compression,single match,n log,square greedy matching heuristic,lz1 compression,lossless image compression,size n,sequential time,compression performance,m log,rectangle matching,mesh generation,greedy algorithms,concurrent computing,data compression,parallel algorithms,computer science,parallel algorithm
Discrete mathematics,Binary logarithm,Polygon mesh,Computer science,Parallel algorithm,Rectangle,Greedy algorithm,Theoretical computer science,Data compression,Mesh generation,Lossless compression
Conference
ISSN
ISBN
Citations 
1068-0314
0-7695-2545-8
4
PageRank 
References 
Authors
0.44
0
1
Name
Order
Citations
PageRank
Sergio De Agostino110216.51