Blind hierarchical deconvolution

Blind hierarchical deconvolution

Deconvolution is a fundamental inverse problem in signal processing and the prototypical model for recovering a signal from its noisy measurement. Nevertheless, the majority of model-based inversion techniques require knowledge on the convolution kernel to recover an accurate reconstruction and addi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Arjas, Arttu, Roininen, Lassi, Sillanpää, Mikko J, Hauptmann, Andreas
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Learning
Statistics - Machine Learning
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Arjas, Arttu
Roininen, Lassi
Sillanpää, Mikko J
Hauptmann, Andreas
description Deconvolution is a fundamental inverse problem in signal processing and the prototypical model for recovering a signal from its noisy measurement. Nevertheless, the majority of model-based inversion techniques require knowledge on the convolution kernel to recover an accurate reconstruction and additionally prior assumptions on the regularity of the signal are needed. To overcome these limitations, we parametrise the convolution kernel and prior length-scales, which are then jointly estimated in the inversion procedure. The proposed framework of blind hierarchical deconvolution enables accurate reconstructions of functions with varying regularity and unknown kernel size and can be solved efficiently with an empirical Bayes two-step procedure, where hyperparameters are first estimated by optimisation and other unknowns then by an analytical formula.
doi_str_mv 10.48550/arxiv.2007.11391
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2007_11391</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2007_11391</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-3406d9018203dd0b3e3b851ac8541999f5551647767c6bb5835f0b819e90c2133</originalsourceid><addsrcrecordid>eNotzrtqw0AQQNFtUgQ7H5DK-gEpMxrNPkpb5AUGN-rFvoQXZMlsHJH8fYjt6naXI8QzQtVoZnix-SctVQ2gKkQy-CiK3ZimUBxTzDb7Y_J2LEL087TM4_clzdNaPAx2_IpP965E9_batR_l_vD-2W73pZUKS2pABgOoa6AQwFEkpxmt19ygMWZgZpSNUlJ56Rxr4gGcRhMN-BqJVmJz216J_Tmnk82__T-1v1LpD2fGNq8</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Blind hierarchical deconvolution</title><source>arXiv.org</source><creator>Arjas, Arttu ; Roininen, Lassi ; Sillanpää, Mikko J ; Hauptmann, Andreas</creator><creatorcontrib>Arjas, Arttu ; Roininen, Lassi ; Sillanpää, Mikko J ; Hauptmann, Andreas</creatorcontrib><description>Deconvolution is a fundamental inverse problem in signal processing and the prototypical model for recovering a signal from its noisy measurement. Nevertheless, the majority of model-based inversion techniques require knowledge on the convolution kernel to recover an accurate reconstruction and additionally prior assumptions on the regularity of the signal are needed. To overcome these limitations, we parametrise the convolution kernel and prior length-scales, which are then jointly estimated in the inversion procedure. The proposed framework of blind hierarchical deconvolution enables accurate reconstructions of functions with varying regularity and unknown kernel size and can be solved efficiently with an empirical Bayes two-step procedure, where hyperparameters are first estimated by optimisation and other unknowns then by an analytical formula.</description><identifier>DOI: 10.48550/arxiv.2007.11391</identifier><language>eng</language><subject>Computer Science - Learning ; Statistics - Machine Learning</subject><creationdate>2020-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2007.11391$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2007.11391$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Arjas, Arttu</creatorcontrib><creatorcontrib>Roininen, Lassi</creatorcontrib><creatorcontrib>Sillanpää, Mikko J</creatorcontrib><creatorcontrib>Hauptmann, Andreas</creatorcontrib><title>Blind hierarchical deconvolution</title><description>Deconvolution is a fundamental inverse problem in signal processing and the prototypical model for recovering a signal from its noisy measurement. Nevertheless, the majority of model-based inversion techniques require knowledge on the convolution kernel to recover an accurate reconstruction and additionally prior assumptions on the regularity of the signal are needed. To overcome these limitations, we parametrise the convolution kernel and prior length-scales, which are then jointly estimated in the inversion procedure. The proposed framework of blind hierarchical deconvolution enables accurate reconstructions of functions with varying regularity and unknown kernel size and can be solved efficiently with an empirical Bayes two-step procedure, where hyperparameters are first estimated by optimisation and other unknowns then by an analytical formula.</description><subject>Computer Science - Learning</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrtqw0AQQNFtUgQ7H5DK-gEpMxrNPkpb5AUGN-rFvoQXZMlsHJH8fYjt6naXI8QzQtVoZnix-SctVQ2gKkQy-CiK3ZimUBxTzDb7Y_J2LEL087TM4_clzdNaPAx2_IpP965E9_batR_l_vD-2W73pZUKS2pABgOoa6AQwFEkpxmt19ygMWZgZpSNUlJ56Rxr4gGcRhMN-BqJVmJz216J_Tmnk82__T-1v1LpD2fGNq8</recordid><startdate>20200722</startdate><enddate>20200722</enddate><creator>Arjas, Arttu</creator><creator>Roininen, Lassi</creator><creator>Sillanpää, Mikko J</creator><creator>Hauptmann, Andreas</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20200722</creationdate><title>Blind hierarchical deconvolution</title><author>Arjas, Arttu ; Roininen, Lassi ; Sillanpää, Mikko J ; Hauptmann, Andreas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-3406d9018203dd0b3e3b851ac8541999f5551647767c6bb5835f0b819e90c2133</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Learning</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Arjas, Arttu</creatorcontrib><creatorcontrib>Roininen, Lassi</creatorcontrib><creatorcontrib>Sillanpää, Mikko J</creatorcontrib><creatorcontrib>Hauptmann, Andreas</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Arjas, Arttu</au><au>Roininen, Lassi</au><au>Sillanpää, Mikko J</au><au>Hauptmann, Andreas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Blind hierarchical deconvolution</atitle><date>2020-07-22</date><risdate>2020</risdate><abstract>Deconvolution is a fundamental inverse problem in signal processing and the prototypical model for recovering a signal from its noisy measurement. Nevertheless, the majority of model-based inversion techniques require knowledge on the convolution kernel to recover an accurate reconstruction and additionally prior assumptions on the regularity of the signal are needed. To overcome these limitations, we parametrise the convolution kernel and prior length-scales, which are then jointly estimated in the inversion procedure. The proposed framework of blind hierarchical deconvolution enables accurate reconstructions of functions with varying regularity and unknown kernel size and can be solved efficiently with an empirical Bayes two-step procedure, where hyperparameters are first estimated by optimisation and other unknowns then by an analytical formula.</abstract><doi>10.48550/arxiv.2007.11391</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2007.11391
ispartof
issn
language eng
recordid cdi_arxiv_primary_2007_11391
source arXiv.org
subjects Computer Science - Learning
Statistics - Machine Learning
title Blind hierarchical deconvolution
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T21%3A15%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Blind%20hierarchical%20deconvolution&rft.au=Arjas,%20Arttu&rft.date=2020-07-22&rft_id=info:doi/10.48550/arxiv.2007.11391&rft_dat=%3Carxiv_GOX%3E2007_11391%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true