Significance map pruning and other enhancements to SPIHT image coding algorithm
dc.authorid | 0000-0001-6556-4104 | |
dc.contributor.author | Bayazıt, Uluğ | en_US |
dc.date.accessioned | 2015-01-15T22:59:58Z | |
dc.date.available | 2015-01-15T22:59:58Z | |
dc.date.issued | 2003-10 | |
dc.department | Işık Üniversitesi, Mühendislik Fakültesi, Elektrik-Elektronik Mühendisliği Bölümü | en_US |
dc.department | Işık University, Faculty of Engineering, Department of Electrical-Electronics Engineering | en_US |
dc.description.abstract | 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. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | 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 | en_US |
dc.identifier.doi | 10.1016/S0923-5965(03)00049-3 | |
dc.identifier.endpage | 785 | |
dc.identifier.issn | 0923-5965 | |
dc.identifier.issn | 1879-2677 | |
dc.identifier.issue | 9 | |
dc.identifier.scopus | 2-s2.0-0142093109 | |
dc.identifier.scopusquality | Q2 | |
dc.identifier.startpage | 769 | |
dc.identifier.uri | https://hdl.handle.net/11729/125 | |
dc.identifier.uri | http://dx.doi.org/10.1016/S0923-5965(03)00049-3 | |
dc.identifier.volume | 18 | |
dc.identifier.wos | WOS:000186655800001 | |
dc.identifier.wosquality | Q2 | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Science Citation Index Expanded (SCI-EXPANDED) | en_US |
dc.institutionauthor | Bayazıt, Uluğ | en_US |
dc.institutionauthorid | 0000-0001-6556-4104 | |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Elsevier Science | en_US |
dc.relation.ispartof | Signal Processing: Image Communication | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Image coding | en_US |
dc.subject | Wavelet | en_US |
dc.subject | SPIHT | en_US |
dc.subject | Pruning | en_US |
dc.subject | Arithmetic coding | en_US |
dc.subject | Hierarchical trees | en_US |
dc.subject | Compression | en_US |
dc.subject | Coder | en_US |
dc.subject | Performance | en_US |
dc.subject | Lossless | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Computer simulation | en_US |
dc.subject | Hierarchical systems | en_US |
dc.subject | Map pruning | en_US |
dc.title | Significance map pruning and other enhancements to SPIHT image coding algorithm | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 125.pdf
- Boyut:
- 363.79 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher version