Algorithmic modifications to SPIHT
Yükleniyor...
Dosyalar
Tarih
2001
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3] The modifications exploit universal traits common to the real world images Approximately 1-2 % compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all Of the Proposed modifications into SPIHT.
Açıklama
Anahtar Kelimeler
Image compression, Lossless, Arithmetic, Bit rate, Discrete cosine transforms, Image coding, Partitioning algorithms, Quantization, Rate-distortion, Sorting, Testing, Wavelet coefficients, SPIHT, Algorithmic modifications, Bit rate reduction, Compression gain, Mean squared error, Progressive coding, Rate-distortion, Real world images, Refinement pass, Set partitioning in hierarchical trees, Wavelet based image coding, Data compression, Mean square error methods, Set theory, Trees (mathematics)
Kaynak
IEEE International Conference on Image Processing
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
3
Sayı
Künye
Bayazit, U. & Pearlman, W. A. (2001). Algorithmic modifications to SPIHT. Paper presented at the IEEE International Conference on Image Processing, 3, 800-803. doi:10.1109/ICIP.2001.958241
