The Community for Technology Leaders
Green Image
Issue No. 05 - September-October (2006 vol. 12)
ISSN: 1077-2626
pp: 1165-1172
Zeki Melek , IEEE
Thread-like structures are becoming more common in modern volumetric data sets as our ability to image vascular and neural tissue at higher resolutions improves. The thread-like structures of neurons and micro-vessels pose a unique problem in visualization since they tend to be densely packed in small volumes of tissue. This makes it difficult for an observer to interpret useful patterns from the data or trace individual fibers. In this paper we describe several methods for dealing with large amounts of thread-like data, such as data sets collected using Knife-Edge Scanning Microscopy (KESM) and Serial Block-Face Scanning Electron Microscopy (SBF-SEM). These methods allow us to collect volumetric data from embedded samples of whole-brain tissue. The neuronal and microvascular data that we acquire consists of thin, branching structures extending over very large regions. Traditional visualization schemes are not sufficient to make sense of the large, dense, complex structures encountered. In this paper, we address three methods to allow a user to explore a fiber network effectively. We describe interactive techniques for rendering large sets of neurons using self-orienting surfaces implemented on the GPU. We also present techniques for rendering fiber networks in a way that provides useful information about flow and orientation. Third, a global illumination framework is used to create high-quality visualizations that emphasize the underlying fiber structure. Implementation details, performance, and advantages and disadvantages of each approach are discussed.
neuron visualization, GPU acceleration, global illumination, orientation filtering
David Mayerich, Cem Yuksel, John Keyser, Zeki Melek, "Visualization of Fibrous and Thread-like Data", IEEE Transactions on Visualization & Computer Graphics, vol. 12, no. , pp. 1165-1172, September-October 2006, doi:10.1109/TVCG.2006.197
103 ms
(Ver 3.1 (10032016))