DocumentCode :
2298347
Title :
A Parallel Decoder for Lossless Image Compression by Block Matching
Author :
Cinque, Luigi ; De Agostino, Sergio
Author_Institution :
Dept. of Comp. Sci., La Sapienza Univ., Rome
fYear :
2007
fDate :
27-29 March 2007
Firstpage :
183
Lastpage :
192
Abstract :
A work-optimal O(lognlogM) time PRAM-EREW algorithm for lossless image compression by block matching was shown in L. Cinque et al., (2003), 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(lognlogM) time with O(n/logn) processors on the PRAM-EREW. With the realistic assumption that the size of the compressed image is O(n1/2), the parallel decoder requires O(log2n) time and O(n/logn) processors on the mesh of trees
Keywords :
data compression; decoding; image coding; image matching; trees (mathematics); block matching; lossless image compression; parallel decoder; parallel encoder; tree mesh; work-optimal PRAM-EREW algorithm; Compression algorithms; Data compression; Data structures; Decoding; Image coding; Parallel algorithms; Phase change random access memory; Remuneration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 2007. DCC '07
Conference_Location :
Snowbird, UT
ISSN :
1068-0314
Print_ISBN :
0-7695-2791-4
Type :
conf
DOI :
10.1109/DCC.2007.6
Filename :
4148757
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2298347
بازگشت