Performance analysis of Matching Pursuit algorithm modifications
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F11%3APU93749" target="_blank" >RIV/00216305:26220/11:PU93749 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Performance analysis of Matching Pursuit algorithm modifications
Original language description
This article deals with the Matching Pursuit algorithm and its modifications, which are often used for computing aproximating sparse solutions of underdetermined systems of linear equations. Many modifications of Matching Pursuit exist nowadays and theyare used for different types of applications (compressed sensing, MRI etc.). Some of them give good results in representing general signals, too. In this article, several these algorithms are described, emphasizing the difference between each of them andthe original Matching Pursuit. The paper also contains comparison of the algorithms from the viewpoints of accuracy and computational efficiency.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JA - Electronics and optoelectronics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceeding of the 13th International Conference on Research in Telecommunication Technologies 2011
ISBN
978-80-214-4283-2
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
228-232
Publisher name
VUT v Brně
Place of publication
Brno
Event location
Těchov
Event date
Sep 7, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—