Segmentation strategies for polymerized volume data sets /

Bibliographic Details
Main Author:	Doddapaneni, Venkata Purna, 1979-
Other Authors:	McCormick, Bruce H. (Thesis advisor)
Format:	Thesis eBook
Language:	English
Published:	[College Station, Tex.] : [Texas A&M University], [2006]
Subjects:	Major computer science. Visualization Segmentation Strategies
Online Access:	Link to OAK Trust copy

Description
Abstract:	A new technique, called the polymerization algorithm, is described for the hierarchical segmentation of polymerized volume data sets (PVDS) using the L- block data structure. The L - block data structure is defined as a 3-dimensional iso-rectangular block of enhanced vertex information. Segmentation of the PVDS is attained by intersecting and merging L-block 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 sub-micron resolution, using three-dimensional light microscopy (knife-edge scanning microscopy (KESM), confocal microscopy (CFM), and multi-photon microscopy (MPM)). A hybrid technique using the polymerization algorithm and an existing vector-based tracing algorithm is developed. Both the polymerized and the hybrid algorithm have been tested and their analyzed results are presented.
Item Description:	"Major Subject: Computer Science" Title from author supplied metadata (automated record created on Apr. 14, 2006.) Vita. Abstract. Electronic resource.
Format:	Mode of access: World Wide Web. System requirements: World Wide Web access and Adobe Acrobat Reader.
Bibliography:	Includes bibliographical references.