PIPO-Net: A Penalty-based Independent Parameters Optimization deep unfolding Network

IF 3.6 2区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC Signal Processing Pub Date : 2025-04-01 Epub Date: 2024-11-22 DOI:10.1016/j.sigpro.2024.109796
Xiumei Li , Zhijie Zhang , Huang Bai , Ljubiša Stanković , Junpeng Hao , Junmei Sun
{"title":"PIPO-Net: A Penalty-based Independent Parameters Optimization deep unfolding Network","authors":"Xiumei Li ,&nbsp;Zhijie Zhang ,&nbsp;Huang Bai ,&nbsp;Ljubiša Stanković ,&nbsp;Junpeng Hao ,&nbsp;Junmei Sun","doi":"10.1016/j.sigpro.2024.109796","DOIUrl":null,"url":null,"abstract":"<div><div>Compressive sensing (CS) has been widely applied in signal and image processing fields. Traditional CS reconstruction algorithms have a complete theoretical foundation but suffer from the high computational complexity, while fashionable deep network-based methods can achieve high-accuracy reconstruction of CS but are short of interpretability. These facts motivate us to develop a deep unfolding network named the penalty-based independent parameters optimization network (PIPO-Net) to combine the merits of the above mentioned two kinds of CS methods. Each module of PIPO-Net can be viewed separately as an optimization problem with respective penalty function. The main characteristic of PIPO-Net is that, in each round of training, the learnable parameters in one module are updated independently from those of other modules. This makes the network more flexible to find the optimal solutions of the corresponding problems. Moreover, the mean-subtraction sampling and the high-frequency complementary blocks are developed to improve the performance of PIPO-Net. Experiments on reconstructing CS images demonstrate the effectiveness of the proposed PIPO-Net.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"229 ","pages":"Article 109796"},"PeriodicalIF":3.6000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S016516842400416X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/11/22 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Compressive sensing (CS) has been widely applied in signal and image processing fields. Traditional CS reconstruction algorithms have a complete theoretical foundation but suffer from the high computational complexity, while fashionable deep network-based methods can achieve high-accuracy reconstruction of CS but are short of interpretability. These facts motivate us to develop a deep unfolding network named the penalty-based independent parameters optimization network (PIPO-Net) to combine the merits of the above mentioned two kinds of CS methods. Each module of PIPO-Net can be viewed separately as an optimization problem with respective penalty function. The main characteristic of PIPO-Net is that, in each round of training, the learnable parameters in one module are updated independently from those of other modules. This makes the network more flexible to find the optimal solutions of the corresponding problems. Moreover, the mean-subtraction sampling and the high-frequency complementary blocks are developed to improve the performance of PIPO-Net. Experiments on reconstructing CS images demonstrate the effectiveness of the proposed PIPO-Net.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
PIPO-Net:基于惩罚的独立参数优化深度展开网络
压缩传感(CS)已被广泛应用于信号和图像处理领域。传统的 CS 重构算法有完整的理论基础,但存在计算复杂度高的问题,而时下流行的基于深度网络的方法可以实现高精度的 CS 重构,但缺乏可解释性。这些事实促使我们结合上述两种 CS 方法的优点,开发了一种名为基于惩罚的独立参数优化网络(PIPO-Net)的深度展开网络。PIPO-Net 的每个模块都可单独视为一个优化问题,并带有各自的惩罚函数。PIPO-Net 的主要特点是,在每一轮训练中,一个模块的可学习参数的更新与其他模块无关。这使得网络能更灵活地找到相应问题的最优解。此外,为了提高 PIPO-Net 的性能,还开发了均值减法采样和高频互补块。重建 CS 图像的实验证明了所提出的 PIPO-Net 的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Signal Processing
Signal Processing 工程技术-工程:电子与电气
CiteScore
9.20
自引率
9.10%
发文量
309
审稿时长
41 days
期刊介绍: Signal Processing incorporates all aspects of the theory and practice of signal processing. It features original research work, tutorial and review articles, and accounts of practical developments. It is intended for a rapid dissemination of knowledge and experience to engineers and scientists working in the research, development or practical application of signal processing. Subject areas covered by the journal include: Signal Theory; Stochastic Processes; Detection and Estimation; Spectral Analysis; Filtering; Signal Processing Systems; Software Developments; Image Processing; Pattern Recognition; Optical Signal Processing; Digital Signal Processing; Multi-dimensional Signal Processing; Communication Signal Processing; Biomedical Signal Processing; Geophysical and Astrophysical Signal Processing; Earth Resources Signal Processing; Acoustic and Vibration Signal Processing; Data Processing; Remote Sensing; Signal Processing Technology; Radar Signal Processing; Sonar Signal Processing; Industrial Applications; New Applications.
期刊最新文献
Multi-view clustering via contrastive approach Correntropy-induced multi-hypergraph discrete clustering LAES: A local adaptive edge-enhanced spectrogram method for unsupervised anomalous sound detection Geometric optimization for joint localization and surveillance in distributed passive radar Coarray transformation and compensation of coprime array for non-circular signal
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1