• 제목/요약/키워드: 볼륨렌더링

Search Result 176, Processing Time 0.024 seconds

Extravasation Injury of Contrast Media in the Neck and Thorax During MDCT Scanning with 3D Image Reformation Findings (CT검사에서 조영제의 혈관외유출에 의한 목 및 흉부 손상의 3차원 재구성 영상)

  • Kweon, Dae-Cheol;Jang, Keun-Jo;Yoo, Beong-Gyu;Lee, Jong-Seok
    • Journal of radiological science and technology
    • /
    • v.30 no.3
    • /
    • pp.281-287
    • /
    • 2007
  • Contrast media may cause tissue injury by extravasation during intravenous automated injection during CT examination. Here, we present a study in which contrast media extravasation was detected and localized in the neck and thorax by three-dimensional(3D) CT data reformation. The CT studies of the extavasation site were performed using a 3D software program with four different display techniques axial, multi planar reformation(MPR), maximum intensity projection(MIP), and volume rendering displays are currently available for reconstructing MDCT data. 3D image reconstructions provide accurate views of high-resolution imaging. This paper introduces extravasation with the MDCT and 3D reformation findings of contrast media extravasation in neck ant thorax. The followed injection of the external jugular vein into an existing intravenous catheter and a large volume of extravasation was demonstrated on by 3D MDCT.

  • PDF

A Surface Reconstruction Method from Contours Based on Dividing Virtual Belt (가상벨트 분할에 기반한 등고선으로부터의 표면재구성 방법)

  • Choi, Young-Kyu;Lee, Seung-Ha
    • The KIPS Transactions:PartB
    • /
    • v.14B no.6
    • /
    • pp.413-422
    • /
    • 2007
  • This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.

Development of K-$Touch^{TM}$ API for kinesthetic/tactile haptic interaction (역/촉감 햅틱 상호작용을 위한 "K-$Touch^{TM}$" API 개발 - 햅틱(Haptic) 개발자 및 응용분야를 위한 소프트웨어 인터페이스 -)

  • Lee, Beom-Chan;Kim, Jong-Phil;Ryu, Je-Ha
    • Journal of the HCI Society of Korea
    • /
    • v.1 no.2
    • /
    • pp.1-8
    • /
    • 2006
  • This paper presents a development of new haptic API (Application Programming Interface) that is called K-$Touch^{TM}$ haptic API. It is designed in order to allow users to interact with objects by kinesthetic and tactile modalities through haptic interfaces. The K-$Touch^{TM}$ API would serve two different types of users: high level programmers who need an easy to use haptic API for creating haptic applications and researchers in the haptic filed who need to experiment or develop with new devices and new algorithms while not wanting to re-write all the required code from scratch. Since the graphic hardware based kinesthetic rendering algorithm implemented in the K-$Touch^{TM}$ API is different from any other conventional kinesthetic algorithms, this API can provide users with haptic interaction for various data representations such as 2D, 2.5D depth(height field), 3D polygon, and volume data. In addition, this API supports kinesthetic and tactile interaction simultaneously in order to allow users with realistic haptic interaction. With a wide range of applicative characteristics, therefore, it is expected that the proposed K-$Touch^{TM}$ haptic API will assists to have deeper recognition of the environments, and enhance a sense of immersion in environments. Moreover, it will be useful development toolkit to investigate new devices and algorithms in the haptic research field.

  • PDF

A Real-time Single-Pass Visibility Culling Method Based on a 3D Graphics Accelerator Architecture (실시간 단일 패스 가시성 선별 기법 기반의 3차원 그래픽스 가속기 구조)

  • Choo, Catherine;Choi, Moon-Hee;Kim, Shin-Dug
    • The KIPS Transactions:PartA
    • /
    • v.15A no.1
    • /
    • pp.1-8
    • /
    • 2008
  • An occlusion culling method, one of visibility culling methods, excludes invisible objects or triangles which are covered by other objects. As it reduces computation quantity, occlusion culling is an effective method to handle complex scenes in real-time. But an existing common occlusion culling method, such as hardware occlusion query method, sends objects' data twice to GPU and this causes processing overheads once for occlusion culling test and the other is for rendering. And another existing hardware occlusion culling method, VCBP, can test objects' visibility quickly, but it neither test bounding volume nor return test result to application stage. In this paper, we propose a single pass occlusion culling method which uses temporal and spatial coherency, with effective occlusion culling hardware architecture. In our approach, the hardware performs occlusion culling test rapidly with cache on the rasterization stage where triangles are transformed into fragments. At the same time, hardware sends each primitive's visibility information to application stage. As a result, the application stage reduces data transmission quantity by excluding covered objects using the visibility information on previous frame and hierarchical spatial tree. Our proposed method improved maximum 44%, minimum 14% compared with S&W method based on hardware occlusion query. And the performance is increased 25% and 17% respectively, compared to maximum and minimum performance of CHC method which is based on occlusion culling method.

Characteristic of Coils According to Volume in Case of Embolization of Cerebral Aneurysm (뇌동맥류에 대한 색전술 시 체적에 따른 코일 특성)

  • Chae, Soo-In;Baek, Chang-Moo;Kim, Jeong-Koo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.7
    • /
    • pp.247-254
    • /
    • 2012
  • This study presents the assessment results of coil length characteristics according to the volume of cerebral artery among the inpatients that received angiography and coil embolization following intracranial aneurysm from March, 2010 to September 2011. The volume rendering method was applied to the patients that received embolization to their cerebral arteries to obtain volume measurements. After coil embolization, the volume ratios were calculated with the volumes and lengths of coils. The embolic volume ratios were $43.11{\pm}3.11%$, $36.07{\pm}2.03%$, 40.91%, and 38.25% when the aneurysm sizes were 6mm or less, 6~10mm, 10~15mm and 20mm or more, respectively, being similar to the recommended volume ratios. Regardless of the types of aneurysm, the coil length according to volume was 0.65cm per $1mm^3$ of 20~$100mm^3$ when one type of 0.25mm diameter coil was used. They were 0.62cm per $1mm^3$ of 20~$150mm^3$ when one type of coil was used in the aneurysm volume of the saccular type and 0.60cm per $1mm^3$ of 20~$90mm^3$ when one type of coil was used in the aneurysm volume of the multi-lobulated type.

Measurement of the Mucosal Surface Distance in the Early Gastric Cancer Using CT Gastrography (조기 위암에서 CT Gastrography를 이용한 위점막 표면 거리 측정)

  • Choi, Hyang-Hee;Yu, Wan-Sik;Ryeom, Hun-Kyu;Lee, Jae-Hyuk;Choi, Jae-Jeong;Kim, Hee-Su;Cleary, Kevin;Mun, Seong-Ki;Chung, Ho-Young
    • Journal of Gastric Cancer
    • /
    • v.6 no.3
    • /
    • pp.161-166
    • /
    • 2006
  • Purpose: Recently, the incidence of early gastric cancer (EGC) patients is rapidly increased in Korea. However, they're often not perceptible by surgical palpation or inspection. The aim of this study is 1) to develope a software that can locate the tumor and measure the mucosal distance from an anatomic landmark to the tumor using CT gastrography and 2) to compare the distance measured by the developed software with the distance measured by the pathologic findings. Materials and Methods: Between January 2004 and September 2005, sixty patients (male=45, female=15, mean 57.8 years old) estimated for EGC with preoperative CT scans and undergone gastrectomies in Kyungpook National University Hospital were enrolled in this study. Preoperative CT scans were performed after insufflations of room air via 5 Fr NG tube. The scans included the following parameters: (slice thickness/reconstruction interval: 0.625 mm, kVp: 120, mAs: 200). 3D volume rendering and measurement of the surface distance from the pylorus to the EGC were performed using the developed software. Results: The average difference between the lesion to pylorus distances measured from pathologic specimens and CT gastrography was $5.3{\pm}2.9\;mm(range,\;0{\sim}23\;mm)$. The lesion to pylorus distance measured from CT gastrography was well correlated with that measured from the pathologic specimens (r=0.9843, P<0.001). Conclusion: These results suggest that the surface distance from an anatomic landmark to the EGC can be measured accurately by CT gastrography. This technique could be used for preoperative localization of early gastric carcinomas to determine the optimal extent of surgical resection.

  • PDF