Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases

DOI10.1162/NECO_a_00385zbMath1269.94009OpenAlexW2066792693WikidataQ50935915 ScholiaQ50935915MaRDI QIDQ5327163

Andrzej Cichocki, Cesar F. Caiafa

Publication date: 7 August 2013

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco_a_00385

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (9)

A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint ⋮ Non-local blind hyperspectral image super-resolution via 4D sparse tensor factorization and low-rank ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators ⋮ Analysis sparse representation for nonnegative signals based on determinant measure by DC programming ⋮ Statistical interpolation of spatially varying but sparsely measured 3D geo-data using compressive sensing and variational Bayesian inference ⋮ Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals ⋮ An iterative method for tensor inpainting based on higher-order singular value decomposition ⋮ Sparse recovery of sound fields using measurements from moving microphones

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• On the linear independence of spikes and sines
• Generalizing the column-row matrix decomposition to multi-way arrays
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Sparse solutions to underdetermined Kronecker product systems
• Kronecker-product approximations for some function-related matrices.
• The ubiquitous Kronecker product
• Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
• Atomic Decomposition by Basis Pursuit
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP
• Combining Kronecker Product Approximation with Discrete Wavelet Transforms to Solve Dense, Function-Related Linear Systems
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• A Theory for Sampling Signals From a Union of Subspaces
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Sparsity and incoherence in compressive sampling
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
• Kronecker Compressive Sensing
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Compressed sensing

This page was built for publication: Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases