Denoising and Completion of 3D Data via Multidimensional Dictionary Learning

by   Zemin Zhang, et al.

In this paper a new dictionary learning algorithm for multidimensional data is proposed. Unlike most conventional dictionary learning methods which are derived for dealing with vectors or matrices, our algorithm, named KTSVD, learns a multidimensional dictionary directly via a novel algebraic approach for tensor factorization as proposed in [3, 12, 13]. Using this approach one can define a tensor-SVD and we propose to extend K-SVD algorithm used for 1-D data to a K-TSVD algorithm for handling 2-D and 3-D data. Our algorithm, based on the idea of sparse coding (using group-sparsity over multidimensional coefficient vectors), alternates between estimating a compact representation and dictionary learning. We analyze our KTSVD algorithm and demonstrate its result on video completion and multispectral image denoising.


page 6

page 7

page 8


Computational Intractability of Dictionary Learning for Sparse Representation

In this paper we consider the dictionary learning problem for sparse rep...

Efficient GPU Implementation for Single Block Orthogonal Dictionary Learning

Dictionary training for sparse representations involves dealing with lar...

ℓ_1-K-SVD: A Robust Dictionary Learning Algorithm With Simultaneous Update

We develop a dictionary learning algorithm by minimizing the ℓ_1 distort...

Distributed Convolutional Dictionary Learning (DiCoDiLe): Pattern Discovery in Large Images and Signals

Convolutional dictionary learning (CDL) estimates shift invariant basis ...

Exact Sparse Orthogonal Dictionary Learning

Over the past decade, learning a dictionary from input images for sparse...

A Split-and-Merge Dictionary Learning Algorithm for Sparse Representation

In big data image/video analytics, we encounter the problem of learning ...

An Adaptive Dictionary Learning Approach for Modeling Dynamical Textures

Video representation is an important and challenging task in the compute...