Title :
Block sparse representations of tensors using Kronecker bases
Author :
Caiafa, Cesar F. ; Cichocki, Andrzej
Author_Institution :
Inst. Argentino de Radioastronom., Villa Elisa, Argentina
Abstract :
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).
Keywords :
greedy algorithms; signal representation; tensors; Kronecker structure; block sparse representations; greedy algorithm; multidimensional signals; nonzero coefficients; one-dimensional case; orthogonal matching pursuit; subtensor; tensor-OMP algorithm; Compressed sensing; Dictionaries; Matching pursuit algorithms; Signal processing algorithms; Sparse matrices; Tensile stress; Vectors; Kronecker Bases; Orthogonal Matching Pursuit (OMP); Sparse Representations; Tensors;
Conference_Titel :
Acoustics, Speech and Signal Processing (ICASSP), 2012 IEEE International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-4673-0045-2
Electronic_ISBN :
1520-6149
DOI :
10.1109/ICASSP.2012.6288476