返回
General design algorithm for sparse frame expansions
DOI:10.1016/j.sigpro.2005.04.013.png)
摘要
En 中文
Signal expansions using frames may be considered as generalizations of signal representations based on transforms and filter banks. Frames, or dictionaries, for sparse signal representations may be designed using an iterative algorithm with two main steps: (1) Frame vector selection and expansion coefficient determination for signals in a training set, selected to be representative of the signals for which compact representations are desired, using the frame designed in the previous iteration. (2) Update of frame vectors with the objective of improving the representation of step (1). This method for frame design was used by [Engan et al., Signal Processing 80 (2000) 2121-21401 for block-oriented signal expansions, i.e. generalizations of block-oriented transforms and by [Aase et al., IEEE Trans. Signal Process. 49(5) (2001) 1087-1096] for non-block-oriented frames-for short overlapping frames, that may be viewed as generalizations of critically sampled filter banks. Here we give the solution to the general frame design problem using the compact notation of linear algebra. This makes the solution both conceptually and computationally easier, especially for the overlapping frame case. Also, the solution is more general than those presented earlier, facilitating the imposition of constraints, such as symmetry, on the designed frame vectors. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
frame
over-complete
dictionary
frame design
matching pursuit
filter banks
sparse signal representation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
暂无机构信息
引用论文
A fast globally optimal algorithm for template matching using low-resolution pruning一种基于低分辨率剪枝的快速全局最优模板匹配算法
Ditopic crown ether–guanidinium ion receptors for the molecular recognition of amino acids and small peptides
Tetrahedron
IF0

