Bilinear Constraint based ADMM for Mixed Poisson-Gaussian Noise Removal
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose new operator-splitting algorithms for the total variation regularized infimal convolution (TV-IC) model [4] in order to remove mixed Poisson-Gaussian(MPG) noise. In the existing splitting algorithm for TV-IC, an inner loop by Newton method had to be adopted for one nonlinear optimization subproblem, which increased the computation cost per outer loop. By introducing a new bilinear constraint and applying the alternating direction method of multipliers (ADMM), all subproblems of the proposed algorithms named as BCA (short for Bilinear Constraint based ADMM algorithm) and BCAf(short for a variant of BCA with fully splitting form) can be very efficiently solved; especially for the proposed BCAf, they can be calculated without any inner iterations. Under mild conditions, the convergence of the proposed BCA is investigated. Numerically, compared to existing primal-dual algorithms for the TV-IC model, the proposed algorithms, with fewer tunable parameters, converge much faster and produce comparable results meanwhile.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1.
3 papers.
- 2021Fully-Connected Tensor Network Decomposition for Robust Tensor Completion Problemcited by 5
- 2023A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decompositioncited by 3
- 2021Image reconstruction in light-sheet microscopy: spatially varying deconvolution and mixed noisecited by 2
- 2023A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition25 Aug 2023
- 2021Fully-Connected Tensor Network Decomposition for Robust Tensor Completion Problem17 Oct 2021
- 2021Image reconstruction in light-sheet microscopy: spatially varying deconvolution and mixed noise8 Aug 2021