• Journal of the Korean Society of Radiology
• /
• v.5 no.5
• /
• pp.255-260
• /
• 2011

We wanted to evaluate the usefulness of three-dimensional reconstructive images using computed tomography for rib fracture patients. The reconstruction used in clinical multi planar reformation(MPR), volume rendering technique(VRT), and image data using quantitative methods and qualitative methods were compared. Much more, the artifact shadow was minimized to reconstruct with 3D volumetric image by using an law data in the analysis of the reconstructive image and chest CT scan of the evaluation result fractures of the thoracic patient. And we could know that the fractures of the thoracic determination and three dimension volume image reconstruction time were reduced.

• Proceedings of the KSMRM Conference
• /
• 1996.10a
• /
• pp.18-18
• /
• 1996

• Journal of Digital Contents Society
• /
• v.11 no.4
• /
• pp.553-559
• /
• 2010

By applying the various reformation techniques by using a circle raw data of after computed tomography image in the patient enforcing the spine screw fixation, this research tried to look into the various information including the exact location of the position of the screw spike and accuracy of an operation. In a clinical, by applying the or multi planar reformatting(MPR), that is the re-composition technique used mainly, maximum intensity projection (MIP), and volume rendering technique(VRT) and transformation removal from a register modifying VRT, video data were compared and were analyzed by the quantitative method and qualitative method. It is judged as the transformation volume rendering technique of the re-composition technique which is most useful in minimizing the artifact shadow by the exact location of the position of a screw and metal among the analysis and evaluation result computed tomography image reformation technique of the reformation image after the spine screw fixation.

• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• v.27 no.1
• /
• pp.7-16
• /
• 1997

This study was performed to demonstrate the method of image reformation for dental implants, using a personal computer with inexpensive softwares and to compare the images reformatted using the above method with those using Dentascan software. CT axial slices of 5 mandibles of 5 volunteers from GE Highspeed Advantage(GE Medical systems, U.S.A.) were used. Personal computer used for image reformation was PowerWave 6041120 (Power Computing Co, U.S.A.) and softwares used were Osiris (Univ. Hospital of Geneva, Switzerland) and Import ACCESS V1.H Designed Access Co., U.S.A.) for importing CT images and NIH Image 1.58 (NIH, U.S.A.) for image processing. Seven images were selected among the serial reconstructed cross-sectional images produced by Dentascan(DS group). Seven resliced cross-sectional images at the same position were obtained at the personal computer(PC group). Regression analysis of the measurements of PC group was done against those of DS group. Measurements of the bone height and width at the reformed cross-sectional images using Mac-compatible computer were highly correlated with those using workstation with Dentascan software(height : r²=0.999, p<0.001, width : r²=0.991, p<0.001). So, it is considered that we can use a personal computer with inexpensive softwares for the dental implant planning, instead of the expensive software and workstation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.401-407
• /
• 2016

We can consider the following problems for two given points p and q in a simple polygon P. (1) Compute the set of points of P which are visible from both p and q. (2) Compute the set of points of P which are visible from either p or q. They are corresponding to the problems which are to compute the intersection and the union of two visibility polygons. In this paper, we consider algorithms for solving these problems on a reconfigurable mesh(in short, RMESH). The algorithm in [1] can compute the intersection of two general polygons in constant time on an RMESH with size O($n^3$), where n is the total number of vertices of two polygons. In this paper, we construct the planar subdivision graph in constant time on an RMESH with size O($n^2$) using the properties of the visibility polygon for preprocessing. Then we present O($log^2n$) time algorithms for computing the union as well as the intersection of two visibility polygons, which improve the processor-time product from O($n^3$) to O($n^2log^2n$).