A CP-low-rank convolutional sparse coding model for tensors is equivalent to Kruskal regression and is solved by an alternating algorithm that reconstructs signals with fewer nonzero activations than unconstrained ADMM.
rm k -svd: An algorithm for designing overcomplete dictionaries for sparse representation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Multivariate Convolutional Sparse Coding with Low Rank Tensor
A CP-low-rank convolutional sparse coding model for tensors is equivalent to Kruskal regression and is solved by an alternating algorithm that reconstructs signals with fewer nonzero activations than unconstrained ADMM.