返回
Consistent adaptive sequential dictionary learning
DOI:10.1016/j.sigpro.2018.07.018.png)
摘要
En 中文
Algorithms for learning overcomplete dictionaries for sparse signal representation are mostly iterative minimization methods that alternate between a sparse coding stage and a dictionary update stage. For most however, the notion of consistency of the learned quantities has not been addressed. Based on the observation that the observed signals can be approximated as a sum of rank one matrices, a new adaptive dictionary learning algorithm is proposed in this paper. It is derived via sequential adaptive penalized rank one matrix approximation where the l(1)-norm is introduced as a penalty promoting sparsity. The proposed algorithm uses a block coordinate descent approach to consistently estimate the unknowns and has the advantage of having simple closed form solutions for both the sparse coding and dictionary update stages. The consistency properties of both the estimated sparse code and dictionary atom are provided. The performance of the proposed algorithm compared to some state of the art algorithms is illustrated on both simulated data and a real functional magnetic resonance imaging (fMRI) data set from a finger tapping experiment. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Dictionary learning
Sequential learning
Sparsity
Penalized rank one matrix approximation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
A micromachined efficient parametric array loudspeaker with a wide radiation frequency band具有宽辐射频带的微机械高效参量阵列扬声器
Basis Expansion Approaches for Regularized Sequential Dictionary Learning Algorithms With Enforced Sparsity for fMRI Data Analysis用于fMRI数据分析的具有强制稀疏性的正则化顺序字典学习算法的基础扩展方法
Multi-stage image denoising based on correlation coefficient matching and sparse dictionary pruning
SIGNAL PROCESSING
IF3.6
Learning local dictionaries and similarity structures for single image super-resolution
SIGNAL PROCESSING
IF3.6

