897 research outputs found
Uniform Penalty inversion of two-dimensional NMR Relaxation data
The inversion of two-dimensional NMR data is an ill-posed problem related to
the numerical computation of the inverse Laplace transform. In this paper we
present the 2DUPEN algorithm that extends the Uniform Penalty (UPEN) algorithm
[Borgia, Brown, Fantazzini, {\em Journal of Magnetic Resonance}, 1998] to
two-dimensional data. The UPEN algorithm, defined for the inversion of
one-dimensional NMR relaxation data, uses Tikhonov-like regularization and
optionally non-negativity constraints in order to implement locally adapted
regularization. In this paper, we analyze the regularization properties of this
approach. Moreover, we extend the one-dimensional UPEN algorithm to the
two-dimensional case and present an efficient implementation based on the
Newton Projection method. Without any a-priori information on the noise norm,
2DUPEN automatically computes the locally adapted regularization parameters and
the distribution of the unknown NMR parameters by using variable smoothing.
Results of numerical experiments on simulated and real data are presented in
order to illustrate the potential of the proposed method in reconstructing
peaks and flat regions with the same accuracy
Rapid deconvolution of low-resolution time-of-flight data using Bayesian inference
The deconvolution of low-resolution time-of-flight data has numerous advantages, including the ability to extract additional information from the experimental data. We augment the well-known Lucy-Richardson deconvolution algorithm using various Bayesian prior distributions and show that a prior of second-differences of the signal outperforms the standard Lucy-Richardson algorithm, accelerating the rate of convergence by more than a factor of four, while preserving the peak amplitude ratios of a similar fraction of the total peaks. A novel stopping criterion and boosting mechanism are implemented to ensure that these methods converge to a similar final entropy and local minima are avoided. Improvement by a factor of two in mass resolution allows more accurate quantification of the spectra. The general method is demonstrated in this paper through the deconvolution of fragmentation peaks of the 2,5-dihydroxybenzoic acid matrix and the benzyltriphenylphosphonium thermometer ion, following femtosecond ultraviolet laser desorption
Deconvolution of confocal microscopy images using proximal iteration and sparse representations
We propose a deconvolution algorithm for images blurred and degraded by a
Poisson noise. The algorithm uses a fast proximal backward-forward splitting
iteration. This iteration minimizes an energy which combines a
\textit{non-linear} data fidelity term, adapted to Poisson noise, and a
non-smooth sparsity-promoting regularization (e.g -norm) over the image
representation coefficients in some dictionary of transforms (e.g. wavelets,
curvelets). Our results on simulated microscopy images of neurons and cells are
confronted to some state-of-the-art algorithms. They show that our approach is
very competitive, and as expected, the importance of the non-linearity due to
Poisson noise is more salient at low and medium intensities. Finally an
experiment on real fluorescent confocal microscopy data is reported
Comparison of Computational Methods Developed to Address Depth-variant Imaging in Fluorescence Microscopy
In three-dimensional fluorescence microscopy, the image formation process is inherently depth variant (DV) due to the refractive index mismatch between imaging layers, which causes depth-induced spherical aberration (SA). In this study, we present a quantitative comparison among different image restoration techniques developed based on a DV imaging model for microscopy in order to assess their ability to correct SA and their impact on restoration. The imaging models approximate DV imaging by either stratifying the object space or image space. For the reconstruction purpose, we used regularized DV algorithms with object stratification method such as the Expectation Maximization (EM), Conjugate Gradient; Principal Component Analysis based expectation maximization (PCA-EM), and Inverse filtering (IF). Reconstructions from simulated data and measured data show that better restoration results are achieved with the DV PCA-EM method than the other DV algorithms in terms of execution time and restoration quality of the image
Exploiting Structural Complexity for Robust and Rapid Hyperspectral Imaging
This paper presents several strategies for spectral de-noising of
hyperspectral images and hypercube reconstruction from a limited number of
tomographic measurements. In particular we show that the non-noisy spectral
data, when stacked across the spectral dimension, exhibits low-rank. On the
other hand, under the same representation, the spectral noise exhibits a banded
structure. Motivated by this we show that the de-noised spectral data and the
unknown spectral noise and the respective bands can be simultaneously estimated
through the use of a low-rank and simultaneous sparse minimization operation
without prior knowledge of the noisy bands. This result is novel for for
hyperspectral imaging applications. In addition, we show that imaging for the
Computed Tomography Imaging Systems (CTIS) can be improved under limited angle
tomography by using low-rank penalization. For both of these cases we exploit
the recent results in the theory of low-rank matrix completion using nuclear
norm minimization
A parametric level-set method for partially discrete tomography
This paper introduces a parametric level-set method for tomographic
reconstruction of partially discrete images. Such images consist of a
continuously varying background and an anomaly with a constant (known)
grey-value. We represent the geometry of the anomaly using a level-set
function, which we represent using radial basis functions. We pose the
reconstruction problem as a bi-level optimization problem in terms of the
background and coefficients for the level-set function. To constrain the
background reconstruction we impose smoothness through Tikhonov regularization.
The bi-level optimization problem is solved in an alternating fashion; in each
iteration we first reconstruct the background and consequently update the
level-set function. We test our method on numerical phantoms and show that we
can successfully reconstruct the geometry of the anomaly, even from limited
data. On these phantoms, our method outperforms Total Variation reconstruction,
DART and P-DART.Comment: Paper submitted to 20th International Conference on Discrete Geometry
for Computer Imager
- …