A Weight Sequence Distance Function
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.
KeywordsWeight Sequence City Block Neighborhood Sequence Digital Space Minimal Cost Path
Unable to display preview. Download preview PDF.
- 4.Denev, A.: Digital distance functions defined by sequence of weights, Bachelor Thesis, Dept. of Information Technology, Uppsala University (2011)Google Scholar
- 6.Klette, R., Rosenfeld, A.: Digital geometry - geometric methods for digital picture analysis. Morgan Kaufmann (2004)Google Scholar
- 9.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)Google Scholar
- 13.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
- 15.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)Google Scholar