• The Journal of the Korea Contents Association
• /
• v.14 no.1
• /
• pp.66-75
• /
• 2014

The purpose of this study is to analyze and illustrate 'Rhizome', a postmodern speculation system based on de-subjectivity and decentralization, presented by Gilles Deleuze. He borrowed the word rhizome, an originally botanical term meaning a horizontal stem under the surface of the earth, to counteract the dominating system grounded on binary, root-tree structure. The study then criticizes the early movements of de-subjectivity with molecular-biological and evolutionary evidences, and proves that these evidences can only be characterized by chance and nomadism, which are the key elements that constitute Rhizome. As a practical example of Rhizome, the study analyzes the film by Gus Van Sant, and demonstrates that both his various cinematic experiments and the result bear the same characteristics as Rhizome.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.261-263
• /
• 2005

In this paper, we implement an identification system using the vein image of the hand. The vein pattern is obtained in the grey-scale 2D image through the infrared-red imaging from back of the hand. Since the frame has lack of clearance, we use some enhancing methods such as the complement, addition, and multiplication to the image to increase the contrast. After Wiener filtering for smoothness of the vein pattern, we transform the image into the binary image with mean function. The binarized image is session thinned and the cross-points in the vein tree are obtained by calculating the number of pixels connected because the image is shaped as a tree. We choose the point and find the nearest to the center if it has majority, where we find the two end points of the selected line. We can get the angle between the two lines joined at the cross-point and store its coordinates, angle, and label the values. The values are used as the feature vector of the vein pattern. This procedure is similar to the human cognition sequences. It is shown that the proposed method is simple for the vein recognition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1732-1743
• /
• 2000

In this paper a fixed-delay trellis search with decision feedback (FDTrS/DF) for high-density DVD systems (4.7-15GB) is proposed and implemented with FPGA. The proposed FDTrS/DF is derived by transforming the binary tree search structure into trellis search structure implying that FDTrS/DF performs better than the singnal detection techniques based on tree search structure such as FDTS/DF and SSD/DF. Advantages of FDTrS/DF are significant reductions in hardware complexity due to the unique structure of FDTrS composed of only one trellis stage requiring no traceback procedure usually implemented in the Viterbi detector. Also in this paper the PDFS/DF and SSD/DF orginally proposed for high-density magnetic recording systems are modified for the DVD system and compared with the proposed FDTrS/DF. In order to increase speed in the FPGA implementation the pipelining technique and absolute branch metric (instead of square branch metric) are applied. The proposed FDTrS/DF is shown to provide the best performance among various signal detection techniques such as PRML, DFE, FDTS/DF and SSD/DF even with a small hardware complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.49-54
• /
• 1998

AS it takes a considerable time for database operations for processing the condition part of active rule, the operations have an important effect on the efficiency of active database system. The processing time of operations should be minimized in order to improve the efficiency of system. The previous works are limited to basic database operations and the partial aggregate functions. In this paper, the processing technique using the structuralization and the state table of relations is suggested. The processing time for basic database operations can be reduced with the structuralization of relations to classification tree and the introduction of deletion information table. With the introduction of binary search tree and relation state table, the aggregate function which has a big of processing cost can be processed effectively and the function of the active database system can be maximized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.253-261
• /
• 2005

In this paper, we propose an efficient block-based disparity estimation algorithm fur multiple view image coding in EE2 and EE3 in 3DAV. The proposed method emphasizes on visual quality improvement to satisfy the requirements for multiple view generation. Therefore, we perform an adaptive disparity estimation that constructs variable blocks by considering given image features. Examining neighboring features around desired block search range is set up to decrease complexity and additional information than only using quad-tree coding through applying binary-tree and quad-tree coding by taking into account stereo image feature having big disparity. The experimental results show that the proposed method improves PSNR about 1 to 2dB compared to existing other methods and decreases computational complexity up to maximum 68 percentages than FBMA.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.988-992
• /
• 2009

