• Journal of KIISE:Software and Applications
• /
• v.30 no.5_6
• /
• pp.389-397
• /
• 2003

The component-based development methodology becomes famous as the new way for reuse. The goal of the reuse is improvement of quality, productivity and independence on the software development. For the improvement in the quality of a component-based system, it is necessary to research component metrics in the early phase of a component development. Hence, in this paper, we propose new component metrics using the information of a component analysis phase. Those are CCI(Complexity of Component Interface) and LCC(Lack Cohesion of Component interface). CCI indicates a difficulty about comprehension, modification, management, use of interface. LCC indicates a functional independence about how strong the elements are related with. Therefore, it is possible to predict and manage the quality of a component to be developed. Predicting a lowness of complexity and highness of cohesion as an independent functional unit by a component interface in the early phase of a component development, we can expect the improvement in the quality of a system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.709-717
• /
• 2002

A new multi constant modulus algorithm (MCMA) for a blind decision feedback equalizer is proposed. In order to avoid the error propagation problem in the conventional DFE structure, Feed-Back Filter coefficients are updated only after Feed-Forward Filter coefficients are sufficiently converged to the steady state. Therefore, it has the problem of slow convergence speed characteristics. To overcome this drawback, the proposed MCMA algorithm uses not only new cost function considering the minimum distance between the received signal and the representative value containing the statistical characteristics of the transmitted signal, but also adaptive step-size according to the equalizer outputs to fast convergence speed of FBF. Simulations were carried out under the certified communication channel environment to evaluate a performance of the proposed equalizer. The simulation results show that the proposed equalizer has an improved convergence and SER performance compared with previous methods. The proposed techniques offer the possibility of practical equalization for cable modem and terrestrial HDTV broadcast (using 8-VSB or 64-QAM) applications.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.345-354
• /
• 2005

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have a priori knowledge about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper presents the motion detection algorithm that can run robustly about recusive motion. The motion detection compares and analyzes two frames each other, motion of whether happened judge. Through experiments, we show significant improvements in the reduction of the computational time in terms of the number of search steps without much quality degradation in the predicted image.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.142-145
• /
• 2005

