Kim, Se-Jin;Kim, Sun-Jae;Ha, Hee-Ju;Kil, Gyung-Suk;Kim, Il-Kwon
Journal of Advanced Marine Engineering and Technology
/
v.38
no.6
/
pp.737-743
/
2014
This paper dealt with a retrofit high power LED searchlight to replace conventional 1kW halogen searchlights. The design specification meets KDS 6230-1046-1 and KS V 8469. An optical lens with the beam angle of $6^{\circ}$ was used to meet the luminous intensity of 800,000cd at $0^{\circ}$ in horizontal line. Heat dissipation of the LED searchlight adopted a free air cooling type which does not use a fan or a heat-pipe. From the test results, power consumption of the prototype LED searchlight was 148W which was saved by 85% comparing a halogen searchlight of 1kW. Luminous intensity was 945,000cd at $0^{\circ}$ in horizontal line, satisfying KS V 8469. Luminous efficacy was improved by 4.7 times higher than that of the halogen searchlights. Beam angle, color temperature, and color rendering index(CRI) was $5.4^{\circ}$, 5,500K, and 70, respectively. Surface temperature of the LED searchlight was below $60^{\circ}C$ and surrounding temperature of the SMPS installed inside was below $50^{\circ}C$ which were satisfied with the IEC 60092-306.
Oh Jungsu;Cho Ik Hwan;Na Dong Gyu;Chang Kee Hyun;Park Kwang Suk;Song In Chan
Investigative Magnetic Resonance Imaging
/
v.9
no.1
/
pp.2-8
/
2005
Purpose : The purpose of this study was to implement a software to visualize tumor and its surrounding fiber tracts simultaneously using diffusion tensor imaging and examine the feasibility of our software for investigating the influence of tumor on its surrounding fiber connectivity. Material and Methods : MR examination including T1-weigted and diffusion tensor images of a patient with brain tumor was performed on a 3.0 T MRI unit. We used the skull-striped brain and segmented tumor images for volume/surface rendering and anatomical information from contrast-enhanced T1-weighted images. Diffusion tensor images for the white matter fiber-tractography were acquired using a SE-EPI with a diffusion scheme of 25 directions. Fiber-tractography was performed using the streamline and tensorline methods. To correct a spatial mismatch between T1-weighted and diffusion tensor images, they were coregistered using a SPM. Our software was implemented under window-based PC system. Results : We successfully implemented the integrated visualization of the fiber tracts with tube-like surfaces, cortical surface and the tumor with volume/surface renderings in a patient with brain tumor. Conclusion : Our result showed the feasibility of the integrated visualization of brain tumor and its surrounding fiber tracts. In addition, our implementation for integrated visualization can be utilized to navigate the brain for the quantitative analysis of fractional anisotropy to assess changes in the white matter tract integrity of edematic and peri-edematic regions in a number of tumor patients.
There are many difficulties to develop a mobile contents due to many constraints on mobile environments. It is difficult to make a good mobile contents with only visual reduction of existing contents on wire Internet. Therefore, it is essential to devise the data representation and to develop the authoring tool to meet the needs of the mobile contents market. We suggest the compact mobile contents to learn Chinese characters and developed its authoring tool. The animation which our system produces is realistic as if someone writes letters with pen or brush. Moreover, our authoring tool makes a user generate a Chinese character animation easily and rapidly although she or he has not many knowledge in computer graphics, mobile programming or Chinese characters. The method to generate the stroke animation is following: We take basic character shape information represented with several contours from TTF(TrueType Font) and get the information for the stroke segmentation and stroke ordering from simple user input. And then, we decompose whole character shape into some strokes by using polygonal approximation technique. Next, the stroke animation for each stroke is automatically generated by the scan line algorithm ordered by the stroke direction. Finally, the ordered scan lines are compressed into some integers by reducing coordinate redundancy As a result, the stroke animation of our system is even smaller than GIF animation. Our method can be extended to rendering and animation of Hangul or general 2D shape based on vector graphics. We have the plan to find the method to automate the stroke segmentation and ordering without user input.
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.
Recently, the smart applications, such as smart phone and smart TV, become a hot issue in IT consumer markets. In particular, the smart TV provides 3D video services, hence efficient coding methods for 3D video data are required. Three-dimensional (3D) video involves stereoscopic or multi-view images to provide depth experience through 3D display systems. Binocular cues are perceived by rendering proper viewpoint images obtained at slightly different view angles. Since the number of viewpoints of the multi-view video is limited, 3D display devices should generate arbitrary viewpoint images using available adjacent view images. In this paper, after we explain a view synthesis method briefly, we propose a new algorithm to compensate view synthesis errors around object boundaries. We describe a 3D warping technique exploiting the depth map for viewpoint shifting and a hole filling method using multi-view images. Then, we propose an algorithm to remove boundary noises that are generated due to mismatches of object edges in the color and depth images. The proposed method reduces annoying boundary noises near object edges by replacing erroneous textures with alternative textures from the other reference image. Using the proposed method, we can generate perceptually inproved images for 3D video systems.
Recently the depth-image-based rendering (DIBR) method is usually used in 3D image application filed. Virtual view image is created by using a known view with associated depth map to make a virtual view point which did not taken by the camera. But, disocclusion area occur because the virtual view point is created using a depth image based image 3D warping. To remove those kind of disocclusion region, many hole filling methods are proposed until now. Constant color region searching, horizontal interpolation, horizontal extrapolation, and variational inpainting techniques are proposed as a hole filling methods. But when using those hole filling method some problem occurred. The different types of annoying artifacts are appear in texture region hole filling procedure. In this paper to solve those problem, the multi-directional extrapolation method is newly proposed for efficiency of expanded hole filling performance. The proposed method is efficient when performing hole filling which complex texture background region. Consideration of directionality for hole filling method use the hole neighbor texture pixel value when estimate the hole pixel value. We can check the proposed hole filling method can more efficiently fill the hole region which generated by virtual view synthesis result.
For medical students and doctors, knowledge of the three-dimensional (3D) structure of brain is very important in diagnosis and treatment of brain diseases. Two-dimensional (2D) tools (ex: anatomy book) or traditional 3D tools (ex: plastic model) are not sufficient to understand the complex structures of the brain. However, it is not always guaranteed to dissect the brain of cadaver when it is necessary. To overcome this problem, the virtual dissection programs of the brain have been developed. However, most programs include only 2D images that do not permit free dissection and free rotation. Many programs are made of radiographs that are not as realistic as sectioned cadaver because radiographs do not reveal true color and have limited resolution. It is also necessary to make the virtual dissection programs of each race and ethnic group. We attempted to make a virtual dissection program using a 3D image of the brain from a Korean cadaver. The purpose of this study is to present an educational tool for those interested in the anatomy of the brain. The procedures to make this program were as follows. A brain extracted from a 58-years old male Korean cadaver was embedded with gelatin solution, and serially sectioned into 1.4 mm-thickness using a meat slicer. 130 sectioned specimens were inputted to the computer using a scanner ($420\times456$ resolution, true color), and the 2D images were aligned on the alignment program composed using IDL language. Outlines of the brain components (cerebrum, cerebellum, brain stem, lentiform nucleus, caudate nucleus, thalamus, optic nerve, fornix, cerebral artery, and ventricle) were manually drawn from the 2D images on the CorelDRAW program. Multimedia data, including text and voice comments, were inputted to help the user to learn about the brain components. 3D images of the brain were reconstructed through the volume-based rendering of the 2D images. Using the 3D image of the brain as the main feature, virtual dissection program was composed using IDL language. Various dissection functions, such as dissecting 3D image of the brain at free angle to show its plane, presenting multimedia data of brain components, and rotating 3D image of the whole brain or selected brain components at free angle were established. This virtual dissection program is expected to become more advanced, and to be used widely through Internet or CD-title as an educational tool for medical students and doctors.
In order to establish fundamental data for stream restoration and environmental flow, we investigated optimal ecological flowrate (OEF) and riverine health condition in the Chogang Stream, a tributary to Geum River, Korea. The number of fish individuals sampled in this period were 4,669 in 36 species of 9 families. The most abundant species was Korean chub (Zacco koreanus, 34.0%) followed by pale chub (Z. platypus, 22.6%) and Korean shinner (Coreoleuciscus splendidus, 13.3%). Index of biological integrity (IBI) and qualitative habitat evaluation index (QHEI) values decreased from upstream to downstream along the stream. The estimated IBI value ranged from 27.9 to 38.6 with average 32.2 out of 50, rendering the site ecologically fair to good health conditions. OEF was estimated by the physical habitat simulation system (PHABSIM) using the habitat suitability indexes (HSI) of three fish species Z. koreanus, C. splendidus and Pseudopungtungia nigra selected as indicator species. In Z. koreanus, HSI for flow velocity and water depth were estimated at 0.1 to 0.4 m/s and 0.2 to 0.4 m, respectively. In P. nigra, HSI for flow velocity, water depth and substrate size were estimated at 0.2 to 0.5 m/s and 0.4 to 0.6 m and fine gravel to cobbles, respectively. OEF values increasing from up to downstream was found to increase, weighted usable area (WUA) values increased accordingly.
Lee, Soo Hyun;Kwon, Sang-Jo;Lee, Sang Eun;Kim, Jeong-Heon;Lee, Jung-Soo;Na, Ja Hyun;Han, Jaejoon
Korean Journal of Food Science and Technology
/
v.46
no.6
/
pp.739-742
/
2014
This study investigated the effect of perforation by the Indian meal moth (Plodia interpunctella) larvae on various flexible food-packaging films, in relation to their thickness and type. Among the various flexible packaging films, polyethylene (PE), aluminum foil (AF), polypropylene (PP), polystyrene (PS), and polyethylene terephthalate (PET) were selected for this study due to their wide usage in food packaging. Based on their thickness, film penetration by P. interpunctella larvae was measured as in following order: PP, $20{\mu}m$; AF, $9{\mu}m$; PET, $12{\mu}m$; PP, $30{\mu}m$; PS, $30{\mu}m$; PE, $40{\mu}m$; PE, $35{\mu}m$; PS, $60{\mu}m$; and PET, $16{\mu}m$. P. interpunctella larvae rapidly penetrated through the packaging films regardless of their thickness and type. In particular, it was observed that PP of $20{\mu}m$ and PS of $30{\mu}m$ were completely penetrated by P. interpunctella larvae within 72 h, rendering thin PP and PS films less valuable as anti-insect packaging films. Our results show that the perforations by P. interpunctella larvae were observed in the thin films. These results imply that each packaging film has a marginal thickness against the perforations by P. interpunctella larvae.
Park, Gyeong-Sin;Lee, Kyung-Ji;Jung, Chan-Kwon;Lee, Dae-Hyoung;Cho, Bin;Lee, Youn-Soo;Shim, Sang-In;Lee, Kyo-Young;Kang, Chang-Suk
The Korean Journal of Cytopathology
/
v.18
no.1
/
pp.46-54
/
2007
Cerebrospinal fluid (CSF) cytology is an effective tool for evaluating diseases involving the central nervous system, but this technique is usually limited by its low cellularity and poor cellular preservation. Here we compared the manual liquid-base $Liqui-PREP^{TM}$ (LP) to the cytospin (CS) with using a mononuclear cell suspension and we applied both methods to the CSFs of pediatric leukemia patients. The cytopresevability, in terms of cell yield and cell size, and the clinical efficacy were evaluated. When 2000 and 4000 mononuclear cells were applied, LP was superior to CS for the cell yield, 16.8% vs 1.7% (P=0.001) and 26.2% vs 3.5% (P=0.002), respectively. The mean size of the smeared cells was 10.60 ${\mu}m$ in the CS, 5.01 ${\mu}m$ in the LP and 6.50 ${\mu}m$ in the direct smear (DS), and the size ratio was 1.7 (CS to DS), 0.8(LP to DS) and 2.1 (CS to LP), respectively. As compared to the cells in the DS, the cells in the CS were significantly enlarged, but those in the LP were slightly shrunken. Upon application to 109 CSF samples, 4 were diagnosed as positive for leukemia (positive), 4 had atypical cells and 101 were negative by CS; 6 were positive, one had atypical cells and 102 were negative by LP. For six cases, in which 4 were positive for leukemia and 2 of 4 had atypical cells by CS, they were positive by LP and they were also confirmed as positive according to the follow-up study. Three cases diagnosed as atypical cells (two by CS and one by LP), were confirmed as negative. In conclusion, these results suggest that LP is superior to CS for the cytopresevability and for rendering a definite diagnosis of cerebrospinal fluid.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.