In this paper, we propose an efficient numerical scheme for solving some large‐scale ill‐posed linear inverse problems arising from image restoration. In order to accelerate the computation, two different hidden structures are exploited. First, the coefficient matrix is approximated as the sum of a small number of Kronecker products. This procedure not only introduces one more level of parallelism into the computation but also enables the usage of computationally intensive matrix–matrix multiplications in the subsequent optimization procedure. We then derive the corresponding Tikhonov regularized minimization model and extend the fast iterative shrinkage‐thresholding algorithm (FISTA) to solve the resulting optimization problem. Because the matrices appearing in the Kronecker product approximation are all structured matrices (Toeplitz, Hankel, etc.), we can further exploit their fast matrix–vector multiplication algorithms at each iteration. The proposed algorithm is thus called
Inverse methods involving compressive sensing are tested in the application of two‐dimensional aperture‐synthesis imaging of radar backscatter from field‐aligned plasma density irregularities in the ionosphere. We consider basis pursuit denoising, implemented with the fast iterative shrinkage thresholding algorithm, and orthogonal matching pursuit (OMP) with a wavelet basis in the evaluation. These methods are compared with two more conventional optimization methods rooted in entropy maximization (MaxENT) and adaptive beamforming (linearly constrained minimum variance or often “Capon's Method.”) Synthetic data corresponding to an extended ionospheric radar target are considered. We find that MaxENT outperforms the other methods in terms of its ability to recover imagery of an extended target with broad dynamic range. Fast iterative shrinkage thresholding algorithm performs reasonably well but does not reproduce the full dynamic range of the target. It is also the most computationally expensive of the methods tested. OMP is very fast computationally but prone to a high degree of clutter in this application. We also point out that the formulation of MaxENT used here is very similar to OMP in some respects, the difference being that the former reconstructs the logarithm of the image rather than the image itself from basis vectors extracted from the observation matrix. MaxENT could in that regard be considered a form of compressive sensing.
more » « less- Award ID(s):
- 1732209
- NSF-PAR ID:
- 10460448
- Publisher / Repository:
- DOI PREFIX: 10.1029
- Date Published:
- Journal Name:
- Radio Science
- Volume:
- 54
- Issue:
- 6
- ISSN:
- 0048-6604
- Page Range / eLocation ID:
- p. 503-516
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Summary structured FISTA (sFISTA). In particular, we show that the approximation error introduced by sFISTA is well under control and sFISTA can reach the same image restoration accuracy level as FISTA. Finally, both the theoretical complexity analysis and some numerical results are provided to demonstrate the efficiency of sFISTA. -
Glow discharge optical emission spectroscopy elemental mapping (GDOES EM), enabled by spectral imaging strategies, is an advantageous technique for direct multi-elemental analysis of solid samples in rapid timeframes. Here, a single-pixel, or point scan, spectral imaging system based on compressed sensing image sampling, is developed and optimized in terms of matrix density, compression factor, sparsifying basis, and reconstruction algorithm for coupling with GDOES EM. It is shown that a 512 matrix density at a compression factor of 30% provides the highest spatial fidelity in terms of the peak signal-to-noise ratio (PSNR) and complex wavelet structural similarity index measure (cw-SSIM) while maintaining fast measurement times. The background equivalent concentration (BEC) of Cu I at 510.5 nm is improved when implementing the discrete wavelet transform (DWT) sparsifying basis and Two-step Iterative Shrinking/Thresholding Algorithm for Linear Inverse Problems (TwIST) reconstruction algorithm. Utilizing these optimum conditions, a GDOES EM of a flexible, etched-copper circuit board was then successfully demonstrated with the compressed sensing single-pixel spectral imaging system (CSSPIS). The newly developed CSSPIS allows taking advantage of the significant cost-efficiency of point-scanning approaches (>10× vs. intensified array detector systems), while overcoming (up to several orders of magnitude) their inherent and substantial throughput limitations. Ultimately, it has the potential to be implemented on readily available commercial GDOES instruments by adapting the collection optics.more » « less
-
he Compressive Sensing (CS) framework has demonstrated improved acquisition efficiency on a variety of clinical applications. Of interest to this work is Reflectance Confocal Microscopy (RCM), where CS can influence a drastic reduction in instrumentation complexity and image acquisition times. However, CS introduces the disadvantage of requiring a time consuming and computationally intensive process for image recovery. To mitigate this, the current document details our preliminary work on expanding a Deep-Learning architecture for the acquisition and fast recovery of RCM images using CS. We show preliminary recoveries of RCM images of both a synthetic target and heterogeneous skin tissue using a state-of-the-art network architecture from compressive measurements at various undersampling rates. In addition, we propose an application-specific addition to an established network architecture, and evaluate its ability to further increase the accuracy of recovered CS RCM images and remove visual artifacts. Our initial results show that it is possible to recover compressively sampled images at near-real time rates with comparable quality to established computationally intensive and time-consuming optimization-based methods common in CS applicationsmore » « less
-
more » « less
Abstract In statistics, the least absolute shrinkage and selection operator (Lasso) is a regression method that performs both variable selection and regularization. There is a lot of literature available, discussing the statistical properties of the regression coefficients estimated by the Lasso method. However, there lacks a comprehensive review discussing the algorithms to solve the optimization problem in Lasso. In this review, we summarize five representative algorithms to optimize the objective function in Lasso, including iterative shrinkage threshold algorithm (ISTA), fast iterative shrinkage‐thresholding algorithms (FISTA), coordinate gradient descent algorithm (CGDA), smooth L1 algorithm (SLA), and path following algorithm (PFA). Additionally, we also compare their convergence rate, as well as their potential strengths and weakness.
This article is categorized under:
Statistical Models > Linear Models
Algorithms and Computational Methods > Numerical Methods
Algorithms and Computational Methods > Computational Complexity
-
more » « less
ABSTRACT A pulsar dynamic spectrum is an inline digital hologram of the interstellar medium; it encodes information on the propagation paths by which signals have travelled from source to telescope. To decode the hologram, it is necessary to ‘retrieve’ the phases of the wavefield from intensity measurements, which directly gauge only the field modulus, by imposing additional constraints on the model. We present a new method for phase retrieval in the context of pulsar spectroscopy. Our method makes use of the Fast Iterative Shrinkage Thresholding Algorithm (FISTA) to obtain sparse models of the wavefield in a hierarchical approach with progressively increasing depth. Once the tail of the noise distribution is reached the hierarchy terminates with a final, unregularized optimization. The result is a fully dense model of the complex wavefield that permits the discovery of faint signals by appropriate averaging. We illustrate the performance of our method on synthetic test cases and on real data. Our algorithm, which we call H-FISTA, is implemented in the python programming language and is freely available.
