Show simple item record

dc.contributor.advisorMcCormick, Bruce
dc.creatorDoddapaneni, Venkata Purna
dc.date.accessioned2006-04-12T16:02:02Z
dc.date.available2006-04-12T16:02:02Z
dc.date.created2004-12
dc.date.issued2006-04-12
dc.identifier.urihttps://hdl.handle.net/1969.1/3077
dc.description.abstractA 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.en
dc.format.extent10144701 bytesen
dc.format.mediumelectronicen
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherTexas A&M University
dc.subjectSegmentation Strategiesen
dc.subjectVisualizationen
dc.titleSegmentation strategies for polymerized volume data setsen
dc.typeBooken
dc.typeThesisen
thesis.degree.departmentComputer Scienceen
thesis.degree.disciplineComputer Scienceen
thesis.degree.grantorTexas A&M Universityen
thesis.degree.nameMaster of Scienceen
thesis.degree.levelMastersen
dc.contributor.committeeMemberKeyser, John
dc.contributor.committeeMemberWang, Lihong
dc.type.genreElectronic Thesisen
dc.type.materialtexten
dc.format.digitalOriginborn digitalen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record