Is speckle noise more challenging to mitigate than additive noise?
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913827727081472 |
|---|---|
| author | Malekian, Reihaneh Xing, Hao Maleki, Arian |
| author_facet | Malekian, Reihaneh Xing, Hao Maleki, Arian |
| contents | We study the problem of estimating a function in the presence of both speckle and additive noises, commonly referred to as the de-speckling problem. Although additive noise has been thoroughly explored in nonparametric estimation, speckle noise, prevalent in applications such as synthetic aperture radar, ultrasound imaging, and digital holography, has not received as much attention. Consequently, there is a lack of theoretical investigations into the fundamental limits of mitigating the speckle noise.This paper is the first step in filling this gap.
Our focus is on investigating the minimax estimation error for estimating a $β$-Hölder continuous function and determining the rate of the minimax risk. Specifically, if $n$ represents the number of data points, $f$ denotes the underlying function to be estimated, $\hatν_n$ is an estimate of $f$, and $σ_n$ is the standard deviation of the additive Gaussian noise, then $\inf_{\hatν_n} \sup_f \mathbb{E}_f\| \hatν_n - f \|^2_2$ decays at the rate $(\max(1,σ_n^4)/n)^{\frac{2β}{2β+1}}$. Note that the rate achieved under purely additive noise is $({σ_n^2/n})^{\frac{2β}{2β+1}}$. We will provide a detailed comparison of this rate with the one obtained in the presence of both noise types across different regimes of their relative magnitudes, and discuss the insights that emerge from these comparisons. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_16585 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Is speckle noise more challenging to mitigate than additive noise? Malekian, Reihaneh Xing, Hao Maleki, Arian Statistics Theory Information Theory Signal Processing We study the problem of estimating a function in the presence of both speckle and additive noises, commonly referred to as the de-speckling problem. Although additive noise has been thoroughly explored in nonparametric estimation, speckle noise, prevalent in applications such as synthetic aperture radar, ultrasound imaging, and digital holography, has not received as much attention. Consequently, there is a lack of theoretical investigations into the fundamental limits of mitigating the speckle noise.This paper is the first step in filling this gap. Our focus is on investigating the minimax estimation error for estimating a $β$-Hölder continuous function and determining the rate of the minimax risk. Specifically, if $n$ represents the number of data points, $f$ denotes the underlying function to be estimated, $\hatν_n$ is an estimate of $f$, and $σ_n$ is the standard deviation of the additive Gaussian noise, then $\inf_{\hatν_n} \sup_f \mathbb{E}_f\| \hatν_n - f \|^2_2$ decays at the rate $(\max(1,σ_n^4)/n)^{\frac{2β}{2β+1}}$. Note that the rate achieved under purely additive noise is $({σ_n^2/n})^{\frac{2β}{2β+1}}$. We will provide a detailed comparison of this rate with the one obtained in the presence of both noise types across different regimes of their relative magnitudes, and discuss the insights that emerge from these comparisons. |
| title | Is speckle noise more challenging to mitigate than additive noise? |
| topic | Statistics Theory Information Theory Signal Processing |
| url | https://arxiv.org/abs/2409.16585 |