Sparse Object Representations by Digital Distance Functions

  • Robin Strand
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6607)

Abstract

In this paper, some methods for representing objects using path-based distances are considered. The representations can be used as anchor points when extracting medial representations of the objects. The distance transform (DT) is obtained by labeling each object element with the distance to the background. By local operations on the DT, different sets of anchor points can be obtained. We present two different methods based on local operations and prove that the representations are reversible, when this is the case. The methods are defined for weighted distances based on neighborhood sequences, which includes for example the well known cityblock and chessboard distances.

Keywords

Distance Function Local Maximum Anchor Point Object Representation Medial Axis 
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.

References

  1. 1.
    Arcelli, C., Sanniti di Baja, G.: Finding local maxima in a pseudo-Euclidean distance transform. Computer Vision, Graphics, and Image Processing 43, 361–367 (1988)CrossRefGoogle Scholar
  2. 2.
    Sanniti di Baja, G., Thiel, E.: Skeletonization algorithm running on path-based distance maps. Image and Vision Computing 14(1), 47–57 (1996)CrossRefGoogle Scholar
  3. 3.
    Blum, H.: A transformation for extracting new descriptors of shape. In: Proceedings of Models for the Perception of Speech and Visual Form, pp. 362–380. MIT Press, Cambridge (1967)Google Scholar
  4. 4.
    Borgefors, G.: Centres of maximal discs in the 5-7-11 distance transform. In: Proceedings of 8th Scandinavian Conference on Image Analysis (SCIA 1993), Tromsø, Norway, pp. 105–111 (1993)Google Scholar
  5. 5.
    Borgefors, G., Nyström, I.: Efficient shape representation by minimizing the set of centres of maximal discs/spheres. Pattern Recognition Letters 18, 465–472 (1997)CrossRefGoogle Scholar
  6. 6.
    Borgefors, G., Ramella, G., Sanniti di Baja, G., Svensson, S.: On the multiscale representation of 2D and 3D shapes. Graphical Models and Image Processing 61(1), 44–62 (1999)CrossRefMATHGoogle Scholar
  7. 7.
    Coeurjolly, D., Hulin, J., Sivignon, I.: Finding a minimum medial axis of a discrete shape is NP-hard. Theoretical Computer Science 406(1-2), 72–79 (2008)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Kumar, M.A., Chatterji, B.N., Mukherjee, J., Das, P.P.: Representation of 2D and 3D binary images using medial circles and spheres. International Journal of Pattern Recognition and Artificial Intelligence 10(4), 365–387 (1996)CrossRefGoogle Scholar
  9. 9.
    Mukherjee, J., Kumar, M.A., Chatterji, B.N., Das, P.P.: Discrete shading of three-dimensional objects from medial axis transform. Pattern Recognition Letters 20(14), 1533–1544 (1999)CrossRefGoogle Scholar
  10. 10.
    Mukherjee, J., Kumar, M.A., Das, P.P., Chatterji, B.N.: Use of medial axis transforms for computing normals at boundary points. Pattern Recognition Letters 23(14), 1649–1656 (2002)CrossRefMATHGoogle Scholar
  11. 11.
    Normand, N., Évenou, P.: Medial axis LUT computation for chamfer norms using H-polytopes. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 189–200. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Rémy, E., Thiel, E.: Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D. Pattern Recognition Letters 23, 649–661 (2002)CrossRefMATHGoogle Scholar
  13. 13.
    Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of the ACM 13(4), 471–494 (1966)CrossRefMATHGoogle Scholar
  14. 14.
    Strand, R.: Distance Functions and Image Processing on Point-Lattices: with focus on the 3D face- and body-centered cubic grids. Ph.D. thesis, Uppsala University, Sweden (November 2008)Google Scholar
  15. 15.
    Strand, R.: Shape representation with maximal path-points for path-based distances. In: Proceedings of 5th International Symposium on Image and Signal Processing and Analysis (ISPA 2007), Istanbul, Turkey. pp. 397–402 (2007)Google Scholar
  16. 16.
    Strand, R.: Weighted distances based on neighbourhood sequences. Pattern Recognition Letters 28(15), 2029–2036 (2007)CrossRefGoogle Scholar
  17. 17.
    Svensson, S., Sanniti di Baja, G.: Using distance transforms to decompose 3D discrete objects. Image and Vision Computing 20(8), 529–540 (2002)CrossRefGoogle Scholar
  18. 18.
    Svensson, S., Borgefors, G., Nyström, I.: On reversible skeletonization using anchor-points from distance transforms. Journal of Visual Communication and Image Representation 10(4), 379–397 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Robin Strand
    • 1
  1. 1.Centre for Image AnalysisUppsala UniversitySweden

Personalised recommendations