7864691
A CURE for Noisy Magnetic Resonance Images: Chi-Square Unbiased Risk Estimation
In this paper, we derive an unbiased expression for the expected mean-squared error associated with continuously differentiable estimators of the noncentrality parameter of a chi-square random variable. We then consider the task of denoising squared-magnitude magnetic resonance (MR) image data, which are well modeled as independent noncentral chi-square random variables on two degrees of freedom. We consider two broad classes of linearly parameterized shrinkage estimators that can be optimized using our risk estimate, one in the general context of undecimated filterbank transforms, and the other in the specific case of the unnormalized Haar wavelet transform. The resultant algorithms are computationally tractable and improve upon most state-of-the-art methods for both simulated and actual MR image data.
44507394
Measurement of signal intensities in the presence of noise in MR images.
Power spectrum or magnitude images are frequently presented in magnetic resonance imaging. In such images, measurement of signal intensity at low signal levels is compounded with the noise. This report describes how to extract true intensity measurements in the presence of noise.
9825881
The rician distribution of noisy mri data
The image intensity in magnetic resonance magnitude images in the presence of noise is shown to be governed by a Rician distribution. Low signal intensities (SNR < 2) are therefore biased due to the noise. it is shown how the underlying noise can be estimated from the images and a simple correction scheme is provided to reduce the bias. the noise characteristics in phase images are also studied and shown to be very different from those of the magnitude images. Common to both, however, is that the noise distributions are nearly Gaussian for SNR larger than two.
10650720
A Nonlocal Maximum Likelihood Estimation Method for Rician Noise Reduction in MR Images
Postacquisition denoising of magnetic resonance (MR) images is of importance for clinical diagnosis and computerized analysis, such as tissue classification and segmentation. It has been shown that the noise in MR magnitude images follows a Rician distribution, which is signal-dependent when signal-to-noise ratio (SNR) is low. It is particularly difficult to remove the random fluctuations and bias introduced by Rician noise. The objective of this paper is to estimate the noise free signal from MR magnitude images. We model images as random fields and assume that pixels which have similar neighborhoods come from the same distribution. We propose a nonlocal maximum likelihood (NLML) estimation method for Rician noise reduction. Our method yields an optimal estimation result that is more accurate in recovering the true signal from Rician noise than NL means algorithm in the sense of SNR, contrast, and method error. We demonstrate that NLML performs better than the conventional local maximum likelihood (LML) estimation method in preserving and defining sharp tissue boundaries in terms of a well-defined sharpness metric while also having superior performance in method error.
11182238
Feature-Preserving MRI Denoising: A Nonparametric Empirical Bayes Approach
This paper presents a novel method for Bayesian denoising of magnetic resonance (MR) images that bootstraps itself by inferring the prior, i.e., the uncorrupted-image statistics, from the corrupted input data and the knowledge of the Rician noise model. The proposed method relies on principles from empirical Bayes (EB) estimation. It models the prior in a nonparametric Markov random field (MRF) framework and estimates this prior by optimizing an information-theoretic metric using the expectation-maximization algorithm. The generality and power of nonparametric modeling, coupled with the EB approach for prior estimation, avoids imposing ill-fitting prior models for denoising. The results demonstrate that, unlike typical denoising methods, the proposed method preserves most of the important features in brain MR images. Furthermore, this paper presents a novel Bayesian-inference algorithm on MRFs, namely iterated conditional entropy reduction (ICER). This paper also extends the application of the proposed method for denoising diffusion-weighted MR images. Validation results and quantitative comparisons with the state of the art in MR-image denoising clearly depict the advantages of the proposed method.
6623504
Noise estimation and removal in MR imaging: The variance-stabilization approach
We develop optimal forward and inverse variance-stabilizing transformations for the Rice distribution, in order to approach the problem of magnetic resonance (MR) image filtering by means of standard denoising algorithms designed for homoskedastic observations.
4683670
Restoration of DWI Data Using a Rician LMMSE Estimator
This paper introduces and analyzes a linear minimum mean square error (LMMSE) estimator using a Rician noise model and its recursive version (RLMMSE) for the restoration of diffusion weighted images. A method to estimate the noise level based on local estimations of mean or variance is used to automatically parametrize the estimator. The restoration performance is evaluated using quality indexes and compared to alternative estimation schemes. The overall scheme is simple, robust, fast, and improves estimations. Filtering diffusion weighted magnetic resonance imaging (DW-MRI) with the proposed methodology leads to more accurate tensor estimations. Real and synthetic datasets are analyzed.
7263571
Noise and Signal Estimation in Magnitude MRI and Rician Distributed Images: A LMMSE Approach
A new method for noise filtering in images that follow a Rician model-with particular attention to magnetic resonance imaging-is proposed. To that end, we have derived a (novel) closed-form solution of the linear minimum mean square error (LMMSE) estimator for this distribution. Additionally, a set of methods that automatically estimate the noise power are developed. These methods use information of the sample distribution of local statistics of the image, such as the local variance, the local mean, and the local mean square value. Accordingly, the dynamic estimation of noise leads to a recursive version of the LMMSE, which shows a good performance in both noise cleaning and feature preservation. This paper also includes the derivation of the probability density function of several local sample statistics for the Rayleigh and Rician model, upon which the estimators are built.
16606570
An Optimized Blockwise Non Local Means Denoising Filter for 3D Magnetic Resonance Images
A critical issue in image restoration is the problem of noise removal while keeping the integrity of relevant image information. Denoising is a crucial step to increase image quality and to improve the performance of all the tasks needed for quantitative imaging analysis. The method proposed in this paper is based on a 3D optimized blockwise version of the Non Local (NL) means filter [1]. The NL-means filter uses the redundancy of information in the image under study to remove the noise. The performance of the NL-means filter has been already demonstrated for 2D images, but reducing the computational burden is a critical aspect to extend the method to 3D images. To overcome this problem, we propose improvements to reduce the computational complexity. These different improvements allow to drastically divide the computational time while preserving the performances of the NL-means filter. A fully-automated and optimized version of the NL-means filter is then presented. Our contributions to the NL-means filter are: (a) an automatic tuning of the smoothing parameter, (b) a selection of the most relevant voxels, (c) a blockwise implementation and (d) a parallelized computation. Quantitative validation was carried out on synthetic datasets generated with BrainWeb [2]. The results show that our optimized NL-means filter outperforms the classical implementation of the NL-means filter, as well as two other classical denoising methods (Anisotropic Diffusion [3] and Total Variation minimization process [4]) in terms of accuracy (measured by the Peak Signal to Noise Ratio) with low computation time. Finally, qualitative results on real data are presented.
18390050
Denoising of Dynamic Contrast-Enhanced MR Images Using Dynamic Nonlocal Means
This paper presents a new algorithm for denoising dynamic contrast-enhanced (DCE) MR images. It is a novel variation on the nonlocal means (NLM) algorithm. The algorithm, called dynamic nonlocal means (DNLM), exploits the redundancy of information in the temporal sequence of images. Empirical evaluations of the performance of the DNLM algorithm relative to seven other denoising methods-simple Gaussian filtering, the original NLM algorithm, a trivial extension of NLM to include the temporal dimension, bilateral filtering, anisotropic diffusion filtering, wavelet adaptive multiscale products threshold, and traditional wavelet thresholding-are presented. The evaluations include quantitative evaluations using simulated data and real data (20 DCE-MRI data sets from routine clinical breast MRI examinations) as well as qualitative evaluations using the same real data (24 observers: 14 image/signal-processing specialists, 10 clinical breast MRI radiographers). The results of the quantitative evaluation using the simulated data show that the DNLM algorithm consistently yields the smallest MSE between the denoised image and its corresponding original noiseless version. The results of the quantitative evaluation using the real data provide evidence, at the ¿ = 0.05 level of significance, that the DNLM algorithm yields the smallest MSE between the denoised image and its corresponding original noiseless version. The results of the qualitative evaluation provide evidence, at the ¿ = 0.05 level of significance, that the DNLM algorithm performs visually better than all of the other algorithms. Collectively the qualitative and quantitative results suggest that the DNLM algorithm more effectively attenuates noise in DCE MR images than any of the other algorithms.
12475205
MRI denoising using Non-Local Means
Magnetic Resonance (MR) images are affected by random noise which limits the accuracy of any quantitative measurements from the data. In the present work, a recently proposed filter for random noise removal is analyzed and adapted to reduce this noise in MR magnitude images. This parametric filter, named Non-Local Means (NLM), is highly dependent on the setting of its parameters. The aim of this paper is to find the optimal parameter selection for MR magnitude image denoising. For this purpose, experiments have been conducted to find the optimum parameters for different noise levels. Besides, the filter has been adapted to fit with specific characteristics of the noise in MR image magnitude images (i.e. Rician noise). From the results over synthetic and real images we can conclude that this filter can be successfully used for automatic MR denoising.
37997080
An adaptive nonlocal means scheme for medical image denoising
Medical images often consist of low-contrast objects corrupted by random noise arising in the image acquisition process. Thus, image denoising is one of the fundamental tasks required by medical imaging analysis. In this work, we investigate an adaptive denoising scheme based on the nonlocal (NL)-means algorithm for medical imaging applications. In contrast with the traditional NL-means algorithm, the proposed adaptive NL-means (ANL-means) denoising scheme has three unique features. First, it employs the singular value decomposition (SVD) method and the K-means clustering (K-means) technique for robust classification of blocks in noisy images. Second, the local window is adaptively adjusted to match the local property of a block. Finally, a rotated block matching algorithm is adopted for better similarity matching. Experimental results from both additive white Gaussian noise (AWGN) and Rician noise are given to demonstrate the superior performance of the proposed ANL denoising technique over various image denoising benchmarks in term of both PSNR and perceptual quality comparison.
26608870
Filtering noise from images with wavelet transforms
A new method of filtering MR images is presented that uses wavelet transforms instead of Fourier transforms. The new filtering method does not reduce the sharpness of edges. However, the new method does eliminate any small structures that are similar in size to the noise eliminated. There are many possible extensions of the filter. © 1991 Academic Press, Inc.
16798253
Wavelet transform domain filters: a spatially selective noise filtration technique
Wavelet transforms are multiresolution decompositions that can be used to analyze signals and images. They describe a signal by the power at each scale and position. Edges can be located very effectively in the wavelet transform domain. A spatially selective noise filtration technique based on the direct spatial correlation of the wavelet transform at several adjacent scales is introduced. A high correlation is used to infer that there is a significant feature at the position that should be passed through the filter. The authors have tested the technique on simulated signals, phantom images, and real MR images. It is found that the technique can reduce noise contents in signals and images by more than 80% while maintaining at least 80% of the value of the gradient at most edges. The authors did not observe any Gibbs' ringing or significant resolution loss on the filtered images. Artifacts that arose from the filtration are very small and local. The noise filtration technique is quite robust. There are many possible extensions of the technique. The authors see its applications in spatially dependent noise filtration, edge detection and enhancement, image restoration, and motion artifact removal. They have compared the performance of the technique to that of the Weiner filter and found it to be superior.
17029533
Wavelet-based Rician noise removal for magnetic resonance imaging
It is well known that magnetic resonance magnitude image data obey a Rician distribution. Unlike additive Gaussian noise, Rician "noise" is signal-dependent, and separating signal from noise is a difficult task. Rician noise is especially problematic in low signal-to-noise ratio (SNR) regimes where it not only causes random fluctuations, but also introduces a signal-dependent bias to the data that reduces image contrast. This paper studies wavelet-domain filtering methods for Rician noise removal. We present a novel wavelet-domain filter that adapts to variations in both the signal and the noise.
14352579
A versatile wavelet domain noise filtration technique for medical imaging
We propose a robust wavelet domain method for noise filtering in medical images. The proposed method adapts itself to various types of image noise as well as to the preference of the medical expert; a single parameter can be used to balance the preservation of (expert-dependent) relevant details against the degree of noise reduction. The algorithm exploits generally valid knowledge about the correlation of significant image features across the resolution scales to perform a preliminary coefficient classification. This preliminary coefficient classification is used to empirically estimate the statistical distributions of the coefficients that represent useful image features on the one hand and mainly noise on the other. The adaptation to the spatial context in the image is achieved by using a wavelet domain indicator of the local spatial activity. The proposed method is of low complexity, both in its implementation and execution time. The results demonstrate its usefulness for noise suppression in medical ultrasound and magnetic resonance imaging. In these applications, the proposed method clearly outperforms single-resolution spatially adaptive algorithms, in terms of quantitative performance measures as well as in terms of visual quality of the images.
548723
Noise Reduction for Magnetic Resonance Images via Adaptive Multiscale Products Thresholding
Edge-preserving denoising is of great interest in medical image processing. This paper presents a wavelet-based multiscale products thresholding scheme for noise suppression of magnetic resonance images. A Canny edge detector-like dyadic wavelet transform is employed. This results in the significant features in images evolving with high magnitude across wavelet scales, while noise decays rapidly. To exploit the wavelet interscale dependencies we multiply the adjacent wavelet subbands to enhance edge structures while weakening noise. In the multiscale products, edges can be effectively distinguished from noise. Thereafter, an adaptive threshold is calculated and imposed on the products, instead of on the wavelet coefficients, to identify important features. Experiments show that the proposed scheme better suppresses noise and preserves edges than other wavelet-thresholding denoising methods.
11637816
A New SURE Approach to Image Denoising: Interscale Orthonormal Wavelet Thresholding
This paper introduces a new approach to orthonormal wavelet image denoising. Instead of postulating a statistical model for the wavelet coefficients, we directly parametrize the denoising process as a sum of elementary nonlinear processes with unknown weights. We then minimize an estimate of the mean square error between the clean image and the denoised one. The key point is that we have at our disposal a very accurate, statistically unbiased, MSE estimate-Stein's unbiased risk estimate-that depends on the noisy image alone, not on the clean one. Like the MSE, this estimate is quadratic in the unknown weights, and its minimization amounts to solving a linear system of equations. The existence of this a priori estimate makes it unnecessary to devise a specific statistical model for the wavelet coefficients. Instead, and contrary to the custom in the literature, these coefficients are not considered random any more. We describe an interscale orthonormal wavelet thresholding algorithm based on this new approach and show its near-optimal performance-both regarding quality and CPU requirement-by comparing it with the results of three state-of-the-art nonredundant denoising algorithms on a large set of test images. An interesting fallout of this study is the development of a new, group-delay-based, parent-child prediction in a wavelet dyadic tree
2221107
The SURE-LET Approach to Image Denoising
We propose a new approach to image denoising, based on the image-domain minimization of an estimate of the mean squared error-Stein's unbiased risk estimate (SURE). Unlike most existing denoising algorithms, using the SURE makes it needless to hypothesize a statistical model for the noiseless image. A key point of our approach is that, although the (nonlinear) processing is performed in a transformed domain-typically, an undecimated discrete wavelet transform, but we also address nonorthonormal transforms-this minimization is performed in the image domain. Indeed, we demonstrate that, when the transform is a ldquotightrdquo frame (an undecimated wavelet transform using orthonormal filters), separate subband minimization yields substantially worse results. In order for our approach to be viable, we add another principle, that the denoising process can be expressed as a linear combination of elementary denoising processes-linear expansion of thresholds (LET). Armed with the SURE and LET principles, we show that a denoising algorithm merely amounts to solving a linear system of equations which is obviously fast and efficient. Quite remarkably, the very competitive results obtained by performing a simple threshold (image-domain SURE optimized) on the undecimated Haar wavelet coefficients show that the SURE-LET principle has a huge potential.
236129
Chi-square unbiased risk estimate for denoising magnitude MR images
In this article we develop Stein-type results for unbiased estimation of the risk associated with parametric estimators of the noncentrality parameter of chi-squared random variables on two degrees of freedom. These results allow for estimator adaptivity, and thus can be used to optimize the parameters of a broad class of typical denoising functions, subject only to weak smoothness assumptions. We show how to apply these results to the problem of enhancing magnitude magnetic resonance images, which are known to be corrupted by Rician noise. As an example, we propose a transform-domain point-wise estimator based on linear expansion of thresholds. Finally, we apply this estimator to synthetic and real image data in conjunction with the undecimated Haar wavelet transform, and conclude that it is able to outperform previous wavelet-based techniques and compares favorably with a more recent approach based on non-local means.
16806403
Translation-Invariant De-Noising
De-Noising with the traditional (orthogonal, maximally-decimated) wavelet transform sometimes exhibits visual artifacts; we attribute some of these—for example, Gibbs phenomena in the neighborhood of discontinuities—to the lack of translation invariance of the wavelet basis. One method to suppress such artifacts, termed “cycle spinning” by Coifman, is to “average out” the translation dependence. For a range of shifts, one shifts the data (right or left as the case may be), De-Noises the shifted data, and then unshifts the de-noised data. Doing this for each of a range of shifts, and averaging the several results so obtained, produces a reconstruction subject to far weaker Gibbs phenomena than thresholding based De-Noising using the traditional orthogonal wavelet transform.
9403574
Image Denoising in Mixed Poisson–Gaussian Noise
We propose a general methodology (PURE-LET) to design and optimize a wide class of transform-domain thresholding algorithms for denoising images corrupted by mixed Poisson-Gaussian noise. We express the denoising process as a linear expansion of thresholds (LET) that we optimize by relying on a purely data-adaptive unbiased estimate of the mean-squared error (MSE), derived in a non-Bayesian framework (PURE: Poisson-Gaussian unbiased risk estimate). We provide a practical approximation of this theoretical MSE estimate for the tractable optimization of arbitrary transform-domain thresholding. We then propose a pointwise estimator for undecimated filterbank transforms, which consists of subband-adaptive thresholding functions with signal-dependent thresholds that are globally optimized in the image domain. We finally demonstrate the potential of the proposed approach through extensive comparisons with state-of-the-art techniques that are specifically tailored to the estimation of Poisson intensities. We also present denoising results obtained on real images of low-count fluorescence microscopy.
124660839
THE NON-CENTRAL χ2- AND F-DISTRIBUTIONS AND THEIR APPLICATIONS
In the Neyman-Pearson theory of testing statistical hypotheses, the efficiency of a statistical test is to be judged by its power of detecting departures from the null hypothesis. Thus besides knowing the random sampling distribution of a given statistic T under this hypothesis, say Ho, it is also necessary to know the distribution of T under admissible hypotheses alternative to Ho. Hence the power function of the test is obtained. In the case of the wellknown tests using X2, t and F, the evaluation of their power functions involves the use of what have been called non-central distributions. For example, if we are applying the t-test to examine if a sample has come from a normal population with mean # = 0(HO), we know that under Ho, t has a 5 % chance of exceeding the 5 % point of its distribution. But in order to compute the power of the test we wish to know the chance that t exceeds this point when M has alternative values, not equal to zero. This chance is given by the non-central t-integral. This distribution has been studied by Fisher (1931), Neyman (1935), Neyman & Tokarska (1936) and Johnson & Welch (1939). In a similar way, the non-central X2and F-distributions arise in consideration of the power functions of the X2and variance-ratio tests. The power function may be used either to determine the extent of the departures from Ho in a given direction, which will be detected as significant (at a prescribed level) with a given probability, or it may be used to determine in advance the size of experiment necessary to ensure that a worth-while difference will be established as significant, if it exists. But apart from its value in this connexion, the study of non-central distributions is of considerable interest. The mathematical forms of these distributions of t, x2 and F have been long known, but their use without extensive tabling has not been easy. The present paper is therefore concerned with two lines of investigation: (a) The derivation of certain approximations to the probability integrals of (i) non-central X2, and (ii) the ratio of non-central X2 to an independent central X2, which we have termed noncentral F. These approximations, depending on tabled functions, permit easy calculation. (b) Discussion of the ways in which these distributions may be used in connexion with the power functions of statistical tests.
149055
De-noising by soft-thresholding
Donoho and Johnstone (1994) proposed a method for reconstructing an unknown function f on [0,1] from noisy data d/sub i/=f(t/sub i/)+/spl sigma/z/sub i/, i=0, ..., n-1,t/sub i/=i/n, where the z/sub i/ are independent and identically distributed standard Gaussian random variables. The reconstruction f/spl circ/*/sub n/ is defined in the wavelet domain by translating all the empirical wavelet coefficients of d toward 0 by an amount /spl sigma//spl middot//spl radic/(2log (n)/n). The authors prove two results about this type of estimator. [Smooth]: with high probability f/spl circ/*/sub n/ is at least as smooth as f, in any of a wide variety of smoothness measures. [Adapt]: the estimator comes nearly as close in mean square to f as any measurable estimator can come, uniformly over balls in each of two broad scales of smoothness classes. These two properties are unprecedented in several ways. The present proof of these results develops new facts about abstract statistical inference and its connection with an optimal recovery model. >
8872792
Wavelet-based Poisson rate estimation using the Skellam distribution
Owing to the stochastic nature of discrete processes such as photon counts in imaging, real-world data measurements often exhibit heteroscedastic behavior. In particular, time series components and other measurements may frequently be assumed to be non-iid Poisson random variables, whose rate parameter is proportional to the underlying signal of interest-witness literature in digital communications, signal processing, astronomy, and magnetic resonance imaging applications. In this work, we show that certain wavelet and filterbank transform coefficients corresponding to vector-valued measurements of this type are distributed as sums and differences of independent Poisson counts, taking the so-called Skellam distribution. While exact estimates rarely admit analytical forms, we present Skellam mean estimators under both frequentist and Bayes models, as well as computationally efficient approximations and shrinkage rules, that may be interpreted as Poisson rate estimation method performed in certain wavelet/filterbank transform domains. This indicates a promising potential approach for denoising of Poisson counts in the above-mentioned applications.
7222723
Fast interscale wavelet denoising of Poisson-corrupted images
We present a fast algorithm for image restoration in the presence of Poisson noise. Our approach is based on (1) the minimization of an unbiased estimate of the MSE for Poisson noise, (2) a linear parametrization of the denoising process and (3) the preservation of Poisson statistics across scales within the Haar DWT. The minimization of the MSE estimate is performed independently in each wavelet subband, but this is equivalent to a global image-domain MSE minimization, thanks to the orthogonality of Haar wavelets. This is an important difference with standard Poisson noise-removal methods, in particular those that rely on a non-linear preprocessing of the data to stabilize the variance. Our non-redundant interscale wavelet thresholding outperforms standard variance-stabilizing schemes, even when the latter are applied in a translation-invariant setting (cycle-spinning). It also achieves a quality similar to a state-of-the-art multiscale method that was specially developed for Poisson data. Considering that the computational complexity of our method is orders of magnitude lower, it is a very competitive alternative. The proposed approach is particularly promising in the context of low signal intensities and/or large data sets. This is illustrated experimentally with the denoising of low-count fluorescence micrographs of a biological sample.
11995267
Adapting to Unknown Smoothness via Wavelet Shrinkage
Abstract We attempt to recover a function of unknown smoothness from noisy sampled data. We introduce a procedure, SureShrink, that suppresses noise by thresholding the empirical wavelet coefficients. The thresholding is adaptive: A threshold level is assigned to each dyadic resolution level by the principle of minimizing the Stein unbiased estimate of risk (Sure) for threshold estimates. The computational effort of the overall procedure is order N · log(N) as a function of the sample size N. SureShrink is smoothness adaptive: If the unknown function contains jumps, then the reconstruction (essentially) does also; if the unknown function has a smooth piece, then the reconstruction is (essentially) as smooth as the mother wavelet will allow. The procedure is in a sense optimally smoothness adaptive: It is near minimax simultaneously over a whole interval of the Besov scale; the size of this interval depends on the choice of mother wavelet. We know from a previous paper by the authors that traditional smoot...
25386929
Spatially adaptive wavelet thresholding with context modeling for image denoising
The method of wavelet thresholding for removing noise, or denoising, has been researched extensively due to its effectiveness and simplicity. Much of the literature has focused on developing the best uniform threshold or best basis selection. However, not much has been done to make the threshold values adaptive to the spatially changing statistics of images. Such adaptivity can improve the wavelet thresholding performance because it allows additional local information of the image (such as the identification of smooth or edge regions) to be incorporated into the algorithm. This work proposes a spatially adaptive wavelet thresholding method based on context modeling, a common technique used in image compression to adapt the coder to changing image characteristics. Each wavelet coefficient is modeled as a random variable of a generalized Gaussian distribution with an unknown parameter. Context modeling is used to estimate the parameter for each coefficient, which is then used to adapt the thresholding strategy. This spatially adaptive thresholding is extended to the overcomplete wavelet expansion, which yields better results than the orthogonal transform. Experimental results show that spatially adaptive wavelet thresholding yields significantly superior image quality and lower MSE than the best uniform thresholding with the original image assumed known.
207761262
Image quality assessment: from error visibility to structural similarity
Objective methods for assessing perceptual image quality traditionally attempted to quantify the visibility of errors (differences) between a distorted image and a reference image using a variety of known properties of the human visual system. Under the assumption that human visual perception is highly adapted for extracting structural information from a scene, we introduce an alternative complementary framework for quality assessment based on the degradation of structural information. As a specific example of this concept, we develop a structural similarity index and demonstrate its promise through a set of intuitive examples, as well as comparison to both subjective ratings and state-of-the-art objective methods on a database of images compressed with JPEG and JPEG2000. A MATLAB implementation of the proposed algorithm is available online at http://www.cns.nyu.edu//spl sim/lcv/ssim/.
14400709
Automatic estimation of the noise variance from the histogram of a magnetic resonance image.
Estimation of the noise variance of a magnetic resonance (MR) image is important for various post-processing tasks. In the literature, various methods for noise variance estimation from MR images are available, most of which however require user interaction and/or multiple (perfectly aligned) images. In this paper, we focus on automatic histogram-based noise variance estimation techniques. Previously described methods are reviewed and a new method based on the maximum likelihood (ML) principle is presented. Using Monte Carlo simulation experiments as well as experimental MR data sets, the noise variance estimation methods are compared in terms of the root mean squared error (RMSE). The results show that the newly proposed method is superior in terms of the RMSE.
5827025
Noise measurement from magnitude MRI using local estimates of variance and skewness.
In this note, we address the estimation of the noise level in magnitude magnetic resonance (MR) images in the absence of background data. Most of the methods proposed earlier exploit the Rayleigh distributed background region in MR images to estimate the noise level. These methods, however, cannot be used for images where no background information is available. In this note, we propose two different approaches for noise level estimation in the absence of the image background. The first method is based on the local estimation of the noise variance using maximum likelihood estimation and the second method is based on the local estimation of the skewness of the magnitude data distribution. Experimental results on synthetic and real MR image datasets show that the proposed estimators accurately estimate the noise level in a magnitude MR image, even without background data.
1912619
K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation
In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signal-atoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many and include compression, regularization in inverse problems, feature extraction, and more. Recent activity in this field concentrated mainly on the study of pursuit algorithms that decompose signals with respect to a given dictionary. Designing dictionaries to better fit the above model can be done by either selecting one from a pre-specified set of linear transforms, or by adapting the dictionary to a set of training signals. Both these techniques have been considered, but this topic is largely still open. In this paper we propose a novel algorithm for adapting dictionaries in order to achieve sparse signal representations. Given a set of training signals, we seek the dictionary that leads to the best representation for each member in this set, under strict sparsity constraints. We present a new method – the K-SVD algorithm – generalizing the K-Means clustering process. K-SVD is an iterative method that alternates between sparse coding of the examples based on the current dictionary, and a process of updating the dictionary atoms to better fit the data. The update of the dictionary columns is combined with an update of the sparse representations, thereby accelerating convergence. The K-SVD algorithm is flexible and can work with any pursuit method (e.g., basis pursuit, FOCUSS, or matching pursuit). We analyze this algorithm and demonstrate its results on both synthetic tests and in applications on real image data.