We present an anisotropic mesh denoising algorithm that is effective, simple and fast. This is accomplished by filtering vertices of the mesh in the normal direction using local neighborhoods. Motivated by the impressive results of bilateral filtering for image denoising, we adopt it to denoise 3D meshes; addressing the specific issues required in the transition from two-dimensions to manifolds in three dimensions. We show that the proposed method successfully removes noise from meshes while preserving features. Furthermore, the presented algorithm excels in its simplicity both in concept and implementation.
%0 Journal Article
%1 882368
%A Fleishman, Shachar
%A Drori, Iddo
%A Cohen-Or, Daniel
%C New York, NY, USA
%D 2003
%I ACM
%J ACM Trans. Graph.
%K bilateralfiltering computationalgeometry computergraphics da denoising fairing mesh reconstruction smoothing toread
%N 3
%P 950--953
%R http://doi.acm.org/10.1145/882262.882368
%T Bilateral mesh denoising
%U http://portal.acm.org/citation.cfm?id=882368
%V 22
%X We present an anisotropic mesh denoising algorithm that is effective, simple and fast. This is accomplished by filtering vertices of the mesh in the normal direction using local neighborhoods. Motivated by the impressive results of bilateral filtering for image denoising, we adopt it to denoise 3D meshes; addressing the specific issues required in the transition from two-dimensions to manifolds in three dimensions. We show that the proposed method successfully removes noise from meshes while preserving features. Furthermore, the presented algorithm excels in its simplicity both in concept and implementation.
@article{882368,
abstract = {We present an anisotropic mesh denoising algorithm that is effective, simple and fast. This is accomplished by filtering vertices of the mesh in the normal direction using local neighborhoods. Motivated by the impressive results of bilateral filtering for image denoising, we adopt it to denoise 3D meshes; addressing the specific issues required in the transition from two-dimensions to manifolds in three dimensions. We show that the proposed method successfully removes noise from meshes while preserving features. Furthermore, the presented algorithm excels in its simplicity both in concept and implementation.},
added-at = {2008-11-25T17:49:11.000+0100},
address = {New York, NY, USA},
author = {Fleishman, Shachar and Drori, Iddo and Cohen-Or, Daniel},
biburl = {https://www.bibsonomy.org/bibtex/286b6bf2004d1240c45e33fe41e84e083/rwoz},
description = {Bilateral mesh denoising},
doi = {http://doi.acm.org/10.1145/882262.882368},
interhash = {629aeb9d75b16d3c485801fd8d982713},
intrahash = {86b6bf2004d1240c45e33fe41e84e083},
issn = {0730-0301},
journal = {ACM Trans. Graph.},
keywords = {bilateralfiltering computationalgeometry computergraphics da denoising fairing mesh reconstruction smoothing toread},
note = {easily impled & impressive result},
number = 3,
pages = {950--953},
publisher = {ACM},
timestamp = {2008-12-19T17:56:56.000+0100},
title = {Bilateral mesh denoising},
url = {http://portal.acm.org/citation.cfm?id=882368},
volume = 22,
year = 2003
}