Advertisement

Path-Gradient – A Theory of Computing Full Intensity-Transition Between Two Points

  • Syed Ahmed Nadeem
  • Eric A. Hoffman
  • Punam K. Saha
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10657)

Abstract

A major challenge for path-based segmentation methods is to select the optimum scale capturing the total intensity variation across object interfaces without losing small-scale structures. Minimum barrier distance (MBD) attempts to alleviate this issue using a unique path-cost function that computes the maximum intensity variation on the path. Two major concerns of MBD are related to high computational complexity and convoluted trajectory of the optimum path between two points on either side of an object interface limiting benefits of MBD. Here, we introduce the notion of path-gradient (PG) that exhibits similar behavior as MBD for object segmentation with significantly reduced computation. The formulation of PG allows the addition of a regularization term in path cost, which improves segmentation still at considerably reduced computation cost than regular MBD. Efficient algorithms for computing PG and regularized PG are presented and their segmentation performances are compared with that of MBD.

Keywords

Digital topology Image segmentation Minimum barrier distance Path cost Dynamic programming 

Notes

Acknowledgements

This work was supported by the NIH grant R01 HL112986.

References

  1. 1.
    Udupa, J.K., et al.: A methodology for evaluating image segmentation algorithms. SPIE Med. Imaging (2002)Google Scholar
  2. 2.
    Cootes, T.F., et al.: Active shape models - their training and application. Comput. Vis. Image Underst. 61, 38–59 (1995)CrossRefGoogle Scholar
  3. 3.
    Kass, M., Witkin, A., Terzopoulos, D.: Snakes: active contour models. Int. J. Comput. Vis. 1, 321–331 (1988)CrossRefMATHGoogle Scholar
  4. 4.
    Udupa, J.K., Saha, P.K.: Fuzzy connectedness and image segmentation. Proc. IEEE 91, 1649–1669 (2003)CrossRefGoogle Scholar
  5. 5.
    Saha, P.K., Udupa, J.K., Odhner, D.: Scale-based fuzzy connected image segmentation: theory, algorithms, and validation. Comput. Vis. Image Underst. 77, 145–174 (2000)CrossRefGoogle Scholar
  6. 6.
    Falcão, A.X., Stolfi, J., de Alencar Lotufo, R.: The image foresting transform: theory, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 26(1), 19–29 (2004)CrossRefGoogle Scholar
  7. 7.
    Saha, P.K., Strand, R., Borgefors, G.: Digital topology and geometry in medical imaging: a survey. IEEE Trans. Med. Imaging 34(9), 1940–1964 (2015)CrossRefGoogle Scholar
  8. 8.
    Ciesielski, K.C., et al.: Efficient algorithm for finding the exact minimum barrier distance. Comput. Vis. Image Underst. 123, 53–64 (2014)CrossRefGoogle Scholar
  9. 9.
    Strand, R., et al.: The minimum barrier distance. Comput. Vis. Image Underst. 117(4), 429–437 (2013)CrossRefGoogle Scholar
  10. 10.
    Saha, P.K., Udupa, J.K.: Optimum threshold selection using class uncertainty and region homogeneity. IEEE Trans. Pattern Anal. Mach. Intell. 23, 689–706 (2001)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Syed Ahmed Nadeem
    • 1
  • Eric A. Hoffman
    • 2
  • Punam K. Saha
    • 1
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of IowaIowa CityUSA
  2. 2.Department of RadiologyUniversity of IowaIowa CityUSA

Personalised recommendations