This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Local Versus Nonlocal Computation of Length of Digitized Curves
July 1994 (vol. 16 no. 7)
pp. 711-718

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. Abelson, "Towards a theory of local and global computation,"Theoretical Comput. Sci., vol. 6, pp. 41-67, 1978.
[2] R. V. Ambartzumian, Ed, "Stochastic and Integral Geometry. New York: Kluwer Academic, 1987.
[3] L. Ambrosio, "Existence theory for a new class of variational problems," Center for Intelligent Contr. Syst. Rep. CICS-P-93, MIT, 1988.
[4] L. Ambrosio, "Variational problems in SBV," Center for Intelligent Contr. Syst. Rep. CICS-P-86, MIT, 1988.
[5] H. Attouch,Variational Convergence for Functions and Operators. Marshfield, MA: Pitman, 1984.
[6] A. J. Baddeley, "Stochastic geometry and image analysis," inCWI Monographs. Amsterdam: North Holland, 1986.
[7] A. Blake and A. Zisserman, "Invariant surface reconstruction using weak continuity constraints," inProc. IEEE Conf. Comput. Vision and Pattern Recognit., Miami, 1986, pp. 62-67.
[8] A. Blake and A. Zisserman,Visual Reconstruction. Cambridge, MA: MIT Press, 1987.
[9] D. Geiger and A. Yuille, "A common framework for image segmentation,"Int. J. Comput. Vision, 1990, to be published.
[10] S. Geman and D. Geman, "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 721-741, 1984.
[11] T. Y. Kong and A. Rosenfeld, "If we use 4- or 8-connectedness for both the objects and the background, the Euler characteristic is not locally computable,"Pattern Recognit. Lett., vol. 11, pp. 231-232, 1990.
[12] J. Koplowitz and A. Bruckstein, "Design of perimeter estimators for digitized planar shapes,"SPIE vol. 1001 Visual Commun. Image Processing, 1988, pp. 756-763.
[13] J. Koplowitz and A. Bruckstein, "Design of perimeter estimators for digitized planar shapes,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 611-622, 1989.
[14] S. R. Kulkarni, S. K. Mitter, and T. J. Richardson, "An existence result and lattice approximations for a variational problem,"Signal Processing, Part I: Signal Processing Theory, Auslanderet al., Eds. New York: Springer-Verlag, 1990, IMA vol. 22, pp. 189-210.
[15] S. R. Kulkarni and S. K. Mitter, "Variational versus Markov random field methods for image segmentation,"SPIE, Neural Stochastic Methods in Image and Signal Processing III, vol. 2304, 1994.
[16] S. R. Kulkarni, "Problems of computational and information complexity in machine vision and learning," Ph.D. thesis, Dept. of Electrical Eng. and Comput. Sci., M.I.T., 1991.
[17] C. N. Lee and A. Rosenfeld, "Simple Connectivity is Not Locally Computable for Connected 3D Images,"Comput. Vision, Graphics, and Image Processing, vol. 51, pp. 87-95, 1990.
[18] J. Marroquin, S. Mitte, and T. Poggio, "Probabilistic solution of ill-posed problems in computational vision,"J. Amer. Statist. Soc., vol. 82, no. 397, pp. 77-89, 1987.
[19] M. Minsky and S. Papert,Perceptrons: An Introduction to Computational Geometry. Cambridge, MA: The MIT Press, 1969.
[20] U. Montanari, "Continuous skeletons from digitized images,"J. Assoc. Comput. Machinery, vol. 16, pp. 534-549, Oct. 1969.
[21] U. Montanari, "A note on the minimal length polygonal approximation to a digitized contour,"Communs. Ass. Comput. Mach., vol. 13, no. 1, pp. 41-47, 1970.
[22] P. A. P. Moran, "Measuring the length of a curve,"Biometrika, vol. 53, pp. 359-364, 1966.
[23] D. Mumford and J. Shah, "Boundary detection by minimizing functionals," inProc. IEEE Conf. Comput. Vision and Pattern Recognit., San Francisco, CA, 1985, pp. 22-26.
[24] D. Mumford and J. Shah, "Optimal approximations by piecewise smooth functions and associated variational problems," Ctr. for Intelligent Contr. Syst. Rep. CICS-P-68, 1988. Submitted toCommun. Pure Appl. Math..
[25] T. J. Richardson, "Scale independent piecewise smooth segmentation of images via variational methods," Ph.D. thesis, Dept. of E.E.C.S., M.I.T., 1989.
[26] L. A. Santalo,Integral Geometry and Geometric Probability., vol. 1 ofEncyclopedia of Mathematics and its Applications. Reading, MA: Addison-Wesley, 1976.
[27] J. M. Steele, "Subadditive Euclidean functionals and nonlinear growth in geometric probability,"Ann. Probab., vol. 9, no. 3, pp. 365-376, 1981.
[28] H. Steinhaus, "Length, shape, and area,"Colloq. Math., vol. 3, pp. 1-13, 1954.
[29] D. Stoyan, W. S. Kendall, and J. Mecke,Stochastic Geometry and Its Applications. New York: Wiley (Series in probability and mathematical statistics), 1987.

Index Terms:
parallel algorithms; computational complexity; image segmentation; computational geometry; local computation; nonlocal computation; length of digitized curves; parallel computation; inherent parallel computational complexity; digitization level; random tessellation; deterministic tessellation; image segmentation
Citation:
S.R. Kulkarni, S.K. Mitter, R.J. Richardson, J.N. Tsitsiklis, "Local Versus Nonlocal Computation of Length of Digitized Curves," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 7, pp. 711-718, July 1994, doi:10.1109/34.297951
Usage of this product signifies your acceptance of the Terms of Use.