• The KIPS Transactions:PartB
• /
• v.14B no.3 s.113
• /
• pp.231-240
• /
• 2007

In this paper, we propose an automatic extraction model for unknown translations and implement an unknown translation extraction system using the proposed model. The proposed model as a phrase-alignment model is incorporated with three models: a phrase-boundary model, a language model, and a translation model. Using the proposed model we implement the system for extracting unknown translations, which consists of three parts: construction of parallel corpora, alignment of Korean and English words, extraction of unknown translations. To evaluate the performance of the proposed system we have established the reference corpus for extracting unknown translation, which comprises of 2,220 parallel sentences including about 1,500 unknown translations. Through several experiments, we have observed that the proposed model is very useful for extracting unknown translations. In the future, researches on objective evaluation and establishment of parallel corpora with good quality should be performed and studies on improving the performance of unknown translation extraction should be kept up.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.804-814
• /
• 2000

In this paper, we propose an effective method to detect the regions of interests in the Videostrobokymography System. Videostrobokymography system is a medical image processing system for extracting automatically the diagnosis parameters from the irregular vibratory movements of the vocal fold. We detect the regions of interests through three steps. In the first step, we remove the noise in the input image and we find the minimum energy value in each frame. In the second step, we computed the edge by everage value for the one line. In the third step, the regions of interests can be extracted by using the Merge Algorithm which uses the variance of luminance as the feature points. We experimented this method for the vocal fold images of nineteen patients. In consequence, the regions of interests are detected in most vocal fold images. The method proposed in this study is efficient enough to extract the region of interests in the vocal fold images with the frame rate of 40 frames/second and the resolution of 200${\times}$280 pixels.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.1
• /
• pp.31-40
• /
• 1992

This paper presents an automatic feature recognition system for recognizing and extracting feature information needed for the process planning input from a 3D CAD system. A given part is modeled by using the AutoCAD and feature information is automatically extracted from the AutoCAD database. The type of parts considered in this study is prismatic parts composed of faces perpendicular to the X, Y, Z axes and the types of features recognized by the proposed system are through steps, blind steps, through slots, blind slots, and pockets. Features are recognized by using the concept of convex points and concave points. Case studies are implemented to evaluate feasibilities of the function of the proposed system. The developed system is programmed by using Turbo Pascal on the IBM PC/AT on which the AutoCAD and the proposed system are implemented.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.6
• /
• pp.585-591
• /
• 2015

In transcription for spoken language research, labeling is a work linking text-represented utterance to recorded speech. Most existing labeling tools have been working manually. Semi-automatic labeling we are proposing consists of automation module and manual adjustment module. Automation module extracts voice boundaries utilizing G.Saha's algorithm, and predicts utterance boundaries using the number and length of utterance which established utterance text. For maintaining existing manual tool's accuracy, we provide manual adjustment user interface revising the auto-labeling utterance boundaries. The implemented tool of our semi-automatic algorithm speed up to 27% than existing manual labeling tools.

• Annual Conference of KIPS
• /
• 2002.04b
• /
• pp.1021-1024
• /
• 2002

본 연구에서는 인터넷에 존재하는 다양한 XML 문서에서 의미정보를 검색하기 위한 의미정보수집 이동에이전트 시스템을 개발하였다. 이동에이전트는 실행 프로그램이 이기종 분산 환경의 네트웍에서 자율적으로 이동 및 반응하며 실제로 데이터가 존재하고 있는 장소로 이동하여 목적을 수행한다. 의미 정보수집 이동에이전트 시스템의 연구를 위하여, 정보를 개념화하고 포괄적 DTD를 자동으로 생성할 수 있는 DTD생성기를 개발하였으며 의미정보를 추론할 수 있는 추론알고리즘을 연구하였다. 개발된 의미정보수집 이동에이전트 시스템은 정보가 존재하는 원격지 사이트에 파견되어 비정형 XML 문서를 대상으로 포괄적 DTD와 추론엔진을 이용하여, 의미정보를 추출하고 전송하는 임무를 수행한다. 따라서, 의미정보수집 이동에이전트 시스템을 이용한 정보수집은 정보의 질을 향상시키고 네트워크의 부하를 감소시킨다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.443-451
• /
• 2000

