Two-dimensional infrared spectroscopy (2D IR) is a powerful tool to investigate molecular structures and dynamics on femtosecond to picosecond time scales and is applied to diverse systems. Current technologies allow for the acquisition of a single 2D IR spectrum in a few hundreds of milliseconds using a pulse shaper and an array detector, but demanding applications require spectra for many waiting times and involve considerable signal averaging, resulting in data acquisition times that can be many days of laboratory measurement time. Compressive sampling is an emerging signal processing technique to reduce data acquisition time in diverse fields by requiring only a fraction of the traditional number of measurements while yielding much of the same information as the fully-sampled data. Here we combine cutting-edge 2D IR methodology with a novel compressive sampling reconstruction algorithm to reduce the data acquisition time of 2D IR spectroscopy without distorting lineshapes. We introduce the Generic Iteratively Reweighted Annihilating Filter (GIRAF) algorithm re-engineered to the specific problem of 2D IR reconstruction and show its effectiveness applied to various systems, including those with low signal, with multiple peaks, and with differing amounts of frequency shifting. Additionally, we lay the groundwork for 2D IR microscopic imaging using compressive sampling in the spatial image domain. The first instance of a single-pixel camera in the infrared is introduced.

In digital signal processing field, for recovering the signal without distortion, Shannon sampling theory must be fulfilled in the traditional signal sampling. However, in some practical applications, it is becoming an obstacle because of the dramatic increase of the costs due to increased volume of the storage and transmission as a function of frequency for sampling. Therefore, how to reduce the number of the sampling in analog to digital conversion (ADC) for wideband and how to compress the large data effectively has been becoming major subject for study. Recently, a novel technique, so-called “compressed sampling”, abbreviated as CS, has been proposed to solve the problem. This method will capture and represent compressible signals at a sampling rate significantly lower than the Nyquist rate.   This paper not only surveys the theory of compressed sampling, but also simulates the CS with the software Matlab. The error between the recovered signal and original signal for simulation is around -200dB. The attempts were made to apply CS. The error between the recovered signal and original one for experiment is around -40 dB which means the CS is realized in a certain extent. Furthermore, some related applications and the suggestions of the further work are discussed.

No description available.

Automatic target recognition (ATR) is the ability for a computer to discriminate between different objects in a scene. ATR is often performed on point cloud data from a sensor known as a Ladar. Increasing the resolution of this point cloud in order to get a more clear view of the object in a scene would be of significant interest in an ATR application. A technique to increase the resolution of a scene is known as super resolution. This technique requires many low resolution images that can be combined together. In recent years, however, it has become possible to perform super resolution on a single image. This thesis sought to apply Gabor Wavelets and Compressive Sensing to single image super resolution of digital images of natural scenes. The technique applied to images was then extended to allow the super resolution of a point cloud.

No description available.

