Please use this identifier to cite or link to this item: http://hdl.handle.net/11452/21497
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNasir, Memon-
dc.contributor.authorSankur, Bülent-
dc.contributor.authorSayood, Khalid-
dc.date.accessioned2021-08-20T11:59:04Z-
dc.date.available2021-08-20T11:59:04Z-
dc.date.issued2005-03-
dc.identifier.citationAvcıbaş, İ. vd. (2005). "A successively refinable lossless image-coding algorithm". IEEE Transactions on Communications, 53(3), 445-452.en_US
dc.identifier.issn0090-6778-
dc.identifier.issn1558-0857-
dc.identifier.urihttps://doi.org/10.1109/TCOMM.2005.843421-
dc.identifier.urihttps://ieeexplore.ieee.org/document/1413588-
dc.identifier.urihttp://hdl.handle.net/11452/21497-
dc.description.abstractWe present a compression technique that provides progressive transmission as well as lossless and near-lossless compression in a single framework. The proposed technique produces a bit stream that results in a progressive, and ultimately lossless, reconstruction of an image similar to what one can obtain with a reversible wavelet codec. In addition, the proposed scheme provides near-lossless reconstruction with respect to a given bound, after decoding of each layer of the successively refinable bit stream. We formulate the image data-compression problem as one of successively relining the probability density function (pdf) estimate of each pixel. Within this framework, restricting the region of support of the estimated pdf to a fixed size interval then results in near-lossless reconstruction. We address the context-selection problem, as well as pdf-estimation methods based on context data at any pass. Experimental results for both lossless and near-lossless cases indicate that the proposed compression scheme, that innovatively combines lossless, near-lossless, and progressive coding attributes, gives competitive performance in comparison with state-of-the-art compression schemes.en_US
dc.language.isoenen_US
dc.publisherIEEE-INTS Electrical Electronics Engineers Incen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectEmbedded bit streamen_US
dc.subjectImage compressionen_US
dc.subjectLoss-less compressionen_US
dc.subjectNear-lossless compressionen_US
dc.subjectProbability mass estimationen_US
dc.subjectSuccessive refinementen_US
dc.subjectCompressionen_US
dc.subjectEngineeringen_US
dc.subjectTelecommunicationsen_US
dc.subjectComputer simulationen_US
dc.subjectDecodingen_US
dc.subjectEstimationen_US
dc.subjectImage codingen_US
dc.subjectImage reconstructionen_US
dc.subjectMatrix algebraen_US
dc.subjectProbability density functionen_US
dc.subjectStatistical methodsen_US
dc.subjectEmbedded bit streamen_US
dc.subjectLossless compressionen_US
dc.subjectNear lossless compressionen_US
dc.subjectProbability mass estimationen_US
dc.subjectSuccessive refinementen_US
dc.subjectImage compressionen_US
dc.titleA successively refinable lossless image-coding algorithmen_US
dc.typeArticleen_US
dc.identifier.wos000228095000012tr_TR
dc.identifier.scopus2-s2.0-17644378390tr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergitr_TR
dc.contributor.departmentUludağ Üniversitesi/Mühendislik Fakültesi/Elektrik ve Elektronik Mühendisliği Bölümü.tr_TR
dc.identifier.startpage445tr_TR
dc.identifier.endpage452tr_TR
dc.identifier.volume445tr_TR
dc.identifier.issue452tr_TR
dc.relation.journalIEEE Transactions on Communicationsen_US
dc.contributor.buuauthorAvcıbaş, İsmail-
dc.contributor.researcheridH-9089-2018tr_TR
dc.relation.collaborationYurt içitr_TR
dc.relation.collaborationYurt dışıtr_TR
dc.subject.wosEngineering, electrical & electronicen_US
dc.subject.wosTelecommunicationsen_US
dc.indexed.wosSCIEen_US
dc.indexed.scopusScopusen_US
dc.wos.quartileQ1en_US
dc.contributor.scopusid6602339258tr_TR
dc.subject.scopusLossless Image Compression; Image Coding; Compression Ratioen_US
Appears in Collections:Scopus
Web of Science

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.