Efficient ray tracing of volume data
ACM Transactions on Graphics (TOG)
Octrees for faster isosurface generation
ACM Transactions on Graphics (TOG)
Fast algorithms for volume ray tracing
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Proximity clouds—an acceleration technique for 3D grid traversal
The Visual Computer: International Journal of Computer Graphics
Extracting surfaces from fuzzy 3D-ultrasound data
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Interactive ray tracing for isosurface rendering
Proceedings of the conference on Visualization '98
VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
Volume Visualization (Tutorial)
Volume Visualization (Tutorial)
Data Visualization Techniques
Variational classification for visualization of 3D ultrasound data
Proceedings of the conference on Visualization '01
A new object-order ray-casting algorithm
Proceedings of the conference on Visualization '02
Fast Ray-Tracing of Rectilinear Volume Data Using Distance Transforms
IEEE Transactions on Visualization and Computer Graphics
IEEE Computer Graphics and Applications
Preprocessing and Volume Rendering of 3D Ultrasonic Data
IEEE Computer Graphics and Applications
VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
Efficient Space-Leaping Using Optimal Block Sets
IEICE - Transactions on Information and Systems
GPU-accelerated 3D mipmap for real-time visualization of ultrasound volume data
Computers in Biology and Medicine
Hi-index | 0.00 |
There are two important factors to visualize ultrasound datasets using volume ray casting method. Firstly, efficient methods to skip over empty space are required. Secondly, adequate noise-detection methods are necessary because ultrasound datasets contain lots of speckle noises. In general, space-leaping and noise-filtering methods are exploited to solve the problems. However, it increases the preprocessing time to generate the filtered datasets, and interesting (meaningful) objects could be affected by a filtering operation. We propose a hierarchical octree containing min-max values and standard deviation for each block, named a hierarchical σ–octree. In rendering step, our method refers to min-max values of a block. If the block is regarded as nontransparent, it also checks its standard deviation value to detect speckle noises. Our method reduces rendering time compared with the method using only the min-max values because most blocks containing speckle noises are considered as transparent.