Skip to main content
SpringerLink
Log in

Path-Value Functions for Which Dijkstra’s Algorithm Returns Optimal Mapping

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

Dijkstra’s algorithm (DA) is one of the most useful and efficient graph-search algorithms, which can be modified to solve many different problems. It is usually presented as a tool for finding a mapping which, for every vertex v, returns a shortest-length path to v from a fixed single source vertex. However, it is well known that DA returns also a correct optimal mapping when multiple sources are considered and for path-value functions more general than the standard path-length. The use of DA in such general setting can reduce many image processing operations to the computation of an optimum-path forest with path-cost function defined in terms of local image attributes. In this paper, we describe the general properties of a path-value function defined on an arbitrary finite graph which, provably, ensure that Dijkstra’s algorithm indeed returns an optimal mapping. We also provide the examples showing that the properties presented in a 2004 TPAMI paper on the image foresting transform, which were supposed to imply proper behavior of DA, are actually insufficient. Finally, we describe the properties of the path-value function of a graph that are provably necessary for the algorithm to return an optimal mapping.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. Apparently, there was a typo in the version of DA from [21], since they defined a set \(\mathcal{F}\), never used, to avoid reprocessing the vertices in the inner loop of the algorithm. A proper use of \(\mathcal{F}\) would make [21, Lemma 2] valid.

  2. Actually, it is enough to assume only that every hereditarily \(\psi \)-optimal path is monotone.

  3. Notice that in case of the algorithm DA, the value of \(\pi [\mathsf {w}_k]\) can still further change, as shown in Example 6. But, in the presented argument, \(\pi _k\) remains fixed.

  4. Note that if we weaken the assumptions by replacing (R*) with the property (R\(^+\)) obtained by replacing in (R*) symbols \(\preceq \) with the equation =, then the implication does not hold any more: \(\psi _\mathrm{dif}\) from Example 4 satisfies (M) and, for the example from Fig. 2, also (R\(^+\)), but fails the conclusion of Proposition 2.

