Skip to main content

Exact Computation of Median Surfaces Using Optimal 3D Graph Search

  • Conference paper
Graph-Based Representations in Pattern Recognition (GbRPR 2013)

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

  • 1846 Accesses

Abstract

In this paper we formulate the generalized median surface problem and present its exact solution by means of an optimal 3D graph search algorithm. In addition to the general interest in median surface computation our work is also motivated by the task of parameter space exploration without ground truth, which is an effective means of dealing with the difficult parameter problem. A concrete application in this context will be demonstrated on artery boundary detection in ultrasound data. It will be shown that the median computation can not only avoid the parameter training, but also potentially achieve even better results than with trained parameters. Particularly in situations with no available ground truth, the median-based approach can thus be a good alternate.

This work is supported by NSFC, Grant No. 90920008.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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. Jiang, X., Bunke, H.: Learning by generalized median concept. In: Pattern Recognition and Machine Vision, pp. 1–16. River Publishers (2010)

    Google Scholar 

  2. Rokach, L.: Pattern Classification Using Ensemble Methods. World Scientific (2010)

    Google Scholar 

  3. Weiszfeld, E., Plastria, F.: On the point for which the sum of the distances to n given points is minimum. Annals of Operations Research 167, 7–41 (2009)

    Article  MathSciNet  Google Scholar 

  4. Jiang, X., Wentker, J., Ferrer, M.: Generalized median string computation by means of string embedding in vector spaces. Pattern Recognition Letters 33, 842–852 (2012)

    Article  Google Scholar 

  5. Ferrer, M., Karatzas, D., Valveny, E., Bardají, I., Bunke, H.: A generic framework for median graph computation based on a recursive embedding approach. Computer Vision and Image Understanding 115, 919–928 (2011)

    Article  Google Scholar 

  6. Vega-Pons, S., Ruiz-Shulcloper, J.: A survey of clustering ensemble algorithms. Int. Journal of Pattern Recognition and Artificial Intelligence 25, 337–372 (2011)

    Article  MathSciNet  Google Scholar 

  7. Franek, L., Abdala, D.D., Vega-Pons, S., Jiang, X.: Image segmentation fusion using general ensemble clustering methods. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part IV. LNCS, vol. 6495, pp. 373–384. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Wattuya, P., Jiang, X.: A class of generalized median contour problem with exact solution. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR & SPR 2006. LNCS, vol. 4109, pp. 109–117. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Franek, L., Jiang, X.: Evolutionary weighted mean based framework for generalized median computation with application to strings. In: Gimel’farb, G., Hancock, E., Imiya, A., Kuijper, A., Kudo, M., Omachi, S., Windeatt, T., Yamada, K. (eds.) SSPR & SPR 2012. LNCS, vol. 7626, pp. 70–78. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Solnon, C., Jolion, J.-M.: Generalized vs set median strings for histogram-based distances: Algorithms and classification results in the image domain. In: Escolano, F., Vento, M. (eds.) GbRPR 2007. LNCS, vol. 4538, pp. 404–414. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Stewart, C.: Robust parameter estimation in computer vision. SIAM Reviews 41, 513–537 (1999)

    Article  MATH  Google Scholar 

  12. Min, J., Powell, M.W., Bowyer, K.W.: Automated performance evaluation of range image segmentation algorithms. IEEE Transactions on Systems, Man, and Cybernetics, Part B 34, 263–271 (2004)

    Article  Google Scholar 

  13. Pignalberi, G., Cucchiara, R., Cinque, L., Levialdi, S.: Tuning range image segmentation by genetic algorithm. EURASIP J. Adv. Sig. Proc. 2003, 780–790 (2003)

    Article  MATH  Google Scholar 

  14. Cheng, D., Jiang, X.: Detections of arterial wall in sonographic artery images using dual dynamic programming. IEEE Trans. Information Technology in Biomedicine 12, 792–799 (2008)

    Article  Google Scholar 

  15. Li, K., Wu, X., Chen, D., Sonka, M.: Optimal surface segmentation in volumetric images-a graph-theoretic approach. IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI) 28, 119–134 (2006)

    Article  Google Scholar 

  16. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI) 26, 1124–1137 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, Z., Jiang, X., Zheng, N., Liu, Y., Cheng, D. (2013). Exact Computation of Median Surfaces Using Optimal 3D Graph Search. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2013. Lecture Notes in Computer Science, vol 7877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38221-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38221-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38220-8

  • Online ISBN: 978-3-642-38221-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics