• Journal of Digital Convergence
• /
• v.17 no.12
• /
• pp.451-459
• /
• 2019

This study is aims to examine how the skeleton character in Pixar's Animation is visualized for the narrative of the film and suggests the direction of attractive character development corresponding to the story. First of all, it was conducted the case studies on the narrative of animation, character design, character's emotion expression, and animations featuring skeleton character. Based on this study, it was derived the visual representation of the skeleton character featuring in and analyzed the role and function in the animation. As a result, the expressions by the skeleton's eyes, eyebrows, mouth, lips, and jaw played the most important role for the emotional expression and lines in , and the major characteristic for human facial expression was reflected in the design of the skeleton character. In addition, the various props were used to provide the detailed informations of the skeleton's character, and it was expressed the movement emphasizing its essential attribute. Finally, the skeleton's symbolic image was strengthened by composing and arranging the skeleton's image through Mise en scene. It is expected that this study will be used as a reference for the animation character related researchers and practitioners in the business and it helps develop attractive characters fir the narrative animation in the future.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.361-366
• /
• 2018

For each character constituting learning data, different fonts are added in pixel unit to create MASK, and then pixel values belonging to the MASK are divided into three groups. The experimental data are modified into skeletal forms, and then regional boundary operation is used to create a boundary that distinguishes the background region adjacent to the skeleton of the character from the background of the modified experimental data. Discordance values between the modified experimental data and the MASKs are calculated, and then the MASK with the minimum value is found. This MASK is selected as a finally recognized result for the given experiment data. The recognition algorithm using skeleton of the character and the regional boundary operation can easily extend the learning data set by adding new fonts to the given learning data, and also it is simple to implement, and high character recognition rate can be obtained.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.50-57
• /
• 2002

This paper is the study about the improvement of the WPTA4 algorithm available for the recognition of various characters. The WPTA4 algorithm can extract the skeleton of a character almost similar to the original pattern by using the connection value representing connectivity of each pixel. In this paper we show that the skeleton disappearance phenomena existing in the WPTA4 and propose an modified algorithm which can eliminate this phenomena. The proposed algorithm shows that the skeleton disappearance phenomena is eliminated and the quality of extracted skeleton is excellent.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.27-33
• /
• 2005

In this paper, an effective skeleton method is proposed in order to obtain an enhanced digital image of skeleton line. The binary image using the threshold values is applied in the preprocessing stage and then The proposed method is applied to obtain the improved image of skeleton line. We used the existing skeleton methods and SPTA(Shin's Parallel Thinning Algorithm) method for the comparison. The demerits of the existing skeleton methods have a result of noise branch, expansion and contraction. and then we are proposed a SPTA method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.361-363
• /
• 2021

Digital character rigging is an important technology to improve animation vividness, and there are many kinds of complex ways of rigging system. To move naturally, the fish are tested for movement. Because 2,4 family role information although some, but the study of fish (0 family) action information is not much. As the diversity and complexity of fish production increases, inefficient time and capital are required. How to build a fish-like skeleton system depends on how to build an efficient and agile rigging program. The aim of this study is to compare the Advanced Skeleton-based animation process with Maya Rig, which can solve the high time-cost rigging problem, and to explore the best automatic plug-in based on the advantages of Advanced Skeleton, broadening the research scope of fish animation.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.814-818
• /
• 2004

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2823-2829
• /
• 1999

This paper is a study on the improvement of WPTA algorithm available for the recognition of various characters. WPTA algorithm can extract the skeleton of a character almost similar to the original pattern by using the connection value representing connectivity of each pixel. In this paper we show that the skeleton disappearance phenomena existing in WPTA and propose modified algorithm which can eliminate this phenomena.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.358-377
• /
• 2015

In this paper, we propose a novel approach for trajectory recovery. Our system uses a triangulation procedure for skeletonization and graph theory to extract the trajectory. Skeletonization extracts the polyline skeleton according to the polygonal contours of the handwritten characters, and as a result, the junction becomes clear and the characters that are touching each other are separated. The approach for the trajectory recovery is based on graph theory to find the optimal path in the graph that has the best representation of the trajectory. An undirected graph model consisting of one or more strokes is constructed from a polyline skeleton. By using the polyline skeleton, our approach accelerates the process to search for an optimal path. In order to evaluate the performance, we built our own dataset, which includes testing and ground-truth. The dataset consist of thousands of handwritten characters and word images, which are extracted from five handwritten documents. To show the relative advantage of our skeletonization method, we first compare the results against those from Zhang-Suen, a state-of-the-art skeletonization method. For the trajectory recovery, we conduct a comparison using the Root Means Square Error (RMSE) and Dynamic Time Warping (DTW) in order to measure the error between the ground truth and the real output. The comparison reveals that our approach has better performance for both the skeletonization stage and the trajectory recovery stage. Moreover, the processing time comparison proves that our system is faster than the existing systems.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.2
• /
• pp.21-29
• /
• 2003

The thinning algorithms using 8-neighbors connection value can extract the skeleton of a character almost similar to the original pattern by using the connection value representing connectivity of each pixel. This paper considers the erosion phenomenon which appears in the thinning algorithm using 8-neighbors connection value without skeleton disappearance phenomenon. The experimental results show that the proposed thinning algorithm can be applied to the application of both a straight line segment and a curved line segment.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.473-476
• /
• 1989

This paper proposes the recognition of Korean character by using the given pre-segmented area. For higher processing speed, we introduce the techniques for pruning the unused segments. And, new thinning algorithm is used for finding skeleton of each segment.