• Radiation Oncology Journal
• /
• v.21 no.1
• /
• pp.100-106
• /
• 2003

Purpose : To develop a patients' setup verification tool (PSVT) to verify the alignment of the machine and the target isocenters, and the reproduclbility of patients' setup for three dimensional conformal radiotherapy (3DCRT) and intensity modulated radiotherapy (IMRT). The utilization of this system is evaluated through phantom and patient case studies. Materials and methods : We developed and clinically tested a new method for patients' setup verification, using digitally reconstructed radiography (DRR), simulation, porial and digital images. The PSVT system was networked to a Pentium PC for the transmission of the acquired images to the PC for analysis. To verify the alignment of the machine and target isocenters, orthogonal pairs of simulation images were used as verification images. Errors in the isocenter alignment were measured by comparing the verification images with DRR of CT Images. Orthogonal films were taken of all the patients once a week. These verification films were compared with the DRR were used for the treatment setup. By performing this procedure every treatment, using humanoid phantom and patient cases, the errors of localization can be analyzed, with adjustments made from the translation. The reproducibility of the patients' setup was verified using portal and digital images. Results : The PSVT system was developed to verify the alignment of the machine and the target isocenters, and the reproducibility of the patients' setup for 3DCRT and IMRT. The results show that the localization errors are 0.8$\pm$0.2 mm (AP) and 1.0$\pm$0.3 mm (Lateral) in the cases relating to the brain and 1.1$\pm$0.5 mm (AP) and 1.0$\pm$0.6 mm (Lateral) in the cases relating to the pelvis. The reproducibility of the patients' setup was verified by visualization, using real-time image acquisition, leading to the practical utilization of our software Conclusions : A PSVT system was developed for the verification of the alignment between machine and the target isocenters, and the reproduclbility of the patients' setup in 3DCRT and IMRT. With adjustment of the completed GUI-based algorithm, and a good quality DRR image, our software may be used for clinical applications.

• Korean Journal of Cognitive Science
• /
• v.4 no.2
• /
• pp.29-51
• /
• 1994

This paper presents a new approach to describing the meanings of English relative clauses with the theoretical framework of Conceptual Structure Theory (henceforth CST)which builds on the pionerring work of Sowa.And this paper aims at proposing some extensions to his work. CST describes the conceptual structrures of sentences with conceptual graphs(henceforth CG). which have begun to be used as an intermediate language in natural language processing and machine translation of computer.CGs are composed of concept types and conceptual relation types. They are a system of logic for semantic representation of sentences. This paper focuses on showing the differences of the CGs according to the functions of English relative clauses. English relative clauses are divided into restrictive and nonrestrictive uses.And this paper describes a restrictive clause with a CG including a expression.which derives from the viewpoint of Montague-semantics and Nom-S Analysis.This paper deals mainly with the relative clauses of double restroction as an example of restrictive relative clauses.The description of a nonrestrictive relative clause does not need any-expression, for it doesn's involve the meaning of set.And this paper links the CG of an appositive relative clause,which is a kind of nonrestrictive clauses,to the concept of the antecedent in the main clause.The description of a nonrestrictive relative clause with adverbial meaning is strated with two CGs for the main clause and the relative clause.They are linked with an appropriate intersentential conceptual relation type according to the contextual realtions between them.This paper also presents a CG of a sentential relative clause,which gives a comment on the main clause.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.389-396
• /
• 2003

In this paper, we present a Korean partial parser based on rules, which is used for running applications such as a grammar checker and a machine translation. Basically partial parsers construct one or more morphemes and/or words into one syntactical unit, but not complete syntactic trees, and accomplish some additional operations for syntactical parsing. The system described in this paper adopts a set of about 140 manually-written rules for partial parsing. Each rule consists of conditional statements and action statement that defines which one is head node and also describes an additional action to do if necessary. To observe that this approach can improve the efficiency of overall processing, we make simple experiments. The experimental results have shown that the average number of edges generated in processing without the partial parser is about 2 times more than that with the partial parser.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.79-88
• /
• 1999

In this paper we address the tracking method which tracks only target object in image sequence including moving object. We use a contour tracking algorithm based on intensity and motion boundaries. The motion of the moving object contour in the image is assumed to be well describable by an affine motion model with a translation, a change in scale and a rotation. The moving object contour is represented by B-spline, the position and motion of which is estimated along the image sequence. we use pattern recognition to identify target object. In order to use linear Kalman Filters we decompose the estimation process into two filters. One is estimating the affine motion parameters and the other the shape of moving object contour. In some experiments with dial plate we show that this method enables us to obtain the robust motion estimates and tracking trajectories even in case of including obstructive object.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.219-228
• /
• 2003

