Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1207.6323

Adaptive Bayesian Denoising for General Gaussian Distributed (GGD) Signals in Wavelet Domain

Masoud Hashemi·Soosan Beheshti
View original source ↗Read source document ↗Export metadata ↓

Abstract

Optimum Bayes estimator for General Gaussian Distributed (GGD) data in wavelet is provided. The GGD distribution describes a wide class of signals including natural images. A wavelet thresholding method for image denoising is proposed. Interestingly, we show that the Bayes estimator for this class of signals is well estimated by a thresholding approach. This result analytically confirms the importance of thresholding for noisy GGD signals. We provide the optimum soft thresholding value that mimics the behavior of the Bayes estimator and minimizes the resulting error. The value of the threshold in BayesShrink, which is one of the most used and efficient soft thresholding methods, has been provided heuristically in the literature. Our proposed method, denoted by Rigorous BayesShrink (R-BayesShrink), explains the theory of BayesShrink threshold and proves its optimality for a subclass of GDD signals. R-BayesShrink improves and generalizes the existing BayesShrink for the class of GGD signals. While the BayesShrink threshold is independent from the wavelet coefficient distribution and is just a function of noise and noiseless signal variance, our method adapts to the distribution of wavelet coefficients of each scale. It is shown that BayesShrink is a special case of our method when shape parameter in GGD is one or signal follows Laplace distribution. Our simulation results confirm the optimality of R-BayesShrink in GGD denoising with regards to Peak Signal to Noise Ratio (PSNR) and Structural Similarity (SSIM) index.

Explore related subjects

stat.ME

Keep this discovery

BibTeXRIS

Masoud Hashemi, Soosan Beheshti. 2012-07-26. Adaptive Bayesian Denoising for General Gaussian Distributed (GGD) Signals in Wavelet Domain. https://arxiv.org/abs/1207.6323

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Surprise Reduction and Nullification in Bayesian and Inverse Bayesian Inference under Ambiguous Prediction-Error Attribution

In non-stationary environments, prediction errors may signal environmental change or transient outliers, and adaptive systems must track such changes without overreacting to outliers. We distinguish surprise reduction, which updates beliefs to fit observations, from surprise nullification, which weakens constraints imposed by the predictive structure, and formalize both within Bayesian and inverse Bayesian (BIB) inference. Belief and likelihood updates are derived from variational objectives sharing a nullification strength, determined endogenously by minimizing surprise under the candidate post-update predictive distribution. In the Gaussian case, nullification expands belief and likelihood variances by a common factor relative to standard Bayesian updating, leaving the ratio unchanged. BIB thus defers attribution of the prediction error, committing to neither latent-state change nor observation-process uncertainty. The nullification strength is carried over as a candidate and is maintained or released according to the predictive surprise of the next observation. In a mean estimation task with outliers and changepoints, no scanned parameter setting of a Sage-Husa-type adaptive Kalman filter, fixed-strength BIB variant, or belief-forgetting-only variant outperforms BIB in both changepoint tracking and post-outlier stability. An oracle-informed reduced Bayesian model tracks changepoints better but is less stable after outliers. Although BIB maintains no explicit hypotheses about changepoints or outliers, it generates event-dependent dynamics. The learning rate increases after changepoints, whereas after outliers, nullification is released, and this increase is suppressed. Deferring attribution and letting subsequent observations differentiate the responses may constitute a principle of adaptive inference in non-stationary environments.

stat.ME↗
arXiv2026

Generalized Ridge Refitting for the Lasso and Prediction Improvement Bounds

We study a class of Lasso based estimators obtained by applying a quadratic correction on the Lasso equicorrelation set. The penalty matrix determines both the magnitude and geometry of the correction and contains, among other cases, the isotropic Lasso--Ridge correction, least squares refitting, Gram proportional interpolation between the Lasso and least squares, and coordinate specific penalties. We first derive a closed form representation and isolate the positive gain component of the resulting prediction improvement. We then control the remaining stochastic linear term in expectation by localizing the random signed equicorrelation model around a deterministic reference support. This yields a finite sample expectation bound that explicitly accounts for the randomness induced by Lasso model selection. The resulting decomposition provides a unified framework for understanding when Lasso based quadratic corrections can improve prediction.

stat.ME↗
arXiv2026

Discretization in covariate-adaptive randomization: gains and losses

Covariate-adaptive randomization(CAR) is widely implemented in clinical trials to balance prognostic covariates across treatment arms. Continuous covariates are often discretized into strata in practice, yet their consequences are not clearly understood. This paper provides a comprehensive study of the impact of discretization on both the CAR design process and the inferential results thereafter. We establish the asymptotic properties of both imbalance measures and treatment effect estimators under discretized and non-discretized settings. Practical recommendations are given on when and how discretization should be employed. We show that discretization in design is generally recommended, as it enhances robustness against model misspecification. However, if the true model is known, the most efficient strategy is to balance covariates according to that model in the design. The theoretical results are corroborated by extensive simulation studies and an empirical application to a diabetes trial dataset. Together, the results clarify the gains and losses of discretization in CAR and pave the way for learning impact of discretization to other designs and beyond.

stat.ME↗