CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2008 vol.30 Issue No.04 - April

Subscribe

Issue No.04 - April (2008 vol.30)

pp: 577-590

ABSTRACT

In this paper we define and study digital manifolds of arbitrary dimension, and provide (in particular)a general theoretical basis for curve or surface tracing in picture analysis. The studies involve propertiessuch as one-dimensionality of digital curves and (n-1)-dimensionality of digital hypersurfaces thatmakes them discrete analogs of corresponding notions in continuous topology. The presented approachis fully based on the concept of adjacency relation and complements the concept of dimension ascommon in combinatorial topology. This work appears to be the first one on digital manifolds based ona graph-theoretical definition of dimension. In particular, in the n-dimensional digital space, a digitalcurve is a one-dimensional object and a digital hypersurface is an (n-1)-dimensional object, as it isin the case of curves and hypersurfaces in the Euclidean space. Relying on the obtained properties ofdigital hypersurfaces, we propose a uniform approach for studying good pairs defined by separationsand obtain a classification of good pairs in arbitrary dimension. We also discuss possible applicationsof the presented definitions and results.

INDEX TERMS

digital geometry, digital topology, discrete dimension, digital manifold, digital curve, digital hypersurface, good pair

CITATION

Valentin Brimkov, "Border and SurfaceTracing - Theoretical Foundations",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol.30, no. 4, pp. 577-590, April 2008, doi:10.1109/TPAMI.2007.70725REFERENCES

- [2] P. Alexandroff and H. Hopf,
Topologie—Erster Band. Julius Springer, 1935.- [4] G. Bertrand and R. Malgouyres, “Some Topological Properties of Surfaces in ${\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}^{3}$ ,”
J. Math. Imaging Vision, vol. 11, pp. 207-221, 1999.- [8] V.E. Brimkov and R. Klette, “Curves, Hypersurfaces, and Good Pairs of Adjacency Relations,”
Proc. Int'l Workshop Combinatorial Image Analysis, pp. 270-284, 2004.- [9] L. Chen,
Discrete Surfaces and Manifolds: A Theory of Digital-Discrete Geometry and Topology. Scientific and Practical Computing, 2004.- [10] L. Chen, “Gradually Varied Surfaces and Gradually Varied Functions,” Technical Report CITR-TR 156, Univ. of Auckland, May 2005.
- [12] L. Chen and J. Zhang, “Digital Manifolds: An Intuitive Definition and Some Properties,”
Proc. ACM/SIGGRAPH Symp. Solid Modeling Applications, pp. 459-460, 1993.- [13] D. Cohen-Or, A. Kaufman, and T.Y. Kong, “On the Soundness of Surface Voxelizations,”
Topological Algorithms for Digital Image Processing, T.Y. Kong and A. Rosenfeld, eds., pp. 181-204, Elsevier, 1996.- [16] E.E. Domínguez and A.R. Francés, “An Axiomatic Approach to Digital Topology,”
Lecture Notes in Computer Scince, vol. 2243, pp.3-16, 2001.- [17] R.O. Duda, P.E. Hart, and J.H. Munson, “Graphical-Data-Processing Research Study and Experimental Investigation,” Technical Report ECOM-01901-26, Stanford Research Inst., Mar. 1967.
- [20] G.T. Herman, “Boundaries in Digital Spaces: Basic Theory,”
Topological Algorithms for Digital Image Processing, T.Y. Kong and A. Rosenfeld, eds., pp. 233-261, Elsevier, 1996.- [22] C.E. Kim, “Three-Dimensional Digital Line Segments,”
IEEE Trans. Pattern Analysis Machine Intelligence, vol. 5, pp. 231-234, 1983.- [23] G. Klette, “Branch Voxels and Junctions in 3D Skeletons,”
Proc. Int'l Workshop Combinatorial Image Analysis, pp. 34-44, 2006.- [24] G. Klette, “Topologic, Geometric, or Graph-Theoretic Properties of Skeletal Curves,” PhD dissertation, Groningen Univ., 2007.
- [25] R. Klette, “Algorithms for Picture Analysis, Lecture 25,” www. citr.auckland.ac.nz/~rklette/Books/ MK2004Algorithms.htm, Mar. 2005.
- [26] R. Klette and A. Rosenfeld,
Digital Geometry—Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, 2004.- [27] R. Klette and H.-J. Sun, “Digital Planar Segment Based Polyhedrization for Surface Area Estimation,”
Visual Form, C. Arcelli, L.P.Cordella, and G. Sanniti di Baja, eds., pp. 356-366, Springer, 2001.- [28] T.Y. Kong, “Digital Topology,”
Foundations of Image Understanding, L.S. Davis, ed., pp. 33-71, Kluwer Academic, 2001.- [35] L.J. Latecki,
Discrete Representations of Spatial Objects in Computer Vision. Kluwer Academic Publisher, 1998.- [37] K. Menger,
Kurventheorie. Teubner, 1932.- [40] J. Ohser and K. Schladitz,
Image Processing and Analysis. Clarendon Press, 2006.- [41] J.-P. Reveillès,
Géométrie Discrète, Calcul en Nombres Entiers et Algorithmique, Thèse d'état, Université Louis Pasteur, 1991.- [42] A. Rosenfeld, “Adjacency in Digital Pictures,”
Information and Control, vol. 26, pp. 24-33, 1974.- [43] A. Rosenfeld, “Compact Figures in Digital Pictures,”
IEEE Trans. Systems, Man, and Cybernetics, vol. 4, pp. 221-223, 1974.- [44] A. Rosenfeld, T.Y. Kong, and A.Y. Wu, “Digital Surfaces,”
Computer Vision, Graphics, and Image Processing: Graphical Models Image Processing, vol. 53, pp. 305-312, 1991.- [46] M. Siguera, L.J. Latecki, and J. Gallier, “Making 3D Binary Digital Images Well-Composed,”
Proc. Vision Geometry, pp. 150-163, 2005.- [47] G. Tourlakis, “Homological Methods for the Classification of Discrete Euclidean Structures,”
SIAM J. Applied Math., vol. 33, pp.51-54, 1977.- [48] G. Tourlakis and J. Mylopoulos, “Some Results in Computational Topology,”
J. ACM, vol. 20, pp. 430-455, 1973.- [49] J.K. Udupa, “Connected, Oriented, Closed Boundaries in Digital Spaces: Theory and Algorithms,”
Topological Algorithms for Digital Image Processing, T.Y. Kong and A. Rosenfeld, eds., pp.205-231, Elsevier, 1996.- [50] P. Urysohn, “Über die allgemeinen Cantorischen Kurven,”
Proc. Ann. Meeting, Deutsche Mathematiker Vereinigung, 1923.- [51] D.J.A. Welsh,
Matroid Theory. Academic Press, 1976.- [52] F. Wyse, “A Special Topology for the Integers,”
Am. Math. Monthly, vol. 77, p. 1119, 1970. |