In this paper, we attempted to extract binary relations between terminologies using composite kernels consisting of convolution parse tree kernels and WordNet verb synset vector kernels which explain the semantic relationships between two entities in a sentence. In order to evaluate the performance of our system, we used three domain specific test collections. The experimental results demonstrate the superiority of our system in all the targeted collection. Especially, the increase in the effectiveness on KREC 2008, 8% in F1, shows that the core contexts around the entities play an important role in boosting the entire performance of relation extraction.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.5
• /
• pp.47-55
• /
• 2019

As the damage caused by GPS jamming has been increased, researches for detecting and preventing GPS jamming is being actively studied. This paper deals with a GPS jamming detection method using multiple GPS receiving channels and three-types machine learning techniques. Proposed multiple GPS channels consist of commercial GPS receiver with no anti-jamming function, receiver with just anti-noise jamming function and receiver with anti-noise and anti-spoofing jamming function. This system enables user to identify the characteristics of the jamming signals by comparing the coordinates received at each receiver. In this paper, The five types of jamming signals with different signal characteristics were entered to the system and three kinds of machine learning methods(AB: Adaptive Boosting, SVM: Support Vector Machine, DT: Decision Tree) were applied to perform jamming detection test. The results showed that the DT technique has the best performance with a detection rate of 96.9% when the single machine learning technique was applied. And it is confirmed that DT technique is more effective for GPS jamming detection than the binary classifier techniques because it has low ambiguity and simple hardware. It was also confirmed that SVM could be used only if additional solutions to ambiguity problem are applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2714-2726
• /
• 1997

In this paper, adaptive symbol changes-based medical image compression method is presented. First, the differenctial image domain is obtained using the differentiation rules or obaptive predictors applied to original mdeical image. Also, the algorithm determines the context associated with the differential image from the domain. Then prediction symbols which are thought tobe the most probable differential image values are maintained at a high value through the adaptive symbol changes procedure based on estimates of the symbols with polarity coincidence between the differential image values to be coded under to context and differential image values in the model template. At the coding step, the differential image values are encoded as "predicted" or "non-predicted" by the binary adaptive arithmetic encoder, where a binary decision tree is employed. The simlation results indicate that the prediction hit ratios of differential image values using the proposed algorithm improve the coding gain by 25% and 23% than arithmetic coder with ISO JPEG lossless predictor and arithmetic coder with differentiation rules or adaptive predictors, respectively. It can be used in compression part of medical PACS because the proposed method allows the encoder be directly applied to the full bit-planes medical image without a decomposition of the full bit-plane into a series of binary bit-planes as well as lower complexity of encoder through using an additions when sub-dividing recursively unit intervals.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.10a
• /
• pp.187-192
• /
• 2001

In this paper, a practical method to generate task strategies applicable to charmfulness and high-precision assembly, is proposed. The difficulties in devising reliable assembly strategies result form various forms of uncertainty such as imperfect knowledge on the parts being assembled and functional limitations of the assembly devices. In approach to cope with these problems, the robot is provided with the capability of learning the corrective motion in response to the force signal through iterative task execution. The strategy is realized by adopting a learning algorithm and represented in a binary tree type database. To verify the effectiveness of the proposed algorithm, a series of simulations and experiments are carried out under assimilated real production environments. The results show that the sensory signal-to-robot action mapping can be acquired effectively and, consequently, the assembly task can be performed successfully.

• Korean Journal of Cognitive Science
• /
• v.3 no.1
• /
• pp.25-39
• /
• 1991

When an ending which begins with 'a/a'combines to a stem,'a/a'can be deleted.Especially when ot combines to an h-irregular verb,it is represented as a variant like '-a-','-e-','-ia-',or'-ie-'.In order to analyze the variants of 'a/a',we suggest the format of a grammatical morpheme dictionary which is represented as a binary tree and several procedures which process the variants so that the unexpected errors can be removed which occur frequently when we analyze Korean worl phrase.