Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries (Q1288881)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries |
scientific article; zbMATH DE number 1288055
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries |
scientific article; zbMATH DE number 1288055 |
Statements
Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries (English)
0 references
22 November 1999
0 references
The author considers a particular method of nonlinear approximation, namely \(M\)-term approximation; it is used in image and signal processing. He studies the efficiency of greedy type algorithms with regard to redundant dictionaries in Hilbert space and proves a general result which gives a sufficient condition on a dictionary to guarantee that the pure greedy algorithm is nearly best in the sense of power decay of error of approximation. Some examples are given.
0 references
greedy algorithms
0 references
\(M\)-term approximation
0 references
image processing
0 references
numerical examples
0 references
signal processing
0 references
dictionaries
0 references
Hilbert space
0 references
