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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of physics. Conference series Jg. 1948; H. 1; S. 12054 - 12058
1. Verfasser: Shuang, Li
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Bristol IOP Publishing 01.06.2021
Schlagworte:
Algorithms
Greedy algorithms
Matched pursuit
Physics
Transfer functions
ISSN:1742-6588, 1742-6596
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1948/1/012054