IRSnet: An Implicit Residual Solver and Its Unfolding Neural Network With 0.003M Parameters for Total Variation Models

IF 3.4 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Access Pub Date : 2025-01-13 DOI:10.1109/ACCESS.2025.3528637
Yuanhao Gong
{"title":"IRSnet: An Implicit Residual Solver and Its Unfolding Neural Network With 0.003M Parameters for Total Variation Models","authors":"Yuanhao Gong","doi":"10.1109/ACCESS.2025.3528637","DOIUrl":null,"url":null,"abstract":"Solving total variation problems is fundamentally important for many computer vision tasks, such as image smoothing, optical flow estimation and 3D surface reconstruction. However, the traditional iterative solvers require a large number of iterations to converge, while deep learning solvers have a huge number of parameters, hampering their practical deployment. To address these issues, this paper first introduces a novel iterative algorithm that is 6 ~ 75 times faster than previous iterative methods. The proposed iterative method converges and converges to the optimal solution. These two facts are theoretically guaranteed and numerically confirmed, respectively. Then, we generalize this algorithm to a compact implicit neural network that has only 0.003M parameters. The network is shown to be more effective and efficient. Thanks to the small number of parameters, the proposed network can be applied in a wide range of applications where total variation is imposed. The source code for the iterative solver and the neural network is publicly available at <uri>https://github.com/gyh8/IRS</uri>.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"10289-10298"},"PeriodicalIF":3.4000,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10838572","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10838572/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Solving total variation problems is fundamentally important for many computer vision tasks, such as image smoothing, optical flow estimation and 3D surface reconstruction. However, the traditional iterative solvers require a large number of iterations to converge, while deep learning solvers have a huge number of parameters, hampering their practical deployment. To address these issues, this paper first introduces a novel iterative algorithm that is 6 ~ 75 times faster than previous iterative methods. The proposed iterative method converges and converges to the optimal solution. These two facts are theoretically guaranteed and numerically confirmed, respectively. Then, we generalize this algorithm to a compact implicit neural network that has only 0.003M parameters. The network is shown to be more effective and efficient. Thanks to the small number of parameters, the proposed network can be applied in a wide range of applications where total variation is imposed. The source code for the iterative solver and the neural network is publicly available at https://github.com/gyh8/IRS.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
全变分模型的隐式残差解算器及其展开神经网络
解决全变分问题对于许多计算机视觉任务至关重要,例如图像平滑、光流估计和三维表面重建。然而,传统的迭代求解器需要大量的迭代才能收敛,而深度学习求解器具有大量的参数,阻碍了其实际部署。为了解决这些问题,本文首先介绍了一种新的迭代算法,该算法比以前的迭代方法快6 ~ 75倍。所提出的迭代方法收敛并收敛于最优解。这两个事实分别得到了理论上的保证和数值上的证实。然后,我们将该算法推广到只有0.003万个参数的紧凑隐式神经网络。该网络被证明是更有效和高效的。由于参数数量少,所提出的网络可以应用于广泛的应用,其中总变化是强加的。迭代求解器和神经网络的源代码可在https://github.com/gyh8/IRS上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Access
IEEE Access COMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍: IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest. IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on: Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals. Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering. Development of new or improved fabrication or manufacturing techniques. Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.
期刊最新文献
Editorial Board IEEE Access™ Editorial Board Corrections to “The Recent Technologies to Curb the Second-Wave of COVID-19 Pandemic” Corrections to “Decentralized Asynchronous Formation Planning of Multirotor Aerial Vehicles in Dynamic Environments Using Flexible Formation Graphs and Tight Trajectory Hulls” Study on the Motion Patterns of Nested Test Cabin and Its Shock Response Spectrum Analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1