Since the successful launch of FORMOSAT -2 satellite by National Space Organization of Taiwan in May 2004, the Remote Sensing Instrument (RSI) on- board the FORMOSAT -2 has continuously acquired images at one panchromatic and four multi-spectral bands (http://www.nspo.org.tw). In general, the RSI performs well and receives high quality images which proved to be very useful for various applications. However, some RSI panchromatic products exhibit obvious trembling artifact that must be removed. Preliminary study reveals that the trembling artifact is caused by the instability of the spacecraft attitude. Though the magnitude of this artifact is actually less than half of a pixel, it affects the applicability of panchromatic products. A procedure removing this artifact is therefore needed for providing image products of consistent quality. Due to the nature of trembling artifact, it is impossible to describe the trembling amount by employing an analytic model. Relied only on image itself, an algorithm determining trembling amount and removing accordingly the trembling artifact is proposed. The algorithm consists of 3 stages. First, a cross-correlation based scheme is used to measure the relative shift between adjacent scan lines. Follows, the trembling amount is estimated from the measured value. For this purpose, the Fourier transform is utilized to characterize random shifts in frequency domain. An adaptive estimation method is then applied to deduce the approximate trembling amount. In the subsequent stage, image re-sampling operation is applied to restore the trembling-free product. Experimental results show that by applying the proposed algorithm, the unpleasant trembling artifact is no longer evident.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3923-3932
• /
• 2000

In mobile network, wireless links may be overloaded due to a high concentratioJl of mobile hosts in a given cell. As a result, the required QOS(Quality of Service) cannot be provided to all flows in that cell. So, there exists adaptive applications which can operate with various bandwidth levels. When a wireless link is overloaded, it can adapt by reducing the bandwidths of flows, is referred to as rate adaptation. In this paper, we analyze the performance of existing rate adaptation methods by simulations. The result of simulation experiments shows that average-fair adaptation scheme has very low network overhead but high bandwidth variance of flows, which causes the worse quality of service. We propose a rate adaptation method refined by combining fair adaptation and average-fair adaptation, and shows the refined method can provide lower bandwidth variance of flows by simulations.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.59-64
• /
• 2001

The robot soccer simulation game is a dynamic multi-agent environment. In this paper we suggest a new reinforcement learning approach to each agent's dynamic positioning in such dynamic environment. Reinforcement learning is the machine learning in which an agent learns from indirect, delayed reward an optimal policy to chose sequences of actions that produce the greatest cumulative reward. Therefore the reinforcement learning is different from supervised learning in the sense that there is no presentation of input pairs as training examples. Furthermore, model-free reinforcement learning algorithms like Q-learning do not require defining or learning any models of the surrounding environment. Nevertheless it can learn the optimal policy if the agent can visit every state- action pair infinitely. However, the biggest problem of monolithic reinforcement learning is that its straightforward applications do not successfully scale up to more complex environments due to the intractable large space of states. In order to address this problem. we suggest Adaptive Mediation-based Modular Q-Learning (AMMQL)as an improvement of the existing Modular Q-Learning (MQL). While simple modular Q-learning combines the results from each learning module in a fixed way, AMMQL combines them in a more flexible way by assigning different weight to each module according to its contribution to rewards. Therefore in addition to resolving the problem of large state effectively, AMMQL can show higher adaptability to environmental changes than pure MQL. This paper introduces the concept of AMMQL and presents details of its application into dynamic positioning of robot soccer agents.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.1
• /
• pp.1-9
• /
• 2001

We present a scheme and a data structure that decompose the space into adaptive-sized cells to improve the visualization of soft objects. Soft objects are visualized through the evaluation of the field functions at every point of the space. According to the propsed scheme, the affecting soft objects for a point in the space is searched through the data structure called interval tree based on the bounding volume of the components, which represent a soft object whose defining primitive(skeleton) is a simple geometric object such as point or line segment. The bounding volume of each component is generated with respect to the radius of a local field function of the component, threshold value, and the relations between the components and other neighboring components. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in interactive modeling process.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.3
• /
• pp.1-8
• /
• 2016

We propose an adaptive histogram stretching algorithm for application to a car's personal recorder. The algorithm was used for pre-processing to detect the license plate region in an image from a personal recorder. The algorithm employs a Probability Density Function (PDF) and Cumulative Distribution Function (CDF) to analyze the distribution diagram of the images. These two functions are calculated using an image obtained by sampling at a certain pixel interval. The images were subjected to different levels of stretching, and experiments were done on the images to extract their characteristics. The results show that the proposed algorithm provides less deterioration than conventional algorithms. Moreover, contrast is enhanced according to the characteristics of the image. The algorithm could provide better performance than existing algorithms in applications for detecting search regions for license plates.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.31-39
• /
• 2012

DVC(Distributed Video Coding) techniques have been attracting a lot of research works since these enable us to implement the light-weight video encoder and to provide good coding efficiency by introducing the feedback channel. However, the feedback channel causes the decoder to increase the decoding complexity and requires very high decoding latency because of numerous iterative decoding processes. So, in order to reduce the decoding delay and then to implement in a real-time environment, this paper proposes several parity bit estimation methods which are based on the temporal correlation, spatial correlation and spatio-temporal correlations between LDPCA frames on each bit plane in the consecutive video frames in pixel-domain Wyner-Ziv video coding scheme and then the performances of these methods are compared in fast DVC scheme. Through computer simulations, it is shown that the adaptive spatio-temporal correlation-based estimation method and the temporal correlation-based estimation method outperform others for the video frames with the highly active contents and the low active contents, respectively. By using these results, the proposed estimation schemes will be able to be effectively used in a variety of different applications.

• Journal of KIISE:Software and Applications
• /
• v.37 no.9
• /
• pp.694-705
• /
• 2010

The mutation operation is the main operation in the evolutionary programming which has been widely used for the optimization of real valued function. In general, the mutation operation utilizes both a probability distribution and its parameter to change values of variables, and the parameter itself is subject to its own mutation operation which requires other parameters. However, since the optimal values of the parameters entirely depend on a given problem, it is rather hard to find an optimal combination of values of parameters when there are many parameters in a problem. To solve this shortcoming at least partly, if not entirely, in this paper, we propose a new mutation operation in which the parameter for the variable mutation is theoretically estimated from the self-adaptive perspective. Since the proposed algorithm estimates the scale parameter of the Cauchy probability distribution for the mutation operation, it has an advantage in that it does not require another mutation operation for the scale parameter. The proposed algorithm was tested against the benchmarking problems. It turned out that, although the relative superiority of the proposed algorithm from the optimal value perspective depended on benchmarking problems, the proposed algorithm outperformed for all benchmarking problems from the perspective of the computational time.