{"title":"散斑噪声比加性噪声更难消除吗?","authors":"Reihaneh Malekian;Hao Xing;Arian Maleki","doi":"10.1109/TIT.2025.3578430","DOIUrl":null,"url":null,"abstract":"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 <inline-formula> <tex-math>$\\beta $ </tex-math></inline-formula>-Hölder continuous function and determining the rate of the minimax risk. Specifically, if <italic>n</i> represents the number of data points, <italic>f</i> denotes the underlying function to be estimated, <inline-formula> <tex-math>$\\hat {\\nu }_{n}$ </tex-math></inline-formula> is an estimate of <italic>f</i>, and <inline-formula> <tex-math>$\\sigma _{n}$ </tex-math></inline-formula> is the standard deviation of the additive Gaussian noise, then <inline-formula> <tex-math>$\\inf _{\\hat {\\nu }_{n}} \\sup _{f} \\mathbb {E}_{f}\\| \\hat {\\nu }_{n} {-} f \\|^{2}_{2}$ </tex-math></inline-formula> decays at the rate <inline-formula> <tex-math>$\\left ({{\\max (1,\\sigma _{n}^{4})/n}}\\right)^{\\frac {2\\beta }{2\\beta +1}}$ </tex-math></inline-formula>. Comparing this rate with the rate achieved under purely additive noise, namely <inline-formula> <tex-math>$\\left ({{\\sigma _{n}^{2}/n}}\\right)^{\\frac {2\\beta }{2\\beta +1}}$ </tex-math></inline-formula>, leads to the following insights: 1) When <inline-formula> <tex-math>$ \\sigma _{n} = \\omega (1) $ </tex-math></inline-formula>, the additive noise appears to be the dominant component in the de-speckling problem. However, the presence of speckle noise significantly complicates the task of mitigating its effects. As a result, the risk increases from the rate <inline-formula> <tex-math>$ \\left ({{ \\sigma _{n}^{2} / n }}\\right)^{\\frac {2\\beta }{2\\beta +1}} $ </tex-math></inline-formula>, which characterizes the problem with only additive noise, to <inline-formula> <tex-math>$ \\left ({{ \\sigma _{n}^{4} / n }}\\right)^{\\frac {2\\beta }{2\\beta +1}} $ </tex-math></inline-formula> in the presence of both speckle and additive noise. 2) When <inline-formula> <tex-math>$ \\sigma _{n} = o(1) $ </tex-math></inline-formula>, the variance of the additive noise does not contribute to the risk in the de-speckling problem. This suggests that, in this regime, speckle noise is the primary bottleneck. Interestingly, the resulting risk rate matches the rate for mitigating purely additive noise with <inline-formula> <tex-math>$ \\sigma _{n} = \\Theta (1) $ </tex-math></inline-formula>. 3) When <inline-formula> <tex-math>$\\sigma _{n} = \\Theta (1)$ </tex-math></inline-formula>, the two rates coincide, suggesting that both the speckle noise and additive noise are contributing to the overall error.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 8","pages":"6353-6372"},"PeriodicalIF":2.9000,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Is Speckle Noise More Challenging to Mitigate Than Additive Noise?\",\"authors\":\"Reihaneh Malekian;Hao Xing;Arian Maleki\",\"doi\":\"10.1109/TIT.2025.3578430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 <inline-formula> <tex-math>$\\\\beta $ </tex-math></inline-formula>-Hölder continuous function and determining the rate of the minimax risk. Specifically, if <italic>n</i> represents the number of data points, <italic>f</i> denotes the underlying function to be estimated, <inline-formula> <tex-math>$\\\\hat {\\\\nu }_{n}$ </tex-math></inline-formula> is an estimate of <italic>f</i>, and <inline-formula> <tex-math>$\\\\sigma _{n}$ </tex-math></inline-formula> is the standard deviation of the additive Gaussian noise, then <inline-formula> <tex-math>$\\\\inf _{\\\\hat {\\\\nu }_{n}} \\\\sup _{f} \\\\mathbb {E}_{f}\\\\| \\\\hat {\\\\nu }_{n} {-} f \\\\|^{2}_{2}$ </tex-math></inline-formula> decays at the rate <inline-formula> <tex-math>$\\\\left ({{\\\\max (1,\\\\sigma _{n}^{4})/n}}\\\\right)^{\\\\frac {2\\\\beta }{2\\\\beta +1}}$ </tex-math></inline-formula>. Comparing this rate with the rate achieved under purely additive noise, namely <inline-formula> <tex-math>$\\\\left ({{\\\\sigma _{n}^{2}/n}}\\\\right)^{\\\\frac {2\\\\beta }{2\\\\beta +1}}$ </tex-math></inline-formula>, leads to the following insights: 1) When <inline-formula> <tex-math>$ \\\\sigma _{n} = \\\\omega (1) $ </tex-math></inline-formula>, the additive noise appears to be the dominant component in the de-speckling problem. However, the presence of speckle noise significantly complicates the task of mitigating its effects. As a result, the risk increases from the rate <inline-formula> <tex-math>$ \\\\left ({{ \\\\sigma _{n}^{2} / n }}\\\\right)^{\\\\frac {2\\\\beta }{2\\\\beta +1}} $ </tex-math></inline-formula>, which characterizes the problem with only additive noise, to <inline-formula> <tex-math>$ \\\\left ({{ \\\\sigma _{n}^{4} / n }}\\\\right)^{\\\\frac {2\\\\beta }{2\\\\beta +1}} $ </tex-math></inline-formula> in the presence of both speckle and additive noise. 2) When <inline-formula> <tex-math>$ \\\\sigma _{n} = o(1) $ </tex-math></inline-formula>, the variance of the additive noise does not contribute to the risk in the de-speckling problem. This suggests that, in this regime, speckle noise is the primary bottleneck. Interestingly, the resulting risk rate matches the rate for mitigating purely additive noise with <inline-formula> <tex-math>$ \\\\sigma _{n} = \\\\Theta (1) $ </tex-math></inline-formula>. 3) When <inline-formula> <tex-math>$\\\\sigma _{n} = \\\\Theta (1)$ </tex-math></inline-formula>, the two rates coincide, suggesting that both the speckle noise and additive noise are contributing to the overall error.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"71 8\",\"pages\":\"6353-6372\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2025-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11029299/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11029299/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Is Speckle Noise More Challenging to Mitigate Than Additive Noise?
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 $\beta $ -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 {\nu }_{n}$ is an estimate of f, and $\sigma _{n}$ is the standard deviation of the additive Gaussian noise, then $\inf _{\hat {\nu }_{n}} \sup _{f} \mathbb {E}_{f}\| \hat {\nu }_{n} {-} f \|^{2}_{2}$ decays at the rate $\left ({{\max (1,\sigma _{n}^{4})/n}}\right)^{\frac {2\beta }{2\beta +1}}$ . Comparing this rate with the rate achieved under purely additive noise, namely $\left ({{\sigma _{n}^{2}/n}}\right)^{\frac {2\beta }{2\beta +1}}$ , leads to the following insights: 1) When $ \sigma _{n} = \omega (1) $ , the additive noise appears to be the dominant component in the de-speckling problem. However, the presence of speckle noise significantly complicates the task of mitigating its effects. As a result, the risk increases from the rate $ \left ({{ \sigma _{n}^{2} / n }}\right)^{\frac {2\beta }{2\beta +1}} $ , which characterizes the problem with only additive noise, to $ \left ({{ \sigma _{n}^{4} / n }}\right)^{\frac {2\beta }{2\beta +1}} $ in the presence of both speckle and additive noise. 2) When $ \sigma _{n} = o(1) $ , the variance of the additive noise does not contribute to the risk in the de-speckling problem. This suggests that, in this regime, speckle noise is the primary bottleneck. Interestingly, the resulting risk rate matches the rate for mitigating purely additive noise with $ \sigma _{n} = \Theta (1) $ . 3) When $\sigma _{n} = \Theta (1)$ , the two rates coincide, suggesting that both the speckle noise and additive noise are contributing to the overall error.
期刊介绍:
The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.