Issue No. 07 - July (1994 vol. 16)

ISSN: 0162-8828

pp: 711-718

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.297951

ABSTRACT

<p>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.</p>

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

R.J. Richardson, S.K. Mitter, J.N. Tsitsiklis, S.R. Kulkarni, "Local Versus Nonlocal Computation of Length of Digitized Curves",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 16, no. , pp. 711-718, July 1994, doi:10.1109/34.297951SEARCH