Search

Maximum Entropy is an image reconstruction method conceived to image a sparsely occupied field of view and therefore particularly appropriate to achieve super-resolution effects. Although widely used in image deconvolution, this method has been formulated in radio astronomy for the analysis of observations in the spatial frequency domain, and an Interactive Data Language (IDL) code has been implemented for image reconstruction from solar X-ray Fourier data. However, this code relies on a non-convex formulation of the constrained optimization problem addressed by the Maximum Entropy approach and this sometimes results in unreliable reconstructions characterized by unphysical shrinking effects. This paper introduces a new approach to Maximum Entropy based on the constrained minimization of a convex functional. In the case of observations recorded by the Reuven Ramaty High Energy Solar Spectroscopic Imager (RHESSI), the resulting code provides the same super-resolution effects of the previous algorithm, while working properly also when that code produces unphysical reconstructions. Results are also provided of testing the algorithm with synthetic data simulating observations of the Spectrometer/Telescope for Imaging X-rays (STIX) in Solar Orbiter. The new code is available in the {\em{HESSI}} folder of the Solar SoftWare (SSW)tree.

We consider variations of the Rudin-Osher-Fatemi functional which are particularly well-suited to denoising and deblurring of 2D bar codes. These functionals consist of an anisotropic total variation favoring rectangles and a fidelity term which measure the L^1 distance to the signal, both with and without the presence of a deconvolution operator. Based upon the existence of a certain associated vector field, we find necessary and sufficient conditions for a function to be a minimizer. We apply these results to 2D bar codes to find explicit regimes ---in terms of the fidelity parameter and smallest length scale of the bar codes--- for which a perfect bar code is recoverable via minimization of the functionals. Via a discretization reformulated as a linear program, we perform numerical experiments for all functionals demonstrating their denoising and deblurring capabilities., Comment: 34 pages, 6 figures (with a total of 30 subfigures); errors corrected in Version 3, see Errata 1.1, 4.4, and 6.6 (v3 numbering) for more information

Using total variation based energy minimisation we address the recovery of a blurred (convoluted) one dimensional (1D) barcode. We consider functionals defined over all possible barcodes with fidelity to a convoluted signal of a barcode, and regularised by total variation. Our fidelity terms consist of the L^2 distance either directly to the measured signal or preceded by deconvolution. Key length scales and parameters are the X-dimension of the underlying barcode, the size of the supports of the convolution and deconvolution kernels, and the fidelity parameter. For all functionals, we establish regimes (sufficient conditions) wherein the underlying barcode is the unique minimiser. We also present some numerical experiments suggesting that these sufficient conditions are not optimal and the energy methods are quite robust for significant blurring., Comment: version 1: 44 pages, 9 figures; version 2: 36 pages, 8 figures, revised version in which the results are presented in a bit more generality and the appendix has been shrunk significantly; submitted to SIAM Journal on Imaging Sciences; version 3: after final revisions, accepted by SIAM Journal on Imaging Sciences