• Journal of KIISE:Software and Applications
• /
• v.30 no.12
• /
• pp.1247-1254
• /
• 2003

Currently. the north american symptomatic carotid endarterectomy trial, european carotid surgery trial, and common carotid method are used to measure the carotid stenosis for determining candidate for carotid endarterectomy using the projection angiography from different modalities such as digital subtraction angiography. rotational angiography, computed tomography angiography and magnetic resonance angiography. A new computerized carotid stenosis measuring system was developed using MR angiography axial image to overcome the drawbacks of conventional carotid stenosis measuring methods, to reduce the variability of inter-observer and intra-observer. The gray-level thresholding is one of the most popular and efficient method for image segmentation. We segmented the carotid artery and lumen from three-dimensional time-of-flight MRA axial image using gray-level thresholding technique. Using the measured intima-media thickness value of common carotid artery for each cases, we separated carotid artery wall from the segmented carotid artery region. After that, the regions of segmented carotid without artery wall were divided into region of blood flow and plaque. The calculation of carotid stenosis degree was performed as the following; carotid stenosis grading is(area measure of plaque/area measure of blood flow region and plaque) * 100%.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.4 s.97
• /
• pp.189-196
• /
• 1999

환경지도를 갖고 있는 이동로봇은 정확한 경로계획에 의하여 주행하게 된다. 그러나 주행 중 예상하지 못한 장애물을 만나는 경우 새로운 경로정보가 요구된다. 본 논문에서는 부분적인 환경정보를 갖고 있는 이동로봇의 경로계획기법을 제시한다. 경로계획은 전체경로계획과 지역경로계획으로 구분되면 전체환경을 노드와 아크로 표시한 네트워크 모델을 이용하여 수행된다. 경로계획시간과 메모리 부담을 개선하기 위하여 네트워크 분할기법을 이용한 경로계획기법을 제안하였으며 지역경로계획에서는 정보가 변경된 부 네트워크에 대하여 경로계획을 수행하여 계산시간을 적게 소요하며 새로운 경로를 계산한다. 제안한 기법을 자동화 공장에서 주행하는 이동로봇에 적용하였으며 시뮬레이션과 실험을 통하여 제안한 기법의 성능을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.101-106
• /
• 2010

As a part of preparing the sniffing attack, this routing method presented in this thesis decreases the risk rates of the leaking of information through separating valid data and transmitting by a multi-path. then data is transmitted from start node to destination node on distributed sensor network. The level of reduction in leaking of information by the sniffing attack is proved by experimental result thich compare the case described above with the case of transmitting whole data with the single path by simulation, and the algorithm for choosing the routing path is showed by proof of the theorem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.23-26
• /
• 2005

XML이 발표되면서 대용량의 XML을 효과적으로 관리하는 여러 가지 방법들이 연구되고 있다. 특히 지금까지 상업적, 기술적으로 성공적이고 안정된 데이터 모델인 관계형 데이터베이스를 활용하는 여러 가지 방법들이 연구되고 있다. 본 논문은 관계형 DBMS를 사용하여 XML 질의어인 XQuery를 SQL로 변환하여 처리하는 효율적인 방법을 제안한다. 우선 본 논문에서 제안하는 방식은 XML문서를 분할하여 관계형 테이블에 저장하는 분할방식을 사용하며, 분할된 관계형 테이블을 이용하여 XPath를 포함한 XQuery의 기능을 실행하는 SQL을 생성하여 관계형 DBMS에서 SQL을 실행하는 방식을 사용한다. 제안한 XQuery 처리방식은 먼저 XQuery의 구문 분석을 통하여 AST(Abstract Syntax Tree)를 생성하고, AST를 순회하면서 SQL문장을 생성한다. 생성된 SQL문장은 XML 문서의 경로를 사용함으로써 XQuery 연산의 조인 횟수를 감소시키며, 각 노드마다 부여된 순서 정보를 효과적으로 사용하여 문서의 원래 순서에 맞는 XML 부분을 생성하는 방법을 제시한다. 그리고 실제 제안된 시스템을 개발하여 그 성능을 평가한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.645-648
• /
• 2001

