Filters








157,751 Hits in 3.9 sec

IEEE Annals of the History of Computing, Volume 16, 1994, Subject/Title Index

1994 IEEE Annals of the History of Computing  
Historical Perspectives on the Electrical, Electronics, and Computer Industries (rev.) , No. 4, 92  ...  .), No. 4 , 74 Aspray, W illi am, "The Hi story of Computing within the Hi story of Information Techno logy" (rev .), No. 3, 7 1 Aspray , Wi lli am , ed. , Technological Competitiveness: Contemporary and  ...  .), No. 4, 47 ldenburg, Ph.I., No. 3, 22 IEEE Computer Society Computer Pioneer (Happe nings), No. 3, 58, No. 4, 76 ILLIAC, No. 2, 59 INA, see In stitute for Numerica l Analysis, No. 1, 76 INCA , No. 3  ... 
doi:10.1109/mahc.1994.9430143 fatcat:tfpvd4vee5blreujlblmeyb6i4

Communication costs for parallel volume-rendering algorithms

U. Neumann
1994 IEEE Computer Graphics and Applications  
Unless all nodes have a local copy of the data, or viewing positions are severely restricted, a parallel volume rendering algorithm intrinsically requires communication between compute nodes.  ...  Algorithms and Rendering Methods There is a distinction between a parallel volume rendering algorithm and a volume rendering method like ray casting or splatting.  ...  Neither approach requires a high replication Fig. 4 - 4 Taxonomy of parallel volume rendering algorithms message flows.  ... 
doi:10.1109/38.291531 fatcat:c5oboganyvhufma7qqriajmkxm

Fractal volume compression

W.O. Cochran, J.C. Hart, P.J. Flynn
1996 IEEE Transactions on Visualization and Computer Graphics  
Numerous experiments over the many parameters of fractal volume compression show i t to perform competitively against other volume compression methods, surpassing vector quantization and approaching the  ...  Acknowledgments Several volume visualization systems were used during the development of fractal volume compression 1, 17, 29 .  ...  Data for the CT head was obtained from the University of North Carolina-Chapel Hill volume rendering test data set.  ... 
doi:10.1109/2945.556500 fatcat:2tiinnxje5hbbh6v3ud2k6sasy

Interactive volume navigation

M.L. Brady, K.K. Jung, H.T. Nguyen, T.P.Q. Nguyen
1998 IEEE Transactions on Visualization and Computer Graphics  
The algorithm generates a sequence of approximate volume-rendered views in a fraction of the time that would be required to compute them individually.  ...  Volume navigation is the interactive exploration of volume data sets by "flying" the viewpoint through the data, producing a volume rendered view at each frame.  ...  The two-phase algorithm for perspective volume rendering is presented in Section 3 and applied to volume navigation in Section 4.  ... 
doi:10.1109/2945.722298 fatcat:qf6x7yyjujcktb3dyjvld6o3qe

Volume rendering of pool fire data

H. Rushmeier, A. Hamins, Mun Young Choi
1995 IEEE Computer Graphics and Applications  
-17-1 6/95/$4.00 01995 IEEE  ...  Ray casting and line integration Thebasic tool for imaging and computing radiative transfer is ray casting. Figure 3 diagrams casting a ray through the volume of data.  ...  HoUyRushmeier ison the staff of the Computing and Applied Mathematics Laboratory at the National Institute of Standards and Technology.  ... 
doi:10.1109/38.391493 fatcat:hotxmxggjzf57fl2rqmocprl5u

Sampling Design of Synthetic Volume Arrays for Three-Dimensional Microwave Imaging

Jianping Wang, Alexander Yarovoy
2018 IEEE Transactions on Computational Imaging  
., synthetic volume array) for microwave imaging is considered.  ...  Moreover, it has higher computational efficiency compared to the existing approaches. Finally, its effectiveness and selection performances are demonstrated through some imaging examples.  ...  Fig. 4 . 4 Measurement setup for numberical simulations with the four arrays.  ... 
doi:10.1109/tci.2018.2875332 fatcat:tcejuj3ofbg4hfbzjfpbhod5fe

Nonphotorealistic rendering of medical volume data

Feng Dong, G.J. Clapworthy, Hai Lin, M.A. Krokos
2003 IEEE Computer Graphics and Applications  
In Figures 3 and 5 , computing strokes at P uses 2 × 2 × 2 neighboring cubes. In practice, if you prefer longer strokes, you can use more neighboring cubes. We've often used 4 × 4 × 4.  ...  We calculated strokes using 4 × 4 × 4 neighboring cubes and a depth of 16 for the rendering shell, because the effects of surface muscle fibers penetrate a few volume cubes beneath the surface.  ...  //computer. org/publications/dlib.  ... 
doi:10.1109/mcg.2003.1210864 fatcat:a7heq4v2kfgkjmbdl24m4pkeqa

Panel Summaries: Real-Time Volume Diagnostics--Requirements and Challenges

A. Khoche
2006 IEEE Design & Test of Computers  
This would involve ATE improvements. ■ Scalable and efficient storage and compute infrastructure: Such storage and infrastructure enables logging and analyzing large amounts of data with extreme automation  ...  The panel on "Real-time volume diagnostics: requirements and challenges" discussed developing an environment to enable volume diagnostics.  ... 
doi:10.1109/mdt.2006.101 fatcat:76oe5gokhvcc5dxxpbb5d2ezuy

Parallel volume rendering using binary-swap compositing

Kwan-Liu Ma, J.S. Painter, C.D. Hansen, M.F. Krogh
1994 IEEE Computer Graphics and Applications  
Finally, we notice the availability of massively parallel computers and hundreds of highperformance workstations in our computing environments.  ...  Although computing technology continues to advance, computer processing power never seems to catch up to the increases in data size. Several observations motivated the work we describe here.  ...  David Rich of the Advanced Computing Laboratory and Burl Hall of Thinking Machines helped tremendously with the CM-5 timings.  ... 
doi:10.1109/38.291532 fatcat:beapisd6t5eszhzu55zo7c3tyy

A Generative Model for Volume Rendering

Matthew Berger, Jixian Li, Joshua Aaron Levine
2018 IEEE Transactions on Visualization and Computer Graphics  
We use the Generative Adversarial Network (GAN) framework to compute a model from a large collection of volume renderings, conditioned on (1) viewpoint and (2) transfer functions for opacity and color.  ...  As our model is independent of the choice of volume rendering process, we show how to analyze volume-rendered images produced by direct and global illumination lighting, for a variety of volume datasets  ...  Fig. 4 : 4 The architecture for our opacity GAN.  ... 
doi:10.1109/tvcg.2018.2816059 pmid:29993811 fatcat:jqfaopyry5c6pj64ouvuc4hgm4

Local Ambient Occlusion in Direct Volume Rendering

Frida Hernell, Patric Ljung, Anders Ynnerman
2010 IEEE Transactions on Visualization and Computer Graphics  
Multiresolution volume management and GPU-based computation are used to accelerate the calculations and support large data sets.  ...  This paper presents a novel technique to efficiently compute illumination for Direct Volume Rendering using a local approximation of ambient occlusion to integrate the intensity of incident light for each  ...  Local Ambient Occlusion in Direct Volume Rendering Frida Hernell, Patric Ljung, Member, IEEE Computer Society, and Anders Ynnerman, Member, IEEE Abstract-This paper presents a novel technique to efficiently  ... 
doi:10.1109/tvcg.2009.45 pmid:20467054 fatcat:oxwh7udqnfbbnhlj2v7vw7jxla

Importance-Driven Feature Enhancement in Volume Visualization

I. Viola, A. Kanitsar, M.E. Groller
2005 IEEE Transactions on Visualization and Computer Graphics  
This paper introduces importance-driven volume rendering as a novel technique for automatic focus and context display of volumetric data.  ...  The authors are with the Institute of Computer Graphics and Algorithms at the Vienna University of Technology, Austria. E-mail: {viola,armin,meister}@cg.tuwien.ac.at IX.  ...  Comparison between traditional volume rendering (top) and importance-driven volume rendering (bottom). The orange inner organ is the focus object Fig. 4 . 4 Maximum Importance Projection.  ... 
doi:10.1109/tvcg.2005.62 pmid:16138551 fatcat:iyknfs5d2fcvhmqehn7xm7myam

Direct visualization of volume data

T.S. Yoo, U. Neumann, H. Fuchs, S.M. Pizer, T. Cullip, J. Rhoades, R. Whitaker
1992 IEEE Computer Graphics and Applications  
Acknowledgments 2. 3. 4. 5. 6. I. 8. 9. 10.  ...  W e can treat a volume image as a _?-manifold i n 4-space. and analyze ridges and valleys in the 3-manifold.  ...  Renderci-s also have backing store ports that allow data inovement in and out of secondary memorv under Graphics Procesaor control. 64 IEEE ('omputcr (;raphic\ Kr Applications Volume renderers A  ... 
doi:10.1109/38.144828 fatcat:rdexvsaumrfivktnhnkngjkawq

Multiresolution representation and visualization of volume data

P. Cignoni, C. Montani, E. Puppo, R. Scopigno
1997 IEEE Transactions on Visualization and Computer Graphics  
A system to represent and visualize scalar volume data at multiple resolution is presented.  ...  VOLUME DATA APPROXIMATION A scalar volume dataset is given by the values of a scalar field \ taken at a finite set of sample points V in 4 3 .  ...  In the first part (Sections 2-4), we show how a multiresolution model for volume data based on tetrahedral meshes can be built and stored.  ... 
doi:10.1109/2945.646238 fatcat:6is6yon3jrarpod5syhteg5mdy

Tricubic interpolation of discrete surfaces for binary volumes

A. Kadosh, D. Cohen-Or, R. Yagel
2003 IEEE Transactions on Visualization and Computer Graphics  
Binary-defined 3D objects are common in volume graphics and medical imaging as a result of voxelization algorithms, segmentation methods, and binary operations such as clipping.  ...  Moreover, it does not require special graphics hardware and can therefore easily integrate many additional acceleration techniques [4] .  ...  However, in our implementation, we used a volume of two bytes per voxel.  ... 
doi:10.1109/tvcg.2003.1260750 fatcat:r7zqeypop5ecriglpd2zeacqpa
« Previous Showing results 1 — 15 out of 157,751 results