Reconstructions for Analytic Signals Based on Greedy Algorithm

In this paper, we utilize greedy algorithm to approximate analytic signals and transfer functions sparsely. Based on reproducing kernels of Hardy space, a redundant dictionary is constructed. The approximating strategy relies on matching pursuit which is an implementation of greedy algorithm. A nume...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1948; no. 1; pp. 12054 - 12058
Main Author Shuang, Li
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.06.2021
Subjects
Algorithms
Greedy algorithms
Matched pursuit
Physics
Transfer functions
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/1948/1/012054

Cover

More Information
Summary:In this paper, we utilize greedy algorithm to approximate analytic signals and transfer functions sparsely. Based on reproducing kernels of Hardy space, a redundant dictionary is constructed. The approximating strategy relies on matching pursuit which is an implementation of greedy algorithm. A numerical example and Python codes are provided to illustrate the idea.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/1948/1/012054