TY - JOUR
T1 - A successively refinable lossless image-coding algorithm
AU - Avcibaş, Ismail
AU - Memon, Nasir
AU - Sankur, Bülent
AU - Sayood, Khalid
N1 - Funding Information:
Paper approved by K. Illgner, the Editor for Speech, Image, Video, and Signal Processing of the IEEE Communications Society. Manuscript received August 7, 2002; revised May 31, 2003 and February 22, 2004. This work was supported in part by the National Science Foundation under INT 9996097. The work of ˙. Avcibas¸ was supported in part by TUBİTAK BDP program. The work of K. Sayood was supported by NASA Goddard Space Flight Center. ˙. Avcibas¸ is with the Electrical and Electronics Engineering Department, Uludag University, 16059 Bursa, Turkey (e-mail: [email protected]).
PY - 2005/3
Y1 - 2005/3
N2 - We 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 refining 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.
AB - We 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 refining 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.
KW - Embedded bit stream
KW - Image compression
KW - Lossless compression
KW - Near-lossless compression
KW - Probability mass estimation
KW - Successive refinement
UR - http://www.scopus.com/inward/record.url?scp=17644378390&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=17644378390&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2005.843421
DO - 10.1109/TCOMM.2005.843421
M3 - Article
AN - SCOPUS:17644378390
SN - 0090-6778
VL - 53
SP - 445
EP - 452
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 3
ER -