Neural-network-based compression algorithm for gray scale images

I. Valova, Y. Kosugi
{"title":"Neural-network-based compression algorithm for gray scale images","authors":"I. Valova, Y. Kosugi","doi":"10.1109/IJSIS.1998.685489","DOIUrl":null,"url":null,"abstract":"This paper presents an image compression algorithm for gray scale images, based on neural networks. According to this algorithm the image will be first decomposed into Hadamard set of functions and second, the coefficients from the decomposition will be dynamically clustered by a newly proposed dynamic adaptive clustering method (DACM). We show that DACM converges to approximate the optimum solution based on the least sum of squares criterion theoretically and experimentally. We applied the compression method to various gray scale images and show its efficiency in providing high compression rates. In order to show some comparative results for the proposed method, we have chosen the well-known JPEG. Its algorithm has similar structure and therefore is a good basis for comparison. The results from the gray scale images experiments are in favor of the proposed method.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJSIS.1998.685489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents an image compression algorithm for gray scale images, based on neural networks. According to this algorithm the image will be first decomposed into Hadamard set of functions and second, the coefficients from the decomposition will be dynamically clustered by a newly proposed dynamic adaptive clustering method (DACM). We show that DACM converges to approximate the optimum solution based on the least sum of squares criterion theoretically and experimentally. We applied the compression method to various gray scale images and show its efficiency in providing high compression rates. In order to show some comparative results for the proposed method, we have chosen the well-known JPEG. Its algorithm has similar structure and therefore is a good basis for comparison. The results from the gray scale images experiments are in favor of the proposed method.
基于神经网络的灰度图像压缩算法
提出了一种基于神经网络的灰度图像压缩算法。该算法首先将图像分解为Hadamard函数集,然后采用一种新提出的动态自适应聚类方法(DACM)对分解后的系数进行动态聚类。从理论和实验两方面证明了基于最小平方和准则的DACM收敛于逼近最优解。我们将该方法应用于各种灰度图像,并证明了它在提供高压缩率方面的有效性。为了对所提出的方法进行比较,我们选择了众所周知的JPEG格式。其算法结构相似,为比较提供了良好的基础。灰度图像的实验结果证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信