Image inpainting: theoretical analysis and comparison of algorithms
Image inpainting: theoretical analysis and comparison of algorithms
复制标题
图像修复：理论分析与算法比较
DOI：
10.1117/12.2025401
复制
发表时间：
2013
影响因子：
2.5
通讯作者：
Wang
中科院分区：
文献类型：
--
作者：
E. King;Gitta Kutyniok;Wang
数据分析中的一个问题是数据不完整，例如带有划痕的照片或用少于必要的传感器收集的地震数据。有一个统一的方法来解决这个问题和数据分离的问题：即，最小化关于特定帧的分析（而不是合成）系数的范数。分析这种方法使用聚类稀疏的概念，导致理论界和结果，这将是。此外，必要条件的框架，以导致足够好的解决方案将显示，这个理论框架将被用来表明，剪切波是能够inpaint比小波更大的差距。最后，将展示将这种修复方法与许多其他方法进行比较的数值实验结果。
An issue in data analysis is that of incomplete data, for example a photograph with scratches or seismic data collected with fewer than necessary sensors. There exists a unified approach to solving this problem and that of data separation: namely, minimizing the norm of the analysis (rather than synthesis) coefficients with respect to particular frame(s).There have been a number of successful applications of this method recently. Analyzing this method using the concept of clustered sparsity leads to theoretical bounds and results, which will be presented. Furthermore, necessary conditions for the frames to lead to sufficiently good solutions will be shown, and this theoretical framework will be use to show that shearlets are able to inpaint larger gaps than wavelets. Finally, the results of numerical experiments comparing this approach to inpainting to numerous others will be presented.
影响因子：
3
作者：
D. Donoho;Gitta Kutyniok
通讯作者：
D. Donoho;Gitta Kutyniok