본 논문에서는 포맷 변환기를 사용하여 여러 가지 영상처리 필터링을 구현하였다. 이러한 설계기법은 집적회로를 이용한 대규모 화소처리배열을 근거로 하여 실현하였다. 집적구조의 두가지 형태는 연산병렬프로세서와 병렬 프로세스 DRAM(또는 SRAM) 셀로 분류할 수 있다. 이러한 포맷 변환기 설계는 효율적인 제어 경로 수행을 능력을 가지고 있으며 하드웨어를 복잡하게 한 필요 없이 고급 기술로 사용 될 수 있다. 실험 결과 1)단순한 평활화는 더 높은 공간의 주파수를 억제하면서 잡음을 감소시킬 뿐 아니라 에지를 흐리게 할 수 있으며, 2) 평활화와 분할 과정은 날카로운 에지를 보존하면서 잡음을 감소시키고, 3) 평활화와 분할과 같은 메디안 필터링기법은 영상 잡음을 줄이기 위해 적용될 수 있고 날카로운 에지는 유지하면서 스파이크 성분을 제거하고 화소 값에서 단조로운 변화를 유지 할 수 있었다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.265-269
• /
• 2007

In this paper, we propose an automatic extraction method of gastric cancer region from electronic endoscopic images. We use the brightness and saturation of HSI in removing noises by illumination and shadows by the crookedness occurring in the endoscopic process. We partition the image into several areas with similar pigments of hemoglobin using IHb. The candidate areas for gastric cancer are defined as the areas that have high hemoglobin pigments and high value in every channel of RGB. Then the morphological characteristics of gastric cancer are used to decide the target region. In experiment, our method is sufficiently accurate in that it correctly identifies most cases (18 out of 20 cases) from real electronic endoscopic images, obtained by expert endoscopists.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.369-374
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.

• Journal of Veterinary Clinics
• /
• v.33 no.1
• /
• pp.1-5
• /
• 2016

Septic tenosynovitis of the digital flexor tendon sheath (DFTS) is a potentially career-ending and life-threatening problem in horses. This study aimed to describe the outcomes of tenoscopy for the treatment of acute septic digital flexor tenosynovitis in horses. Tenoscopy was performed on 13 Thoroughbred horses with acute septic tenosynovitis of the DFTS. Surgical time was 56-148 min (mean 85.6 min, median 84.0 min). In the synovial fluid analysis, mean white blood cell count, mean neutrophil proportion, and mean total protein were $42.9{\times}10^3cells/{\mu}l$ (range, $7.2-109.5cells/{\mu}l$), 89.5% (range, 68-97%), and 4.0 g/dl (range, 2.5-5.2 g/dl), respectively. Microbial growth in the synovial fluid culture was detected in 2 of 11 horses. All horses survived and returned to their intended use without complications. The present study demonstrated that the tenoscopy is useful for treating acute septic tenosynovitis of the DFTS in horses.

• Journal of the Korean Chemical Society
• /
• v.62 no.5
• /
• pp.344-351
• /
• 2018

The IR spectra of gaseous phenanthrene, phenathrenols, phenanthrenyl radicals, and hydroxylphenanthrene radicals have been obtained using the BLYP/6-311++G(d,p) method. A comparison of these spectra shows that the measurements of IR spectra can be valuable to identify the reaction pathway(s) of the phenanthrene decomposition reaction by ${\cdot}OH$. We have found that the H atom abstraction reaction process can be easily identifiable from the $650-850cm^{-1}$ (CH out-of-plane bending) region and the ${\cdot}OH$ addition reaction process from the CH stretching and bending modes region of IR spectra. In addition, the calculated IR spectra of all five phenanthren-n-ols (n = 1, 2, 3, 4, 9) have also given in this work.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.2
• /
• pp.176-184
• /
• 2000

Possible representation methods for the product structure have been compared and analyzed to determine optimal disassembly path of a product. Petri net is selected as the most optimal method to represent disassembly path of the product. In this method, a reachability tree for the product is generated and disassembly time for each path is calculated. A path with the smallest disassembly time is selected as the optimal path. A software far DPN(Disassembly Petri Net) has been developed and applied to search the optimal disassembly path for a ballpoint pen disassembly process as an example.