• International Journal of Contents
• /
• v.10 no.3
• /
• pp.9-16
• /
• 2014

Depth-image-based rendering is generally used in real-time 2D-to-3D conversion for 3DTV. However, inaccurate depth maps cause flickering issues between image frames in a video sequence, resulting in eye fatigue while viewing 3DTV. To resolve this flickering issue, we propose a new 2D-to-3D conversion scheme based on fast and robust depth-map generation from a 2D video sequence. The proposed depth-map generation algorithm divides an input video sequence into several cuts using a color histogram. The initial depth of each cut is assigned based on a hypothesized depth-gradient model. The initial depth map of the current frame is refined using color and motion information. Thereafter, the depth map of the next frame is updated using the difference image to reduce depth flickering. The experimental results confirm that the proposed scheme performs real-time 2D-to-3D conversions effectively and reduces human eye fatigue.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.283-288
• /
• 2011

This paper have proposed an object retrieval using the corners area variability based on correlogram. The proposed algorithm is processed as follows. First, the corner points of the object in an image are extracted and then the feature vectors are obtained. It are rearranged according to the number dimension and consist of sequence vectors. And the similarity based on the maximum of sequence vectors is measured. The proposed technique is invariant to the rotation or the transfer of the objects and more efficient in case that the objects present simple structure. In simulation that use Wang's database, the method presents that the recall property is improved by 0.03% and more than the standard corner patch histogram.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1794-1806
• /
• 2023

This study presents a method for capturing photographs of users as input and converting them into 2D character animation sprites using a generative adversarial network-based artificial intelligence network. Traditionally, 2D character animations have been created by manually creating an entire sequence of sprite images, which incurs high development costs. To address this issue, this study proposes a technique that combines motion videos and sample 2D images. In the 2D sprite generation process that uses the proposed technique, a sequence of images is extracted from real-life images captured by the user, and these are combined with character images from within the game. Our research aims to leverage cutting-edge deep learning-based image manipulation techniques, such as the GAN-based motion transfer network (impersonator) and background noise removal (U² -Net), to generate a sequence of animation sprites from a single image. The proposed technique enables the creation of diverse animations and motions just one image. By utilizing these advancements, we focus on enhancing productivity in the game and animation industry through improved efficiency and streamlined production processes. By employing state-of-the-art techniques, our research enables the generation of 2D sprite images with various motions, offering significant potential for boosting productivity and creativity in the industry.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.6
• /
• pp.411-418
• /
• 2020

In this paper, approximation and optimization methods are proposed for the structural performance of the composite fan blade. Using these methods, we perform the optimal design of the stacking sequence to maximize stiffnesses without changing the mass and the geometric shape of the composite fan blade. In this study, the lamination parameters are introduced to reduce the design variables and space. From the characteristics of lamination parameters, we generate response surface model having a high fitness value. Considering the requirements of the optimal stacking sequence, the multi-objective optimization problem is formulated. We apply the two-step optimization method that combines gradient-based method and genetic algorithm for efficient search of an optimal solution. Finally, the finite element analysis results of the initial and the optimized model are compared to validate the approximation and optimization methods based on the lamination parameters.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.12-16
• /
• 2007

The function of a protein is closely co-related with its subcellular location(s). Given a protein sequence, therefore, how to determine its subcellular location is a vitally important problem. We have developed a new prediction method for protein subcellular location(s), which is based on n-gram feature extraction and k-nearest neighbor (kNN) classification algorithm. It classifies a protein sequence to one or more subcellular compartments based on the locations of top k sequences which show the highest similarity weights against the input sequence. The similarity weight is a kind of similarity measure which is determined by comparing n-gram features between two sequences. Currently our method extract penta-grams as features of protein sequences, computes scores of the potential localization site(s) using kNN algorithm, and finally presents the locations and their associated scores. We constructed a large-scale data set of protein sequences with known subcellular locations from the SWISS-PROT database. This data set contains 51,885 entries with one or more known subcellular locations. Our method show very high prediction precision of about 93% for this data set, and compared with other method, it also showed comparable prediction improvement for a test collection used in a previous work.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.77-80
• /
• 2000

In this paper, the speaker-recognition process based on both DTW and discrete HMM was performed using the method to evaluate state-dependent parameter weighting from training data so as the personal audio-characteristics are to be well reflected. In the suggested method below, we found the optimal state sequence using the Viterbi algorithm. The optimal path could be evaluated after comparing the sequence of base pattern which already have, with that of the other patterns. After that the frame of which the pattern was matched with the base pattern in the same state are to be found so that the reference pattern can be gained by weighting on the numbers of matched frames.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.45-60
• /
• 2005

This paper investigates the application of the computer method COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) to the process routing (PR) problem with multiple objectives. In any computer aided process planning (CAPP) system, one of the most critical activities for manufacturing a part could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The COMSOAL has been adopted to find the optimum sequence of operations that optimizes two major conflicting criteria : production cost and production quality. The COMSOAL is here slightly modified to simultaneously generate and evaluate a set of possible solutions (called as population) instead of processing a solution stepwise in each iteration. The significant features of the COMSOAL include : no parameters settings needed, and a guarantee of feasible solutions. Experimental results show that COMSOAL is a simple but powerful method to quickly generate multiple feasible solutions which are as good as the ones obtained from several other well-known process routing algorithms.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.87-102
• /
• 1998

Given a sequence of cross-sectional curves, the skinning method generates a freeform surface that interpolates the given curves in that sequence. This thesis presents a construction method of a B-spline skinning surface that is fair and satisfies volume constraints. The fairness metric is based on the parametric energy functional of a surface. The degrees of freedom in surface control are closely related lo control points in the skinning direction. The algorithm fur finding a skinning surface consists of two step. In the first step, an initial fair surface is generated without volume constraints and one coordinate of each control point is fixed. In the second step, a final surface that meets all constraints is constucted by rearranging the other coordinates of each control point that defines the initial surface A variational Lagrange optimization method produces a system of nonlinear equations, which can be solved numerically. Moreover, the reparametrization of given sectional curves is important for the construction of a reasonable skinning surface. This thesis also presents an intuitive metric for reparametrization and gives some examples that are optimized with respect to that metric.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.357-364
• /
• 1996

This paper presents a new blind identification method of nonminimum phase FIR systems without employing higher-order statistics. It is based on the observation that the absolute mean of a second-order white sequence can measure the higher-order whiteness of the sequence. The proposed method may be a new alternative way to the higher-order statistics approaches. Some computer simulations show that the absolute mean is exactly estimated and the proposed method can overcome the disadvantages of the higher-order statistics approaches.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.152-155
• /
• 2009

In this paper, we propose the image encryption method using complemented MLCA based on 90/150 NBCA(Null Boundary Cellular Automata). The encryption method is processed in the following order. First, complemented MLCA, which is derived from linear LFSR, is used to produce a PN(pseudo noise) sequence, which matches the size of the original image. Then, the created complemented MLCA sequence goes through a XOR operation with the original image to become encrypted. Lastly, an experiment is processed to verify the effectiveness of this method.