• Structural Engineering and Mechanics
• /
• v.2 no.2
• /
• pp.125-139
• /
• 1994

A vector algorithm for calculating the stiffness matrices of reinforced concrete shell elements is presented. The algorithm is based on establishing vector lengths equal to the number of elements. The computational efficiency of the proposed algorithm is assessed on a Cray Y-MP supercomputer. It is shown that the vector algorithm achieves scalar-to-vector speedup of 1.7 to 7.6 on three moderate sized inelastic problems.

• Journal of Korean Association for Spatial Structures
• /
• v.8 no.3
• /
• pp.75-82
• /
• 2008

In this study, the modified genetic algorithm, D-GA, is proposed. D-GA is a hybrid genetic algorithm combined a simple genetic algorithm and the local search algorithm using direction vectors. Also, two types of direction vectors, learning direction vector and random direction vector, are defined without the sensitivity analysis. The accuracy of D-GA is compared with that of simple genetic algorithm. It is demonstrated that the proposed approach can be an effective optimization technique through a minimum weight structural optimization of ten bar truss.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1994.10a
• /
• pp.25-30
• /
• 1994

A vector algorithm for calculating the stiffness matrices of reinforced concrete shell elements is presented. The algorithm is based on establishing vector lengths equal to the number of elements. The computational efficiency of the proposed algorithm is assessed on a Cray Y-MP supercomputer. It is shown that the vector algorithm achieves scalar-to-vector speedup of 1.7 to 7.6 on three inelastic problems.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2044-2047
• /
• 2003

In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.5
• /
• pp.68-74
• /
• 1998

Block-based interframe interpolation algorithms cause severe block effect because the algorithm interpolates the skipped frame by using block based motion vector. Therefore, in this paper, we propose an algorithm that reduces the block effect in the interpolated frames. First, we propose an algorithm that obtains backward motion vector by using forward motion vector received from the transmitter. In order to predict well covered and uncovered region, backward motion vector is needed as well as forward motion vector. Second, we propose the algorithm which segments the motion boundary blocks into regions and obtains the motion vector of each region from candidates that consist of the motion vectors of neighbor blocks. This algorithm makes it possible that the moving object and the background, in spite of being in the same block, have different motion vectors from each other so that the block effect can be reduced. According to the results of simulation, the proposed algorithm is superior to conventional algorithm in subjective quality a swell as in objective quality.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.3E
• /
• pp.53-57
• /
• 1998

Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1995.06a
• /
• pp.87-90
• /
• 1995

In this paper, we propose a new deinterlacing algorithm based on weighted wide vector correlations. This algorithm is developed mainly for the format conversion problem encountered in current HDTV system, but not limited to. By having wide vector correlations, visually annoying artifacts caused by interlacing, such as a serrate line, line crawling, a line flicker, and a large area flicker, can be remarkably reduced, since the use of wide vector correlation increases the detectability of edges in various orientations.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.79-86
• /
• 2006

Classification technology is essential for fast retrieval in large multi-media database. This paper proposes a combining GA(Genetic Algorithm) and SVM(Support Vector Machine) model to fast retrieval. We used color and texture as feature vectors. We improved the retrieval accuracy by using proposed model which retrieves an optimal feature vector set in extracted feature vector sets. The first performance test was executed for the performance of color, texture and the feature vector combined with color and texture. The second performance test, was executed for performance of SVM and proposed algorithm. The results of the experiment, using the feature vector combined color and texture showed a good Performance than a single feature vector and the proposed algorithm using hybrid method also showed a good performance than SVM algorithm.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1312-1320
• /
• 2017

Recently, vector map data is developed and used in many domains widely. In the most cases, vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the production process of vector maps is considerably complex and consumes a lot of money and human resources. Therefore, the secured storage and transmission are necessary to prevent the illegal copying and distribution from hacker. This paper presents a selective encryption algorithm using geometric objects in frequency domain for vector map data. In the proposed algorithm, polyline and polygon data in vector map is the target of the selective encryption process. Experimental results verified that proposed algorithm is effectively and adaptive the requirements of security.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.477-484
• /
• 2001

This paper proposes a hybrid learning algorithm combined momentum and kernel-adatron for improving the performance of regression support vector machine. The momentum is utilized for high-speed convergence by restraining the oscillation in the process of converging to the optimal solution, and the kernel-adatron algorithm is also utilized for the capability by working in nonlinear feature spaces and the simple implementation. The proposed algorithm has been applied to the 1-dimension and 2-dimension nonlinear function regression problems. The simulation results show that the proposed algorithm has better the learning speed and performance of the regression, in comparison with those quadratic programming and kernel-adatron algorithm.