#### Filter Results:

#### Publication Year

2002

2004

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

The Mouse Brain Web, a federated database, provides for the construction of anatomically correct models of mouse brain networks. Each web page in this database provides the position, orientation, morphology, and putative synapses for each biologically observed neuron. The Mouse Brain Web has been designed to support (1) mapping of the spatial distribution… (More)

We present a data structure for the representation of filamentary volumetric data, called the L-block. While the L-block can be used to represent arbitrary volume data sets, it is particularly geared towards representing long, thin, branching structures that prior volumetric representations have difficulty dealing with efficiently. The data structure is… (More)

We present a data structure for the representation of volumetric data. The data structure is designed to allow for easy compression, storage, segmentation, and reconstruction of volumetric data. We call our data structure the L-block, abstracting many of the properties of Lego® blocks, and refer to the process of creating and manipulating L-blocks as the… (More)

- PURNA DODDAPANENI, Bruce H. McCormick, John Keyser, Lihong Wang, Valerie E. Taylor, Purna Chandra +3 others
- 2004

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… (More)

We describe a method for processing large amounts of volumetric data collected from a Knife Edge Scanning Microscope (KESM). The neuronal data that we acquire consists of thin, branching structures extending over very large regions that prior volumetric representations have difficulty dealing with efficiently. Since the full volume data set can be extremely… (More)

- PURNA DODDAPANENI, VENKATA PURNA DODDAPANENI, Bruce H. McCormick, John Keyser, Lihong Wang, Valerie E. Taylor +1 other
- 2004

Segmentation Strategies for Polymerized Volume Data Sets. 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… (More)

- ‹
- 1
- ›