• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.93-100
• /
• 2011

The necessity of research on extracting information of face and facial components in animation characters have been increasing since they can effectively express the emotion and personality of characters. In this paper, we introduce a method to extract face and facial components of animation characters by defining a mesh model adequate for characters and by using dominant colors. The suggested algorithm first generates a mesh model for animation characters, and extracts dominant colors for face and facial components by adapting the mesh model to the face of a model character. Then, using the dominant colors, we extract candidate areas of the face and facial components from input images and verify if the extracted areas are real face or facial components by means of color similarity measure. The experimental results show that our method can reliably detect face and facial components of animation characters.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.894-906
• /
• 2006

There are many difficulties to develop a mobile contents due to many constraints on mobile environments. It is difficult to make a good mobile contents with only visual reduction of existing contents on wire Internet. Therefore, it is essential to devise the data representation and to develop the authoring tool to meet the needs of the mobile contents market. We suggest the compact mobile contents to learn Chinese characters and developed its authoring tool. The animation which our system produces is realistic as if someone writes letters with pen or brush. Moreover, our authoring tool makes a user generate a Chinese character animation easily and rapidly although she or he has not many knowledge in computer graphics, mobile programming or Chinese characters. The method to generate the stroke animation is following: We take basic character shape information represented with several contours from TTF(TrueType Font) and get the information for the stroke segmentation and stroke ordering from simple user input. And then, we decompose whole character shape into some strokes by using polygonal approximation technique. Next, the stroke animation for each stroke is automatically generated by the scan line algorithm ordered by the stroke direction. Finally, the ordered scan lines are compressed into some integers by reducing coordinate redundancy As a result, the stroke animation of our system is even smaller than GIF animation. Our method can be extended to rendering and animation of Hangul or general 2D shape based on vector graphics. We have the plan to find the method to automate the stroke segmentation and ordering without user input.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1240-1250
• /
• 2007

We introduce technique for color transformation of characters between scenes in 2D animation. As colors are perceived differently owing to light source, so character colors like clothes, skin and so on are colored differently owing to atmosphere of each scene. This paper is made an attempt to solve mathematically color assignment of characters which has been worked by hand so far. We can find a matrix for color transformation of characters by appling principle of color stimulus to our algorithm. In scenes of existing 2D animation, basic colors and colors under light source of characters are used for the matrix. And matrixes are obtained for each scenes of 2D animation. If we are known basic colors of some characters, you can derive character colors under other light source environments using the matrix. Therefore, this paper describes automatic color transformation of characters between animation scenes.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.26-34
• /
• 2008

Due to spread of movies or online games which are applied with computer animation techniques, we can easily see scenes where numerous characters appear. In the case of large-scale crowd animation, if one were to increase reality of the scene, features of system would be lowered, and if one were to increase functioning of system, reality of the scene would be lowered. In realizing large-scale crowd animation with seafloor environment as background, the paper analyzed and applied elements that affect behavioral types of fishes; and by using concept of crowd, the paper enabled each group or object to control their behavioral type; by comparing and contrasting real-time calculation method as calculation method for animation and hybrid calculation method which is mixed calculation method, the paper seeks to find a method that increases functioning of the system while also expresses natural scenes.

• The Journal of the Korea Contents Association
• /
• v.9 no.5
• /
• pp.76-83
• /
• 2009

This paper presents a compression method for animated meshes or mesh sequences which have a shared connectivity and geometry streams. Our approach is based on static semi-regular mesh compression algorithm introduced by Khodakovky et al. Our encoding algorithm consists of two stages. First, the proposed technique creates a semi-regular mesh sequence from an input irregular mesh sequence. For semi-regular remeshing of irregular mesh sequences, this paper adapts the MAPS algorithm. However, MAPS cannot directly be performed to the input irregular mesh sequence. Thus, the proposed remesh algorithm revises the MAPS remesher using the clustering information, which classify coherent parts during the animation. The second stage uses wavelet transformation and clustering information to compress geometries of mesh sequences efficiently. The proposed compression algorithm predicts the vertex trajectories using the clustering information and the cluster transformation during the animation and compress the difference other frames from the reference frame in order to reduce the range of 3D position values.

