Dictionary learning algorithms have been successfully applied to a number of signal and image processing problems. In some applications however, the observed signals may have a multi-subpsace structure that enables block-sparse signal representations. Based on the observation that the observed signals can be approximated as a sum of low rank matrices, a new algorithm for learning a block-structured dictionary for block-sparse signal representations is proposed. It’s derived via sequential penalized low rank matrix approximation, where a block coordinate descent approach is used to estimate the matrix pairs that form the different low rank matrix approximations. Experimental results on synthetic and standard gray-scale images illustrating the performance of the proposed algorithm are provided.
Paper
Full text
Sequential Structured Dictionary Learning for Block Sparse Representations
Semantic Scholar · Computer Science · 2019
Abstract
Dictionary learning algorithms have been successfully applied to a number of signal and image processing problems. In some applications however, the observed signals may have a multi-subpsace structure that enables block-sparse signal representations. Based on the observation that the observed signals can be approximated as a sum of low rank matrices, a new algorithm for learning a block-structured dictionary for block-sparse signal representations is proposed. It’s derived via sequential penalized low rank matrix approximation, where a block coordinate descent approach is used to estimate the matrix pairs that form the different low rank matrix approximations. Experimental results on synthetic and standard gray-scale images illustrating the performance of the proposed algorithm are provided.