Access Restriction

Author Srihari, Sargur N. ♦ Yau, Mann-May
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Quadtree ♦ Multidimensional arrays ♦ Computed tomography ♦ Hyperoctree ♦ Serial section image processing ♦ Octree
Abstract A tree data structure for representing multidimensional digital binary images is described. The method is based on recursive subdivision of the d-dimensional space into 2d hyperoctants. An algorithm for constructing the tree of a d-dimensional binary image from the trees of its (d - 1 )-dimensional cross sections is given. The computational advantages of the data structure and the algorithm are demonstrated both theoretically and in application to a three-dimensional reconstruction of a human brain.
Description Affiliation: State Univ. of New York at Buffalo, Buffalo (Yau, Mann-May; Srihari, Sargur N.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 26
Issue Number 7
Page Count 12
Starting Page 504
Ending Page 515

Open content in new tab

   Open content in new tab
Source: ACM Digital Library