• Cartoon and Animation Studies
• /
• s.36
• /
• pp.493-510
• /
• 2014

From game consoles to TV and Hollywood films, 3D rendering technology is involved in various fields. Up until the late 90s, the computer image rendering method was rasterization that mainly used Phong Shading, and up until recently it was the go-to method for movies and film animation. In the 21st century, the quality provided by Ray Tracing and the development of Global Illumination was much more realistic and thus became popularized. However, despite its growing use in architectural rendering to the markets, Global Illumination in film animation and movies was limited due to its long render time. So, in this thesis, if one were to take the concept from each rendering method and consider it from a mathematical perspective, one could adapt the Ambient Occlusion's equation to the illumination loop equation used in rasterization. This algorithm modification has the capability to reflect the lighting of a diverse array of colors, like in Global Illumination, with a fast render time, as in rasterization, and the example RenderMan Shader is based upon this new algorithm. In conclusion, with Global Illumination's naturalistic lighting and rasterization's rendering speed, the combination of the best points of each is a new method with a short rendering time while producing good quality. I hope animations and films can benefit from this algorithm by the reduction of budget with an overall better quality output in VFX production.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.247-256
• /
• 2004

This paper presents an efficient collision detection algorithm the performance of which is independent of animation speed. Most of the previous collision detection algorithms are incremental and discrete methods, which find out the neighborhood of the extreme vertex at the previous time instance in order to get an extreme vertex at each time instance. However, if an object collides with another one with a high torque, then the angular speed becomes faster. Hence, the candidate by the incremental algorithms may be farther from the real extreme vertex at this time instance. Therefore, the worst time complexity nay be $O(n^2)$, where n is the number of faces. Moreover, the total time complexity of incremental algorithms is dependent on the time step size of animation because a smaller time step yields more frequent evaluation of Euclidean distance. In this paper, we propose a new method to overcome these drawbacks. We construct a spherical extreme vertex diagram on Gauss Sphere, which has geometric properties, and then generate the distance function of a polyhedron and a plane by using this diagram. In order to efficiently compute the exact collision time, we apply the interval Newton method to the distance function.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.4
• /
• pp.201-207
• /
• 2013

Voice Recognition technique has been developed and it has been actively applied to various information devices such as smart phones and car navigation system. But the basic research technique related the speech recognition is based on research results in English. Since the lip sync producing generally requires tedious hand work of animators and it serious affects the animation producing cost and development period to get a high quality lip animation. In this research, a real time processed automatic lip sync algorithm for virtual characters in digital contents is studied by considering Korean vocal sound system. This suggested algorithm contributes to produce a natural lip animation with the lower producing cost and the shorter development period.

• Journal of Internet of Things and Convergence
• /
• v.9 no.3
• /
• pp.13-19
• /
• 2023

In this paper, we investigated the implementation of a hairstyle recommendation system based on big data and deepfake technology. The proposed hairstyle recommendation system recognizes the facial shapes based on the user's photo (image). Facial shapes are classified into oval, round, and square shapes, and hairstyles that suit each facial shape are synthesized using deepfake technology and provided as videos. Hairstyles are recommended based on big data by applying the latest trends and styles that suit the facial shape. With the image segmentation map and the Motion Supervised Co-Part Segmentation algorithm, it is possible to synthesize elements between images belonging to the same category (such as hair, face, etc.). Next, the synthesized image with the hairstyle and a pre-defined video are applied to the Motion Representations for Articulated Animation algorithm to generate a video animation. The proposed system is expected to be used in various aspects of the beauty industry, including virtual fitting and other related areas. In future research, we plan to study the development of a smart mirror that recommends hairstyles and incorporates features such as Internet of Things (IoT) functionality.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.479-486
• /
• 2016

In this paper, the algorithm which can convert a 2D image into a 3D Model will be discussed. The 2D picture drawn by a user is scanned for image processing. The Canny algorithm is employed to find the contour. The waterfront algorithm is proposed to find foreground image area. The foreground area is segmented to decompose the complex shapes into simple shapes. Then, simple segmented foreground image is converted into 3D model to become a complex 3D model. The 3D conversion formular used in this paper is also discussed. The generated 3D model data will be useful for 3D animation and other 3D contents creation.