{"title":"Soft extrapolation of bandlimited functions","authors":"Dmitry Batenkov, L. Demanet","doi":"10.1109/CAMSAP.2017.8313182","DOIUrl":null,"url":null,"abstract":"Soft extrapolation refers to the problem of recovering a function from its samples multiplied by a fast-decaying window — in this note a narrow Gaussian. The question is akin to deconvolution, but leverages smoothness of the function in order to achieve stable recovery over an interval potentially larger than the essential support of the window. In case the function is bandlimited, we provide an error bound for extrapolation by a least-squares polynomial fit of a well-chosen degree: it is (morally) proportional to a fractional power of the perturbation level, which goes from 1 near the available samples, to 0 when the extrapolation distance reaches the characteristic smoothness length scale of the function. This bound is minimax in the sense that no algorithm can yield a meaningfully lower error over the same smoothness class. The result in this note can be put in the context of blind superresolution, where it corresponds to the limit of a single spike corrupted by a compactly-supported blur.","PeriodicalId":315977,"journal":{"name":"2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMSAP.2017.8313182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Soft extrapolation refers to the problem of recovering a function from its samples multiplied by a fast-decaying window — in this note a narrow Gaussian. The question is akin to deconvolution, but leverages smoothness of the function in order to achieve stable recovery over an interval potentially larger than the essential support of the window. In case the function is bandlimited, we provide an error bound for extrapolation by a least-squares polynomial fit of a well-chosen degree: it is (morally) proportional to a fractional power of the perturbation level, which goes from 1 near the available samples, to 0 when the extrapolation distance reaches the characteristic smoothness length scale of the function. This bound is minimax in the sense that no algorithm can yield a meaningfully lower error over the same smoothness class. The result in this note can be put in the context of blind superresolution, where it corresponds to the limit of a single spike corrupted by a compactly-supported blur.