The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Bilateral mesh denoising
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
A signal processing approach to fair surface design
Taubin, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218473 · Cited by 1,855
Fast bilateral filtering for the display of high-dynamic-range images
Durand, F., & Dorsey, J. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566574 · Cited by 1,547
Implicit fairing of irregular meshes using diffusion and curvature flow
Desbrun, M., Meyer, M., Schröder, P., & Barr, A. H. (1999) · Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99 · doi:10.1145/311535.311576 · Cited by 1,538
Fast bilateral filtering for the display of high-dynamic-range images
Durand, F., & Dorsey, J. (2002) · ACM Transactions on Graphics · doi:10.1145/566654.566574 · Cited by 1,003
On the origin of the bilateral filter and ways to improve it
Elad, M. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.801126 · Cited by 791
Barash, D. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1008390 · Cited by 514
Multiresolution signal processing for meshes
Guskov, I., Sweldens, W., & Schröder, P. (1999) · Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99 · doi:10.1145/311535.311577 · Cited by 489
Non-iterative, feature-preserving mesh smoothing
Jones, T. R., Durand, F., & Desbrun, M. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882367 · Cited by 421
Non-iterative, feature-preserving mesh smoothing
Jones, T. R., Durand, F., & Desbrun, M. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882367 · Cited by 335
A Simple Algorithm for Surface Denoising
Peng, J., Strela, V., & Zorin, D. (2001) · Cited by 63
Cited by
Digital photography with flash and no-flash image pairs
Petschnigg, G., Szeliski, R., Agrawala, M., Cohen, M., Hoppe, H., & Toyama, K. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015777 · Cited by 1,056
A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
Paris, S., & Durand, F. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-007-0110-8 · Cited by 797
Bilateral Filtering: Theory and Applications
Paris, S., Kornprobst, P., Tumblin, J., & Durand, F. (2009) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000020 · Cited by 586
Robust moving least-squares fitting with sharp features
Fleishman, S., Cohen-Or, D., & Silva, C. T. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073227 · Cited by 580
Self-citationMesh editing with poisson-based gradient field manipulation
Yu, Y., Zhou, K., Xu, D., Shi, X., Bao, H., Guo, B., & Shum, H.-Y. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015774 · Cited by 520
Metadata
- Authors
- Fleishman, S., Drori, I., & Cohen-Or, D.
- Venue
- ACM SIGGRAPH 2003 Papers
- Publisher
- ACM
- Published
- 2003-07
- Pages
- 950-953
- OpenAlex
- W1984713107
- Cited by
- 623
- References
- 15
- FWCI
- 57.48
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.