Local Versus Nonlocal Computation of Length of Digitized Curves

Considers the problem of computing the length of a curve from digitized versions of the curve using parallel computation. The authors' aim is to study the inherent parallel computational complexity of this problem as a function of the digitization level. Precise formulations for the digitization, the parallel computation, and notions of local and nonlocal computations are given. It is shown that length cannot be computed locally from digitizations on rectangular tessellations. However, for a random tessellation and appropriate deterministic ones, the authors show that the length of straight line segments can be computed locally. Implications of the authors' results for a method for image segmentation and a number of open problems are discussed. >

[1]  H. Steinhaus.  Length, shape and area , 1954 .

[2]  P. Moran.  Measuring the length of a curve , 1966 .

[3]  Ugo Montanari,et al.  Continuous Skeletons from Digitized Images , 1969, JACM.

[4]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[5]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

[6]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[7]  Harold Abelson,et al.  Corrigendum: Towards a Theory of Local and Global in Computation , 1978, Theoretical Computer Science.

[8]  J. Steele.  Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .

[9]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[10]  H. Attouch.  Variational convergence for functions and operators , 1984 .

[11]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  A. Baddeley.  Stochastic geometry and image analysis , 1984 .

[13]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[14]  R. Ambartzumian.  Stochastic and integral geometry , 1987 .

[15]  Tomaso Poggio,et al.  Probabilistic Solution of Ill-Posed Problems in Computational Vision , 1987 .

[16]  J. Koplowitz,et al.  Design Of Perimeter Estimators For Digitized Planar Shapes , 1988, Other Conferences.

[17]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[18]  Alfred M. Bruckstein,et al.  Design of Perimeter Estimators for Digitized Planar Shapes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  S. Mitter,et al.  An existence theorem and lattice approximations for a variational problem arising in computer vision , 1990 .

[20]  Azriel Rosenfeld,et al.  Simple connectivity is not locally computable for connected 3D images , 1990, Comput. Vis. Graph. Image Process..

[21]  Thomas J. Richardson,et al.  Scale independent piecewise smooth segmentation of images via variational methods , 1990 .

[22]  L. Ambrosio.  Existence theory for a new class of variational problems , 1990 .

[23]  A. Yuille,et al.  A common framework for image segmentation , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[24]  Azriel Rosenfeld,et al.  If we use 4- or 8-connectedness for both the objects and the background, the Euler characteristics is not locally computable , 1990, Pattern Recognition Letters.

[25]  Sanjeev R. Kulkarni,et al.  Problems of computational and informational complexity in machine vision and learning , 1991 .

[26]  Sanjeev R. Kulkarni,et al.  Variational versus Markov random field methods for image segmentation , 1994, Optics & Photonics.