Significance map pruning and other enhancements to SPIHT image coding algorithm

Yükleniyor...
Küçük Resim

Tarih

2003-10

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Elsevier Science

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Araştırma projeleri

Organizasyon Birimleri

Dergi sayısı

Özet

This paper proposes several enhancements to the Set Partitioning in Hierarchical Trees (SPIHT) image coding algorithm without changing the original algorithm's general skeleton. First and foremost, a method for significance map pruning based on a rate-distortion criterion is introduced. Specifically, the (Type A) sets of wavelet coefficients with small ratios of estimated distortion reduction to estimated rate contribution are deemed insignificant and effectively pruned. Even though determining such sets requires the computational complexity of the encoder to increase considerably with respect to the original SPIHT encoder, the original SPIHT decoder may still be used to decode the generated bitstream with a low computational complexity. The paper also proposes three low complexity enhancements by more sophisticated use of the adaptive arithmetic coder. Simulation results demonstrate that all these enhancements yield modest compression gains at moderate to high rates.

Açıklama

Anahtar Kelimeler

Image coding, Wavelet, SPIHT, Pruning, Arithmetic coding, Hierarchical trees, Compression, Coder, Performance, Lossless, Algorithms, Computer simulation, Hierarchical systems, Map pruning

Kaynak

Signal Processing: Image Communication

WoS Q Değeri

Q2
Q2

Scopus Q Değeri

Q2

Cilt

18

Sayı

9

Künye

Bayazit, U. (2003). Significance map pruning and other enhancements to SPIHT image coding algorithm. Signal Processing: Image Communication, 18(9), 769-785. doi:10.1016/S0923-5965(03)00049-3