ABSTRACT
Coherent Diffractive Imaging (CDI) is an algorithmic imaging technique where intricate features are reconstructed from measurements of the freely diffracting intensity pattern. An important goal of such lensless imaging methods is to study the structure of molecules that cannot be crystallized. Ideally, one would want to perform CDI at the highest achievable spatial resolution and in a single-shot measurement such that it could be applied to imaging of ultrafast events. However, the resolution of current CDI techniques is limited by the diffraction limit, hence they cannot resolve features smaller than one half the wavelength of the illuminating light. Here, we present sparsity-based single-shot subwavelength resolution CDI: algorithmic reconstruction of subwavelength features from far-field intensity patterns, at a resolution several times better than the diffraction limit. This work paves the way for subwavelength CDI at ultrafast rates, and it can considerably improve the CDI resolution with X-ray free-electron lasers and high harmonics.
Subject(s)
Image Processing, Computer-Assisted/methods , X-Ray Diffraction/methods , Algorithms , Image Processing, Computer-Assisted/statistics & numerical data , X-Ray Diffraction/statistics & numerical dataABSTRACT
In this paper,we present coincidence-list-ordered sets expectation-maximization (COSEM), an algorithm for iterative image reconstruction directly from list-mode coincidence acquisition data. The COSEM algorithm is based on the ordered sets EM algorithm for binned data but has several extensions that makes it suitable for rotating two planar detector tomographs. We develop the COSEM algorithm and extend it to include analytic calculation of detection probability, noise reducing iterative filtering schemes, and on-the-fly attenuation correction methods. We present an adaptation of COSEM to the Varicam\VG camera and show results from clinical and phantom studies.
Subject(s)
Algorithms , Image Processing, Computer-Assisted/methods , Imaging, Three-Dimensional/methods , Tomography, Emission-Computed/instrumentation , Tomography/methods , Humans , Mathematics , Models, Theoretical , Phantoms, Imaging , Tomography/instrumentationABSTRACT
The blind source separation problem is to extract the underlying source signals from a set of linear mixtures, where the mixing matrix is unknown. This situation is common in acoustics, radio, medical signal and image processing, hyperspectral imaging, and other areas. We suggest a two-stage separation process: a priori selection of a possibly overcomplete signal dictionary (for instance, a wavelet frame or a learned dictionary) in which the sources are assumed to be sparsely representable, followed by unmixing the sources by exploiting the their sparse representability. We consider the general case of more sources than mixtures, but also derive a more efficient algorithm in the case of a nonovercomplete dictionary and an equal numbers of sources and mixtures. Experiments with artificial signals and musical sounds demonstrate significantly better separation than other known techniques.