{"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.