Decoupling noise and features via weighted ℓ1-analysis compressed sensing

ACM Trans. Graph. Pub Date : 2014-04-08 DOI:10.1145/2557449
Ruimin Wang, Zhouwang Yang, Ligang Liu, J. Deng, Falai Chen
{"title":"Decoupling noise and features via weighted ℓ1-analysis compressed sensing","authors":"Ruimin Wang, Zhouwang Yang, Ligang Liu, J. Deng, Falai Chen","doi":"10.1145/2557449","DOIUrl":null,"url":null,"abstract":"Many geometry processing applications are sensitive to noise and sharp features. Although there are a number of works on detecting noise and sharp features in the literature, they are heuristic. On one hand, traditional denoising methods use filtering operators to remove noise, however, they may blur sharp features and shrink the object. On the other hand, noise makes detection of features, which relies on computation of differential properties, unreliable and unstable. Therefore, detecting noise and features on discrete surfaces still remains challenging.\n In this article, we present an approach for decoupling noise and features on 3D shapes. Our approach consists of two phases. In the first phase, a base mesh is estimated from the input noisy data by a global Laplacian regularization denoising scheme. The estimated base mesh is guaranteed to asymptotically converge to the true underlying surface with probability one as the sample size goes to infinity. In the second phase, an ℓ1-analysis compressed sensing optimization is proposed to recover sharp features from the residual between base mesh and input mesh. This is based on our discovery that sharp features can be sparsely represented in some coherent dictionary which is constructed by the pseudo-inverse matrix of the Laplacian of the shape. The features are recovered from the residual in a progressive way. Theoretical analysis and experimental results show that our approach can reliably and robustly remove noise and extract sharp features on 3D shapes.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"18 1","pages":"18:1-18:12"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"97","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Trans. Graph.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2557449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 97

Abstract

Many geometry processing applications are sensitive to noise and sharp features. Although there are a number of works on detecting noise and sharp features in the literature, they are heuristic. On one hand, traditional denoising methods use filtering operators to remove noise, however, they may blur sharp features and shrink the object. On the other hand, noise makes detection of features, which relies on computation of differential properties, unreliable and unstable. Therefore, detecting noise and features on discrete surfaces still remains challenging. In this article, we present an approach for decoupling noise and features on 3D shapes. Our approach consists of two phases. In the first phase, a base mesh is estimated from the input noisy data by a global Laplacian regularization denoising scheme. The estimated base mesh is guaranteed to asymptotically converge to the true underlying surface with probability one as the sample size goes to infinity. In the second phase, an ℓ1-analysis compressed sensing optimization is proposed to recover sharp features from the residual between base mesh and input mesh. This is based on our discovery that sharp features can be sparsely represented in some coherent dictionary which is constructed by the pseudo-inverse matrix of the Laplacian of the shape. The features are recovered from the residual in a progressive way. Theoretical analysis and experimental results show that our approach can reliably and robustly remove noise and extract sharp features on 3D shapes.
通过加权1-分析压缩感知来解耦噪声和特征
许多几何处理应用对噪声和尖锐特征很敏感。虽然文献中有许多关于噪声和尖锐特征检测的工作,但它们都是启发式的。传统的去噪方法一方面使用滤波算子去噪,但可能会模糊锐利的特征,使目标缩小。另一方面,噪声使得依赖于微分性质计算的特征检测变得不可靠和不稳定。因此,在离散表面上检测噪声和特征仍然具有挑战性。在本文中,我们提出了一种将三维形状上的噪声和特征解耦的方法。我们的方法包括两个阶段。在第一阶段,通过一种全局拉普拉斯正则化去噪方案从输入的噪声数据中估计出一个基网格。当样本量趋于无穷大时,保证估计的基网格以概率为1的概率渐近收敛于真实的下表面。在第二阶段,提出了一种基于1-分析的压缩感知优化方法,从基网格和输入网格之间的残差中恢复尖锐特征。这是基于我们发现尖锐特征可以稀疏地表示在由形状的拉普拉斯矩阵的伪逆矩阵构造的相干字典中。从残差中逐步恢复特征。理论分析和实验结果表明,该方法能够可靠、鲁棒地去除噪声并提取出三维形状上的尖锐特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信