CPU-GPU Rendering of CT Scan Images for Vertebra Reconstruction from CT Scan Images with a Calibration Policy

2020 ◽  
pp. 1-5
Author(s):  
Usman Khan ◽  
Usman Khan ◽  
AmanUllah Yasin ◽  
Imran Shafi ◽  
Muhammad Abid

In this work GPU implementation of classic 3D visualization algorithms namely Marching Cubes and Raycasting has been carried for cervical vertebra using VTK libraries. A proposed framework has been introduced for efficient and duly calibrated 3D reconstruction using Dicom Affine transform and Python Mayavi framework to address the limitation of benchmark visualization techniques i.e. lack of calibration, surface reconstruction artifacts and latency.

2015 ◽  
Vol 22 (3) ◽  
pp. 99-104 ◽  
Author(s):  
Henryk Krawczyk ◽  
Michał Nykiel ◽  
Jerzy Proficz

Abstract The recently deployed supercomputer Tryton, located in the Academic Computer Center of Gdansk University of Technology, provides great means for massive parallel processing. Moreover, the status of the Center as one of the main network nodes in the PIONIER network enables the fast and reliable transfer of data produced by miscellaneous devices scattered in the area of the whole country. The typical examples of such data are streams containing radio-telescope and satellite observations. Their analysis, especially with real-time constraints, can be challenging and requires the usage of dedicated software components. We propose a solution for such parallel analysis using the supercomputer, supervised by the KASKADA platform, which with the conjunction with immerse 3D visualization techniques can be used to solve problems such as pulsar detection and chronometric or oil-spill simulation on the sea surface.


2012 ◽  
Vol 182-183 ◽  
pp. 1343-1346
Author(s):  
De Wen Seng ◽  
Da Qing Li

The procedure of volume rendering techniques is introduced. The principles and methods of two kinds of different volume rendering techniques of 3D spatial data are discussed. Application of Marching Cubes (MC) algorithm in the modeling of geological objects is given. This algorithm is modified and improved in several aspects. The asymptotic decider algorithm is employed to solve the ambiguity problem and oct-tree structure is used to reduce the number of polygons generated, which will increases the efficiency of the algorithm. The improved algorithm is applied to real geological data obtained from an iron mine in China. Real data derived from an iron mine of China demonstrates the effectiveness and efficiency of the system and the algorithms.


2014 ◽  
Vol 40 (4) ◽  
pp. 156-162 ◽  
Author(s):  
Andrea Pődor ◽  
Marta Kiszely

The aim of the study is to find possible solutions to represent earthquake catalogue data and design maps which can help non-professionals to identify those places where earthquakes occurred frequently. The goal is to visualize all available catalogue data sets in a complex way on a single map, displaying the long-term recurrence times of earthquakes. Therefore, raw data and aggregated data were combined with different cartographic visualization techniques to test the applicability of earthquake maps. Preliminary research demonstrates that aggregation can improve the process of retrieving information from earthquake maps and 3D visualization is useful to find the places of earthquakes of highest magnitude. A second result is that 3D visualization is not effective in the comparison of quantities of released energy and the number of earthquakes.


2009 ◽  
Vol 9 (2) ◽  
pp. 152-164 ◽  
Author(s):  
Andreas Kjellin ◽  
Lars Winkler Pettersson ◽  
Stefan Seipel ◽  
Mats Lind

New technologies and techniques allow novel kinds of visualizations and different types of 3D visualizations are constantly developed. We propose a categorization of 3D visualizations and, based on this categorization, evaluate two versions of a space-time cube that show discrete spatiotemporal data. The two visualization techniques used are a head-tracked stereoscopic visualization (‘strong 3D’) and a static monocular visualization (‘weak 3D’). In terms of effectiveness and efficiency the weak 3D visualization is as good as the strong 3D and thus the need for advanced 3D visualizations in these kinds of tasks may not be necessary.


