Approximating the Euclidean Circle in the Square Grid using Neighbourhood Sequences

作者: Szabolcs Baják , Benedek Nagy , János Farkas

DOI:

关键词:

摘要: Distance measuring is a very important task in digital geometry and image processing. Due to our natural approach we think of the set points that are equally far from given point as Euclidean circle. Using classical neighbourhood relations on grids, get circles greatly differ In this paper examine different methods approximating circle square grid, considering possible motivat ions well. We compare perimeter-, area-, curve- noncompactness-based approximations their realization using sequences. also provide table which summarizes results, can be used when developing applications support MSC2000 code: 52C99.

参考文章(8)
P.P. Das, P.P. Chakrabarti, B.N. Chatterji, Distance functions in digital geometry Information Sciences. ,vol. 42, pp. 113- 136 ,(1987) , 10.1016/0020-0255(87)90019-3
A. Rosenfeld, J.L. Pfaltz, Distance functions on digital pictures Pattern Recognition. ,vol. 1, pp. 33- 61 ,(1968) , 10.1016/0031-3203(68)90013-7
Benedek Nagy, Distances with neighbourhood sequences in cubic and triangular grids Pattern Recognition Letters. ,vol. 28, pp. 99- 109 ,(2007) , 10.1016/J.PATREC.2006.06.007
P.P. Das, B.N. Chatterji, Octagonal distances for digital pictures Information Sciences. ,vol. 50, pp. 123- 150 ,(1990) , 10.1016/0020-0255(90)90008-X
András Hajdu, None, Geometry of neighbourhood sequences Pattern Recognition Letters. ,vol. 24, pp. 2597- 2606 ,(2003) , 10.1016/S0167-8655(03)00104-1
B. Nagy, Metric and non-metric distances on Z/sup n/ by generalized neighbourhood sequences international symposium on image and signal processing and analysis. pp. 215- 220 ,(2005) , 10.1109/ISPA.2005.195412
A. Fazekas, A. Hajdu, L. Hajdu, Lattice of generalized neighbourhood sequences in nD international symposium on image and signal processing and analysis. ,vol. 1, pp. 107- 111 ,(2003) , 10.1109/ISPA.2003.1296877