This paper presents an efficient construction method of determination rules of thematic roles from syntactic relations in Korean language processing. This process is one of the main core of semantic analysis and an important issue to be solved in natural language processing. It is problematic to describe rules for determining thematic roles by only using general linguistic knowledge and experience, since the final result may be different according to the subjective views of researchers, and it is impossible to construct rules to cover all cases. However, our method is objective and efficient by considering large corpora, which contain practical osages of Korean language, and case frames in the Sejong Electronic Lexicon of Korean, which is being developed by dozens of Korean linguistic researchers. To determine thematic roles more correctly, our system uses syntactic relations, semantic classes, morpheme information, position of double subject. Especially by using semantic classes, we can increase the applicability of the rules.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1709-1715
• /
• 2005

This paper describes the development of 3-D web graphic library for dynamic web graphic design. The 3-D web graphic library developed in this per supports creation of 3-D objects like cube and sphere objects, elimination of hidden line and surface, and the shading of diffuse and specular reflections. It provides, in drawing, perspective projection of an object depth first sort of multiple objects, and wire frame and solid models. It also supports texture mapping function for realistic and dynamic web application in application software. Each created 3-D object gives functions for the scaling, translation, and rotation of itself. It can be used for the development of dynamic web application software and the advertisement of information for business and tourism as a 3-D web graphic library engine. It is written in 'Java' language and runs on web browsers with Java virtual machine without any dependancy of client computer system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2721-2731
• /
• 1997

Distributed programming can be greatly simplified by language support for distributed communication. Many web-browsers now offer some form of active objects and the number and types of them are growing daily in interesting and innovative ways. Java applets are well known as one kind of active object related to web-browser. This paper focuses in distributed active objects which is one kind of active objects that can communicate with other active objects located in different machines across the Internet. Java RMI and CORBA IDL are two major programming environments for distributed active objects which are non compatible with each other. To make discussion concrete, we introduce a single application as implemented on two environments : the HORM, adopting RMI mechanism, and the OrbixWeb2.0.1, adopting CORBA specification, respectively. Binding, inheritance, polymorphism, object passing and callbacks across the machine boundary in distributed programming environments are issued. The results show that some differences in the implementation of distributed active objects can have a significant impact on how distributed applications are structured. The comparison between two implementations on the programming environments will be the basis for building the translation system between HORB to OrbixWeb and vice versa.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.1
• /
• pp.27-36
• /
• 2019

In this paper, we propose a method to find the most similar answer to the user's response from the question-answer database in order to avoid generating a redundant question in retrieval-based automatic question generation system. As a question of the most similar answer to user's response may already be known to the user, the question should be removed from a set of question candidates. A similarity detector calculates a similarity between two answers by utilizing the same words, paraphrases, and sentential meanings. Paraphrases can be acquired by building a phrase table used in a statistical machine translation. A sentential meaning's similarity of two answers is calculated by an attention-based convolutional neural network. We evaluate the accuracy of the similarity detector on an evaluation set with 100 answers, and can get the 71% Mean Reciprocal Rank (MRR) score.

• Korean Journal of Cognitive Science
• /
• v.4 no.1
• /
• pp.213-242
• /
• 1993

During the past decades,several automatic indexing systems have been developed such as single term indexing.phrase indexing and thesaurus basedidndexing systems.Among these systems,single term indexing has been known as superior to others despte its simpicity of extracting meaningful terms.On the other hand,thesaurus based one has been conceived as producing low retrival rate ,mainly because thesauri do not usually have enough index terms.so that much of text data fail to be indexed if they do not match with any of index terms in thesauri.This paper develops a thesaurus based indexing system THINS that yields higher retrieval rate than other systems.by doing syntactic analysis of text data and matching them with index terms in thesauri partially.First,the system analyzes the input text syntactically by using the machine translation suystem MATES/EK and extracts noun phrases.After deleting stop words from noun phrases and stemming the remaining ones.it tries to index these with similar index terms in the thesaurus as much as possible. We conduct an experiment with CACM data set that measures the retrieval effectiveness with CACM data set that measures the retrieval effectuvenss of THINS with single term based one under HYKIS-a thesaurus based information retrieval system.It turns out that THINS yields about 10 percent higher precision than single term based one.while shows 8to9 percent lower recall.This retrieval rate shows that THINS improves much better than privious ones that only yields 25 or 30 percent lower precision than single term based one.We also argue that the relatively lower recall is cause by that CRCS-the thesaurus included in CACM datea set is very incomplete one,having only more than one thousand terms,thus THINS is expected to produce much higher rate if it is associated with currently available large thesaurus.