Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Combinatorial Image Analysis

IWCIA 2008: Combinatorial Image Analysis pp 51–62Cite as

Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids – Parameter Optimization

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4958))

Abstract

Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighborhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We introduce four different error functions which are used to find the optimal weights and neighborhood sequences that can be used to define the distance functions with low rotational dependency.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics, and Image Processing 34, 344–371 (1986)

    Article  Google Scholar 

  2. Carr, H., Theussl, T., Möller, T.: Isosurfaces on optimal regular samples. In: Bonneau, G.-P., Hahmann, S., Hansen, C. (eds.) Proceedings of the symposium on Data visualisation 2003, Eurographics Association, pp. 39–48 (2003)

    Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. Das, P.P., Chatterji, B.N.: Octagonal distances for digital pictures. Information Sciences 50, 123–150 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Das, P.P.: Best simple octagonal distances in digital geometry. Journal of Approximation Theory 68, 155–174 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fouard, C., Strand, R., Borgefors, G.: Weighted distance transforms generalized to modules and their computation on point lattices. Pattern Recognition 40(9), 2453–2474 (2007)

    Article  MATH  Google Scholar 

  7. Hajdu, A., Nagy, B.: Approximating the Euclidean circle using neighbourhood sequences. In: Proceedings of 3rd Hungarian Conference on Image Processing, Domaszék, pp. 260–271 (2002)

    Google Scholar 

  8. Hajdu, A., Hajdu, L.: Approximating the Euclidean distance using non-periodic neighbourhood sequences. Discrete Mathematics 283, 101–111 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Image Analysis (The Morgan Kaufmann Series in Computer Graphics). Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. Nagy, B., Strand, R.: Approximating Euclidean distance using distances based on neighbourhood sequences in non-standard three-dimensional grids. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol. 4040, pp. 89–100. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of the ACM 13(4), 471–494 (1966)

    Article  MATH  Google Scholar 

  13. Rosenfeld, A., Pfaltz, J.L.: Distance functions on digital pictures. Pattern Recognition 1, 33–61 (1968)

    Article  MathSciNet  Google Scholar 

  14. Strand, R., Borgefors, G.: Distance transforms for three-dimensional grids with non-cubic voxels. Computer Vision and Image Understanding 100(3), 294–311 (2005)

    Article  Google Scholar 

  15. Strand, R., Nagy, B.: Distances based on neighbourhood sequences in non-standard three-dimensional grids. Discrete Applied Mathematics 155(4), 548–557 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Strand, R.: Weighted distances based on neighbourhood sequences in non-standard three-dimensional grids. In: Ersbøll, B.K., Pedersen, K.S. (eds.) SCIA 2007. LNCS, vol. 4522, pp. 452–461. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Strand, R., Stelldinger, P.: Topology preserving marching cubes-like algorithms on the face-centered cubic grid. In: Proceedings of 14th International Conference on Image Analysis and Processing (ICIAP 2007), Modena, Italy, pp. 781–788 (2007)

    Google Scholar 

  18. Strand, R., Malmberg, F., Svensson, S.: Minimal cost-path for path-based distances. In: Petrou, M., Saramäki, T., Erçil, A., Loncaric, S. (eds.), Proceedings of 5th International Symposium on Image and Signal Processing and Analysis (ISPA 2007), pp. 379–384. Istanbul, Turkey (2007)

    Google Scholar 

  19. Strand, R.: Weighted distances based on neighbourhood sequences. Pattern Recognition Letters 28(15), 2029–2036 (2007)

    Article  Google Scholar 

  20. Nagy, B., Strand, R.: Weighted neighbourhood sequences in non-standard three-dimensional grids – metricity and algorithms, DGCI 2008 (accepted, 2008)

    Google Scholar 

  21. 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)

    Article  Google Scholar 

  22. Verwer, B.J.H.: Local distances for distance transformations in two and three dimensions. Pattern Recognition Letters 12(11), 671–682 (1991)

    Article  Google Scholar 

  23. Yamashita, M., Ibaraki, T.: Distances defined by neighborhood sequences. Pattern Recognition 19(3), 237–246 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Image Analysis, Uppsala University, Box 337, SE-75105, Uppsala, Sweden

    Robin Strand

  2. Department of Computer Science, Faculty of Informatics, University of Debrecen, PO Box 12, 4010, Debrecen, Hungary

    Benedek Nagy

Authors
  1. Robin Strand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Valentin E. Brimkov Reneta P. Barneva Herbert A. Hauptman

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Strand, R., Nagy, B. (2008). Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids – Parameter Optimization. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds) Combinatorial Image Analysis. IWCIA 2008. Lecture Notes in Computer Science, vol 4958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78275-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78275-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78274-2

  • Online ISBN: 978-3-540-78275-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation