• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.337-344
• /
• 2006

In this paper, we propose a multi-view video codec for 3DTV system. The proposed algorithm is not only to reduce the temporal and spatial redundancy but also to reduce the redundancy among each view. With these results, we can improve the coding efficiency for multi-view video sequences. In order to reduce the redundancy of each view more efficiently, we define the assembled image(AI) that is generated by the global disparity compensation of each view. In addition, the proposed algorithm is based on MPEG-2 structure so that we can easily implement 3DTV system without changing the conventional 2D digital TV system. Experimental results show that the proposed algorithm performs very well. It also performs better than MPEG-2 simulcast coding method. The newly proposed codec also supports the view scalability, accurate temporal synchronization among multiple views and random access capability in view dimension.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.257-264
• /
• 2005

This paper suggests a heuristic algorithm for the clustering problem. Clustering involves grouping similar objects into a cluster. Clustering is used in a wide variety of fields including data mining, marketing, and biology. Until now there are a lot of approaches using Self-Organizing Feature Maps(SOFMs). But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of k output-layer nodes, if they want to make k clusters. This approach has problems to classify elaboratively. This paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We can find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. We use the well known IRIS data as an experimental data. Unsupervised clustering of IRIS data typically results in 15 - 17 clustering error. However, the proposed algorithm has only six clustering errors.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.36 no.2
• /
• pp.111-122
• /
• 1994

In this study, an algorithm which can be applied to the optimum design of simple steel plate girders was developed, and efficient optimization strategies for the solution of algorithm were found out. The optimum design algorithm consists of 3-levels of optimization. In the first and second levels of optimization, the absolute maximum bending moment and shearing force are extracted and in the third level of optimization, the optimum cross section of steel plate girder is determined. For the optimum design of cross section, the objective function is formulated as the total area of cross section and constraints are derived in consideration of the various stresses and the minimum dimension of flange and web based on the part of steel bridge in the Korea standard code of road bridge. Sequential unconstrained minimization technique using the exterior penalty function method(SUMT-EP), sequential linear programming(SLP) and sequential quadratic programming (SQP) are proved to be efficient and robust strategies for the optimum design of simple plate girder cross section. From the reliable point of view, SLP is the most efficient and robust strategy and SQP is the most efficient one from the viewpoint of converguency and computing time.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.3
• /
• pp.151-157
• /
• 2009

In this paper, we proposed an algorithm of redeye correction. For naturally redeye correction, we assumed positions of the redeye at an image which produced redeye, and we estimated rate of the redeye to apply the appropriate redeye correction suitably. We extract and label pixels those are possible of generating redeye using red, skin and reflected light color. The each labeled group is decided by rates of length and width, dimension, density, the color of white of the eye and reflected light color of groups for the redeye group. We corrected positions of redeye using blurring effect, naturally. In the case of designing the proposed algorithm, we designed the redeye correction hardware using the minimum of memories for efficiency of hardware.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.3
• /
• pp.53-61
• /
• 2016

In this paper, we propose an algorithm for generating lightning paths, which are more realistic than those of random tree based algorithm and faster than a physically based simulation algorithm. Our approach utilizes physically based Dielectric Breakdown Method (DBM) and approximates the electric potential field dramatically to generate the lightning path. We also show a guide path method for the lightning to avoid obstacles in a complex scene. Finally, our method renders fast and realistic lightning by considering physical characteristics for the thickness and brightness of the lightning stream. Our result of the lightning path shares similarity to natural phenomenon by having about 1.56 fractal dimensions, and we can generate the lightning path faster than a previous physically based algorithm. On the other hand, our method is difficult to apply on the real-time games yet, but our approach can be improved by performing the path generation algorithm with GPU in future.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.69-75
• /
• 2019

The standard application area of over-sampled discrete wavelet transform is noise removal technology for digital images. Comparing dual density discrete wavelet transform with dual tree discrete wavelet transform, we have almost similar characteristics. In this paper, several discrete wavelet transforms are accomplished on digital image existing with noise, noises are removed with threshold processing algorithm on subband, performance evaluation experiments of the reconstructed images are accomplished. If we decide appropriate threshold value, the effect noise removal is possible. In this paper, we can certified that the suggested algorithm of 3-direction separable processing with 2 dimension dual density discrete wavelet transform is superior to several experiment results.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.531-540
• /
• 2008

