• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.843-852
• /
• 2001

Statistics concerning software errors indicate that more errors are introduced in analysis and design phase than implementation phase. Therefore, it is needed to check whether the design modeling is appropriate for own function and structure. This paper discussed the effective test method for the object-oriented design model, i.e., UML. A new method was proposed for generating test data. This method consists of category partition theory by the representation each element in UML model with OCL (Object Constraint Language). Test data generated in this way can be used for testing the source code functionality as well as for checking the design model.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.701-708
• /
• 2004

Existing contents-based video retrieval systems search by using a single method such as annotation-based or feature-based retrieval. Hence, it not only shows low search efficiency, but also requires many efforts to provide system administrator or annotator with a perfect automatic processing. Tn this paper, we propose an agent-based, and automatic and unified semantics-based video retrieval system, which support various semantics-retrieval of the massive video data by integrating the feature-based retrieval and the annotation-based retrieval. The indexing agent embodies the semantics about annotation of extracted key frames by analyzing a fundamental query of a user and by selecting a key-frame image that is ed by a query. Also, a key frame selected by user takes a query image of the feature-based retrieval and the indexing agent searches and displays the most similar key-frame images after comparing query images with key frames in the database by using the color-multiple-partition histogram techniques. Furthermore, it is shown that the performance of the proposed system can be significantly improved.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3185-3199
• /
• 1997

This paper suggests techniques to reduce coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same com- pression rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2761-2781
• /
• 2018

With the continuous growth of data size and the use of compression technology, data reduction has great research value and practical significance. Aiming at the shortcomings of the existing semantic compression algorithm, this paper is based on the analysis of ItCompress algorithm, and designs a method of bidirectional order selection based on interval partitioning, which named An Optimized Iterative Semantic Compression Algorithm (Optimized ItCompress Algorithm). In order to further improve the speed of the algorithm, we propose a parallel optimization iterative semantic compression algorithm using GPU (POICAG) and an optimized iterative semantic compression algorithm using Spark (DOICAS). A lot of valid experiments are carried out on four kinds of datasets, which fully verified the efficiency of the proposed algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.1
• /
• pp.57-66
• /
• 2010

In this paper, we develop the Automatic Number Plate Recognition (ANPR) System. ANPR is generally composed of the following four steps: i) The acquisition of the image; ii) The extraction of the region of the number plate; iii) The partition of the number and iv) The recognition. The second and third steps incorporate image processing technique. We propose to resolve this by using Partial Differential Equation(PDE) based segmentation method. This method is computationally efficient and robust. Results indicate that our methods are capable to recognize the plate number on difficult situations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1690-1704
• /
• 2013

An affine invariant descriptor is proposed, which is able to well represent the affine covariant regions. Estimating main orientation is still problematic in many existing method, such as SIFT (scale invariant feature transform) and SURF (speeded up robust features). Instead of aligning the estimated main orientation, in this paper ellipse orientation is directly used. According to ellipse orientation, affine covariant regions are firstly divided into 4 sub-regions with equal angles. Since affine covariant regions are divided from the ellipse orientation, the divided sub-regions are rotation invariant regardless the rotation, if any, of ellipse. Meanwhile, the affine covariant regions are normalized into a circular region. In the end, the gradients of pixels in the circular region are calculated and the partition-based descriptor is created by using the gradients. Compared with the existing descriptors including MROGH, SIFT, GLOH, PCA-SIFT and spin images, the proposed descriptor demonstrates superior performance according to extensive experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1487-1490
• /
• 2005

오늘날의 MMORPG 환경에서 수만~수십만 명의 유저들이 동시 접속하여 게임을 즐기고 있다. 수많은 인원이 같은 맵 상에서 활동하기 때문에 최근의 게임시스템들은 맵의 영역에 따라 유저를 분할하여 처리하고 있다. 이를 위해 맵 분할 시스템에 대한 연구가 다양하게 이루어지고 있으나 기존 맵 분할 시스템은 유동적인 유저들에 대해 대처하기엔 문제점을 가지고 있다. 본 논문에서는 기존 맵 분할 방법들에 대한 구조적 단점을 보완하고, 부하에 능동적으로 대처할 수 있도록 VML를 이용한 동적 맵 분할 방법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1099-1102
• /
• 2005

다중서명에서는 보안적 요소뿐만 아니라 다중서명의 길이, 다중서명의 생성 및 검증 시간, 복호화 시간, 통신량 등도 중요한 요소이다. 기존의 RSA를 그대로 이용한 RSA 원형 다중서명 방식과 RSA를 변형하여 적용한 RSA 변형 다중서명 방식은 다중서명의 생성 및 검증 시간이 각각의 개인서명을 생성하고 검증하는 시간의 합과 비례하여 증가한다는 문제점이 있다. 본 논문은 서명자의 수만큼 분할된 각각의 부분메시지에 대해 RSA 방식을 이용하여 제각기 서명하는 다중서명 방식을 제안한다. 제안된 메시지 분할을 이용한 RSA 다중서명 방식은 블록의 수가 증가하지 않는 경우 기존 방식에 비해 다중서명의 길이가 증가하지 않으면서, 다중서명의 생성 및 검증 시간이 각각 $\frac{1}{L}$로 감소하고, 복호화 시간과 통신량은 각각 약 $\frac{1}{2}{\sim}\frac{1}{L}$로 감소한다.

• Journal of Information Processing Systems
• /
• v.10 no.3
• /
• pp.384-394
• /
• 2014

The femtocell overlaid cellular network (FOCN) has been used to enhance the capacity of existing cellular systems. To obtain the desired system performance, both cross-tier interference and co-tier interference in an FOCN need to be managed. This paper proposes an interference management scheme that adaptively constructs a femtocell cluster, which is a group of femtocell base stations that share the same frequency band. The performance evaluation shows that the proposed scheme can enhance the performance of the macrocell-tier and maintain a greater signal to interference-plus-noise ratio than the outage level can for about 99% of femtocell users.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.69-72
• /
• 2001

High-level synthesis generates a structural design that implements the given behavior and satisfies design constraints for area, performance, power consumption, packaging, testing and other criteria. Thus, high-level synthesis generates that register-transfer(RT) level structure from algorithm level description. High-level syntehsis consist of compiling, partitioning, scheduling This paper we study the partitioning process, and analysis the min-cut algorithm and simulated annealing algorithm.