{"title":"Adaptive Lossy Image Compression Based on Singular Value Decomposition","authors":"M. R. Souza, H. Pedrini","doi":"10.4236/JSIP.2019.103005","DOIUrl":null,"url":null,"abstract":"Image compression techniques aim to reduce redundant information in order to allow data storage and transmission in an efficient way. In this work, we propose and analyze a lossy image compression method based on the singular value decomposition using an optimal choice of eigenvalues and an adaptive mechanism for block partitioning. Experiments are conducted on several images to demonstrate the effectiveness of the proposed compression method in comparison with the direct application of the singular value decomposition.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"98 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Hiding and Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4236/JSIP.2019.103005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0
Abstract
Image compression techniques aim to reduce redundant information in order to allow data storage and transmission in an efficient way. In this work, we propose and analyze a lossy image compression method based on the singular value decomposition using an optimal choice of eigenvalues and an adaptive mechanism for block partitioning. Experiments are conducted on several images to demonstrate the effectiveness of the proposed compression method in comparison with the direct application of the singular value decomposition.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
