Answers are grounded in this paper and cite their sources.
In this paper, we consider sparse representations of multidimensional signals (tensors) by generalizing the one-dimensional case (vectors). A new greedy algorithm, namely the Tensor-OMP algorithm, is proposed to compute a block-sparse representation of a tensor with respect to a Kronecker basis where the non-zero coefficients are restricted to be located within a sub-tensor (block). It is demonstrated, through simulation examples, the advantage of considering the Kronecker structure together with the block-sparsity property obtaining faster and more precise sparse representations of tensors compared to the case of applying the classical OMP (Orthogonal Matching Pursuit).
No takes yet. Share an insight, caveat, or question.
Caiafa et al. (2012) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: