1992
DOI: 10.1016/0167-2789(92)90242-f
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear total variation based noise removal algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

13
8,211
0
56

Year Published

2011
2011
2017
2017

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 13,553 publications
(8,280 citation statements)
references
References 9 publications
13
8,211
0
56
Order By: Relevance
“…latest Laplacian matrix pre-conditioner by Krishnan et al [26], we have noticed that solving equation (20) takes in general only one iteration, and two iterations for very small λ values. This is very fast processing : for two iterations of the proposed method, around 2 × 3 = 6 pre-conditioned conjugate gradient iterations in total are required to perform edge-aware smoothing of a full-color image.…”
Section: Fast Numerical Solutionmentioning
confidence: 99%
See 3 more Smart Citations
“…latest Laplacian matrix pre-conditioner by Krishnan et al [26], we have noticed that solving equation (20) takes in general only one iteration, and two iterations for very small λ values. This is very fast processing : for two iterations of the proposed method, around 2 × 3 = 6 pre-conditioned conjugate gradient iterations in total are required to perform edge-aware smoothing of a full-color image.…”
Section: Fast Numerical Solutionmentioning
confidence: 99%
“…(a) Input (b) BLF [1] (c) NCF [11] (d) TV [20] (e) Extrema [27] (f) GF [28] (g) WLS [16] (h) L0 [21] (i) Proposed [21]). The proposed method produces high-quality smoothing while being flexible and computationally efficient.…”
Section: Image Smoothingmentioning
confidence: 99%
See 2 more Smart Citations
“…Interestingly, researchers in image restoration had proposed over the years solutions to Strang's dual problem, that of minimizing the total variation (TV) of a functional. Initial solutions used level-set formulations [60], and later ones convex optimization methods [11,58]. Nonetheless, it is thought that primal maximum flow methods are better suited to segmentation than TV formulations [18].…”
Section: Maximal Continuous Flows and Total Variationmentioning
confidence: 99%