<p>This work focuses on the construction and application of coded apertures to compressive X-ray tomography. Coded apertures can be made in a number of ways, each method having an impact on system background and signal contrast. Methods of constructing coded apertures for structuring X-ray illumination and scatter are compared and analyzed. Apertures can create structured X-ray bundles that investigate specific sets of object voxels. The tailored bundles of rays form a code (or pattern) and are later estimated through computational inversion. Structured illumination can be used to subsample object voxels and make inversion feasible for low dose computed tomography (CT) systems, or it can be used to reduce background in limited angle CT systems. </p><p>On the detection side, coded apertures modulate X-ray scatter signals to determine the position and radiance of scatter points. By forming object dependent projections in measurement space, coded apertures multiplex modulated scatter signals onto a detector. The multiplexed signals can be inverted with knowledge of the code pattern and system geometry. This work shows two systems capable of determining object position and type in a 2D plane, by illuminating objects with an X-ray `fan beam,' using coded apertures and compressive measurements. Scatter tomography can help identify materials in security and medicine that may be ambiguous with transmission tomography alone.</p> / Dissertation

Reconstruction of continuous signals from a number of their discrete samples is central to digital signal processing. Digital devices can only process discrete data and thus processing the continuous signals requires discretization. After discretization, possibility of unique reconstruction of the source signals from their samples is crucial. The classical sampling theory provides bounds on the sampling rate for unique source reconstruction, known as the Nyquist sampling rate. Recently a new sampling scheme, Compressive Sensing (CS), has been formulated for sparse signals. CS is an active area of research in signal processing. It has revolutionized the classical sampling theorems and has provided a new scheme to sample and reconstruct sparse signals uniquely, below Nyquist sampling rates. A signal is called (approximately) sparse when a relatively large number of its elements are (approximately) equal to zero. For the class of sparse signals, sparsity can be viewed as prior information about the source signal. CS has found numerous applications and has improved some image acquisition devices. Interesting instances of CS can happen, when apart from sparsity, side information is available about the source signals. The side information can be about the source structure, distribution, etc. Such cases can be viewed as extensions of the classical CS. In such cases we are interested in incorporating the side information to either improve the quality of the source reconstruction or decrease the number of the required samples for accurate reconstruction. A general CS problem can be transformed to an equivalent optimization problem. In this thesis, a special case of CS with side information about the feasible region of the equivalent optimization problem is studied. It is shown that in such cases uniqueness and stability of the equivalent optimization problem still holds. Then, an efficient reconstruction method is proposed. To demonstrate the practical value of the proposed scheme, the algorithm is applied on two real world applications: image deblurring in optical imaging and surface reconstruction in the gradient field. Experimental results are provided to further investigate and confirm the effectiveness and usefulness of the proposed scheme.

<p>This dissertation describes two computational sensors that were used to demonstrate applications of generalized sampling of the optical field. The first sensor was an incoherent imaging system designed for compressive measurement of the power spectral density in the scene (spectral imaging). The other sensor was an interferometer used to compressively measure the mutual intensity of the optical field (coherence imaging) for imaging through turbulence. Each sensor made anisomorphic measurements of the optical signal of interest and digital post-processing of these measurements was required to recover the signal. The optical hardware and post-processing software were co-designed to permit acquisition of the signal of interest with sub-Nyquist rate sampling, given the prior information that the signal is sparse or compressible in some basis.</p> <p>Compressive spectral imaging was achieved by a coded aperture snapshot spectral imager (CASSI), which used a coded aperture and a dispersive element to modulate the optical field and capture a 2D projection of the 3D spectral image of the scene in a snapshot. Prior information of the scene, such as piecewise smoothness of objects in the scene, could be enforced by numerical estimation algorithms to recover an estimate of the spectral image from the snapshot measurement.</p> <p>Hypothesizing that turbulence between the scene and CASSI would introduce spectral diversity of the point spread function, CASSI's snapshot spectral imaging capability could be used to image objects in the scene through the turbulence. However, no turbulence-induced spectral diversity of the point spread function was observed experimentally. Thus, coherence functions, which are multi-dimensional functions that completely determine optical fields observed by intensity detectors, were considered. These functions have previously been used to image through turbulence after extensive and time-consuming sampling of such functions. Thus, compressive coherence imaging was attempted as an alternative means of imaging through turbulence.</p> <p>Compressive coherence imaging was demonstrated by using a rotational shear interferometer to measure just a 2D subset of the 4D mutual intensity, a coherence function that captures the optical field correlation between all the pairs of points in the aperture. By imposing a sparsity constraint on the possible distribution of objects in the scene, both the object distribution and the isoplanatic phase distortion induced by the turbulence could be estimated with the small number of measurements made by the interferometer.</p> / Dissertation

Seismic imaging involves the solution of an inverse-scattering problem during which the energy of (extremely) large data volumes is collapsed onto the Earth's reflectors. We show how the ideas from 'compressive sampling' can alleviate this task by exploiting the curvelet transform's 'wavefront-set detection' capability and 'invariance' property under wave propagation. First, a wavelet-vaguellete technique is reviewed, where seismic amplitudes are recovered from complete data by diagonalizing the Gramm matrix of the linearized scattering problem. Next, we show how the recovery of seismic wavefields from incomplete data can be cast into a compressive sampling problem, followed by a proposal to compress wavefield extrapolation operators via compressive sampling in the modal domain. During the latter approach, we explicitly exploit the mutual incoherence between the eigenfunctions of the Helmholtz operator and the curvelet frame elements that compress the extrapolated wavefield. This is joint work with Gilles Hennenfent, Peyman Moghaddam, Tim Lin, Chris Stolk and Deli Wang.

Reconstruction of continuous signals from a number of their discrete samples is central to digital signal processing. Digital devices can only process discrete data and thus processing the continuous signals requires discretization. After discretization, possibility of unique reconstruction of the source signals from their samples is crucial. The classical sampling theory provides bounds on the sampling rate for unique source reconstruction, known as the Nyquist sampling rate. Recently a new sampling scheme, Compressive Sensing (CS), has been formulated for sparse signals. CS is an active area of research in signal processing. It has revolutionized the classical sampling theorems and has provided a new scheme to sample and reconstruct sparse signals uniquely, below Nyquist sampling rates. A signal is called (approximately) sparse when a relatively large number of its elements are (approximately) equal to zero. For the class of sparse signals, sparsity can be viewed as prior information about the source signal. CS has found numerous applications and has improved some image acquisition devices. Interesting instances of CS can happen, when apart from sparsity, side information is available about the source signals. The side information can be about the source structure, distribution, etc. Such cases can be viewed as extensions of the classical CS. In such cases we are interested in incorporating the side information to either improve the quality of the source reconstruction or decrease the number of the required samples for accurate reconstruction. A general CS problem can be transformed to an equivalent optimization problem. In this thesis, a special case of CS with side information about the feasible region of the equivalent optimization problem is studied. It is shown that in such cases uniqueness and stability of the equivalent optimization problem still holds. Then, an efficient reconstruction method is proposed. To demonstrate the practical value of the proposed scheme, the algorithm is applied on two real world applications: image deblurring in optical imaging and surface reconstruction in the gradient field. Experimental results are provided to further investigate and confirm the effectiveness and usefulness of the proposed scheme.