An Adaptive Random Testing(ART) is one of test case generation algorithms, which was designed to get better performance in terms of fault-detection capability than that of Random Testing(RT) algorithm by locating test cases in evenly spreaded area. Two ART algorithms, such as Distance-based ART(D-ART) and Restricted Random Testing(RRT), had been indicated that they have significant drawbacks in computations, i.e., consuming quadratic order of runtime. To reduce the amount of computations of D-ART and RRT, iterative partitioning of input domain strategy was proposed. They achieved, to some extent, the moderate computation cost with relatively high performance of fault detection. Those algorithms, however, have yet the patterns of non-uniform distribution in test cases, which obstructs the scalability. In this paper we analyze the distribution of test cases in an iterative partitioning strategy, and propose a new method of input domain enlargement which makes the test cases get much evenly distributed. The simulation results show that the proposed one has about 3 percent of improvement in terms of mean relative F-measure for 2-dimension input domain, and shows 10 percent improvement for 3-dimension space.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.1
• /
• pp.137-145
• /
• 2004

In this paper, a new algorithm for the segmentation of the multi moving objects at the 3 dimension space and the method of measuring the distance from the camera to the moving object by using stereo video monitoring system is proposed. It get the input image of left and right from the stereo video monitoring system, and the area of the multi moving objects segmented by using adaptive threshold and PRA(pixel recursive algorithm). Each of the object segmented by window mask, then each coordinate value and stereo disparity of the multi moving objects obtained from the window masks. The distance of the multi moving objects can be calculated by this disparity, the feature of the stereo vision system and the trigonometric function. From the experimental results, the error rate of a distance measurement be existed within 7.28％, therefore, in case of implementation the proposed algorithm, the stereo security system, the automatic moving robot system and the stereo remote control system will be applied practical application.

• The Journal of Information Systems
• /
• v.25 no.3
• /
• pp.217-245
• /
• 2016

Purpose With the increasing number of foreign travelers visiting Korea, it is a heavy question to evaluate service quality of typical domestic hotel companies. Our research aims to evaluate service quality of domestic hotels in Korea from the perspective of foreign travelers in order to provide the quality improvements that call attention for the hotel management. Design/Methodology/Approach In this paper, topics of sentiment followed Lodging Quality Index(LQI) dimensions classifying lodging service quality appropriately. Also, we employed word2vec algorithm which calculates similarity and affinity among the vocabularies accurately. To calculate sentiment of each dimension, we adopted scores from SentiWordNet. Findings From the result, we found the number of foreign travelers particularly satisfied with cleanliness, politeness, and problem solving skills. In contrast, it has also been found out that both promptness of services and efficiency of communication do not fulfill the requirements of travelers.

• Tunnel and Underground Space
• /
• v.29 no.4
• /
• pp.243-261
• /
• 2019

Microseismic monitoring technologies have been recognized for its superiority over traditional methods and are used in domestic and overseas underground mines. However, the complex gangway layout of underground mines in Korea and the mixed structure of excavated space and rock masses make it difficult to estimate the microseismic propagation and to determine the arrival time of microseismic wave. In this paper, experimental studies were carried out to determine the source location according to various arrival picking methods and dimensional conditions. The arrival picking methods used were FTC (First Threshold Cross), Picking window, AIC (Akaike Information Criterion), and 2-D and 3-D source generation experiments were performed, respectively, under the 2-D sensor array. In each experiment, source location algorithm used iterative method and genetic algorithm. The iterative method was effective when the sensor array and source generation were the same dimension, but it was not suitable to apply when the source generation was higher dimension. On the other hand, in case of source location using RCGA, the higher dimensional source location could be determined, but it took longer time to calculate. The accuracy of the arrival picking methods differed according to the source location algorithms, but picking window method showed high accuracy in overall.