Javascript must be enabled to continue!
Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals
View through CrossRef
Sparse signal representations have gained much interest recently in both signal processing and statistical communities. Compared to orthogonal matching pursuit (OMP) and basis pursuit, which solve the [Formula: see text] and [Formula: see text] constrained sparse least-squares problems, respectively, least angle regression (LARS) is a computationally efficient method to solve both problems for all critical values of the regularization parameter [Formula: see text]. However, all of these methods are not suitable for solving large multidimensional sparse least-squares problems, as they would require extensive computational power and memory. An earlier generalization of OMP, known as Kronecker-OMP, was developed to solve the [Formula: see text] problem for large multidimensional sparse least-squares problems. However, its memory usage and computation time increase quickly with the number of problem dimensions and iterations. In this letter, we develop a generalization of LARS, tensor least angle regression (T-LARS) that could efficiently solve either large [Formula: see text] or large [Formula: see text] constrained multidimensional, sparse, least-squares problems (underdetermined or overdetermined) for all critical values of the regularization parameter [Formula: see text] and with lower computational complexity and memory usage than Kronecker-OMP. To demonstrate the validity and performance of our T-LARS algorithm, we used it to successfully obtain different sparse representations of two relatively large 3D brain images, using fixed and learned separable overcomplete dictionaries, by solving both [Formula: see text] and [Formula: see text] constrained sparse least-squares problems. Our numerical experiments demonstrate that our T-LARS algorithm is significantly faster (46 to 70 times) than Kronecker-OMP in obtaining [Formula: see text]-sparse solutions for multilinear leastsquares problems. However, the [Formula: see text]-sparse solutions obtained using Kronecker-OMP always have a slightly lower residual error (1.55% to 2.25%) than ones obtained by T-LARS. Therefore, T-LARS could be an important tool for numerous multidimensional biomedical signal processing applications.
Title: Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals
Description:
Sparse signal representations have gained much interest recently in both signal processing and statistical communities.
Compared to orthogonal matching pursuit (OMP) and basis pursuit, which solve the [Formula: see text] and [Formula: see text] constrained sparse least-squares problems, respectively, least angle regression (LARS) is a computationally efficient method to solve both problems for all critical values of the regularization parameter [Formula: see text].
However, all of these methods are not suitable for solving large multidimensional sparse least-squares problems, as they would require extensive computational power and memory.
An earlier generalization of OMP, known as Kronecker-OMP, was developed to solve the [Formula: see text] problem for large multidimensional sparse least-squares problems.
However, its memory usage and computation time increase quickly with the number of problem dimensions and iterations.
In this letter, we develop a generalization of LARS, tensor least angle regression (T-LARS) that could efficiently solve either large [Formula: see text] or large [Formula: see text] constrained multidimensional, sparse, least-squares problems (underdetermined or overdetermined) for all critical values of the regularization parameter [Formula: see text] and with lower computational complexity and memory usage than Kronecker-OMP.
To demonstrate the validity and performance of our T-LARS algorithm, we used it to successfully obtain different sparse representations of two relatively large 3D brain images, using fixed and learned separable overcomplete dictionaries, by solving both [Formula: see text] and [Formula: see text] constrained sparse least-squares problems.
Our numerical experiments demonstrate that our T-LARS algorithm is significantly faster (46 to 70 times) than Kronecker-OMP in obtaining [Formula: see text]-sparse solutions for multilinear leastsquares problems.
However, the [Formula: see text]-sparse solutions obtained using Kronecker-OMP always have a slightly lower residual error (1.
55% to 2.
25%) than ones obtained by T-LARS.
Therefore, T-LARS could be an important tool for numerous multidimensional biomedical signal processing applications.
Related Results
Theoretical Foundations and Practical Applications in Signal Processing and Machine Learning
Theoretical Foundations and Practical Applications in Signal Processing and Machine Learning
Tensor decomposition has emerged as a powerful mathematical framework for analyzing multi-dimensional data, extending classical matrix decomposition techniques to higher-order repr...
Enhanced inherent strain modelling for powder-based metal additive manufacturing
Enhanced inherent strain modelling for powder-based metal additive manufacturing
(English) Metal additive manufacturing (MAM), particularly powder bed fusion using a laser beam (PBF-LB), has transformed manufacturing by enabling the production of intricate and ...
Sign Problem in Tensor-Network Contraction
Sign Problem in Tensor-Network Contraction
We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we ...
Accelerating Dynamic MRI Reconstruction Using Adaptive Sequentially
Truncated Higher-Order Singular Value Decomposition
Accelerating Dynamic MRI Reconstruction Using Adaptive Sequentially
Truncated Higher-Order Singular Value Decomposition
Background:
Dynamic magnetic resonance imaging (dMRI) plays an important role in
cardiac perfusion and functional clinical exams. However, further applications are limited by the s...
Gravitational Waves from Alena Tensor
Gravitational Waves from Alena Tensor
Alena Tensor is a recently discovered class of energy-momentum tensors that proposes a general equivalence of the curved path and the geodesic for the analyzed spacetimes which all...
Quantum annealing algorithms for Boolean tensor networks
Quantum annealing algorithms for Boolean tensor networks
AbstractQuantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribut...
Sparse Grids for Dynamic Economic Models
Sparse Grids for Dynamic Economic Models
Solving dynamic economic models that capture salient real-world heterogeneity and non-linearity requires the approximation of high-dimensional functions. As their dimensionality in...
Correlation study of changes in visual acuity, pupil diameter, Kappa angle, and Alpha angle after phacoemulsification surgery combined with multifocal IOL implantation
Correlation study of changes in visual acuity, pupil diameter, Kappa angle, and Alpha angle after phacoemulsification surgery combined with multifocal IOL implantation
Abstract
Purpose To study the changes and correlation of visual acuity, pupil size, kappa angle and Alpha angle after phacoemulsification combined with multifocal intraocul...

