In this paper, we present a fast iterative magnetic resonance imaging (MRI) reconstruction algorithm taking advantage of the prevailing GPGPU programming paradigm. In clinical environment, MRI reconstruction is usually performed via fast Fourier transform (FFT). However, imaging artifacts (i.e. signal loss) resulting from susceptibility -induced magnetic field inhomogeneities degrade the qualit...

A block-iterative projection algorithm for solving the consistent convex feasibility problem in a finite-dimensional Euclidean space that is resilient to bounded and summable perturbations (in the sense that convergence to a feasible point is retained even if such perturbations are introduced in each iterative step of the algorithm) is proposed. This resilience can be used to steer the iterativ...

This paper explores three-dimensional (3D) interferometric synthetic aperture radar (IFSAR) image reconstruction when multiple scattering centers and noise are present in a radar resolution cell. We introduce an IFSAR scattering model that accounts for both multiple scattering centers and noise. The problem of 3D image reconstruction is then posed as a multiple hypothesis detection and estimati...

Approximate message passing (AMP) is a class of low-complexity scalable algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal β0 from noisy, linear measurements y = Aβ0 + w. AMP has the attractive feature that its performance (for example, the mean squared error of its estimates) can be accurately tracked by a simple, scalar iteration refe...

A new technique which we call Iterative Redeployment of Illumination and Sensing (IRIS) is introduced and applied to See-Through-the-Wall radar imaging. IRIS is applicable to adaptive sensing scenarios where the medium is illuminated and measured multiple times using different illiminator/sensor configurations, e.g., position, bandwidth, or polarization. These configurations are adaptively sele...

We give uniqueness theorem and reconstruction algorithm for the nonlinearized problem of finding the dielectric anisotropy f of the medium from non-overdetermined polarization tomography data. We assume that the medium has uniform background parameters and that the anisotropic (dielectric permeability) perturbation is described by symmetric and sufficiently small matrix-function f . On a pure m...

In this paper we improve on an algorithm by Pachter-Speyer for reconstruction of a phylogenetic tree from its size-m subtree weights. We provide an especially efficient algorithm for reconstruction from 3-weights.

We propose a novel foreground object segmentation algorithm for a silhouette-based 3D reconstruction system. Our system requires several multi-view images as input to reconstruct a complete 3D model. The proposed foreground segmentation algorithm is based on graph-cut optimization with the energy function developed for planar background assumption. We parallelize parts of our program with GPU p...

In medicine, there is a still growing interest in non-invasive examination techniques which can depict anatomical structures. Amongst these methods are Magnetic Resonance Imaging (MRI), Positron Emission Tomography (PET) and Computerised Tomography (CT). These are all based on the same principle: under a number of angles, a set of line integrals in a plane is measured resulting in a set of proo...

We present a method for obtaining accurate image reconstruction from highly sparse data in diffraction tomography (DT). A practical need exists for reconstruction from few-view and limited-angle data, as this can greatly reduce required scan times in DT. Our method does this by minimizing the total variation (TV) of the estimated image, subject to the constraint that the Fourier transform of th...