The Eccentricity Transform (of a Digital Shape)

  • Walter G. Kropatsch
  • Adrian Ion
  • Yll Haxhimusa
  • Thomas Flanitzer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4245)


Eccentricity measures the shortest length of the paths from a given vertex v to reach any other vertex w of a connected graph. Computed for every vertex v it transforms the connectivity structure of the graph into a set of values. For a connected region of a digital image it is defined through its neighbourhood graph and the given metric. This transform assigns to each element of a region a value that depends on it’s location inside the region and the region’s shape. The definition and several properties are given. Presented experimental results verify its robustness against noise, and its increased stability compared to the distance transform. Future work will include using it for shape decomposition, representation, and matching.


Root Mean Square Error Short Path Noisy Image Connected Region Pepper Noise 
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.


  1. 1.
    Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24(4), 509–522 (2002)CrossRefGoogle Scholar
  2. 2.
    Siddiqi, K., Shokoufandeh, A., Dickinson, S., Zucker, S.W.: Shock graphs and shape matching. International Journal of Computer Vision 30, 1–24 (1999)Google Scholar
  3. 3.
    Felzenszwalb, P.F.: Representation and detection of deformable shapes. IEEE Trans. Pattern Anal. Mach. Intell. 27(2), 208–220 (2005)CrossRefGoogle Scholar
  4. 4.
    Mori, G.: Guiding model search using segmentation. In: ICCV, pp. 1417–1423 (2005)Google Scholar
  5. 5.
    Rosenfeld, A.: A note on ’geometric transforms’ of digital sets. Pattern Recognition Letters 1(4), 223–225 (1983)MATHCrossRefGoogle Scholar
  6. 6.
    Ogniewicz, R.L., Kübler, O.: Hierarchic Voronoi Skeletons. Pattern Recognition 28 ( 3 ), 343–359 (1995)CrossRefGoogle Scholar
  7. 7.
    Borgefors, G., Nyström, I., Sanniti Di Baja, G.: Computing skeletons in three dimensions. Pattern Recognition 37(7), 1225–1236 (1999)CrossRefGoogle Scholar
  8. 8.
    Haxhimusa, Y.v., Ion, A., Kropatsch, W.G., Illetschko, T.: Evaluating minimum spanning tree based segmentation algorithms. In: Gagalowicz, A., Philips, W. (eds.) CAIP 2005. LNCS, vol. 3691, pp. 579–586. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Gorelick, L., Galun, M., Sharon, E., Basri, R., Brandt, A.: Shape representation and classification using the poisson equation. In: CVPR (2), pp. 61–67 (2004)Google Scholar
  10. 10.
    Yamashita, M., Ibaraki, T.: Distances defined by neighborhood sequences. Pattern Recognition 19, 237–246 (1986)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Klette, R., Rosenfeld, A.: Digital Geometry. Morgan Kaufmann, San Francisco (2004)MATHGoogle Scholar
  12. 12.
    Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of Association of Computer Machinery 13(4), 471–494 (1966)MATHGoogle Scholar
  13. 13.
    Borgefors, G.: Distance transformation in digital images. Computer Vision, Graphics, and Image Processing 34, 344–371 (1986)CrossRefGoogle Scholar
  14. 14.
    Kropatsch, W.G., Haxhimusa, Y.v., Pizlo, Z.: Integral trees: Subtree depth and diameter. In: Klette, R., Žunić, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 77–87. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  15. 15.
    Buckley, F., Harary, F.: Distances in Graphs. Addison-Wesley Publishing Company, Reading (1990)Google Scholar
  16. 16.
    Thulasiraman, K., Swamy, M.N.S.: Graphs: Theory and Algorithms. Wiley-Interscience, Chichester (1992)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Walter G. Kropatsch
    • 1
  • Adrian Ion
    • 1
  • Yll Haxhimusa
    • 1
  • Thomas Flanitzer
    • 1
  1. 1.Pattern Recognition and Image Processing GroupVienna University of TechnologyViennaAustria

Personalised recommendations