• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2004년도 춘계 종합학술대회 논문집
• /
• pp.335-341
• /
• 2004

웹 기술의 급속한 발전으로 인한 인터넷의 사용과 정보의 양이 급증하는 요즘 표현 중심적인 언어인 HTML에서는 웹의 정보를 이용하는데 한계를 가져왔으며 이로 인한 대안으로 웹상에서 자유로운 문서 전송 및 교환을 위한 표준이며 W3C에서 데이터 자체의 의미나 상관관계를 표현하는 n이 등장하였다. 이러한 XML문서를 RDBMS에서 저장해서 사용하기 위한 많은 노력이 있으나 구조적으로 XML문서는 트리구조이어서 관계형 DB에 자료를 질의하기 위한 언어인 SQL과 완벽한 호환을 이루지 못한다. 그래서 W3C의 XML 표준 질의인 XQuery가 등장하게 되었다. 이 논문에서는 XML 문서를 파싱하고 DOM 트리과정을 거쳐 RDBMS에 저장된 XML 정보들을 Xeuery2SQL이라는 변환기를 통해서 SQL질의로 변환한 후 RDBMS에 있는 정보를 추출하는 XQuery2SQL 변환 알고리즘을 구현하고자 한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.422-424
• /
• 2021

In this paper, it leads the approach of fusing multiple RGB cameras for visual objects recognition based on deep learning with convolution neural network and 3D Light Detection and Ranging (LiDAR) to observe the environment and match into a 3D world in estimating the distance and position in a form of point cloud map. The goal of perception in multiple cameras are to extract the crucial static and dynamic objects around the autonomous vehicle, especially the blind spot which assists the AV to navigate according to the goal. Numerous cameras with object detection might tend slow-going the computer process in real-time. The computer vision convolution neural network algorithm to use for eradicating this problem use must suitable also to the capacity of the hardware. The localization of classified detected objects comes from the bases of a 3D point cloud environment. But first, the LiDAR point cloud data undergo parsing, and the used algorithm is based on the 3D Euclidean clustering method which gives an accurate on localizing the objects. We evaluated the method using our dataset that comes from VLP-16 and multiple cameras and the results show the completion of the method and multi-sensor fusion strategy.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 제13회 신호처리 합동 학술대회 논문집
• /
• pp.725-728
• /
• 2000

본 논문에서는 영상검색 기법에서 핵심인 Shot Change Detection 과 Non Linear Browsing 을 H/W기반으로 구현하여, S/W 적으로는 비실시간으로만 가능하였던 video indexing 을 DTV 에 적용하여 실시간으로 구현하는 방법을 제시한다. 이를 위해 H/W part 는 실시간으로 들어오는 방송용 MPEG-2 bitstream 을 full decoding 이 아닌 최소화된 VLD(Variable Length Decoding) 수준의 parsing 으로 picture 내의 luminance와 chrominance 의 DC 값, macroblock type, motion vector 정보를 얻어내어 각각의 histogram을 계산하여 memory interface를 통해 S/W 측에 넘겨주게 되고 S/W 는 각 상황에 맞게 indexing algorithm 을 변화시키며 최적의 video indexing 방법으로 확장할 수 있도록 하였다.

• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.183-190
• /
• 1996

The purpose of this paper is to show that the solutions of the problem for the anaphor ocured in korean senstence, by means of one-direction activated chart parsing leaded by a head. This is the phenomenon frequently occured in the conversation of natural language and the part necessarily required in the construction of natural language processing system for the practical use. To solve the problem of anaphor in the korean language, we have computerized definition and the management conditions necessary in the semantic classification between the anaphor and its antecedent and index are added in the feature structure in lexicon. To deal with anaphor in parser and algorithm is proposed to solve the problem for anaphor. The range of management of pareser is extended to solve the problem for anaphor of the indeclinable parts of speech in korean occured in all the sentences the parser HPSG developed previously manages.

• Journal of Information Technology Applications and Management
• /
• 제9권3호
• /
• pp.1-12
• /
• 2002

