An Optimized Fast Discrete Cosine Transform Approach with Various Iterations and Optimum Numerical Factors for Image Quality Evaluation

B. Nagaria, Mohammad Farukh Hashmi, Vijay Patidar, N. Jain
{"title":"An Optimized Fast Discrete Cosine Transform Approach with Various Iterations and Optimum Numerical Factors for Image Quality Evaluation","authors":"B. Nagaria, Mohammad Farukh Hashmi, Vijay Patidar, N. Jain","doi":"10.1109/CICN.2011.31","DOIUrl":null,"url":null,"abstract":"In this paper, we have discussed the comparative study of Fast Discrete Cosine Transform (FDCT).The proposed Algorithm investigate the performance evaluation of quantization based Fast DCT and variable block size with different no of iterations based image compression Techniques. This paper has been devoted to improve image compression at low lower no of iterations and higher pixel values. The numerical analysis of such algorithms is carried out by measuring Peak Signal to Noise Ratio (PSNR), Compression Ratio (CR) and CPU processing time. In this paper we have elaborated about the compression ratio with different no iterations. We can evaluate the higher compression ratio results more effectively with lower iteration and higher pixel values than that of quality of image respectively. Image quality will be degraded at higher iteration but compression ratio is better as compare to other algorithms. Different no of iterations and quantized matrix and variable block size are chosen using FDCT for calculating MSE, PSNR and Compression Ratio for achieving the highest image quality and Compression Ratio under the same algorithm. The proposed algorithm significantly raises the PSNR and minimizes the MSE at lower iterations but as above discussion main theory is that Compression Ratio increases at higher iterations and quality of image will not be maintained at higher iterations. We have also calculated the CPU processing time for processing of image compression to find the complexity of algorithm. We have Tested this algorithm two test Images fruit with 512X512 pixel frame and Lena image with 256X256 pixel frames. Thus, we can also conclude that at the same compression ratio the difference between original and decompressed image goes on decreasing, as there is increase in image resolution.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2011.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we have discussed the comparative study of Fast Discrete Cosine Transform (FDCT).The proposed Algorithm investigate the performance evaluation of quantization based Fast DCT and variable block size with different no of iterations based image compression Techniques. This paper has been devoted to improve image compression at low lower no of iterations and higher pixel values. The numerical analysis of such algorithms is carried out by measuring Peak Signal to Noise Ratio (PSNR), Compression Ratio (CR) and CPU processing time. In this paper we have elaborated about the compression ratio with different no iterations. We can evaluate the higher compression ratio results more effectively with lower iteration and higher pixel values than that of quality of image respectively. Image quality will be degraded at higher iteration but compression ratio is better as compare to other algorithms. Different no of iterations and quantized matrix and variable block size are chosen using FDCT for calculating MSE, PSNR and Compression Ratio for achieving the highest image quality and Compression Ratio under the same algorithm. The proposed algorithm significantly raises the PSNR and minimizes the MSE at lower iterations but as above discussion main theory is that Compression Ratio increases at higher iterations and quality of image will not be maintained at higher iterations. We have also calculated the CPU processing time for processing of image compression to find the complexity of algorithm. We have Tested this algorithm two test Images fruit with 512X512 pixel frame and Lena image with 256X256 pixel frames. Thus, we can also conclude that at the same compression ratio the difference between original and decompressed image goes on decreasing, as there is increase in image resolution.
基于多迭代和最优数值因子的图像质量快速离散余弦变换优化方法
本文讨论了快速离散余弦变换(FDCT)的比较研究。该算法研究了基于量化的快速DCT和基于不同迭代次数的变块大小图像压缩技术的性能评价。本文致力于提高低迭代次数和高像素值下的图像压缩性能。通过测量峰值信噪比(PSNR)、压缩比(CR)和CPU处理时间对这些算法进行了数值分析。本文阐述了不同无迭代情况下的压缩比。相对于图像质量,我们可以用更少的迭代和更高的像素值来更有效地评价高压缩比的结果。迭代次数越多,图像质量会下降,但压缩比优于其他算法。采用FDCT计算MSE、PSNR和Compression Ratio,选择不同迭代次数、量化矩阵和可变块大小,在相同算法下获得最高的图像质量和Compression Ratio。本文提出的算法在较低的迭代中显著提高了PSNR并最小化了MSE,但如上所述,主要理论是在较高的迭代中压缩比增加,而在较高的迭代中图像质量将无法保持。我们还计算了处理图像压缩的CPU处理时间,找出算法的复杂度。我们用512X512像素帧的水果图像和256X256像素帧的Lena图像对该算法进行了测试。因此,我们还可以得出结论,在相同的压缩比下,随着图像分辨率的增加,原始图像与解压缩图像之间的差异不断减小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信