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

DOI10.1109/TSP.2014.2385040zbMATH Open1394.94096DBLPjournals/tsp/CaiafaC15arXiv1406.3295OpenAlexW2062692432WikidataQ60486515 ScholiaQ60486515MaRDI QIDQ4579729FDOQ4579729

Authors: Cesar F. Caiafa, Andrzej Cichocki 

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: 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}imes{I}_{2}imescdotsimes{I}_N)$ data tensor $underlinemathbfX$ 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{mathbfX}_{a}u$ is stable in the sense that the approximation error is comparable to the one provided by the best low-multilinear-rank approximation, where $au$ 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 $au=a{u}_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 $au=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.

Full work available at URL: https://arxiv.org/abs/1406.3295

Recommendations

• Computer Vision - ECCV 2004
• Reconstruction from projections using Grassmann tensors
• Robust low-rank tensor recovery: models and algorithms
• Rapid compressed sensing reconstruction: a semi-tensor product approach
• Fast Multilinear Singular Value Decomposition for Structured Tensors
• Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
• Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (7)

• A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
• Sparse signal reconstruction via collaborative neurodynamic optimization
• Petz recovery versus matrix reconstruction
• A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format
• Computer Vision - ECCV 2004
• Alternating Linear Scheme in a Bayesian Framework for Low-Rank Tensor Approximation
• Cross: efficient low-rank tensor completion

This page was built for publication: Stable, Robust, and Super Fast Reconstruction of Tensors Using Multi-Way Projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579729)