2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) 2011
DOI: 10.1109/allerton.2011.6120182
|View full text |Cite
|
Sign up to set email alerts
|

Suboptimality of nonlocal means on images with sharp edges

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
35
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(36 citation statements)
references
References 10 publications
1
35
0
Order By: Relevance
“…Note that, in order to streamline the proofs, we take a continuous-variable analysis approach in this paper, in contrast to our approach in [41]. The moral of the story is compatible with [41], however. Table 1 Minimax risk decay rates of several classical image denoising algorithms; recall that according to Theorem 1, for α = 2 the optimal minimax rate is σ 4/3 .…”
Section: Minimax Analysis Frameworkmentioning
confidence: 83%
See 4 more Smart Citations
“…Note that, in order to streamline the proofs, we take a continuous-variable analysis approach in this paper, in contrast to our approach in [41]. The moral of the story is compatible with [41], however. Table 1 Minimax risk decay rates of several classical image denoising algorithms; recall that according to Theorem 1, for α = 2 the optimal minimax rate is σ 4/3 .…”
Section: Minimax Analysis Frameworkmentioning
confidence: 83%
“…The proof is similar to the proof of Theorem 5 in [41]; we consider the function f h (t 1 , t 2 ) for h(t 1 ) = 1/2 and prove that the bias of the NLM on (t 1 , t 2 ) ∈ Q δ n is Θ(1) for any choice of the threshold parameter. However, in the continuous setting considered here, the steps are more challenging.…”
Section: Appendix B Minimax Risk Of Nlmmentioning
confidence: 89%
See 3 more Smart Citations