General design algorithm for sparse frame expansions

Karl Skretting

doi:10.1016/j.sigpro.2005.04.013

Return

General design algorithm for sparse frame expansions

2006-01-01

PRE

Karl Skretting

John Håkon Husøy

Sven Ole Aase

DOI：10.1016/j.sigpro.2005.04.013

Original

Original request for help

Save

Abstract

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.

Keywords:

frame

over-complete

dictionary

frame design

matching pursuit

filter banks

sparse signal representation

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.