Stable, Robust and Super Fast Reconstruction of Tensors Using Multi-Way Projections

In the framework of multidimensional Compressed Sensing (CS), we introduce an analytical reconstruction formula that allows one to recover an $N$th-order $(I_1\times I_2\times \cdots \times I_N)$ data tensor $\underline{\mathbf{X}}$ from a reduced set of multi-way compressive measurements by exploiting its low multilinear-rank structure. Moreover, we show that, an interesting property of multi-way measurements allows us to build the reconstruction based on compressive linear measurements taken only in two selected modes, independently of the tensor order $N$. In addition, it is proved that, in the matrix case and in a particular case with $3$rd-order tensors where the same 2D sensor operator is applied to all mode-3 slices, the proposed reconstruction $\underline{\mathbf{X}}_\tau$ is stable in the sense that the approximation error is comparable to the one provided by the best low-multilinear-rank approximation, where $\tau$ is a threshold parameter that controls the approximation error. Through the analysis of the upper bound of the approximation error we show that, in the 2D case, an optimal value for the threshold parameter $\tau=\tau_0 > 0$ exists, which is confirmed by our simulation results. On the other hand, our experiments on 3D datasets show that very good reconstructions are obtained using $\tau=0$, which means that this parameter does not need to be tuned. Our extensive simulation results demonstrate the stability and robustness of the method when it is applied to real-world 2D and 3D signals. A comparison with state-of-the-arts sparsity based CS methods specialized for multidimensional signals is also included. A very attractive characteristic of the proposed method is that it provides a direct computation, i.e. it is non-iterative in contrast to all existing sparsity based CS algorithms, thus providing super fast computations, even for large datasets.Comment: Submitted to IEEE Transactions on Signal Processin

Ultrasonic guided wave imaging via sparse reconstruction

Structural health monitoring (SHM) is concerned with the continuous, long-term assessment of structural integrity. One commonly investigated SHM technique uses guided ultrasonic waves, which travel through the structure and interact with damage. Measured signals are then analyzed in software for detection, estimation, and characterization of damage. One common configuration for such a system uses a spatially-distributed array of fixed piezoelectric transducers, which is inexpensive and can cover large areas. Typically, one or more sets of prerecorded baseline signals are measured when the structure is in a known state, with imaging methods operating on differences between follow-up measurements and these baselines. Presented here is a new class of SHM spatially-distributed array algorithms that rely on sparse reconstruction. For this problem, damage over a region of interest (ROI) is considered to be sparse. Two different techniques are demonstrated here. The first, which relies on sparse reconstruction, uses an a priori assumption of scattering behavior to generate a redundant dictionary where each column corresponds to a pixel in the ROI. The second method extends this concept by using multidimensional models for each pixel, with each pixel corresponding to a "block" in the dictionary matrix; this method does not require advance knowledge of scattering behavior. Analysis and experimental results presented demonstrate the validity of the sparsity assumption. Experiments show that images generated with sparse methods are superior to those created with delay-and-sum methods; the techniques here are shown to be tolerant of propagation model mismatch. The block-sparse method described here also allows the extraction of scattering patterns, which can be used for damage characterization.Ph.D

Image coding using redundant dictionaries

This chapter discusses the problem of coding images using very redundant libraries of waveforms, also referred to as dictionaries. We start with a discussion of the shortcomings of classical approaches based on orthonormal bases. More specifically, we show why these redundant dictionaries provide an interesting alternative for image representation. We then introduce a special dictionary of 2-D primitives called anisotropic refinement atoms that are well suited for representing edge dominated images. Using a simple greedy algorithm, we design an image coder that performs very well at low bit rate. We finally discuss its performance and particular features such as geometric adaptativity and rate scalability

A Compressed Sampling and Dictionary Learning Framework for WDM-Based Distributed Fiber Sensing

We propose a compressed sampling and dictionary learning framework for fiber-optic sensing using wavelength-tunable lasers. A redundant dictionary is generated from a model for the reflected sensor signal. Imperfect prior knowledge is considered in terms of uncertain local and global parameters. To estimate a sparse representation and the dictionary parameters, we present an alternating minimization algorithm that is equipped with a pre-processing routine to handle dictionary coherence. The support of the obtained sparse signal indicates the reflection delays, which can be used to measure impairments along the sensing fiber. The performance is evaluated by simulations and experimental data for a fiber sensor system with common core architecture.Comment: Accepted for publication in Journal of the Optical Society of America A [ \copyright\ 2017 Optical Society of America.]. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modifications of the content of this paper are prohibite