2021 ◽  
Author(s):  
Imane Zaimi ◽  
Nabila Zrira ◽  
Ibtissam Benmiloud ◽  
Imad Marzak ◽  
Kawtar Megdiche ◽  
...  

2016 ◽  
pp. 620-642 ◽  
Author(s):  
Erdem Kaya ◽  
Mustafa Tolga Eren ◽  
Candemir Doger ◽  
Selim Saffet Balcisoy

Conventional visualization techniques and tools may need to be modified and tailored for analysis purposes when the data is spatio-temporal. However, there could be a number of pitfalls for the design of such analysis tools that completely rely on the well-known techniques with well-known limitations possibly due to the multidimensionality of spatio-temporal data. In this chapter, an experimental study to empirically testify whether widely accepted advantages and limitations of 2D and 3D representations are valid for the spatio-temporal data visualization is presented. The authors implemented two simple representations, namely density map and density cube, and conducted a laboratory experiment to compare these techniques from task completion time and correctness perspectives. Results of the experiment revealed that the validity of the generally accepted properties of 2D and 3D visualization needs to be reconsidered when designing analytical tools to analyze spatio-temporal data.


2020 ◽  
Vol 20 (09) ◽  
pp. 2040002
Author(s):  
MONAN WANG ◽  
HAIYANG LUO ◽  
QI CUI

Based on the standard Marching Cubes (MC) algorithm, this paper proposes an improved MC algorithm. First, the original 15 topological configurations in the MC algorithm are increased to 24, which effectively avoid the generation of voids phenomenon. To further improve the speed of three-dimensional (3D) reconstruction, in this paper, the midpoint selection method is used instead of the linear interpolation method, and the 24 configurations are divided into three types. Each class corresponds to a thread. The multi-thread parallel processing is used to improve the calculation speed. The critical region is used to realize multi-thread synchronization, and then we designed a protocol mapping table according to the idea of the message mapping table. The function pointer is triggered by macro. Processing function is called by function pointer and completes the encapsulation of the protocol mapping table, which maintains the opening and closing principle of the class and ensures the scalability of the class. Through the improved MC algorithm accuracy verification and reconstruction speed verification, it is concluded that the improved MC algorithm can make up for the voids problem. By comparing the calculation time under the two platforms of Windows and Linux, the reconstruction speed of the improved MC algorithm is approximately 30% faster than the standard MC algorithm and 40% faster than the Masala algorithm. Finally, the algorithm is applied to the medical image 3D reconstruction system, and the accuracy and applicability of the algorithm are demonstrated by two sets of examples.


Author(s):  
Scott Neurauter ◽  
Sabrina Szeto ◽  
Matt Tindall ◽  
Yan Wong ◽  
Chris Wright

3D visualization is the process of displaying spatial data to simulate and model a real three dimensional space. Using 3D visualization, Geomatic professionals are enabling pipeline engineers to make better decisions by providing an increased understanding of potential costs earlier in the design process. This paper will focus on the value of visualizing Digital Elevation Model (DEM) data through the use of hillshades and imagery-draped 3D models. From free online DEM data to high resolution Light Detection and Ranging (LiDAR) derived DEM data, the increased availability allows for a broader use of 3D visualization techniques beyond 3D analysis. Of the numerous sources available, two DEM sources will be discussed in this paper, the free low resolution DEM (CDED Level 1) and the more costly but higher resolution LiDAR based DEM. Traditional methods of evaluating potential locations for route and facilities involved a significant cost for ground truthing. Through the use of 3D visualization products, multiple potential locations can be examined for suitability without the expense of field visits for every candidate site. By focusing on the selected candidate locations using a visual desktop study, the time and expense of ground truthing all of the potential sites can be reduced significantly. Exploiting the visual value of DEM permits a productive and cost efficient methodology for initial route and facility placement on hydrocarbon projects.


Sign in / Sign up

Export Citation Format

Share Document