Name
Abstract | ||
|---|---|---|
We propose a level-successive encoding scheme for the compression of continuous tone images. The compressed bit stream is partitioned into individual segments corre- sponding to successive bits and arranged in order of de- creasing significance of the bits. Bit-plane scalability is achieved by recursively partitioning the image into an LSB bit-plane and remaining higher order bits and encoding the LSB bit-plane using the remaining bits as context. This allows the scheme to achieve excellent compression per- formance by exploiting both spatial and inter-level corre- lations. We compare the proposed scheme with a number of scalable and non-scalable lossless image compression algorithms to benchmark its performance. Results indicate that the level-embedded compression incurs only a small penalty in compression efficiency over conventional loss- less schemes while offering the benefit of easy bit-plane scalability. |
Year | Venue | Keywords |
|---|---|---|
2003 | PICS | digital photography,higher order,recursive partitioning,lossless image compression |
Field | DocType | Citations |
Computer vision,Data compression ratio,Lossy compression,Computer science,Algorithm,Artificial intelligence,Data compression,Arithmetic coding,Image compression,Least significant bit,Context-adaptive binary arithmetic coding,Lossless compression | Conference | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mehmet Utku Celik | 1 | 165 | 13.93 |
| Gaurav Sharma | 2 | 640 | 56.64 |
| A. Murat Tekalp | 3 | 2603 | 278.04 |