Compressed image reproduction based on block decomposition

Sangkeun Lee
{"title":"Compressed image reproduction based on block decomposition","authors":"Sangkeun Lee","doi":"10.1049/IET-IPR.2007.0195","DOIUrl":null,"url":null,"abstract":"A compressed image reproduction scheme is proposed by properly decomposing and manipulating the coefficients of discrete cosine transform (DCT) directly in the compressed domain. The basic idea of the proposed approach is to decompose each DCT block into several sub-blocks and to adjust the brightness and detail components of a given image for compressing dynamic range and enhancing contrast. Image reproduction based on the subblock decomposition can be done more precisely than any approach based on the normal block-sized approach. First, DCT coefficients of each block are decomposed into several sub-blocks. Next each sub-block's coefficients are separated into brightness and detail components, and treated differently according to content analysis. Then, the enhanced coefficients are projected on the constraint sets to avoid some artefacts, and are composed back to the original order. The main advantages of the proposed algorithm are that (i) it can enhance the dynamic range and details without affecting the compressibility of the given image since it operates directly in the compressed domain, and (ii) it does not boost blocking artefacts around big edges without any further processing. In order to evaluate the proposed scheme, several base-line approaches are described and compared using enhancement quality measures.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Image Process.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/IET-IPR.2007.0195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A compressed image reproduction scheme is proposed by properly decomposing and manipulating the coefficients of discrete cosine transform (DCT) directly in the compressed domain. The basic idea of the proposed approach is to decompose each DCT block into several sub-blocks and to adjust the brightness and detail components of a given image for compressing dynamic range and enhancing contrast. Image reproduction based on the subblock decomposition can be done more precisely than any approach based on the normal block-sized approach. First, DCT coefficients of each block are decomposed into several sub-blocks. Next each sub-block's coefficients are separated into brightness and detail components, and treated differently according to content analysis. Then, the enhanced coefficients are projected on the constraint sets to avoid some artefacts, and are composed back to the original order. The main advantages of the proposed algorithm are that (i) it can enhance the dynamic range and details without affecting the compressibility of the given image since it operates directly in the compressed domain, and (ii) it does not boost blocking artefacts around big edges without any further processing. In order to evaluate the proposed scheme, several base-line approaches are described and compared using enhancement quality measures.
基于分块分解的压缩图像再现
提出了一种直接在压缩域中对离散余弦变换(DCT)系数进行适当分解和处理的压缩图像再现方案。该方法的基本思想是将每个DCT块分解成几个子块,并对给定图像的亮度和细节分量进行调整,以压缩动态范围和增强对比度。基于子块分解的图像复制比基于常规块大小的方法更精确。首先,将每个块的DCT系数分解成几个子块;然后将各子块系数分为亮度分量和细节分量,根据内容分析进行不同处理。然后,将增强系数投影到约束集上以避免一些伪影,并将其组合回原始顺序。该算法的主要优点是:(i)它可以增强动态范围和细节,而不会影响给定图像的可压缩性,因为它直接在压缩域中操作;(ii)它不会增强大边缘周围的阻塞伪影,而无需进一步处理。为了评估所提出的方案,描述了几种基线方法,并使用增强质量措施进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信