Abstract
In this paper, a family of weighted neighborhood sequence distance functions defined on the square grid is presented. With this distance function, the allowed weight between any two adjacent pixels along a path is given by a weight sequence. We build on our previous results, where only two or three unique weights are considered, and present a framework that allows any number of weights. We show that the rotational dependency can be very low when as few as three or four unique weights are used. An algorithm for computing the distance transform (DT) that can be used for image processing applications is also presented.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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
Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics, and Image Processing 34, 344–371 (1986)
Celebi, M.E., Celiker, F., Kingravi, H.A.: On Euclidean norm approximations. Pattern Recognition 44(2), 278–283 (2011)
Das, P.P., Chakrabarti, P.P.: Distance functions in digital geometry. Information Sciences 42, 113–136 (1987)
Denev, A.: Digital distance functions defined by sequence of weights, Bachelor Thesis, Dept. of Information Technology, Uppsala University (2011)
Fabbri, R., da, F., Costa, L., Torelli, J.C., Bruno, O.M.: 2D Euclidean distance transform algorithms: A comparative survey. ACM Computing Surveys 40(1), 1–44 (2008)
Klette, R., Rosenfeld, A.: Digital geometry - geometric methods for digital picture analysis. Morgan Kaufmann (2004)
Mukherjee, J.: Hyperspheres of weighted distances in arbitrary dimension. Pattern Recognition Letters 34(2), 117–123 (2013)
Nagy, B.: Distance functions based on neighbourhood sequences. Publ. Math. Debrecen 63(3), 483–493 (2003)
Nagy, B.: Metric and non-metric distances on ℤn by generalized neighbourhood sequences. In: IEEE Proceedings of 4th International Symposium on Image and Signal Processing and Analysis (ISPA 2005), Zagreb, Croatia, pp. 215–220 (2005)
Nagy, B.: Distance with generalized neighbourhood sequences in nD and ∞ D. Discrete Applied Mathematics 156(12), 2344–2351 (2008)
Ragnemalm, I.: The Euclidean distance transform in arbitrary dimensions. Pattern Recognition Letters 14(11), 883–888 (1993)
Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of the ACM 13(4), 471–494 (1966)
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 (2008), http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9312
Strand, R.: Weighted distances based on neighbourhood sequences. Pattern Recognition Letters 28(15), 2029–2036 (2007)
Strand, R., Nagy, B.: A weighted neighborhood sequence distance function with three local steps. In: IEEE Proceedings of 8th International Symposium on Image and Signal Processing and Analysis (ISPA 2011), Dubrovnik, Croatia, pp. 564–568 (2011)
Strand, R., Nagy, B., Borgefors, G.: Digital distance functions on three-dimensional grids. Theoretical Computer Science 412, 1350–1363 (2011)
Strand, R., Normand, N.: Distance transform computation for digital distance functions. Theoretical Computer Science 448, 80–93 (2012)
Yamashita, M., Ibaraki, T.: Distances defined by neighborhood sequences. Pattern Recognition 19(3), 237–246 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagy, B., Strand, R., Normand, N. (2013). A Weight Sequence Distance Function. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2013. Lecture Notes in Computer Science, vol 7883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38294-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-38294-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38293-2
Online ISBN: 978-3-642-38294-9
eBook Packages: Computer ScienceComputer Science (R0)