Optimally sparse 3D approximations using shearlet representations

Q3 Mathematics
K. Guo, D. Labate
{"title":"Optimally sparse 3D approximations using shearlet representations","authors":"K. Guo, D. Labate","doi":"10.3934/ERA.2010.17.125","DOIUrl":null,"url":null,"abstract":"This paper introduces a new Parseval frame, based on the 3-D \nshearlet representation, which is especially designed to capture \ngeometric features such as discontinuous boundaries with very high \nefficiency. We show that this approach exhibits essentially optimal \napproximation properties for 3-D functions $f$ which are smooth \naway from discontinuities along $C^2$ surfaces. In fact, the $N$ \nterm approximation $f_N^S$ obtained by selecting the $N$ largest \ncoefficients from the shearlet expansion of $f$ satisfies the \nasymptotic estimate \n \n ||$f-f_N^S$||$_2^2$ ≍ $N^{-1} (\\log N)^2, as \nN \\to \\infty.$ Up to the logarithmic factor, \nthis is the optimal behavior for functions in this class and \nsignificantly outperforms wavelet approximations, which only yields \na $N^{-1/2}$ rate. Indeed, the wavelet approximation rate was the \nbest published nonadaptive result so far and the result presented in \nthis paper is the first nonadaptive construction which is provably \noptimal (up to a loglike factor) for this class of 3-D data. \n \n Our estimate is consistent with the corresponding \n2-D (essentially) optimally sparse approximation results obtained \nby the authors using 2-D shearlets and by Candes and Donoho using \ncurvelets.","PeriodicalId":53151,"journal":{"name":"Electronic Research Announcements in Mathematical Sciences","volume":"8 1","pages":"125-137"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Research Announcements in Mathematical Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/ERA.2010.17.125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 25

Abstract

This paper introduces a new Parseval frame, based on the 3-D shearlet representation, which is especially designed to capture geometric features such as discontinuous boundaries with very high efficiency. We show that this approach exhibits essentially optimal approximation properties for 3-D functions $f$ which are smooth away from discontinuities along $C^2$ surfaces. In fact, the $N$ term approximation $f_N^S$ obtained by selecting the $N$ largest coefficients from the shearlet expansion of $f$ satisfies the asymptotic estimate ||$f-f_N^S$||$_2^2$ ≍ $N^{-1} (\log N)^2, as N \to \infty.$ Up to the logarithmic factor, this is the optimal behavior for functions in this class and significantly outperforms wavelet approximations, which only yields a $N^{-1/2}$ rate. Indeed, the wavelet approximation rate was the best published nonadaptive result so far and the result presented in this paper is the first nonadaptive construction which is provably optimal (up to a loglike factor) for this class of 3-D data. Our estimate is consistent with the corresponding 2-D (essentially) optimally sparse approximation results obtained by the authors using 2-D shearlets and by Candes and Donoho using curvelets.
使用shearlet表示的最佳稀疏3D近似
本文介绍了一种新的Parseval框架,该框架基于三维剪切波表示,专门用于高效捕获不连续边界等几何特征。我们表明,这种方法对三维函数$f$具有本质上最优的近似性质,这些函数沿着$C^2$表面平滑地远离不连续。事实上,通过从$f$的shearlet展开中选择$N$最大系数得到的$N$项近似$f_N^S$满足渐近估计|| $f-f_N^S$ || $_2^2$ ̄$N^{-1} (\log N)^2, as N \to \infty.$直到对数因子,这是该类函数的最优行为,并且显著优于小波近似,小波近似只产生$N^{-1/2}$速率。事实上,小波近似率是迄今为止发表的最好的非自适应结果,而本文提出的结果是第一个可证明对这类三维数据最优(达到loglike factor)的非自适应结构。我们的估计与作者使用二维shearlet和Candes和Donoho使用曲线得到的相应的二维(本质上)最优稀疏近似结果一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Electronic Research Archive (ERA), formerly known as Electronic Research Announcements in Mathematical Sciences, rapidly publishes original and expository full-length articles of significant advances in all branches of mathematics. All articles should be designed to communicate their contents to a broad mathematical audience and must meet high standards for mathematical content and clarity. After review and acceptance, articles enter production for immediate publication. ERA is the continuation of Electronic Research Announcements of the AMS published by the American Mathematical Society, 1995—2007
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信