Skip to main content

A Robust Approach to Multi-feature Based Mesh Segmentation Using Adaptive Density Estimation

  • Conference paper
Book cover Computer Analysis of Images and Patterns (CAIP 2011)

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

Included in the following conference series:

  • 1885 Accesses

Abstract

In this paper, a new and robust approach to mesh segmentation is presented. There are various algorithms which deliver satisfying results on clean 3D models. However, many reverse-engineering applications in computer vision such as 3D reconstruction produce extremely noisy or even incomplete data. The presented segmentation algorithm copes with this challenge by a robust semi-global clustering scheme and a cost-function that is based on a probabilistic model. Vision based reconstruction methods are able to generate colored meshes and it is shown, how the vertex color can be used as a supportive feature. A probabilistic framework allows the algorithm to be easily extended by other user defined features. The segmentation scheme is a local iterative optimization embedded in a hierarchical clustering technique. The presented method has been successfully tested on various real world examples.

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. Snavely, N., Seitz, S.M., Szeliski, R.: Modeling the world from internet photo collections. Int. J. Comput. Vision 80, 189–210 (2008)

    Article  Google Scholar 

  2. Moon, T.K.: The expectation-maximization algorithm. IEEE Signal Processing Magazine 13(6), 47–60 (1996)

    Article  Google Scholar 

  3. Heller, K., Ghahramani, Z.: Bayesian hierarchical clustering. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 297–304. ACM, New York (2005)

    Google Scholar 

  4. Anderberg, M.R.: Cluster Analysis for Applications. Ac. Press, New York (1973)

    MATH  Google Scholar 

  5. Garland, M., Willmott, A., Heckbert, P.S.: Hierarchical face clustering on polygonal surfaces. In: Proceedings of the 2001 Symposium on Interactive 3D Graphics, I3D 2001, pp. 49–58. ACM, NY (2001)

    Google Scholar 

  6. Attene, M., Falcidieno, B., Spagnuolo, M.: Hierarchical mesh segmentation based on fitting primitives. Vis. Comput. 22, 181–193 (2006)

    Article  Google Scholar 

  7. Cohen-Steiner, D., Alliez, P., Desbrun, M.: Variational shape approximation. In: ACM SIGGRAPH 2004 Papers (2004)

    Google Scholar 

  8. Shlafman, S., Tal, A., Katz, S.: Metamorphosis of polyhedral surfaces using decomposition. In: CG Forum, vol. 21, pp. 219–228. Wiley Online Library (2002)

    Google Scholar 

  9. Wu Leif Kobbelt, J.: Structure recovery via hybrid variational surface approximation. Computer Graphics Forum 24(3), 277–284 (2005)

    Article  Google Scholar 

  10. Julius, D., Kraevoy, V., Sheffer, A.: D-charts: Quasi-developable mesh segmentation. Computer Graphics Forum 24(3), 581–590 (2005)

    Article  Google Scholar 

  11. Chiosa, I., Kolb, A.: Variational multilevel mesh clustering. In: International Conference on Shape Modeling and Applications, pp. 197–204 (2008)

    Google Scholar 

  12. Lloyd, S.: Least squares quantization in PCM. IEEE Transactions on Information Theory 28(2), 129–137 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Brox, T., Rosenhahn, B., Cremers, D., Seidel, H.P.: Nonparametric density estimation with adaptive, anisotropic kernels for human motion tracking. In: Elgammal, A., Rosenhahn, B., Klette, R. (eds.) Human Motion 2007. LNCS, vol. 4814, pp. 152–165. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Abramson, I.S.: On bandwidth variation in kernel estimates a square root law. The Annals of Statistics 10(4), 1217–1223 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  15. Cheng, H., Jiang, X., Sun, Y., Wang, J.: Color image segmentation: advances and prospects. Pattern Recognition 34(12), 2259–2281 (2001)

    Article  MATH  Google Scholar 

  16. Chen, X., Golovinskiy, A., Funkhouser, T.: A benchmark for 3d mesh segmentation. ACM Trans. Graph. 28, 73:1–73:12 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wekel, T., Hellwich, O. (2011). A Robust Approach to Multi-feature Based Mesh Segmentation Using Adaptive Density Estimation. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds) Computer Analysis of Images and Patterns. CAIP 2011. Lecture Notes in Computer Science, vol 6854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23672-3_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23672-3_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23671-6

  • Online ISBN: 978-3-642-23672-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics