Results 251 to 260 of about 207,280 (295)
Some of the next articles are maybe not open access.
2014 International Symposium on Integrated Circuits (ISIC), 2014
This paper presents the considerations for improving the processing speed of ray-casting algorithm, which is widely used to visualize medical images, by using a parallel processing unit. The most important considerations are to exploit memory bandwidth and to maintain high occupancy. To improve memory bandwidth, cache-hit-rate should be kept high.
Hanjoo Cho, Young Hwan Kim
openaire +1 more source
This paper presents the considerations for improving the processing speed of ray-casting algorithm, which is widely used to visualize medical images, by using a parallel processing unit. The most important considerations are to exploit memory bandwidth and to maintain high occupancy. To improve memory bandwidth, cache-hit-rate should be kept high.
Hanjoo Cho, Young Hwan Kim
openaire +1 more source
An Improved Adaptive Ray Casting Algorithm
1991Ray casting is frequently used as a means of rendering volume data. While this results in realistic images, the computational cost associated with ray casting is high. (Levoy 1990) has proposed a method of performing adaptive ray-casting. In this paper, we propose a relatively straightforward improvement to this algorithm which, under simulation, casts
Renben Shu, Alan Liu, Kuan-Tsae Huang
openaire +1 more source
Rayfilling: A new method to accelerate ray casting
Computers & Graphics, 1994Abstract This paper presents a new method for ray casting solid models described by CSG trees. This new approach accelerates image generation by a reduction of the number of rays analysed in search of an intersection with the objects of a scene.
V. Belloli +4 more
openaire +1 more source
Automated X-ray inspection of aluminum castings
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1988The experience gained with several approaches to automatic flaw detection in X-ray images of cast aluminum wheels is described. Basic problems are mentioned, and the applicability of segmentation methods to actual inspection tasks is demonstrated.
Herbert Boerner, Helmut Strecker
openaire +1 more source
Secure Cloud-Based Volume Ray-Casting
2013 IEEE 5th International Conference on Cloud Computing Technology and Science, 2013Advances in cloud computing have allowed volume rendering tasks, typically done by volume ray-casting, to be outsourced to cloud data centers. The availability of volume data and rendered images (which can contain important information such as the disease information of a patient) to a third-party cloud provider, however, presents security and privacy ...
Manoranjan Mohanty +2 more
openaire +1 more source
Multi-frame thrashless ray casting with advancing ray-front
1996Coherency (data locality) is one of the most important factors that influences the performance of distributed ray tracing systems, especially when object dataflow approach is employed. The enormous cost associated with remote fetches must be reduced to improve the efficiency of the parallel renderer.
Asish Law, Roni Yagel
openaire +1 more source
Memory-Aware and Efficient Ray-Casting Algorithm
XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007), 2007Ray-casting implementations require that the connectivity between the cells of the dataset to be explicitly computed and kept in memory. This constitutes a huge obstacle for obtaining real-time rendering for very large models. In this paper, we address this problem by introducing a new implementation of the ray-casting algorithm for irregular datasets.
Saulo P. Ribeiro +4 more
openaire +1 more source
Fast Ray-Casting for Irregular Volumes
2000This paper proposes a fast cell traverse method for volume rendering of irregular volume datasets. All cells of an irregular volume are subdivided into a set of tetrahedral cells for our algorithm. The number of calculations required to find the intersections of a ray and irregular volume is reduced by using the exterior faces of cells rather than the ...
openaire +1 more source
An optimal parallel algorithm for volume ray casting
Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation, 1996Volume rendering by ray casting is a computationally expensive problem. For interactive volume visualization, rendering has to be done in real time (30 frames/sec). Since the typical 3-D dataset size is 256/sup 3/ the use of parallel processing is imperative.
Goel, Vineet, Mukherjee, Amar
openaire +2 more sources
A ray queueing and sorting design for real time ray casting
2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353), 2002This paper presents a hardware design that processes several rays simultaneously to improve the memory access and compositing performance for three dimensional image synthesis using ray casting. By processing multiple rays, the memory access coherence of a group of neighbouring rays can be exploited and fewer page misses in a modern SDRAM memory device
openaire +1 more source