Skip to main content

A Robust Algorithm for Denoising Meshes with High-Resolution Details

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNIP,volume 7633)

Abstract

In this paper, we present a robust and efficient mesh denoising algorithm which preserves high-resolution details very well. Our method is a three-stage algorithm. Firstly, we modify a robust density-based clustering method and apply it to the face neighborhood of each triangular face to extract a subset of neighbors which belong to the same cluster as the central face. Because the faces within the extracted subset are not distributed across high-resolution details, we filter the central face normal iteratively within this subset to remove noise and preserve such details as much as possible. Finally, vertex positions are updated to be consistent with the filtered face normals using a least-squares formulation. Experiments on various types of meshes indicate that our method has advantages over previous surface denoising methods.

Keywords

  • Mesh Denoising
  • High-Resolution Details
  • Face Neighborhood
  • Normal Clustering
  • Normal Filtering

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Field, D.: Laplacian smoothing and Delaunay triangulations. Communications in Applied Numerical Methods 4(6), 709–712 (1988)

    CrossRef  MATH  Google Scholar 

  2. Taubin, G.: A signal processing approach to fair surface design. In: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, pp. 351–358 (1995)

    Google Scholar 

  3. Desbrun, M., Meyer, M., Schröder, P., Barr, A.: Implicit fairing of irregular meshes using diffusion and curvature flow. In: Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, pp. 317–324 (1999)

    Google Scholar 

  4. Ohtake, Y., Belyaev, A., Bogaevski, I.: Polyhedral surface smoothing with simultaneous mesh regularization. In: Proceedings of Geometric Modeling and Processing 2000. Theory and Applications, pp. 229–237 (2000)

    Google Scholar 

  5. Clarenz, U., Diewald, U., Rumpf, M.: Anisotropic geometric diffusion in surface processing. In: Proceedings of the Conference on Visualization 2000, pp. 397–405 (2000)

    Google Scholar 

  6. Desbrun, M., Meyer, M., Schröder, P., Barr, A.: Anisotropic feature-preserving denoising of height fields and bivariate data. Graphics Interface 11(10), 145–152 (2000)

    Google Scholar 

  7. Bajaj, C., Xu, G.: Anisotropic diffusion of surfaces and functions on surfaces. ACM Transactions on Graphics (TOG) 22(1), 4–32 (2003)

    CrossRef  Google Scholar 

  8. Fleishman, S., Drori, I., Cohen-Or, D.: Bilateral mesh denoising. In: International Conference on Computer Graphics and Interactive Techniques, pp. 950–953 (2003)

    Google Scholar 

  9. Jones, T., Durand, F., Desbrun, M.: Non-iterative, feature-preserving mesh smoothing. ACM Transactions on Graphics 22(3), 943–949 (2003)

    CrossRef  Google Scholar 

  10. Tomasi, C., Manduchi, R.: Bilateral filtering for gray and color images. In: Proceedings of the Sixth International Conference on Computer Vision, p. 839 (1998)

    Google Scholar 

  11. Hildebrandt, K., Polthier, K.: Anisotropic filtering of non-linear surface features. In: Computer Graphics Forum, vol. 23, pp. 391–400. Blackwell Publishing (2004)

    Google Scholar 

  12. Yagou, H., Ohtake, Y., Belyaev, A.: Mesh denoising via iterative alpha-trimming and nonlinear diffusion of normals with automatic thresholding. In: Proc. Computer Graphics Intl., pp. 1–6 (2003)

    Google Scholar 

  13. Yu, Y., Zhou, K., Xu, D., Shi, X., Bao, H., Guo, B., Shum, H.: Mesh editing with poisson-based gradient field manipulation. ACM Transactions on Graphics (TOG) 23(3), 644–651 (2004)

    CrossRef  Google Scholar 

  14. Lee, K., Wang, W.: Feature-preserving mesh denoising via bilateral normal filtering. In: Ninth International Conference on Computer Aided Design and Computer Graphics, p. 6 (2005)

    Google Scholar 

  15. Sun, X., Rosin, P., Martin, R., Langbein, F.: Fast and effective feature-preserving mesh denoising. IEEE Transactions on Visualization and Computer Graphics 13(5), 925–938 (2007)

    CrossRef  Google Scholar 

  16. Fan, H., Yu, Y., Peng, Q.: Robust Feature-Preserving Mesh Denoising Based on Consistent Sub-Neighborhoods. IEEE Transactions on Visualization and Computer Graphics 16 (2010)

    Google Scholar 

  17. Shen, Y., Barner, K.: Fuzzy vector median-based surface smoothing. IEEE Transactions on Visualization and Computer Graphics 10(3), 252–265 (2004)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fan, H., Peng, Q., Yu, Y. (2012). A Robust Algorithm for Denoising Meshes with High-Resolution Details. In: Hu, SM., Martin, R.R. (eds) Computational Visual Media. CVM 2012. Lecture Notes in Computer Science, vol 7633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34263-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34263-9_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34262-2

  • Online ISBN: 978-3-642-34263-9

  • eBook Packages: Computer ScienceComputer Science (R0)