New views of linearity and connectedness in digital geometry

Abstract A digital line is classically defined to be the result of subjecting a continuous line to a particular digitization process. This does not take into account noise in the environment. We present a less rigid concept of linearity based on least squares and the correlation coefficient. A new type of connectedness is also discussed; it is intermediate between the usual 4- and 8-connectedness. An appendix contains the continuation of a series of bibliographies on digital metrics.

[1]  Chul E. Kim,et al.  Digital Parallelism, Perpendicularity, and Rectangles , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Azriel Rosenfeld.  A note on average distances in digital sets , 1987, Pattern Recognit. Lett..

[3]  Michael Werman,et al.  Recognition and characterization of digitized curves , 1987, Pattern Recognit. Lett..

[4]  Partha Pratim Das,et al.  Distance functions in digital geometry , 1987, Inf. Sci..

[5]  Chak-Kuen Wong,et al.  Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles , 1987, IEEE Transactions on Computers.

[6]  A. Bogomolny.  On the perimeter and area of fuzzy sets , 1987 .

[7]  Robert A. Melter.  Some characterizations of city block distance , 1987, Pattern Recognit. Lett..

[8]  Partha Pratim Das,et al.  Generalized distances in digital geometry , 1987, Inf. Sci..

[9]  Chak-Kuen Wong,et al.  On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..

[10]  P. Wuyts,et al.  Fuzzy path and fuzzy connectedness , 1987 .

[11]  U. M. Landau,et al.  Estimation of a circular arc center and its radius , 1987, Comput. Vis. Graph. Image Process..

[12]  Jim Piper,et al.  Computing distance transformations in convex and non-convex domains , 1987, Pattern Recognit..