• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.233-237
• /
• 2010

This paper addresses a problem of violating the member accessibility of a class in C++, which is not detected as an error by existing C++ compilers. The member access specifiers can be used to specify member accessibility. The C++ uses a private or protected specifier for specifying the members which cannot be accessed from outside of an object. However, the private or protected members can be accessed from outside of that object by the pointer arithmetic in C++. We show some violating examples that cannot be detected by existing C++ compilers. The contribution of this paper is to discover and define the new problem of the member accessibility.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1188-1195
• /
• 2006

This paper presents an efficient design method of 2-D state-space digital filter based on an improved branch-and -bound algorithm. The resultant 2-D state-space digital filters whose coefficients are represented as the sum of two power-of-two terms, are attractive for high-speed operation and simple implementation. The feasibility of the proposed method is demonstrated by several experiments. The results show that the approximation error and group delay characteristic of the resultant filters are similar to those of the digital filters which designed in the continuous coefficient space.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.3
• /
• pp.1-7
• /
• 2000

The number of pixels being processed in a raster graphics system often exceeds 1 million per frame. Replacing fractional arithmetic by integer arithmetic on rendering graphics primitives will therefore significantly improve the rendering performance. A scaling method that replaces fractional arithmetic by integer arithmetic on rendering graphics primitives is introduced. This method is applied to the filtered edge drawing and Gouraud shading. This method will also be applicable to some of other incremental algorithms for rendering graphics primitives. Because the scaling method requires only simple modifications upon the known algorithms that already have been implemented in ASIC (Application Specific Integrated Circuit), our algorithms can easily be implemented in ASIC. Our method will be useful especially for the low-price systems (e.g., home game machines, personal computers, etc.).

• The Journal of the Korea Contents Association
• /
• v.17 no.6
• /
• pp.169-179
• /
• 2017

The historical film is complex genre that give various messages of directors besides a historical fact. Shin Sangok and Lee Joonik are important historical film directors. Their films show director's style by various method of historical reproduction. Sin Sangok and Lee Joonik portrayed same person Yeonsan, in and . They described identical person and historical fact in a different way. This is due to director's view of history, time of reinterpretation of history, and so forth. Therefore this paper is going to analysis the method of representation on history.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5042-5048
• /
• 2010

In ubiquitous environments, many continuous query processing techniques make use of operator network and sharing methods on continuous data stream generated from various sensors. Since similar continuous queries with the location information intensively occur in specific regions, we suggest a new operator sharing method based on grid partition for the spatial continuous query processing for location-based applications. Due to the proposed method shares moving objects by the given grid cell without sharing spatial operators individually, our approach can not only share spatial operators including similar conditions, but also increase the query processing performance and the utilization of memory by reducing the frequency of use of spatial operators.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1497-1504
• /
• 2009

This Paper Propose a method to reduce the calculation time in JPEG2000. That is, if a coefficient is estimate a upper-level subband and its descendents skip the scan process. There is a trade-off relationship between the calculation time and the image quality or the amount of output data, the calculation time and the amount of output data decreases, but the image degradation increases. The experimental results showed that in calculation time was 35% in average, which means that ls ge ses. The ein calculation time and output data can be obtls ed with a cost of an acceptlble image quality degradation.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.1-15
• /
• 1999

대화식 UNDO는 수행된 연산을 철회시키거나 재실행시킴으로서 사용자의 오류를 쉽게 교정할 수 있도록 허용하기 위한 일종의 회복기능이다. 소프트웨어 개발, 하이퍼미디어 CAD 등과 같은 새로운 데이터베이스응용 분야에서는 편리한 저작 및 편집 과정으르 위하여 대화식 UNDO 기능의 지원이 필수적이다. 상용 DBMS들이 제공하는 세이브포인트를 이용한 부분 철회는 수행된 연산의 철회만을 허용하는 것으로 대화식 UNDO의 제한적 기능이다. 기존의 응용 시스템들은 데이터 관리를 위해서는 DBMS를 사용하면서도 이러한 대화식 UNDO 기능은 응용시스템에서 직접 제공하고 있다. 대화식 UNDO 기능의 구현은 매우 복잡하기 때문에 응용 프로그래머에게 상당한 개발 오버헤드를 요구한다. 본 연구의 목적은다양한 응용 시스템개발을 위하여 공통적으로 필요한 고급 기능을 응용 프로그래머가 쉽게 이용할 수 있도록 대화식 UNDO 기능을 DBMS에서 직접 지원하는 새로운 회복 기법을 제안하는 것이다. 제안된 기법에서는 트랜잭션 철회시 대화식 UNDO에 의해 UNDO된 연산들을 스킵함으로써 빠른 철회를 보장하고 여러 연산을 한번에 철회할 수 있는 벌크 UNDO 연산 (bulk undo)을 제공한다. 벌크들도 다시 재실행될수 있다는 점에서 부분 철회와 구별된다. 특히,일반 DBMS에서 회복을 위하여 관리해야 하는 정보를 최대한 활용함으로써 새로운 기능의 추가에도 불구하고 제안된 기법의 성능은 이러한 기능을 제공하지 않는 기존의 회복 기법과 비교할만한 좋은 성능을 보인다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.4
• /
• pp.53-60
• /
• 2013

We propose a method for improving detection speed of small target detection system using SAD algorithm. First, the proposed method deletes clutters using a median filter. Next, it does closing and opening operation using various size of structure elements, and extracts candidate pixels for a target with subtraction operation between the results of closing and opening operation. It finally detects a small target using a gaussian distance function from the candidate pixels. To improve detection speed, it detects a target performing SAD algorithm only for the predicted target areas for next every 7 frames. The proposed method not only enables a real time process because it considers only predicted area but also shows detecting rate of 97%.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.67-76
• /
• 2012

This paper proposes a concept and algorithm of cloth covering. It is a physically-based model which simulates computationally a shape of cloth covering some objects. The goal of cloth covering is to conceal the details of object and to reveal only the shape outline. It has one scale parameter which controls the degree of suppressing fine-scale structures. To show viability of the proposed cloth covering, this paper performed an experiment of script recognition. The results of comparing accuracies of feature extraction using Gaussian and cloth covering showed that the cloth covering is superior to Gaussian. We discuss the reason for the superiority.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.713-717
• /
• 2008

Recently, as the capacity of flash memory increases rapidly, efficient indexing methods become crucial for fast searching of a large volume of data stored in flash memory. Flash memory has its unique characteristics: the write operation is much more costly than the read operation and in-place updating is not allowed. In this paper, we propose a novel index structure that significantly reduces the number of write operations and thus supports efficient searches, insertions, and deletions. We verify the superiority of our method by performing extensive experiments.