Block recursive least squares dictionary learning algorithm

The block recursive least square (BRLS) dictionary learning algorithm that dealing with training data arranged in block is proposed in this paper. BRLS can be used to update overcomplete dictionary for sparse signal representation. Different from traditional recursive least square algorithms, BRLS i...

Full description

Saved in:
Bibliographic Details
Published in:Chinese Control and Decision Conference pp. 1961 - 1964
Main Authors: Jiang, Qianru, Li, Sheng, Lu, Zeru, Sun, Binbin
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 01.05.2016
Subjects:
Algorithm design and analysis
Algorithms
block
Conferences
Dictionaries
Electronics
Learning
Least squares method
Matching pursuit algorithms
Overcomplete dictionary
Recursion
recursive least square
Representations
Signal to noise ratio
Sparse matrices
sparse representation
Training
Training data
ISSN:1948-9447
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The block recursive least square (BRLS) dictionary learning algorithm that dealing with training data arranged in block is proposed in this paper. BRLS can be used to update overcomplete dictionary for sparse signal representation. Different from traditional recursive least square algorithms, BRLS is designed for data in a block form and the recursion is developed without using the matrix inversion lemma. The proposed algorithm is applied in synthetic data and real image reconstruction. Simulation results show that the new algorithm achieves a better performance than traditional approaches.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:1948-9447
DOI:10.1109/CCDC.2016.7531304