Paper Info
Title
Fast progressive wavelet coding
Abstract
Fast and efficient image compression can be achieved with the progressive wavelet coder (PWC) introduced in this paper. Unlike many previous wavelet coders, PWC does not rely on zerotrees or other ordering schemes based on parent-child wavelet relationships. PWC has a very simple structure, based on two key concepts: (1) data-independent reordering and blocking, and (2) low-complexity independent encoding of each block via adaptive Rice coding of bit planes. In that way, PWC allows for progressive image encoding that is scalable both in resolution and bit rate, with a fully embedded bitstream. PWC achieves a rate vs. distortion performance that is comparable to that of the state-of-the-art SPMT (set partitioning in hierarchical trees) coder, but with a better performance/complexity ratio.
Year
DOI
Venue
1999
10.1109/DCC.1999.755683
Data Compression Conference
Keywords
Field
DocType
adaptive codes,computational complexity,data compression,image coding,image resolution,rate distortion theory,transform coding,wavelet transforms,adaptive Rice coding,bit planes,data-independent blocking,data-independent reordering,embedded bitstream,image compression,low-complexity independent encoding,progressive image encoding,progressive wavelet coding,rate/distortion performance,resolution,scalable image encoding
Computer science,Theoretical computer science,Artificial intelligence,Context-adaptive binary arithmetic coding,Wavelet transform,Wavelet,Computer vision,Pattern recognition,Set partitioning in hierarchical trees,Transform coding,Bitstream,Data compression,Image compression
Conference
ISSN
ISBN
Citations 
1068-0314
0-7695-0096-X
18
PageRank 
References 
Authors
2.77
6
1
Name
Order
Citations
PageRank
Henrique Malvar1690105.66