Advertisement

Diffusion-Based Similarity for Image Analysis

  • Jan GauraEmail author
  • Eduard Sojka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9493)

Abstract

Measuring the distances is a key problem in many image-analysis algorithms. This is especially true for image segmentation. It provides a basis for the decision whether two image points belong to a single or to two different image segments. Many algorithms use the Euclidean distance, which may not be the right choice. The geodesic distance or the k shortest paths measure the distance along the surface that is defined by the image function. The diffusion distance seems to provide better properties since all the paths are taken into account. In this paper, we show that the diffusion distance has the properties that make it difficult to use in some image processing algorithms, mainly in image segmentation, which extends the recent observations of some other authors. We propose a new measure called normalised diffusion cosine similarity that overcomes some problems of diffusion distance. Lastly, we present the necessary theory and the experimental results.

Keywords

Distance measurement Euclidean distance Geodesic distance Diffusion distance Normalised diffusion similarity 

Notes

Acknowledgements

This work was partially supported by the grant of SGS No. SP2015/141, VŠB - Technical University of Ostrava, Czech Republic.

References

  1. 1.
    Babić, D., Klein, D.J., Lukovits, I., Nikoli, S., Trinajsti, N.: Resistance-distance matrix: a computational algorithm and its application. Int. J. Quantum Chem. 90(1), 166–176 (2002)CrossRefGoogle Scholar
  2. 2.
    Brand, M.: A random walks perspective on maximizing satisfaction and profit. In: Proceedings of the International Conference on Data Mining, pp. 12–19 (2005)Google Scholar
  3. 3.
    Coifman, R., Lafon, S.: Diffusion maps. Appl. Comput. Harmonic Anal. 21, 5–30 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fouss, F., Pirotte, A., Renders, J.M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. Trans. Knowl. Data Eng. 19, 355–369 (2007)CrossRefGoogle Scholar
  6. 6.
    Grady, L.: Random walks for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 28(11), 1768–1783 (2006)CrossRefGoogle Scholar
  7. 7.
    Huang, H., Yoo, S., Qin, H., Yu, D.: A robust clustering algorithm based on aggregated heat kernel mapping. In: International Conference on Data Mining, ICDM 2011, pp. 270–279 (2011)Google Scholar
  8. 8.
    Klein, D.J., Randić, M.: Resistance distance. J. Math. Chem. 12, 81–95 (1993)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Lafon, S., Lee, A.B.: Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parameterization. Trans. Pattern Anal. Mach. Intell. 28(9), 1393–1403 (2006)CrossRefGoogle Scholar
  10. 10.
    Lipman, Y., Rustamov, R.M., Funkhouser, T.A.: Biharmonic distance. ACM Trans. Graph. 29, 1–11 (2010)Google Scholar
  11. 11.
    Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proceedings of the International Conference of Computer Vision, ICCV 2001, pp. 416–423 (2001)Google Scholar
  12. 12.
    Nadler, B., Lafon, S., Coifman, R.R., Kevrekidis, I.G.: Diffusion maps, spectral clustering and reaction coordinates of dynamical systems. Appl. Comput. Harmonic Anal. 21(1), 113–127 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Papadimitriou, C.H.: An algorithm for shortest-path motion in three dimensions. Inf. Process. Lett. 20(5), 259–263 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Qiu, H., Hancock, E.R.: Clustering and embedding using commute times. Trans. Pattern Anal. Mach. Intell. 29(11), 1873–1890 (2007)CrossRefGoogle Scholar
  15. 15.
    Sharma, A., Horaud, R., Cech, J., Boyer, E.: Topologically-robust 3D shape matching based on diffusion geometry and seed growing. In: Proceedings of the Conference on Computer Vision and Pattern Recognition, pp. 2481–2488 (2011)Google Scholar
  16. 16.
    Sinop, A.K., Grady, L.: A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In: Proceedings of the International Conference on Computer Vision, ICCV 2007, pp. 1–8 (2007)Google Scholar
  17. 17.
    Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S.J., Hoppe, H.: Fast exact and approximate geodesics on meshes. ACM Trans. Graph. 24(3), 553–560 (2005)CrossRefGoogle Scholar
  18. 18.
    Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)CrossRefGoogle Scholar
  19. 19.
    von Luxburg, U., Radl, A., Hein, M.: Hitting and commute times in large random neighborhood graphs. J. Mach. Learn. Res. 15, 1751–1798 (2014)MathSciNetzbMATHGoogle Scholar
  20. 20.
    Yen, L., Fouss, F., Decaestecker, C., Francq, P., Saerens, M.: Graph nodes clustering based on the commute-time kernel. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 1037–1045. Springer, Heidelberg (2007) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Faculty of Electrical Engineering and Computer ScienceVŠB - Technical University of OstravaOstrava-PorubaCzech Republic

Personalised recommendations