Local Versus Non-local Computation of Length of Digitized Curves
暂无分享,去创建一个
[1] A. Baddeley. Stochastic geometry and image analysis , 1984 .
[2] R. Ambartzumian. Stochastic and integral geometry , 1987 .
[3] Marvin Minsky,et al. Perceptrons: An Introduction to Computational Geometry , 1969 .
[4] Azriel Rosenfeld,et al. Simple connectivity is not locally computable for connected 3D images , 1990, Comput. Vis. Graph. Image Process..
[5] P. Moran. Measuring the length of a curve , 1966 .
[6] Harold Abelson,et al. Corrigendum: Towards a Theory of Local and Global in Computation , 1978, Theoretical Computer Science.
[7] Ugo Montanari,et al. A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.
[8] 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.
[9] L. Santaló. Integral geometry and geometric probability , 1976 .
[10] Alfred M. Bruckstein,et al. Design of Perimeter Estimators for Digitized Planar Shapes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[11] H. Steinhaus. Length, shape and area , 1954 .