{'fraction_non_alphanumeric': 0.029411764705882353, 'fraction_numerical': 0.005190311418685121, 'mean_word_length': 5.649425287356322, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Multilinear Compressed Sensing using Tensor Least Angle Regression (T-LARS)

Multilinear compressed sensing generalizes the compressed sensing formulation to tensor signals, where the tensor signal is reconstructed using much fewer samples obtained in a sparse domain by solving a multilinear sparse coding problem. The Kronecker-OMP, a generalization of Orthogonal Matching Pursuit (OMP) solves the L0 constrained multilinear sparse least-squares problems. However, with the problem dimensions and the number of iterations, the space and computational cost of Kronecker-OMP increase in the polynomial order. Authors have previously developed a generalized least-angle regression(LARS), known as Tensor Least Angle Regression (T-LARS), with a lower asymptotic space and computational complexity than Kronecker-OMP to efficiently solve both L0 and L1 constrained multilinear sparse least-squares problems. In this paper, we used T-LARS to solve multilinear compressed sensing problems and compared the results with Kronecker-OMP, where the T-LARS is 56 times faster than Kronecker-OMP in reconstructing the 3D PET-CT images using compressed sensing samples.