Due to the fast development in computer and communication technologies, a video is now being more widely used than ever in many areas. The current information analyzing systems are originally built to process text-based data. Thus, it has little bits problems when it needs to correctly represent the ambiguity of a video, when it has to process a large amount of comments, or when it lacks the objectivity that the jobs require. We would like to purpose an algorithm that is capable of analyze a large amount of video efficiently. In a video, divided areas use a region growing and region merging techniques. To sample the color, we translate the color from RGB to HSI and use the information that matches with the representative colors. To sample the shape information, we use improved moment invariants(IMI) so that we can solve many problems of histogram intersection caused by current IMI and Jain. Sampled information on characteristics of the streaming media will be used to find similar frames.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 춘계학술대회 논문집
• /
• pp.367-372
• /
• 2001

Feature restoration is that restore feature to 3D solid model using the feature information in STEP AP224. Feature is very important in CAPP, but feature information is defined very complicated in STEP AP224. This paper recommends the algorithm of extraction the feature information in physical STEP AP224file. This program import STEP AP224 file, parse the geometric and topological information, the tolerance data, and feature information line-by-line. After importation and parsing, store data into database. Feature restoration module analyze database including feature information, extract feature information, e.g. feature type, feature's parameter, etc., analyze the relationship and then restore feature to 3D solid model.

• 전자공학회논문지B
• /
• 제31B권9호
• /
• pp.10-21
• /
• 1994

Query-by-Example(QBE) is high-level display-oriented databased manipulation language that provides a convenient and unified style for querying, updating, defining, and controling a relational database. QBE is relationally complete. However, lack of aubquery constructs limits th usability of QBE significantly. In particular, certain queries cannot be represented in one window. In this paper, we define a subquery box and extend QBE for subquery construction. The Extended QBE makes it possible to represent the queries that the QBE cannot do in one window, reducing the overhead and complexity of composing those queries. We also define the grammar of the Extended QBE and present the parsing techniques. Finally, we present an algorithm to transform the queries in Exteded QBE to those in SQL. The result of the transformation can be executed using dynamic SQL features of any SQL system. The proposed language has been implemented on OS/2 using the OS/2 EE Database Manager.

• 한국멀티미디어학회논문지
• /
• 제21권9호
• /
• pp.1035-1043
• /
• 2018

There is a case where the core content of another person's work is decorated as though it is his own thoughts by changing own thoughts without showing the source. Plagiarism test of copykiller free service used in plagiarism check is performed by comparing plagiarism more than 6th word. However, it is not enough to judge it as a plagiarism with a six - word match if it is replaced with a similar word. Therefore, in this paper, we construct word clusters by using DBSCAN algorithm, find synonyms, convert the words in the clusters into representative synonyms, and construct L-R tables through L-R parsing. We then propose a method for determining the similarity of documents by applying weights to the thesaurus and weights for each paragraph of the thesis.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.358-364
• /
• 2007

Syntax parsers can benefit from speakers' intuition about constituent structures indicated in the input string in the form of parentheses. Focusing on languages like Korean, whose orthographic convention requires more than one word to be written without spaces, we describe an algorithm for passing the bracketing information across the tagger to the probabilistic CFG parser, together with one for heightening (or penalizing, as the case may be) probabilities of putative constituents as they are suggested by the parser. It is shown that two or three constituents marked in the input suffice to guide the parser to the correct parse as the most likely one, even with sentences that are considered long.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.375-384
• /
• 2007

This paper describes a method for automatic acquisition of wide-coverage treebank-based deep linguistic resources for Japanese, as part of a project on treebank-based induction of multilingual resources in the framework of Lexical-Functional Grammar (LFG). We automatically annotate LFG f-structure functional equations (i.e. labelled dependencies) to the Kyoto Text Corpus version 4.0 (KTC4) (Kurohashi and Nagao 1997) and the output of of Kurohashi-Nagao Parser (KNP) (Kurohashi and Nagao 1998), a dependency parser for Japanese. The original KTC4 and KNP provide unlabelled dependencies. Our method also includes zero pronoun identification. The performance of the f-structure annotation algorithm with zero-pronoun identification for KTC4 is evaluated against a manually-corrected Gold Standard of 500 sentences randomly chosen from KTC4 and results in a pred-only dependency f-score of 94.72%. The parsing experiments on KNP output yield a pred-only dependency f-score of 82.08%.