Weighted Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids

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

Abstract

By combining weighted distances and distances based on neighbourhood sequences, a new family of distance functions with potentially low rotational dependency is obtained. The basic theory for these distance functions, including functional form of the distance between two points, is presented for the face-centered cubic grid and the body-centered cubic grid. By minimizing an error function, the optimal combination of weights and neighbourhood sequence is derived.

References

  1. 1.
    Matej, S., Lewitt, R.M.: Efficient 3D grids for image reconstruction using spherically-symmetric volume elements. IEEE Transactions on Nuclear Science 42(4), 1361–1370 (1995)CrossRefGoogle Scholar
  2. 2.
    Strand, R., Borgefors, G.: Distance transforms for three-dimensional grids with non-cubic voxels. Computer Vision and Image Understanding 100(3), 294–311 (2005)CrossRefGoogle Scholar
  3. 3.
    Fouard, C., Strand, R., Borgefors, G.: Weighted distance transforms generalized to modules and their computation on point lattices. Accepted for publication in Pattern Recognition (2007), Available online, http://www.sciencedirect.com
  4. 4.
    Strand, R., Nagy, B.: Distances based on neighbourhood sequences in non-standard three-dimensional grids. Discrete Applied Mathematics 155(4), 548–557 (2006)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Carr, H., Theussl, T., Möller, T.: Isosurfaces on optimal regular samples. In: Bonneau, G.-P., Hahmann, S., Hansen, C.D. (eds.) Proceedings of the symposium on Data visualisation 2003, pp. 39–48. Eurographics Association (2003)Google Scholar
  6. 6.
    Coeurjolly, D., Miguet, S., Tougne, L.: 2D and 3D visibility in discrete geometry: an application to discrete geodesic paths. Pattern Recognition Letters 25(5), 561–570 (2004)CrossRefGoogle Scholar
  7. 7.
    Verwer, B.J.H., Verbeek, P.W., Dekker, S.T.: An efficient uniform cost algorithm applied to distance transforms. IEEE Transactions on Pattern Analysis and Machine Intelligence 11(4), 425–429 (1989)CrossRefGoogle Scholar
  8. 8.
    Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics, and Image Processing 34, 344–371 (1986)CrossRefGoogle Scholar
  9. 9.
    Rosenfeld, A., Pfaltz, J.L.: Distance functions on digital pictures. Pattern Recognition 1, 33–61 (1968)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. J. ACM 13(4), 471–494 (1966)MATHCrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Robin Strand
    • 1
  1. 1.Centre for Image Analysis, Uppsala University, Box 337, SE-75105 UppsalaSweden

Personalised recommendations