Title
Polynomial dictionary learning algorithms in sparse representations
Abstract
•In this article, we present a new technique for learning dictionaries from the signals with time delays, represented by polynomial matrices.•Two types of polynomial dictionary methods are proposed based on either the matrix of polynomials model or the polynomial of matrices model.•We also present a method to calculate the sparse approximation coefficients for there reconstruction of the signals in polynomial form for a given polynomial dictionary.•The proposed technique is demonstrated for acoustic impulse response modeling.
Year
DOI
Venue
2018
10.1016/j.sigpro.2017.08.011
Signal Processing
Keywords
Field
DocType
Dictionary learning,Polynomial matrix,Impulse responses,Sparse representation
Lagrange polynomial,K-SVD,Polynomial,Polynomial matrix,Matrix (mathematics),Computer science,Square-free polynomial,Algorithm,Polynomial long division,Matrix polynomial
Journal
Volume
ISSN
Citations 
142
0165-1684
0
PageRank 
References 
Authors
0.34
34
7
Name
Order
Citations
PageRank
Guan Jian183.69
Xuan Wang229157.12
Pengming Feng3334.90
Dong Jing421.05
Jonathon Chambers5998.84
Zoe L. Jiang610017.59
Wang Wenwu7144.75