References

  1. Alexandre, E.B., Chowdhury, A.S., Falcão, A.X., de Miranda, P.A.V.: IFT-SLIC: a general framework for superpixel generation based on simple linear iterative clustering and image foresting transform. In: XXVIII SIBGRAPI—Conference on Graphics, Patterns and Images, pp. 337–344 (2015)

  2. Amorim, W.P., Falcão, A.X., Papa, J.P., Carvalho, M.H.: Improving semi-supervised learning through optimum connectivity. Pattern Recognit. 60, 72–85 (2016)

    Article  Google Scholar 

  3. Andaló, F.A., Miranda, P.A.V., Torres, R.da S., Falcão, A.X.: Shape feature extraction and description based on tensor scale. Pattern Recognit. 43(1), 26–36 (2010)

    Article  MATH  Google Scholar 

  4. Bai, X., Sapiro, G.: Geodesic matting: a framework for fast interactive image and video segmentation and matting. Int. J. Comput. Vision 82, 113–132 (2009)

    Article  Google Scholar 

  5. Bergo, F.P.G., Falcão, A.X., Miranda, P.A.V., Rocha, L.M.: Automatic image segmentation by tree pruning. J. Math. Imaging Vision 29(2–3), 141–162 (2007)

    Article  MathSciNet  Google Scholar 

  6. Cappabianco, F.A.M., Falcão, A.X., Yasuda, C.L., Udupa, J.K.: Brain tissue MR-image segmentation via optimum-path forest clustering. Comput. Vision Image Underst. 116(10), 1047–1059 (2012)

    Article  Google Scholar 

  7. Carvalho, B.M., Gau, C.J., Herman, G.T., Kong, T.Y.: Algorithms for fuzzy segmentation. Pattern Anal. Appl. 2, 73–81 (1999)

    Article  Google Scholar 

  8. Carvalho, B.M., Herman, G.T., Kong, T.Y.: Simultaneous fuzzy segmentation of multiple objects. Discrete Appl. Math. 151, 55–77 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ciesielski, K.C., Herman, G.T., Kong, T.Y.: General theory of fuzzy connectedness segmentations. J. Math. Imaging Vision 55(3), 304–342 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ciesielski, K.C., Miranda, P.A.V., Falcão, A.X., Udupa, J.K.: Joint graph cut and relative fuzzy connectedness image segmentation algorithm. Med. Image Anal. 17, 1046–1057 (2013)

    Article  Google Scholar 

  11. Ciesielski, K.C., Strand, R., Malmberg, F., Saha, P.K.: Efficient algorithm for finding the exact minimum barrier distance. Comput. Vision Image Underst. 123, 53–64 (2014)

    Article  Google Scholar 

  12. Ciesielski, K.C., Udupa, J.K.: Affinity functions in fuzzy connectedness based image segmentation I: equivalence of affinities. Comput. Vision Image Underst. 114, 146–154 (2010)

    Article  Google Scholar 

  13. Ciesielski, K.C., Udupa, J.K.: Affinity functions in fuzzy connectedness based image segmentation II: defining and recognizing truly novel affinities. Comput. Vision Image Underst. 114, 155–166 (2010)

    Article  Google Scholar 

  14. Ciesielski, K.C., Udupa, J.K.: Region-based segmentation: fuzzy connectedness, graph cut, and other related algorithms. In: Deserno, T.M. (ed.) Biomedical Image Processing, pp. 251–278. Springer, Berlin (2011)

    Google Scholar 

  15. Ciesielski, K.C., Udupa, J.K., Falcão, A.X., Miranda, P.A.V.: Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis. J. Math. Imaging Vision 44, 375–398 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ciesielski, K.C., Udupa, J.K., Saha, P.K., Zhuge, Y.: Iterative relative fuzzy connectedness for multiple objects, allowing multiple seeds. Comput. Vision Image Underst. 107, 160–182 (2007)

    Article  Google Scholar 

  17. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  18. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  19. Falcão, A.X., Costa, L.F., da Cunha, B.S.: Multiscale skeletons by image foresting transform and its applications to neuromorphometry. Pattern Recognit. 35(7), 1569–1580 (2002)

    Article  MATH  Google Scholar 

  20. Falcão, A.X., da Cunha, B.S., Lotufo, R.A.: Design of connected operators using the image foresting transform. SPIE Med. Imaging 4322, 468–479 (2001)

    Google Scholar 

  21. Falcão, A.X., Stolfi, J., Lotufo, R.A.: The image foresting transform: theory, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 26, 19–29 (2004)

    Article  Google Scholar 

  22. Falcão, A.X., Udupa, J.K.: A 3D generalization of user-steered live wire segmentation. Med. Image Anal. 4(4), 389–402 (2000)

    Article  Google Scholar 

  23. Falcão, A.X., Udupa, J.K., Miyazawa, F.K.: An ultra-fast user-steered image segmentation paradigm: live-wire-on-the-fly. IEEE Trans. Med. Imaging 19(1), 55–62 (2000)

    Article  Google Scholar 

  24. Frieze, A.: Minimum paths in directed graphs. Oper. Res. Q. 28(2), 339–346 (1977)

    Article  MATH  Google Scholar 

  25. Herman, G.T., Carvalho, B.M.: Multiseeded segmentation using fuzzy connectedness. IEEE Trans. Pattern Anal. Mach. Intell. 23, 460–474 (2001)

    Article  Google Scholar 

  26. Lotufo, R.A., Falcão, A.X., Zampirolli, F.A.: IFT-watershed from gray scale marker. In: XV SIBGRAPI—Brazillian Symp. on Computer Graphics and Image Processing, pp. 146–152 (2002)

  27. Mansilha, L.A.C., Jackowski, M.P., Miranda, P.A.V.: Image foresting transform with geodesic star convexity for interactive image segmentation. In: 20th IEEE Conference on Image Processing (ICIP), pp. 4054–4058 (2013)

  28. Mansilla, L.A.C., Miranda, P.A.V. Cappabianco, F.A.M.: Oriented image foresting transform segmentation with connectivity constraints. In: IEEE International Conference on Image Processing (ICIP), pp. 289–296 (2016)

  29. Miranda, P.A.V., Falcão, A.X., Spina, T.V.: Riverbed: a novel user-steered image segmentation method based on optimum boundary tracking. IEEE Trans. Image Process. 21(6), 3042–3052 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  30. Miranda, P.A.V., Mansilla, L.A.C.: Oriented image foresting transform segmentation by seed competition. IEEE Trans. Image Process. 23(1), 389–398 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  31. Papa, J.P., Falcão, A.X., de Albuquerque, V.H.C., Tavares, J.M.R.S.: Efficient supervised optimum-path forest classification for large datasets. Pattern Recognit. 45(1), 512–520 (2012)

    Article  Google Scholar 

  32. Papa, J.P., Falcão, A.X., Suzuki, C.T.N.: Supervised pattern classification based on optimum-path forest. Int. J. Imaging Syst. Technol. 19(2), 120–131 (2009)

    Article  Google Scholar 

  33. Ragnemalm, I.: Fast erosion and dilation by contour processing and thresholding of distance maps. Pattern Recognit. Lett. 13, 161–166 (1992)

    Article  Google Scholar 

  34. Reddy, K.R.U.K.: A survey of the all-pairs shortest paths problem and its variants in graphs. Acta Univ. Sapientiae Informatica 8(1), 16–40 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  35. Rocha, L.M., Cappabianco, F.A.M., Falcão, A.X.: Data clustering as an optimum-path forest problem with applications in image analysis. Int. J. Imaging Syst. Technol. 19(2), 50–68 (2009)

    Article  Google Scholar 

  36. Saito, P.T.M., Suzuki, C.T.N., Gomes, J.F., de Rezende, P.J., Falcão, A.X.: Robust active learning for the diagnosis of parasites. Pattern Recognit. 8(11), 3572–3583 (2015)

    Article  Google Scholar 

  37. Spina, T.V., de Miranda, P.A.V., Falcão, A.X.: Hybrid approaches for interactive image segmentation using the Live Markers paradigm. IEEE Trans. Image Process. 23(12), 5756–5769 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  38. Strand, R., Ciesielski, K.C., Malmberg, F., Saha, P.K.: The minimum barrier distance. Comput. Vision Image Underst. 117(4), 429–437 (2013)

    Article  MATH  Google Scholar 

  39. Torres, R.S., Falcão, A.X.: Contour salience descriptors for effective image retrieval and analysis. Image Vision Comput. 25(1), 3–13 (2007)

    Article  Google Scholar 

  40. Torres, R.S., Falcão, A.X., Costa, L.F.: A graph-based approach for multiscale shape analysis. Pattern Recognit. 37(6), 1163–1174 (2004)

    Article  Google Scholar 

  41. Udupa, J.K., Saha, P.K., Lotufo, R.A.: Relative fuzzy connectedness and object definition: theory, algorithms, and applications in image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 24, 1485–1500 (2002)

    Article  Google Scholar 

  42. Udupa, J.K., Samarasekera, S.: Fuzzy connectedness and object definition: theory, algorithms, and applications in image segmentation. Graph. Models Image Process. 58, 246–261 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, West Virginia University, Morgantown, WV, 26506-6310, USA

    Krzysztof Chris Ciesielski

  2. MIPG, Department of Radiology, University of Pennsylvania, Philadelphia, PA, 19104-6021, USA

    Krzysztof Chris Ciesielski

  3. Institute of Computing, University of Campinas, Campinas, SP, 13083-852, Brazil

    Alexandre Xavier Falcão

  4. Institute of Mathematics and Statistics, University of São Paulo, São Paulo, SP, 05508-090, Brazil

    Paulo A. V. Miranda

Authors
  1. Krzysztof Chris Ciesielski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandre Xavier Falcão
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paulo A. V. Miranda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Krzysztof Chris Ciesielski.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ciesielski, K.C., Falcão, A.X. & Miranda, P.A.V. Path-Value Functions for Which Dijkstra’s Algorithm Returns Optimal Mapping. J Math Imaging Vis 60, 1025–1036 (2018). https://doi.org/10.1007/s10851-018-0793-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-018-0793-1

Keywords

Search

Navigation