Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases

DOI10.1162/NECO_A_00385MaRDI QIDQ5327163zbMATH OpenOpenAlexWikidataFDO

Authors Cesar F. Caiafa, Andrzej Cichocki

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)

Recommendations

• Kronecker Compressive Sensing
• On sparse representation in pairs of bases
• On Sparse Representations in Arbitrary Redundant Bases
• Sparse representations of random signals
• Frame-Based Sparse Analysis and Synthesis Signal Representations and Parseval K-SVD
• On Sparse Representation in Fourier and Local Bases
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Sparsification of matrices and compressed sensing

Cites work

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

Cited in

(12)

• A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
• Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
• Sparse recovery of sound fields using measurements from moving microphones
• Non-local blind hyperspectral image super-resolution via 4D sparse tensor factorization and low-rank
• Statistical interpolation of spatially varying but sparsely measured 3D geo-data using compressive sensing and variational Bayesian inference
• An iterative method for tensor inpainting based on higher-order singular value decomposition
• Tensor least angle regression for sparse representations of multidimensional signals
• Two algorithms for compressed sensing of sparse tensors
• On Sparse Representations in Arbitrary Redundant Bases
• A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
• Sparse signal reconstruction via collaborative neurodynamic optimization
• Tensor sparse representation via Einstein product

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

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