Skip to main content

The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation

  • Conference paper
Algorithms and Computation (ISAAC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3827))

Included in the following conference series:

Abstract

Efficient detection of multiple inter-related surfaces representing the boundaries of objects of interest in d-D images (d ≥ 3) is important and remains challenging in many medical image analysis applications. In this paper, we study several layered net surface (LNS) problems captured by an interesting type of geometric graphs called ordered multi-column graphs in the d-D discrete space (d ≥ 3). The LNS problems model the simultaneous detection of multiple mutually related surfaces in three or higher dimensional medical images. Although we prove that the d-D LNS problem (d ≥ 3) on a general ordered multi-column graph is NP-hard, the (special) ordered multi-column graphs that model medical image segmentation have the self-closure structures, and admit polynomial time exact algorithms for solving the LNS problems. Our techniques also solve the related net surface volume (NSV) problems of computing well-shaped geometric regions of an optimal total volume in a d-D weighted voxel grid. The NSV problems find applications in medical image segmentation and data mining. Our techniques yield the first polynomial time exact algorithms for several high dimensional medical image segmentation problems. The practical efficiency and accuracy of the algorithms are showcased by experiments based on real medical data.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Asano, T., Chen, D.Z., Katoh, N., Tokuyama, T.: Efficient algorithms for optimization-based image segmentation. Int. Journal of Computational Geometry & Applications 11(2), 145–166 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen, D.Z., Chun, J., Katoh, N., Tokuyama, T.: Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain. In: Proc. 10th Annual Int. Computing and Combinatorics Conf., Jeju Island, Korea, pp. 238–248 (2004)

    Google Scholar 

  3. Frank, R.J., McPherson, D.D., Chandran, K.B., Dove, E.L.: Optimal surface detection in intravascular ultrasound using multi-dimensional graph search. In: Computers in Cardiology, pp. 45–48. IEEE, Los Alamitos (1996)

    Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  5. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. Assoc. Comput. Mach. 35, 921–940 (1988)

    MATH  MathSciNet  Google Scholar 

  6. Huang, X., Metaxas, D., Chen, T.: MetaMorphs: Deformable shape and texture models. In: Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), June 2004, vol. I, pp. 496–503 (2004)

    Google Scholar 

  7. Li, K., Wu, X., Chen, D.Z., Sonka, M.: Efficient optimal surface detection: Theory, implementation and experimental validation. In: Proc. SPIE’s Int. Symp. on Medical Imaging: Imaging Processing, San Diego, CA, vol. 5370, pp. 620–627 (2004)

    Google Scholar 

  8. Li, K., Wu, X., Chen, D.Z., Sonka, M.: Optimal Surface Segmentation in Volumetric Images — A Graph-Theoretic Approach, accepted to. IEEE Trans. on Pattern Analysis and Machine Intelligence (2005)

    Google Scholar 

  9. Osher, S., Paragios, N. (eds.): Geometric Level Set Methods in Imaging, Vision and Graphics. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  10. Picard, J.C.: Maximal closure of a graph and applications to combinatorial problems. Management Science 22, 1268–1272 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision, 2nd edn. Brooks/Cole Publishing Company, Pacific Grove (1999)

    Google Scholar 

  12. Thedens, D.R., Skorton, D.J., Fleagle, S.R.: Methods of graph searching for border detection in image sequences with applications to cardiac magnetic resonance imaging. IEEE Trans. on Medical Imaging 14(1), 42–55 (1995)

    Article  Google Scholar 

  13. Wu, X., Chen, D.Z.: Optimal net surface problems with applications. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 1029–1042. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Yang, F., Holzapfel, G., Schulze-Bauer, C., Stollberger, R., Thedens, D., Bolinger, L., Stolpen, A., Sonka, M.: Segmentation of wall and plaque in in-vitro vascular MR image. International Journal on Cardiovascular Imaging 19(5), 419–428 (2003)

    Article  Google Scholar 

  15. Zeng, X., Staib, L.H., Schultz, R.T., Duncan, J.S.: Segmentation and measurement of the cortex from 3-D MR images using coupled surfaces propagation. IEEE Trans. Med. Imag. 18, 927–937 (1999)

    Article  Google Scholar 

  16. Zhu, S., Yuille, A.: Region competition: Unifying snakes, region growing, and Bayes/MDL for multiband images segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 18, 884–900 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, X., Chen, D.Z., Li, K., Sonka, M. (2005). The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_4

Download citation

  • DOI: https://doi.org/10.1007/11602613_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics