THE REGULARIZED ORTHOGONAL FUNCTIONAL MATCHING PURSUIT FOR ILL-POSED INVERSE PROBLEMS

We propose a novel algorithm to solve a general class of linear ill-posed inverse problems. For our numerical tests, we consider ill-posed problems on the sphere as they appear in the geosciences. Based on an iterative greedy algorithm, called the orthogonal matching pursuit, the signal is expanded...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on numerical analysis 2016-01, Vol.54 (1), p.262-287
Hauptverfasser: MICHEL, VOLKER, TELSCHOW, ROGER
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 287
container_issue 1
container_start_page 262
container_title SIAM journal on numerical analysis
container_volume 54
creator MICHEL, VOLKER
TELSCHOW, ROGER
description We propose a novel algorithm to solve a general class of linear ill-posed inverse problems. For our numerical tests, we consider ill-posed problems on the sphere as they appear in the geosciences. Based on an iterative greedy algorithm, called the orthogonal matching pursuit, the signal is expanded in terms of trial functions which are picked from a large redundant set of functions, the so-called dictionary. The method is able to combine arbitrary trial functions which is a great advantage to former approximation algorithms. In particular, we combine orthogonal polynomials (such as spherical harmonics in the case of the sphere) of low degrees with localized trial functions such as wavelets and/or scaling functions for the reconstruction of global trends and regional details of the signal, respectively. Since we deal with ill-posed problems, we use a Tikhonov-type regularization with a penalty term based on a (spherical) Sobolev norm. There is no need to solve any system of equations or any integration problem which provides the ability to handle very large amounts of data or extremely scattered data sets. The outcome of the algorithm is a smooth and sparse approximation of the unknown signal which is locally adapted to the detail structure of the signal as well as to the density of the given data. Moreover, in the case that wavelets are contained in the dictionary, we additionally obtain a multiresolution of the signal. Several numerical experiments are presented.
doi_str_mv 10.1137/141000695
format Article
fullrecord <record><control><sourceid>jstor_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1137_141000695</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>43901711</jstor_id><sourcerecordid>43901711</sourcerecordid><originalsourceid>FETCH-LOGICAL-c251t-6406a7cd1918b5b6ce416412121610ffa74c66e5412e04b399bdb9b583a8d3573</originalsourceid><addsrcrecordid>eNo9kD9PwzAUxC0EEqUw8AGQvDIE_Op_8RiKm1py48hJGFiiJE0kKlBR0oVvX0NRdcM7nX7vhkPoHsgTAJXPwIAQIhS_QDMgikcSJLlEM0KoiIAt1DW6maZdYGgMdIaqcq2x12llE2_e9St2vly71GWJxasqW5bmz26Scrk2WYrzyheVKfHKeWysjXJXhCeTvWlfaJx792L1prhFV0PzOfV3_3eOqpUODZF1qVkmNuoWHA6RYEQ0stuCgrjlreh6BoLBIkgAGYZGsk6InoeoJ6ylSrXbVrU8pk28pVzSOXo89XbjfprGfqi_x4-vZvypgdS_e9TnPQL7cGJ302E_nkFGFQEZ2CMcpFMU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>THE REGULARIZED ORTHOGONAL FUNCTIONAL MATCHING PURSUIT FOR ILL-POSED INVERSE PROBLEMS</title><source>SIAM Journals</source><source>JSTOR Mathematics &amp; Statistics</source><source>JSTOR Archive Collection A-Z Listing</source><creator>MICHEL, VOLKER ; TELSCHOW, ROGER</creator><creatorcontrib>MICHEL, VOLKER ; TELSCHOW, ROGER</creatorcontrib><description>We propose a novel algorithm to solve a general class of linear ill-posed inverse problems. For our numerical tests, we consider ill-posed problems on the sphere as they appear in the geosciences. Based on an iterative greedy algorithm, called the orthogonal matching pursuit, the signal is expanded in terms of trial functions which are picked from a large redundant set of functions, the so-called dictionary. The method is able to combine arbitrary trial functions which is a great advantage to former approximation algorithms. In particular, we combine orthogonal polynomials (such as spherical harmonics in the case of the sphere) of low degrees with localized trial functions such as wavelets and/or scaling functions for the reconstruction of global trends and regional details of the signal, respectively. Since we deal with ill-posed problems, we use a Tikhonov-type regularization with a penalty term based on a (spherical) Sobolev norm. There is no need to solve any system of equations or any integration problem which provides the ability to handle very large amounts of data or extremely scattered data sets. The outcome of the algorithm is a smooth and sparse approximation of the unknown signal which is locally adapted to the detail structure of the signal as well as to the density of the given data. Moreover, in the case that wavelets are contained in the dictionary, we additionally obtain a multiresolution of the signal. Several numerical experiments are presented.</description><identifier>ISSN: 0036-1429</identifier><identifier>EISSN: 1095-7170</identifier><identifier>DOI: 10.1137/141000695</identifier><language>eng</language><publisher>Society for Industrial and Applied Mathematics</publisher><ispartof>SIAM journal on numerical analysis, 2016-01, Vol.54 (1), p.262-287</ispartof><rights>Copyright ©2016 Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c251t-6406a7cd1918b5b6ce416412121610ffa74c66e5412e04b399bdb9b583a8d3573</citedby><cites>FETCH-LOGICAL-c251t-6406a7cd1918b5b6ce416412121610ffa74c66e5412e04b399bdb9b583a8d3573</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/43901711$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/43901711$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,780,784,803,832,3184,27924,27925,58017,58021,58250,58254</link.rule.ids></links><search><creatorcontrib>MICHEL, VOLKER</creatorcontrib><creatorcontrib>TELSCHOW, ROGER</creatorcontrib><title>THE REGULARIZED ORTHOGONAL FUNCTIONAL MATCHING PURSUIT FOR ILL-POSED INVERSE PROBLEMS</title><title>SIAM journal on numerical analysis</title><description>We propose a novel algorithm to solve a general class of linear ill-posed inverse problems. For our numerical tests, we consider ill-posed problems on the sphere as they appear in the geosciences. Based on an iterative greedy algorithm, called the orthogonal matching pursuit, the signal is expanded in terms of trial functions which are picked from a large redundant set of functions, the so-called dictionary. The method is able to combine arbitrary trial functions which is a great advantage to former approximation algorithms. In particular, we combine orthogonal polynomials (such as spherical harmonics in the case of the sphere) of low degrees with localized trial functions such as wavelets and/or scaling functions for the reconstruction of global trends and regional details of the signal, respectively. Since we deal with ill-posed problems, we use a Tikhonov-type regularization with a penalty term based on a (spherical) Sobolev norm. There is no need to solve any system of equations or any integration problem which provides the ability to handle very large amounts of data or extremely scattered data sets. The outcome of the algorithm is a smooth and sparse approximation of the unknown signal which is locally adapted to the detail structure of the signal as well as to the density of the given data. Moreover, in the case that wavelets are contained in the dictionary, we additionally obtain a multiresolution of the signal. Several numerical experiments are presented.</description><issn>0036-1429</issn><issn>1095-7170</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNo9kD9PwzAUxC0EEqUw8AGQvDIE_Op_8RiKm1py48hJGFiiJE0kKlBR0oVvX0NRdcM7nX7vhkPoHsgTAJXPwIAQIhS_QDMgikcSJLlEM0KoiIAt1DW6maZdYGgMdIaqcq2x12llE2_e9St2vly71GWJxasqW5bmz26Scrk2WYrzyheVKfHKeWysjXJXhCeTvWlfaJx792L1prhFV0PzOfV3_3eOqpUODZF1qVkmNuoWHA6RYEQ0stuCgrjlreh6BoLBIkgAGYZGsk6InoeoJ6ylSrXbVrU8pk28pVzSOXo89XbjfprGfqi_x4-vZvypgdS_e9TnPQL7cGJ302E_nkFGFQEZ2CMcpFMU</recordid><startdate>20160101</startdate><enddate>20160101</enddate><creator>MICHEL, VOLKER</creator><creator>TELSCHOW, ROGER</creator><general>Society for Industrial and Applied Mathematics</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20160101</creationdate><title>THE REGULARIZED ORTHOGONAL FUNCTIONAL MATCHING PURSUIT FOR ILL-POSED INVERSE PROBLEMS</title><author>MICHEL, VOLKER ; TELSCHOW, ROGER</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c251t-6406a7cd1918b5b6ce416412121610ffa74c66e5412e04b399bdb9b583a8d3573</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>MICHEL, VOLKER</creatorcontrib><creatorcontrib>TELSCHOW, ROGER</creatorcontrib><collection>CrossRef</collection><jtitle>SIAM journal on numerical analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>MICHEL, VOLKER</au><au>TELSCHOW, ROGER</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>THE REGULARIZED ORTHOGONAL FUNCTIONAL MATCHING PURSUIT FOR ILL-POSED INVERSE PROBLEMS</atitle><jtitle>SIAM journal on numerical analysis</jtitle><date>2016-01-01</date><risdate>2016</risdate><volume>54</volume><issue>1</issue><spage>262</spage><epage>287</epage><pages>262-287</pages><issn>0036-1429</issn><eissn>1095-7170</eissn><abstract>We propose a novel algorithm to solve a general class of linear ill-posed inverse problems. For our numerical tests, we consider ill-posed problems on the sphere as they appear in the geosciences. Based on an iterative greedy algorithm, called the orthogonal matching pursuit, the signal is expanded in terms of trial functions which are picked from a large redundant set of functions, the so-called dictionary. The method is able to combine arbitrary trial functions which is a great advantage to former approximation algorithms. In particular, we combine orthogonal polynomials (such as spherical harmonics in the case of the sphere) of low degrees with localized trial functions such as wavelets and/or scaling functions for the reconstruction of global trends and regional details of the signal, respectively. Since we deal with ill-posed problems, we use a Tikhonov-type regularization with a penalty term based on a (spherical) Sobolev norm. There is no need to solve any system of equations or any integration problem which provides the ability to handle very large amounts of data or extremely scattered data sets. The outcome of the algorithm is a smooth and sparse approximation of the unknown signal which is locally adapted to the detail structure of the signal as well as to the density of the given data. Moreover, in the case that wavelets are contained in the dictionary, we additionally obtain a multiresolution of the signal. Several numerical experiments are presented.</abstract><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/141000695</doi><tpages>26</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0036-1429
ispartof SIAM journal on numerical analysis, 2016-01, Vol.54 (1), p.262-287
issn 0036-1429
1095-7170
language eng
recordid cdi_crossref_primary_10_1137_141000695
source SIAM Journals; JSTOR Mathematics & Statistics; JSTOR Archive Collection A-Z Listing
title THE REGULARIZED ORTHOGONAL FUNCTIONAL MATCHING PURSUIT FOR ILL-POSED INVERSE PROBLEMS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T12%3A13%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=THE%20REGULARIZED%20ORTHOGONAL%20FUNCTIONAL%20MATCHING%20PURSUIT%20FOR%20ILL-POSED%20INVERSE%20PROBLEMS&rft.jtitle=SIAM%20journal%20on%20numerical%20analysis&rft.au=MICHEL,%20VOLKER&rft.date=2016-01-01&rft.volume=54&rft.issue=1&rft.spage=262&rft.epage=287&rft.pages=262-287&rft.issn=0036-1429&rft.eissn=1095-7170&rft_id=info:doi/10.1137/141000695&rft_dat=%3Cjstor_cross%3E43901711%3C/jstor_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_jstor_id=43901711&rfr_iscdi=true