Image Segmentation Based on Electrical Proximity in a Resistor-Capacitor Network

  • Jan Gaura
  • Eduard Sojka
  • Michal Krumnikl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6915)

Abstract

Measuring the distances is an important problem in many image-segmentation algorithms. The distance should tell whether two image points belong to a single or, respectively, to two different image segments. The paper deals with the problem of measuring the distance along the manifold that is defined by image. We start from the discussion of difficulties that arise if the geodesic distance, diffusion distance, and some other known metrics are used. Coming from the diffusion equation and inspired by the diffusion distance, we propose to measure the proximity of points as an amount of substance that is transferred in diffusion process. The analogy between the images and electrical circuits is used in the paper, i.e., we measure the proximity as an amount of electrical charge that is transported, during a certain time interval, between two nodes of a resistor-capacitor network. We show how the quantity we introduce can be used in the algorithms for supervised (seeded) and unsupervised image segmentation. We also show that the distance between the areas consisting of more than one point (pixel) can also be easily introduced in a meaningful way. Experimental results are also presented.

Keywords

Image Segmentation Resistive Sheet Geodesic Distance Image Segment Generalise Eigenvalue Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babic, D., Klein, D.J., Lukovits, I., Nikolic, S., Trinajstic, N.: Resistance-Distance Matrix: A Computational Algorithm and Its Applications. Int. J. Quant. Chem. 90, 166–176 (2002)CrossRefGoogle Scholar
  2. 2.
    Comaniciu, D., Meer, P.: Mean Shift: A Robust Approach toward Feature Space Analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 1–18 (2002)CrossRefGoogle Scholar
  3. 3.
    Eppstein, D.: Finding the k Shortest Paths. SIAM Journal on Computing 28(2), 652–673 (1999)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Grady, L.: Random Walks for Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(11), 1768–1783 (2006)CrossRefGoogle Scholar
  5. 5.
    Klein, D.J., Randi, M.: Resistance Distance. J. Math. Chem. 12, 81–95 (1993)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Ling, H.: Diffusion distance for histogram comparison. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 246–253 (2006)Google Scholar
  7. 7.
    Perona, P., Malik, J.: Scale-space and edge detection using anisotropic diffusion. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(7), 629–639 (1990)CrossRefGoogle Scholar
  8. 8.
    Sheikh, Y.A., Khan, E.A., Kanade, T.: Mode-seeking by Medoidshifts. In: International Conference on Computer Vision, pp. 1–8 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jan Gaura
    • 1
  • Eduard Sojka
    • 1
  • Michal Krumnikl
    • 1
  1. 1.Faculty of Electrical Engineering and Computer ScienceVŠB - Technical University of OstravaOstravaCzech Republic

Personalised recommendations