loading...
A Parallel Decoder for Lossless Image Compression by Block Matching
Snowbird, Utah March 27-March 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2007.62007 Data Compression Conference (DCC ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Luigi Cinque, La Sapienza U., Via Salaria 113, 00198 Roma, Italy
Sergio De Agostino, La Sapienza U., Via Salaria 113, 00198 Roma, Italy
A work-optimal O(log n logM) time PRAM-EREW algorithm for lossless image compression by block matching was shown in [1], where n is the size of the image and M is the maximum size of the match. The design of a parallel decoder was left as an open problem. By slightly modifying the parallel encoder, in this paper we show how to implement the decoder in O(log n logM) time with O(n/ log n) processors on the PRAM-EREW. With the realistic assumption that the size of the compressed image is O(n^1/2), the parallel decoder requires O(log2 n) time and O(n/ log n) processors on the mesh of trees.
Citation:
Luigi Cinque, Sergio De Agostino, "A Parallel Decoder for Lossless Image Compression by Block Matching," dcc, pp.183-192, 2007 Data Compression Conference (DCC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.