Abstract
In many three-dimensional imaging applications, the three-dimensional space is represented by an array of cubical volume elements (voxels) and a subset of the voxels is specified by some property. Objects in the scene are then recognised by being ‘components’ of the specified set and individual boundaries are recognised as sets of voxel faces separating objects from ‘components’ in the complement of the specified set. This paper deals with the problem of algorithmic tracking of such a boundary specified by one of the voxel faces lying in it. The paper is expository in that all ideas are carefully motivated and introduced. Its original contribution is the investigation of the question of whether the use of a queue (of loose ends in the tracking process which are to be picked up again to complete the tracking) is necessary for an algorithmic tracker of boundaries in three-dimensional space. Such a queue is not needed for two-dimensional boundary tracking, but published three-dimensional boundary trackers all make use of such a thing. We prove that this is not accidental: under some mild assumptions, a boundary tracker without a queue will fail its task on some three-dimensional boundaries.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abbott EA. Flatland, A Romance of Many Dimensions. Little, Brown and Co, 1899
Herman GT. Oriented surfaces in digital spaces. CVGIP: Graph Models Image Proceedings 1993; 55: 381–396
Kong TY, Rosenfeld A. Digital topology: Introduction and survey. Comput Vision Graph Image Proc 1989; 48: 357–393
Udupa JK. Multidimensional digital boundaries. GVGIP: Graph Models Image Proceedings 1994; 56: 311–323
Harary F. Graph Theory. Addison-Wesley, 1969
Artzy E, Frieder G, Herman GT. The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm. Comput Graph Image Proc 1981; 15: 1–24
Munkres JR. Topology: A First Course. Prentice Hall, 1975
Herman GT, Webster D. A topological proof of a surface tracking algorithm. Comput Vision Graph Image Proc 1983; 23: 162–177
Rosenfeld A, Kong TY, Wu AY. Digital surfaces. GVGIP: Graph Models Image Proc 1991; 53: 305–312
Frieder G, Herman GT, Meyer C, Udupa J. Large software problems for small computers: an example from medical imaging. IEEE Software 1985; 2(5): 37–47
David DJ, Hemmy DC, Cooter RD. Craniofacial Deformities: Atlas of Three-Dimensional Reconstruction from Computed Tomography. Springer-Verlag, 1990
Herman GT, Coin CG. The use of three-dimensional computer display in the study of disk disease. J Comput Assist Tomogr 1980; 4: 564–567
Burk Jr DL, Mears DC, Cooperstein LA, Herman GT, Udupa JK. Acetabular fractures: Three-dimensional computed tomographic imaging and interactive surgical planning. CT: J Comput Tomogr 1986; 10: 1–10
DeMarino DP, Steiner E, Poster R, Katzberg RW, Hengerer AS, Herman GT, Wayne WS, Prosser DC. Three-dimensional computed tomography in maxillofacial trauma. Arch Otolaryng-Head Neck Surg 1986; 112: 146–150
Gordon D, Udupa JK. Fast surface tracking in three-dimensional binary images. Comput Vision Graph Image Proc 1989; 45: 196–241
Preston Jr K. Multidimensional logical transforms. IEEE Transactions PAMI 1983; 5: 539–554
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Herman, G.T., Robinson, D.F. Digital boundary tracking. Pattern Analysis & Applic 1, 2–17 (1998). https://doi.org/10.1007/BF01238022
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01238022