2009
DOI: 10.1137/080730421
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration

Abstract: Abstract. We generalize the alternating minimization algorithm recently proposed in [32] to efficiently solve a general, edge-preserving, variational model for recovering multichannel images degraded by within-and cross-channel blurs, as well as additive Gaussian noise. This general model allows the use of localized weights and higher-order derivatives in regularization, and includes a multichannel extension of total variation (MTV) regularization as a special case. In the MTV case, we show that the model can … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
217
0
1

Year Published

2011
2011
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 474 publications
(224 citation statements)
references
References 37 publications
3
217
0
1
Order By: Relevance
“…For years, these restoration models are usually solved by gradient descent method, which is quite slow due to the non-smoothness of the objective functionals. Recently, various convex optimization techniques have been proposed to efficiently solve these models [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20], some of which are closely related to iterative shrinkage-thresholding algorithms [21][22][23][24].…”
Section: Introductionmentioning
confidence: 99%
“…For years, these restoration models are usually solved by gradient descent method, which is quite slow due to the non-smoothness of the objective functionals. Recently, various convex optimization techniques have been proposed to efficiently solve these models [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20], some of which are closely related to iterative shrinkage-thresholding algorithms [21][22][23][24].…”
Section: Introductionmentioning
confidence: 99%
“…This result can be found as Lemma 3.3 in [29]. When g is a characteristic function χ C (x) of a convex set C:…”
Section: Solving the Subproblem In Apgmentioning
confidence: 94%
“…Moreover, the problem reformulation is more suitable for improving the efficiency of GAPG, and we can also avoid solving the image denoising subproblem. Finally the GAPG framework is combined with the continuation technique [22] [24][27] [29][30] to solve the resulting optimization problem. Our method works for both anisotropic and isotropic discrete TV-based image restoration.…”
mentioning
confidence: 99%
“…This advantage of total variation regularization was first discovered in [6] for image denoising and deblurring, and has been generalized to multichannel problems in [7], the TV-L1 model in [8], TV-based compressed sensing in [9,10], and an edge-guided compressive sensing reconstruction approach for recovering images of higher qualities from fewer measurements in [11].…”
Section: Introductionmentioning
confidence: 99%