• Journal of the Korean School Mathematics Society
• /
• v.15 no.3
• /
• pp.535-563
• /
• 2012

This study was conducted to confirm the necessity of analogical thinking and to empirically verify the effectiveness of analogical reasoning through the visual representation by analyzing the factors of problem solving depending on analogical conditions. Four conditions (a visual representation mapping condition, a conceptual mapping condition, a retrieval hint condition and no hint condition) were set up for the above purpose and 80 twelfth-grade students from C high-School in Cheong-Ju, Chung-Buk participated in the present study as subjects. They solved the same mathematical problem about sequence of complex numbers in their differed process requirements for analogical transfer. The problem solving rates for each condition were analyzed by Chi-square analysis using SPSS 12.0 program. The results of this study indicate that retrieval of base knowledge is restricted when participants do not use analogy intentionally in problem solving and the mapping of the base and target concepts through the visual representation would be closely related to successful analogical transfer. As the results of this study offer, analogical thinking is necessary while solving mathematical problems and it supports empirically the conclusion that recognition of the relational similarity between base and target concepts by the aid of visual representation is closely associated with successful problem solving.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.12-31
• /
• 2006

The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.

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

Recently, digital watermarking has been proposed as a viable solution to the need of copyright protection and authentication of multimedia data. A robust wavelet-based watermark casting scheme and a watermark retrieval technique are suggested in this paper. We present a method which can add the watermark to the significant coefficients in the DWT domain, and does not require the original image in the detection process. In adaptive watermark casting method is developed to select perceptually significant coefficients for each subband using multiple threshold. In the proposed method, an adaptive multiple threshold scheme is used to reflect characteristics of each subband and complexity of image. The watermark is adaptively weighted in different subbands to achieve robustness as well as high perceptual quality. The watermark, Gaussian random sequence is added to the large coefficients but not in the lowest subband in the DWT domain. Experimental results show that the proposed algorithm produced visually very good watermarked image which has good invisibility to human eyes and very robust against various image processing and compression attacks.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.168-176
• /
• 2014

Detecting moving objects from a video sequence is a fundamental and critical task in video surveillance, traffic monitoring and analysis, and human detection and tracking. It is very difficult to detect moving objects in a video sequence degraded by the environmental factor such as fog. In particular, the color of an object become similar to the neighbor and it reduces the saturation, thus making it very difficult to distinguish the object from the background. For such a reason, it is shown that the performance and reliability of object detection and tracking are poor in the foggy weather. In this paper, we propose a novel method to improve the performance of object detection, combining a haze removal algorithm and a local histogram-based object tracking method. For the quantitative evaluation of the proposed system, information retrieval measurements, recall and precision, are used to quantify how well the performance is improved before and after the haze removal. As a result, the visibility of the image is enhanced and the performance of objects detection is improved.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.13-22
• /
• 2004

Because video sequence consists of dynamic objects in nature, the object motion in video is an effective feature in describing the contents of video sequence and motion feature plays an important role in video retrieval. In this paper, we propose a method that converts motion vectors (MVs) to a uniform set on MPEG coded domain, independent of the frame type and the direction of prediction, and utilizes these normalized MVs (N-MVs) as motion descriptor to understand video contents. We describe a frame-type independent representation of the various types of frames presented in an MPEG video in which all frames can be considered equivalently, without full-decoding. In the experiments, we show that the proposed method is better than the conventional one in terms of performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.2
• /
• pp.25-30
• /
• 2003

Recently, development of digital technology is occupying a large part of multimedia information like character, voice, image, video, etc. Research about video indexing and retrieval progresses especially in research relative to video. In this paper, we propose new algorithm(Frame Feature Comparison) for MPEG video segmentation. Shot, Scene Change detection is basic and important works that segment it in MPEG video sequence. Generally, the segmentation algorithm that uses much has defect that occurs an error detection according to a flash of camera, movement of camera and fast movement of an object, because of comparing former frames with present frames. Therefore, we distinguish a scene change one more time using a scene change point detected in the conventional algorithm through comparing its mean value with abutted frames. In the result, we could detect more corrective scene change than the conventional algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.118-123
• /
• 2006

DNA 시퀀스 데이터베이스 규모의 급격한 증가 추세를 고려할 때, DNA 시퀀스 검색 연산을 보다 효과적으로 지원할 수 있는 인덱싱 및 질의 처리 기술이 요구 된다. 접미어 트리는 DNA 시퀀스 검색을 위한 좋은 인덱스 구조로 알려져 왔다. 그러나 접미어 트리는 그 구조적 특성으로 인하여 저장공간, 검색 성능, DBMS와의 통합 등의 문제점을 갖는다. 본 논문에서는 이와 같은 접미어 트리의 문제점들을 해결하는 DNA 시퀀스 검색을 위한 새로운 인덱스 구조를 제안하고, 이를 기반으로 하는 효율적인 질의 처리 방식을 제안한다. 제안된 인덱스 기법은 이진 트라이를 기본 구조로 채택하며 DNA 시퀀스의 윈도우 서브 시퀀스를 인덱싱 대상으로 한다. 유사 서브 시퀀스 검색을 위한 질의 처리 알고리즘은 기본적으로 다이나믹 프로그래밍 기법에 근거하여 이진 트라이를 루트로부터 너비 우선(breadth-first) 방식으로 운행하며, 경로 상에 존재하는 모든 유사 서브 시퀀스를 검색해 낸다. 제안된 기법의 우수성을 검증하기 위하여, 기존의 접미어 트리와의 비교 실험을 통한 성능 평가를 수행하였다. 실험 결과에 의하면, 제안된 인덱스 기법은 접미어 트리에 비하여 약 30%의 작은 저장 공간을 가지고도 수배에서 수십배의 검색 성능의 개선 효과를 나타낸다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.674-677
• /
• 2004

This paper deals with a systematic approach for the construction of the fixed-delay tree search (FDTS) detector in the intersymbol interference channel. The approach is based on the efficient multi-dimensional space partitioning. The Voronoi diagram (VoD) and the Delaunay tessellation (DT) of the multi-dimensional space are applied to implement the algorithm. In the proposed approach, utilizing the geometric information contained in the VOD/DT, the relative location of the observation sequence is determined which has been shown to reduce the implementation complexity. Detailed construction procedures are discussed followed by an example from the intersymbol interference communication channel.

• Genomics & Informatics
• /
• v.6 no.2
• /
• pp.57-63
• /
• 2008

The Korean HapMap Project has been carried out for the last 5 years since it started in June, 2003. The project generated data for a sum of 1,764,000 Korean SNPs and formally registered the data to the dbSNP of NCBI (The dbSNP website. 2008). We have developed a series of software programs for association studies as well as for the comparison and analysis of Korean HapMap data with four other populations (CEPH, Yoruba, Han Chinese, and Japanese populations). The KHapmap Browser was developed and integrated to provide haplotype retrieval and comparative study tools of human ethnicities for comprehensive disease association studies (http://www.khapmap.org). On that basis, GBrowse was adopted in the KHapmap Browser for inherent Korean genetic data, and a provision of extended services was pledged with the distributed sequence annotation system (DAS). The dynamic linking service of the KHapmap Browser to other tools in our intranetwork environment provides many enhanced functions over GBrowse without DAS. KHapmap Browser is expected to be an invaluable tool for the study of Korean and international Hapmap data.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.797-804
• /
• 2003

Scene change detection algorithm, which is very important preprocessing technique for video indexing and retrieval and determines the performance of video database system, is being studied widely. In this paper, we propose a more effective abrupt scene change detection, which is robust to large motion, sudden change of light and successive abrupt shot transitions rapidly. And we also propose a new gradual scene change detection algorithm, which can detect dissolve, and fade in/out precisely. Furthermore, we also propose a representative frame extraction algorithm which performs content-based video summary by novel DCT DC image buffering technique and accumulative histogram intersection measure (AHIM).