Name
Abstract | ||
|---|---|---|
Some video applications require the use of extremely simple source coding techniques. For these applications, Modulo-PCM is an interesting alternative to PCM since it has a very low complexity and performs better than PCM. In this paper, we present an adaptive Modulo-PCM algorithm for image coding. Our algorithm divides the image into blocks and performs a proper Modulo-PCM coding of each block. Since our algorithm allows different degrees of encoding complexity, it can adapt to the computational resources that are available in each video application. Experimental results show that our algorithm improves the coding efficiency of both non-adaptive MPCM and PCM. The magnitude of the improvements depends on the encoding complexity and the target rate. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ICIP.2011.6116310 | 2011 18TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP) |
Keywords | Field | DocType |
Low complexity coding, video recording | A-law algorithm,Computer science,Real-time computing,Artificial intelligence,Context-adaptive binary arithmetic coding,Algorithmic efficiency,Pattern recognition,Coding tree unit,Algorithm,Transform coding,Decoding methods,Encoding (memory),Computational complexity theory | Conference |
ISSN | Citations | PageRank |
1522-4880 | 1 | 0.37 |
References | Authors | |
5 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josep Prades-nebot | 1 | 134 | 9.59 |