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

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 xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/gyh8/IRS</uri>.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3528637
Citations
6
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
14.89

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Yuanhao Gong
6 citations
IEEE Access
Neural Networks and Applications
14.89
article

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

Yuanhao Gong
article en
6 citations

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 xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/gyh8/IRS</uri>.

IEEE AccessVol. 13
Shenzhen University (CN)
National Natural Science Foundation of China, Shenzhen Science and Technology Innovation Program
Openalex Percentile: Top 2%
Neural Networks and Applications
14.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.