Multi-task convolution neural network-based lifting scheme for image compression

IF 3.9 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Tassnim Dardouri , Mounir Kaaniche , Amel Benazza-Benyahia , Gabriel Dauphin
{"title":"Multi-task convolution neural network-based lifting scheme for image compression","authors":"Tassnim Dardouri ,&nbsp;Mounir Kaaniche ,&nbsp;Amel Benazza-Benyahia ,&nbsp;Gabriel Dauphin","doi":"10.1016/j.patrec.2025.05.001","DOIUrl":null,"url":null,"abstract":"<div><div>Lifting schemes have attracted much interest in different image processing tasks, and more specifically in the image compression field. In this context, the optimization of the lifting operators (i.e. the prediction and update ones) plays a crucial role in the design of efficient lifting-based image coding systems. In this respect, we propose in this paper to further investigate the exploitation of neural networks in a standard non-separable lifting scheme structure. More precisely, unlike previous works, where different neural network models are employed for all the prediction and update steps involved in a lifting scheme-based decomposition, our design consists in building a new multi-task convolutional neural network model that takes into account the similarities between two prediction stages. Simulations carried out on three popular image datasets show the benefits of the proposed learning-based image coding approach.</div></div>","PeriodicalId":54638,"journal":{"name":"Pattern Recognition Letters","volume":"195 ","pages":"Pages 66-72"},"PeriodicalIF":3.9000,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167865525001825","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Lifting schemes have attracted much interest in different image processing tasks, and more specifically in the image compression field. In this context, the optimization of the lifting operators (i.e. the prediction and update ones) plays a crucial role in the design of efficient lifting-based image coding systems. In this respect, we propose in this paper to further investigate the exploitation of neural networks in a standard non-separable lifting scheme structure. More precisely, unlike previous works, where different neural network models are employed for all the prediction and update steps involved in a lifting scheme-based decomposition, our design consists in building a new multi-task convolutional neural network model that takes into account the similarities between two prediction stages. Simulations carried out on three popular image datasets show the benefits of the proposed learning-based image coding approach.
基于多任务卷积神经网络的图像压缩提升方案
提升方案在不同的图像处理任务中,特别是在图像压缩领域引起了人们的极大兴趣。在这种情况下,提升算子的优化(即预测算子和更新算子)对于设计高效的基于提升的图像编码系统至关重要。在这方面,我们建议进一步研究神经网络在标准不可分升降方案结构中的应用。更准确地说,与之前的工作不同,在基于提升方案的分解中,不同的神经网络模型被用于所有预测和更新步骤,我们的设计包括建立一个新的多任务卷积神经网络模型,该模型考虑了两个预测阶段之间的相似性。在三个流行的图像数据集上进行的仿真显示了所提出的基于学习的图像编码方法的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Pattern Recognition Letters
Pattern Recognition Letters 工程技术-计算机:人工智能
CiteScore
12.40
自引率
5.90%
发文量
287
审稿时长
9.1 months
期刊介绍: Pattern Recognition Letters aims at rapid publication of concise articles of a broad interest in pattern recognition. Subject areas include all the current fields of interest represented by the Technical Committees of the International Association of Pattern Recognition, and other developing themes involving learning and recognition.
×
引用
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学术官方微信