Until now, there have been various kinds of science information databsae which databased the science technology information, but they do not satisfy the aspiration of the users. Therefore, in the position of the users, it suggests the technology information space as a now paradigm, which supplement the function of science information DB. ICPIS which inputs described papers with keywords, offers the itemized summary of these contents, the visual indication and comparison of similar thesis, and it also supplises the abundant summary information, survey information, more than ten volumes of info communication thesis with starting the casual relation extraction for the users, playing a significant role in ICPIS is called KP, and it is package of domain knowledge that unifies the extraction and structure narration of the technology information. ICPIS extracts the technology information among the thesis that are deserved by the natural language treatment in the itemized KP keywords described, and form the prescribed summary structure in KP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.63-70
• /
• 2013

In previous research, we suggested a business process structured query language(BPSQL) for information extraction and retrieval in the business process framework, and used an existing query language with the tablization for each layer within the framework, but still had a problem to manually build with the specification of each layer information of BFP. To solve this problem, we suggest automatically to build the schema based business process model with model-to-text conversion technique. This procedure consists of 1) defining each meta-model of the entire structure and of database schema, and 2) also defining model transformation rules for it. With this procedure, we can automatically transform from defining through meta-modeling of an integrated information system designed to the schema based model information table specification defined of the entire layer each layer specification with model-to-text conversion techniques. It is possible to develop the efficiently integrated information system.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.847-856
• /
• 1995

When a human recognizes nouns in a sentence, s/he associates them with the hyper concepts of onus. For computer to simulate the human's word recognition, it should build the knowledge base (WordNet)for the hyper concepts of words. Until now, works for the WordNet haven't been performed in Korea, because they need lots of human efforts and time. But, as the power of computer is radically improved and common MRD becomes available, it is more feasible to automatically construct the WordNet. This paper proposes the method that automatically builds the WordNet of Korean nouns by using the descripti on of onus in Korean MRD, and it proposes the rules for extracting the hyper concepts (hypernyms)by analyzing structrual characteristics of Korean. The rules effect such characteristics as a headword lies on the rear part of sentences and the descriptive sentences of nouns have special structure. In addition, the WordNet prototype of Korean Nouns is developed, which is made by combining the hypernyms produced by the rules mentioned above. It extracts the hypernyms of about 2,500 sample words, and the result shows that about 92per cents of hypernyms are correct.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.1
• /
• pp.49-55
• /
• 2017

Computed tomographic angiography (CTA) is widely used in the diagnosis and treatment of coronary artery disease because it shows not only the whole anatomical structure of the cardiovascular three-dimensionally but also provides information on the lesion and type of plaque. However, due to the large size of the image, there is a limitation in manually extracting coronary arteries, and related researches are performed to automatically extract coronary arteries accurately. As the coronary artery originate from the ascending aorta, the ascending aorta and ostium should be detected to extract the coronary tree accurately. In this paper, we propose an automatic segmentation for the ostium as a starting structure of coronary artery in CTA. First, the region of the ascending aorta is initially detected by using Hough circle transform based on the relative position and size of the ascending aorta. Second, the volume of interest is defined to reduce the search range based on the initial area. Third, the refined ascending aorta is segmented by using a two-dimensional geodesic active contour. Finally, the two ostia are detected within the region of the refined ascending aorta. For the evaluation of our method, we measured the Euclidean distance between the result and the ground truths annotated manually by medical experts in 20 CTA images. The experimental results showed that the ostia were accurately detected.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.215-218
• /
• 2009

본 논문에서는 웨이블릿 변환 된 고주파 서브밴드들의 에지 정보를 이용하여 관심 객체 영역을 고속으로 자동 검출해주는 새로운 알고리즘을 제안하였다. 제안된 방법에서는 에지정보를 이용하여 블록단위의 4-방향 객체 윤곽 탐색 알고리즘(4-DOBS)을 수행하여 관심객체를 검출한다. 전체 이미지는 $64{\times}64$ 또는 $32{\times}32$ 크기의 코드 블록으로 먼저 나누어지고, 각 코드 블록 내에 에지들이 있는지 없는지에 따라 관심 코드블록 또는 배경이 된다. 4-방향은 바깥쪽에서 이미지의 중앙으로 탐색하여 접근하며, 피사계 심도가 낮은 이미지는 중앙으로 갈수록 에지가 발견된다는 특징을 이용한다. 기존 방법들의 문제점 이였던 복잡한 필터링 과정과 영역병합 문제로 인한 높은 계산도를 상당히 개선시킬 수 있었다. 또한 블록 단위의 처리로 인하여 실시간 처리를 요하는 응용에서도 적용 가능 하였다.