Wavelet thresholding for some classes of non–Gaussian noise

Application of Compressive Sensing to Ultrasound Images: A Review

Compressive sensing (CS) offers compression of data below the Nyquist rate, making it an attractive solution in the field of medical imaging, and has been extensively used for ultrasound (US) compression and sparse recovery. In practice, CS offers a reduction in data sensing, transmission, and storage. Compressive sensing relies on the sparsity of data; i.e., data should be sparse in original or in some transformed domain. A look at the literature reveals that rich variety of algorithms have been suggested to recover data using compressive sensing from far fewer samples accurately, but with tradeoffs for efficiency. This paper reviews a number of significant CS algorithms used to recover US images from the undersampled data along with the discussion of CS in 3D US images. In this paper, sparse recovery algorithms applied to US are classified in five groups. Algorithms in each group are discussed and summarized based on their unique technique, compression ratio, sparsifying transform, 3D ultrasound, and deep learning. Research gaps and future directions are also discussed in the conclusion of this paper. This study is aimed to be beneficial for young researchers intending to work in the area of CS and its applications, specifically to US.

A bit allocation method for sparse source coding

In this paper, we develop an efficient bit allocation strategy for subband-based image coding systems. More specifically, our objective is to design a new optimization algorithm based on a rate-distortion optimality criterion. To this end, we consider the uniform scalar quantization of a class of mixed distributed sources following a Bernoulli-generalized Gaussian distribution. This model appears to be particularly well-adapted for image data, which have a sparse representation in a wavelet basis. In this paper, we propose new approximations of the entropy and the distortion functions using piecewise affine and exponential forms, respectively. Because of these approximations, bit allocation is reformulated as a convex optimization problem. Solving the resulting problem allows us to derive the optimal quantization step for each subband. Experimental results show the benefits that can be drawn from the proposed bit allocation method in a typical transform-based coding application.

Iterative PET Image Reconstruction Using Translation Invariant Wavelet Transform

The present work describes a Bayesian maximum a posteriori (MAP) method using a statistical multiscale wavelet prior model. Rather than using the orthogonal discrete wavelet transform (DWT), this prior is built on the translation invariant wavelet transform (TIWT). The statistical modeling of wavelet coefficients relies on the generalized Gaussian distribution. Image reconstruction is performed in spatial domain with a fast block sequential iteration algorithm. We study theoretically the TIWT MAP method by analyzing the Hessian of the prior function to provide some insights on noise and resolution properties of image reconstruction. We adapt the key concept of local shift invariance and explore how the TIWT MAP algorithm behaves with different scales. It is also shown that larger support wavelet filters do not offer better performance in contrast recovery studies. These theoretical developments are confirmed through simulation studies. The results show that the proposed method is more attractive than other MAP methods using either the conventional Gibbs prior or the DWT-based wavelet prior.

Hidden Markov models for wavelet-based blind source separation

In this paper, we consider the problem of blind source separation in the wavelet domain. We propose a Bayesian estimation framework for the problem where different models of the wavelet coefficients are considered: the independent Gaussian mixture model, the hidden Markov tree model, and the contextual hidden Markov field model. For each of the three models, we give expressions of the posterior laws and propose appropriate Markov chain Monte Carlo algorithms in order to perform unsupervised joint blind separation of the sources and estimation of the mixing matrix and hyper parameters of the problem. Indeed, in order to achieve an efficient joint separation and denoising procedures in the case of high noise level in the data, a slight modification of the exposed models is presented: the Bernoulli-Gaussian mixture model, which is equivalent to a hard thresholding rule in denoising problems. A number of simulations are presented in order to highlight the performances of the aforementioned approach: 1) in both high and low signal-to-noise ratios and 2) comparing the results with respect to the choice of the wavelet basis decomposition.

Building robust wavelet estimators for multicomponent images using Stein's principle

Multichannel imaging systems provide several observations of the same scene which are often corrupted by noise. In this paper, we are interested in multispectral image denoising in the wavelet domain. We adopt a multivariate statistical approach in order to exploit the correlations existing between the different spectral components. Our main contribution is the application of Stein's principle to build a new estimator for arbitrary multichannel images embedded in additive Gaussian noise. Simulation tests carried out on optical satellite images show that the proposed method outperforms conventional wavelet shrinkage techniques.