Algorithmic modifications to SPIHT
dc.authorid | 0000-0001-6556-4104 | |
dc.authorid | 0000-0002-4978-6812 | |
dc.contributor.author | Bayazıt, Uluğ | en_US |
dc.contributor.author | Pearlman, William A. | en_US |
dc.date.accessioned | 2015-07-14T23:48:29Z | |
dc.date.available | 2015-07-14T23:48:29Z | |
dc.date.issued | 2001 | |
dc.department | Işık Üniversitesi, Fen Edebiyat Fakültesi, Enformasyon Teknolojileri Bölümü | en_US |
dc.department | Işık University, Faculty of Arts and Sciences, Department of Information Technologies | en_US |
dc.description.abstract | 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. | en_US |
dc.description.sponsorship | IEEE Signal Processing Society | en_US |
dc.description.sponsorship | IEEE | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | 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 | en_US |
dc.identifier.endpage | 803 | |
dc.identifier.isbn | 0780367251 | |
dc.identifier.scopus | 2-s2.0-0035160228 | |
dc.identifier.scopusquality | N/A | |
dc.identifier.startpage | 800 | |
dc.identifier.uri | https://hdl.handle.net/11729/682 | |
dc.identifier.uri | http://dx.doi.org/10.1109/ICIP.2001.958241 | |
dc.identifier.volume | 3 | |
dc.identifier.wos | WOS:000178056400205 | |
dc.identifier.wosquality | N/A | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Conference Proceedings Citation Index – Science (CPCI-S) | 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 | IEEE | en_US |
dc.relation.ispartof | IEEE International Conference on Image Processing | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Image compression | en_US |
dc.subject | Lossless | en_US |
dc.subject | Arithmetic | en_US |
dc.subject | Bit rate | en_US |
dc.subject | Discrete cosine transforms | en_US |
dc.subject | Image coding | en_US |
dc.subject | Partitioning algorithms | en_US |
dc.subject | Quantization | en_US |
dc.subject | Rate-distortion | en_US |
dc.subject | Sorting | en_US |
dc.subject | Testing | en_US |
dc.subject | Wavelet coefficients | en_US |
dc.subject | SPIHT | en_US |
dc.subject | Algorithmic modifications | en_US |
dc.subject | Bit rate reduction | en_US |
dc.subject | Compression gain | en_US |
dc.subject | Mean squared error | en_US |
dc.subject | Progressive coding | en_US |
dc.subject | Rate-distortion | en_US |
dc.subject | Real world images | en_US |
dc.subject | Refinement pass | en_US |
dc.subject | Set partitioning in hierarchical trees | en_US |
dc.subject | Wavelet based image coding | en_US |
dc.subject | Data compression | en_US |
dc.subject | Mean square error methods | en_US |
dc.subject | Set theory | en_US |
dc.subject | Trees (mathematics) | en_US |
dc.title | Algorithmic modifications to SPIHT | en_US |
dc.type | Conference Object | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 682.pdf
- Boyut:
- 436.5 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version