2,658 research outputs found
Monte Carlo-based Noise Compensation in Coil Intensity Corrected Endorectal MRI
Background: Prostate cancer is one of the most common forms of cancer found
in males making early diagnosis important. Magnetic resonance imaging (MRI) has
been useful in visualizing and localizing tumor candidates and with the use of
endorectal coils (ERC), the signal-to-noise ratio (SNR) can be improved. The
coils introduce intensity inhomogeneities and the surface coil intensity
correction built into MRI scanners is used to reduce these inhomogeneities.
However, the correction typically performed at the MRI scanner level leads to
noise amplification and noise level variations. Methods: In this study, we
introduce a new Monte Carlo-based noise compensation approach for coil
intensity corrected endorectal MRI which allows for effective noise
compensation and preservation of details within the prostate. The approach
accounts for the ERC SNR profile via a spatially-adaptive noise model for
correcting non-stationary noise variations. Such a method is useful
particularly for improving the image quality of coil intensity corrected
endorectal MRI data performed at the MRI scanner level and when the original
raw data is not available. Results: SNR and contrast-to-noise ratio (CNR)
analysis in patient experiments demonstrate an average improvement of 11.7 dB
and 11.2 dB respectively over uncorrected endorectal MRI, and provides strong
performance when compared to existing approaches. Conclusions: A new noise
compensation method was developed for the purpose of improving the quality of
coil intensity corrected endorectal MRI data performed at the MRI scanner
level. We illustrate that promising noise compensation performance can be
achieved for the proposed approach, which is particularly important for
processing coil intensity corrected endorectal MRI data performed at the MRI
scanner level and when the original raw data is not available.Comment: 23 page
Off-the-Grid Line Spectrum Denoising and Estimation with Multiple Measurement Vectors
Compressed Sensing suggests that the required number of samples for
reconstructing a signal can be greatly reduced if it is sparse in a known
discrete basis, yet many real-world signals are sparse in a continuous
dictionary. One example is the spectrally-sparse signal, which is composed of a
small number of spectral atoms with arbitrary frequencies on the unit interval.
In this paper we study the problem of line spectrum denoising and estimation
with an ensemble of spectrally-sparse signals composed of the same set of
continuous-valued frequencies from their partial and noisy observations. Two
approaches are developed based on atomic norm minimization and structured
covariance estimation, both of which can be solved efficiently via semidefinite
programming. The first approach aims to estimate and denoise the set of signals
from their partial and noisy observations via atomic norm minimization, and
recover the frequencies via examining the dual polynomial of the convex
program. We characterize the optimality condition of the proposed algorithm and
derive the expected convergence rate for denoising, demonstrating the benefit
of including multiple measurement vectors. The second approach aims to recover
the population covariance matrix from the partially observed sample covariance
matrix by motivating its low-rank Toeplitz structure without recovering the
signal ensemble. Performance guarantee is derived with a finite number of
measurement vectors. The frequencies can be recovered via conventional spectrum
estimation methods such as MUSIC from the estimated covariance matrix. Finally,
numerical examples are provided to validate the favorable performance of the
proposed algorithms, with comparisons against several existing approaches.Comment: 14 pages, 10 figure
Hierarchical Bayesian sparse image reconstruction with application to MRFM
This paper presents a hierarchical Bayesian model to reconstruct sparse
images when the observations are obtained from linear transformations and
corrupted by an additive white Gaussian noise. Our hierarchical Bayes model is
well suited to such naturally sparse image applications as it seamlessly
accounts for properties such as sparsity and positivity of the image via
appropriate Bayes priors. We propose a prior that is based on a weighted
mixture of a positive exponential distribution and a mass at zero. The prior
has hyperparameters that are tuned automatically by marginalization over the
hierarchical Bayesian model. To overcome the complexity of the posterior
distribution, a Gibbs sampling strategy is proposed. The Gibbs samples can be
used to estimate the image to be recovered, e.g. by maximizing the estimated
posterior distribution. In our fully Bayesian approach the posteriors of all
the parameters are available. Thus our algorithm provides more information than
other previously proposed sparse reconstruction methods that only give a point
estimate. The performance of our hierarchical Bayesian sparse reconstruction
method is illustrated on synthetic and real data collected from a tobacco virus
sample using a prototype MRFM instrument.Comment: v2: final version; IEEE Trans. Image Processing, 200
- âŠ