Low-complexity and efficient image coder/decoder with quad-tree search model for embedded computing platforms
Among the existing image coding methods, set partition in hierarchy tree (SPIHT) becomes a favourable choice for the energy-constrained embedded computing system because of its simplicity and high coding efficiency. In this study, the authors presented a quad-tree search model which is able to provi...
Saved in:
| Published in: | IET image processing Vol. 12; no. 2; pp. 235 - 242 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
The Institution of Engineering and Technology
01.02.2018
|
| Subjects: | |
| ISSN: | 1751-9659, 1751-9667 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Among the existing image coding methods, set partition in hierarchy tree (SPIHT) becomes a favourable choice for the energy-constrained embedded computing system because of its simplicity and high coding efficiency. In this study, the authors presented a quad-tree search model which is able to provide the higher coding efficiency than the model used in SPIHT. By applying this model, the authors proposed a new image codec, which is able to surpass SPIHT by 0.2–0.5 dB in peak signal-to-noise ratio over various code rates, and its performance is even comparable to SPIHT with adaptive arithmetic code and JPEG2000. Also an experiment is conducted to show the complexity of the proposed codec is the same as SPIHT without the complicated arithmetic codes. This property is critically favoured in embedded processing communication systems where energy consumption and speed are priority concerns. |
|---|---|
| ISSN: | 1751-9659 1751-9667 |
| DOI: | 10.1049/iet-ipr.2017.0469 |