Skip to main content

Feature Extraction from the Mesh Model with Some Noise

  • Conference paper
Smart Graphics (SG 2007)

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

Included in the following conference series:

  • 760 Accesses

Abstract

This paper presents a new feature extraction method on the mesh model with some noise. Firstly, we compute Mesh saliency value of every vertex on the mesh model. Then we set it as the weighted factor and employ the weighted bi-quadratic Bézier surface to fit the vertex and its neighborhood by the least square method. So we obtain the smoothed principal curvature and principal direction of every vertex, which can be used for detecting and extracting the feature point. The advantage of our method is that we can achieve the better feature extraction result from the mesh model with some noise.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ohtake, Y., Belyaev, A., Seidel, H.: Ridge-valley lines on meshes via implicit surface fitting. ACM Trans Graphics 23(3), 609–612 (2004)

    Article  Google Scholar 

  2. Kim, S., Kim, C.: Finding ridges and valleys in a discrete surface using a modified MLS approximation. Computer-Aided Design 38(2), 173–180 (2006)

    Article  Google Scholar 

  3. Milroy, M., Bradley, C., Vickers, G.: Segmentation of a wrap-around model using an active contour. Computer-Aided Design 29(4), 299–320 (1997)

    Article  Google Scholar 

  4. Goldfeather, J., Interrante, V.: A novel cubic-order algorithm for approximating principal direction vectors. ACM Trans Graphics 23(1), 45–63 (2004)

    Article  Google Scholar 

  5. Sapidis, N., Besl, P.: Direct construction of polynomial surfaces from dense range images through region growing. ACM Trans. On Graphics 14(2), 171–200 (1995)

    Article  Google Scholar 

  6. Chen, Y., Liu, C.: Quadric surface extraction using genetic algorithms. Computer-Aided Design 31(2), 101–110 (1999)

    Article  MATH  Google Scholar 

  7. Belyaev, A., Anoshkina, E.: Detection of surface creases in range data. In: Eleventh IMA Conference on The Mathematics of Surface (2005)

    Google Scholar 

  8. Lee, C., Varshney, A., Jacobs, D.: Mesh saliency. In: Proceedings of SIGGRAPH (2005)

    Google Scholar 

  9. Razdan, A., Bae, M.: Curvature estimation scheme for triangle meshes using biquadratic Bézier patches. Computer-Aided Design 37(14), 1481–1489 (2005)

    Article  Google Scholar 

  10. Stylianou, G., Falin, G.: Crest lines for surface segmentation and flattening. IEEE Trans Vis. Comput Graphics 10(5), 536–544 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andreas Butz Brian Fisher Antonio Krüger Patrick Olivier Shigeru Owada

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Z., Ma, L., Zheng, Z., Tan, W. (2007). Feature Extraction from the Mesh Model with Some Noise. In: Butz, A., Fisher, B., Krüger, A., Olivier, P., Owada, S. (eds) Smart Graphics. SG 2007. Lecture Notes in Computer Science, vol 4569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73214-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73214-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73213-6

  • Online ISBN: 978-3-540-73214-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics