Direct volume rendering methods for cell structures.

The study of the complicated architecture of cell space structures is an important problem in biology and medical research. Optical cuts of cells produced by confocal microscopes enable two-dimensional (2D) and three-dimensional (3D) reconstructions of observed cells. This paper discuses new possibilities for direct volume rendering of these data. We often encounter 16 or more bit images in confocal microscopy of cells. Most of the information contained in these images is unsubstantial for the human vision. Therefore, it is necessary to use mathematical algorithms for visualization of such images. Present software tools as OpenGL or DirectX run quickly in graphic station with special graphic cards, run very unsatisfactory on PC without these cards and outputs are usually poor for real data. These tools are black boxes for a common user and make it impossible to correct and improve them. With the method proposed, more parameters of the environment can be set, making it possible to apply 3D filters to set the output image sharpness in relation to the noise. The quality of the output is incomparable to the earlier described methods and is worth increasing the computing time. We would like to offer mathematical methods of 3D scalar data visualization describing new algorithms that run on standard PCs very well.

[1]  Dalibor Martišek,et al.  New methods for space reconstruction of inside cell structures , 2007 .

[2]  Steven K. Feiner,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 1990 .

[3]  Dalibor Martisek,et al.  The two-dimensional and three-dimensional processing of images provided by conventional microscopes. , 2006, Scanning.

[4]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[5]  H. Jennings,et al.  Roughness of Fracture Surfaces and Compressive Strength of Hydrated Cement Pastes , 2010 .

[6]  Wojciech S. Mokrzycki.  Algorithms of discretization of algebraic spatial curves on homogeneous cubical grids , 1988, Comput. Graph..

[7]  Chikit Au,et al.  Three dimensional extension of Bresenham's Algorithm with Voronoi diagram , 2011, Comput. Aided Des..

[8]  Marc Levoy,et al.  Display of surfaces from volume data , 1988, IEEE Computer Graphics and Applications.

[9]  Daniel Cohen-Or,et al.  3D Line Voxelization and Connectivity Control , 1997, IEEE Computer Graphics and Applications.

[10]  Bui Tuong Phong.  Illumination for computer generated pictures , 1975, Commun. ACM.

[11]  Solomon Eyal Shimony,et al.  3D scan-conversion algorithms for voxel-based graphics , 1987, I3D '86.

[12]  Nelson L. Max,et al.  Optical Models for Direct Volume Rendering , 1995, IEEE Trans. Vis. Comput. Graph..

[13]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[14]  T. Ficker,et al.  A remark on nano-particle stability of cement C-S-H gel , 2011 .

[15]  Bui Tuong Phong.  Illuminat~on for computer generated images , 1973 .

[16]  Arie E. Kaufman,et al.  An Algorithm for 3D Scan-Conversion of Polygons , 1987, Eurographics.