Segmentation strategies for polymerized volume data sets



Journal Title

Journal ISSN

Volume Title


Texas A&M University


A new technique, called the polymerization algorithm, is described for the hierarchical segmentation of polymerized volume data sets (PVDS) using the Lblock data structure. The Lblock data structure is defined as a 3dimensional isorectangular block of enhanced vertex information. Segmentation of the PVDS is attained by intersecting and merging Lblock coverings of the enhanced volumetric data. The data structure allows for easy compression, storage, segmentation, and reconstruction of volumetric data obtained from scanning a mammalian brain at submicron resolution, using threedimensional light microscopy (knifeedge scanning microscopy (KESM), confocal microscopy (CFM), and multiphoton microscopy (MPM)). A hybrid technique using the polymerization algorithm and an existing vectorbased tracing algorithm is developed. Both the polymerized and the hybrid algorithm have been tested and their analyzed results are presented.