71 research outputs found
Wavelet/shearlet hybridized neural networks for biomedical image restoration
Recently, new programming paradigms have emerged that combine parallelism and numerical computations with algorithmic differentiation. This approach allows for the hybridization of neural network techniques for inverse imaging problems with more traditional methods such as wavelet-based sparsity modelling techniques. The benefits are twofold: on the one hand traditional methods with well-known properties can be integrated in neural networks, either as separate layers or tightly integrated in the network, on the other hand, parameters in traditional methods can be trained end-to-end from datasets in a neural network "fashion" (e.g., using Adagrad or Adam optimizers). In this paper, we explore these hybrid neural networks in the context of shearlet-based regularization for the purpose of biomedical image restoration. Due to the reduced number of parameters, this approach seems a promising strategy especially when dealing with small training data sets
aski: full-sky lensing map-making algorithms
Within the context of upcoming full-sky lensing surveys, the edge-preserving non-linear algorithm aski (All-Sky κ Inversion) is presented. Using the framework of Maximum A Posteriori inversion, it aims at recovering the optimal full-sky convergence map from noisy surveys with masks. aski contributes two steps: (i) CCD images of possibly crowded galactic fields are deblurred using automated edge-preserving deconvolution; (ii) once the reduced shear is estimated using standard techniques, the partially masked convergence map is also inverted via an edge-preserving method. The efficiency of the deblurring of the image is quantified by the relative gain in the quality factor of the reduced shear, as estimated by SExtractor. Cross-validation as a function of the number of stars removed yields an automatic estimate of the optimal level of regularization for the deconvolution of the galaxies. It is found that when the observed field is crowded, this gain can be quite significant for realistic ground-based 8-m class surveys. The most significant improvement occurs when both positivity and edge-preserving ℓ1−ℓ2 penalties are imposed during the iterative deconvolution. The quality of the convergence inversion is investigated on noisy maps derived from the horizon-4πN-body simulation with a signal-to-noise ratio (S/N) within the range ℓcut= 500-2500, with and without Galactic cuts, and quantified using one-point statistics (S3 and S4), power spectra, cluster counts, peak patches and the skeleton. It is found that (i) the reconstruction is able to interpolate and extrapolate within the Galactic cuts/non-uniform noise; (ii) its sharpness-preserving penalization avoids strong biasing near the clusters of the map; (iii) it reconstructs well the shape of the PDF as traced by its skewness and kurtosis; (iv) the geometry and topology of the reconstructed map are close to the initial map as traced by the peak patch distribution and the skeleton's differential length; (v) the two-point statistics of the recovered map are consistent with the corresponding smoothed version of the initial map; (vi) the distribution of point sources is also consistent with the corresponding smoothing, with a significant improvement when ℓ1−ℓ2 prior is applied. The contamination of B modes when realistic Galactic cuts are present is also investigated. Leakage mainly occurs on large scales. The non-linearities implemented in the model are significant on small scales near the peaks in the fiel
Spectral features of matrix-sequences, GLT, symbol, and application in preconditioning Krylov methods, image deblurring, and multigrid algorithms.
The final purpose of any scientific discipline can be regarded as the solution of real-world problems. With this aim, a mathematical modeling of the considered phenomenon is often compulsory. Closed-form solutions of the arising functional equations are usually not available and numerical discretization techniques are required. In this setting, the discretization of an infinite-dimensional linear equation via some linear approximation method, leads to a sequence of linear systems of increasing dimension whose coefficient matrices could inherit a structure from the continuous problem. For instance, the numerical approximation by local methods of constant or nonconstant coefficients systems of Partial Differential Equations (PDEs) over multidimensional domains, gives rise to multilevel block Toeplitz or to Generalized Locally Toeplitz (GLT) sequences, respectively. In the context of structured matrices, the convergence properties of iterative methods, like multigrid or preconditioned Krylov techniques, are strictly related to the notion of symbol, a function whose role relies in describing the asymptotical distribution of the spectrum.
This thesis can be seen as a byproduct of the combined use of powerful tools like symbol, spectral distribution, and GLT, when dealing with the numerical solution of structured linear systems. We approach such an issue both from a theoretical and practical viewpoint. On the one hand, we enlarge some known spectral distribution tools by proving the eigenvalue distribution of matrix-sequences obtained as combination of some algebraic operations on multilevel block Toeplitz matrices. On the other hand, we take advantage of the obtained results for designing efficient preconditioning techniques. Moreover, we focus on the numerical solution of structured linear systems coming from the following applications: image deblurring, fractional diffusion equations, and coupled PDEs. A spectral analysis of the arising structured sequences allows us either to study the convergence and predict the behavior of preconditioned Krylov and multigrid methods applied to the coefficient matrices, or to design effective preconditioners and multigrid solvers for the associated linear systems
Spectral features of matrix-sequences, GLT, symbol, and application in preconditioning Krylov methods, image deblurring, and multigrid algorithms.
The final purpose of any scientific discipline can be regarded as the solution of real-world problems. With this aim, a mathematical modeling of the considered phenomenon is often compulsory. Closed-form solutions of the arising functional equations are usually not available and numerical discretization techniques are required. In this setting, the discretization of an infinite-dimensional linear equation via some linear approximation method, leads to a sequence of linear systems of increasing dimension whose coefficient matrices could inherit a structure from the continuous problem. For instance, the numerical approximation by local methods of constant or nonconstant coefficients systems of Partial Differential Equations (PDEs) over multidimensional domains, gives rise to multilevel block Toeplitz or to Generalized Locally Toeplitz (GLT) sequences, respectively. In the context of structured matrices, the convergence properties of iterative methods, like multigrid or preconditioned Krylov techniques, are strictly related to the notion of symbol, a function whose role relies in describing the asymptotical distribution of the spectrum.
This thesis can be seen as a byproduct of the combined use of powerful tools like symbol, spectral distribution, and GLT, when dealing with the numerical solution of structured linear systems. We approach such an issue both from a theoretical and practical viewpoint. On the one hand, we enlarge some known spectral distribution tools by proving the eigenvalue distribution of matrix-sequences obtained as combination of some algebraic operations on multilevel block Toeplitz matrices. On the other hand, we take advantage of the obtained results for designing efficient preconditioning techniques. Moreover, we focus on the numerical solution of structured linear systems coming from the following applications: image deblurring, fractional diffusion equations, and coupled PDEs. A spectral analysis of the arising structured sequences allows us either to study the convergence and predict the behavior of preconditioned Krylov and multigrid methods applied to the coefficient matrices, or to design effective preconditioners and multigrid solvers for the associated linear systems
Edge Guided Reconstruction for Compressive Imaging
We propose EdgeCS—an edge guided compressive sensing reconstruction approach—to recover images
of higher quality from fewer measurements than the current methods. Edges are important
image features that are used in various ways in image recovery, analysis, and understanding. In
compressive sensing, the sparsity of image edges has been successfully utilized to recover images.
However, edge detectors have not been used on compressive sensing measurements to improve the
edge recovery and subsequently the image recovery. This motivates us to propose EdgeCS, which
alternatively performs edge detection and image reconstruction in a mutually beneficial way. The
edge detector of EdgeCS is designed to faithfully return partial edges from intermediate image reconstructions
even though these reconstructions may still have noise and artifacts. For complex-valued
images, it incorporates joint sparsity between the real and imaginary components. EdgeCS has
been implemented with both isotropic and anisotropic discretizations of total variation and tested
on incomplete k-space (spectral Fourier) samples. It applies to other types of measurements as well.
Experimental results on large-scale real/complex-valued phantom and magnetic resonance (MR)
images show that EdgeCS is fast and returns high-quality images. For example, it exactly recovers
the 256×256 Shepp–Logan phantom from merely 7 radial lines (3.03% k-space), which is impossible
for most existing algorithms. It is able to accurately reconstruct a 512 × 512 MR image with 0.05
white noise from 20.87% radial samples. On complex-valued MR images, it obtains recoveries with
faithful phases, which are important in many medical applications. Each of these tests took around
30 seconds on a standard PC. Finally, the algorithm is GPU friendly
Toeplitz-Based Iterative Image Reconstruction for MRI With Correction for Magnetic Field Inhomogeneity
In some types of magnetic resonance (MR) imaging, particularly functional brain scans, the conventional Fourier model for the measurements is inaccurate. Magnetic field inhomogeneities, which are caused by imperfect main fields and by magnetic susceptibility variations, induce distortions in images that are reconstructed by conventional Fourier methods. These artifacts hamper the use of functional MR imaging (fMRI) in brain regions near air/tissue interfaces. Recently, iterative methods that combine the conjugate gradient (CG) algorithm with nonuniform FFT (NUFFT) operations have been shown to provide considerably improved image quality relative to the conjugate-phase method. However, for non-Cartesian k-space trajectories, each CG-NUFFT iteration requires numerous k-space interpolations; these are operations that are computationally expensive and poorly suited to fast hardware implementations. This paper proposes a faster iterative approach to field-corrected MR image reconstruction based on the CG algorithm and certain Toeplitz matrices. This CG-Toeplitz approach requires k-space interpolations only for the initial iteration; thereafter, only fast Fourier transforms (FFTs) are required. Simulation results show that the proposed CG-Toeplitz approach produces equivalent image quality as the CG-NUFFT method with significantly reduced computation time.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85903/1/Fessler50.pd
High-Performance 3D Compressive Sensing MRI Reconstruction Using Many-Core Architectures
Compressive sensing (CS) describes how sparse
signals can be accurately reconstructed from many fewer samples
than required by the Nyquist criterion. Since MRI scan duration
is proportional to the number of acquired samples, CS has been
gaining significant attention in MRI. However, the computationally
intensive nature of CS reconstructions has precluded their
use in routine clinical practice. In this work, we investigate how
different throughput-oriented architectures can benefit one CS
algorithm and what levels of acceleration are feasible on different
modern platforms. We demonstrate that a CUDA-based code
running on an NVIDIA Tesla C2050 GPU can reconstruct a
256 × 160 × 80 volume from an 8-channel acquisition in 19 seconds,
which is in itself a significant improvement over the state of the art. We then
show that Intel's Knights Ferry can perform the same 3D MRI
reconstruction in only 12 seconds, bringing CS methods even
closer to clinical viability
Correction of spherical single lens aberration using digital image processing for cellular phone camera
制度:新 ; 報告番号:甲3276号 ; 学位の種類:博士(工学) ; 授与年月日:2011/2/21 ; 早大学位記番号:新558
- …