• Journal of Digital Contents Society
• /
• v.19 no.8
• /
• pp.1565-1573
• /
• 2018

The recent breakthroughs of multimedia computing have expanded its scope of application to the fields not been touched before. The reproduction of late artists' performance, especially dancers', which had put on the back burner until now, also beginning to shed the light. This study showed how to apply it to the reproduction of these late performers. Through this work, not only did we reduce the working time by applying the software to the manual process which has been dominantly practiced for reproducing the existing stage, but also made it possible to be reused in the subsequent work.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1531-1539
• /
• 2004

In this paper, we propose an efficient method for locating human lips. Based on Point Distribution Model and Principle Component Analysis, a lip shape model is built. Lip boundary model is represented based on the concatenated gray level distribution model. We calculate the distribution of shape parameters using Gaussian mixture. The problem to locate lip is simplified as the minimization problem of matching object function. The Down Hill Simplex Algorithm is used for the minimization with Gaussian Mixture for setting initial condition and refining estimate of lip shape parameter, which can refrain iteration from converging to local minima. The experiments have been performed for many images, and show very encouraging result.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1043-1050
• /
• 2008

XML has become a standard for data representation and exchange on the Internet. With a large number of XML documents on the Web, there is an increasing need to automatically process those structurally rich documents for information retrieval, document management, and data mining applications. In this paper, we propose a new method to measure the similarity between XML documents by considering their structures and contents. The similarity of document's structure is found by a simple string matching technique and that of document's contents is found by weights taking into account of the names and positions of elements. The overall algorithm runs in time that is linear in the combined size of the two documents involved in comparison evaluation.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.520-528
• /
• 2013

Makeup simulation is a tool that tests various makeup methods on a virtual digital face using input and display devices. Although several simulation systems supporting various makeup styles have been recently developed, most systems have many limitations on realistic skin representations because they use 2D facial images. We develope a realistic makeup simulation method which can control skin reflectance and roughness parameters. The method allows a user to simulate makeup applications while changing skin parameters using high-resolution facial data acquired by 3D scanners. Besides we use a point-based shape representation which enables simple and flexible 3D rendering, and provide a more realistic makeup simulation by applying different skin parameters on each part of the face.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.372-379
• /
• 2000

In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

• Journal of Korea Multimedia Society
• /
• v.13 no.3
• /
• pp.359-368
• /
• 2010

Algorithm visualization is useful for program testing, debugging and evaluating, as well as visual aids in education. When teaching algorithms and data structures, showing exact behaviors by graphics or animation is more suitable than just explaining them. Current systems for algorithm animation are limited to a couple of specific applications and need a special environment. In the proposed system, programmer writes source program in C and animator embeds visualization scripts in the appropriate location of the program. Then user can get an animation code in form of SVG and see a graphical representation on the web browser. Generated SVG animation code is platform independent and can also interact with other XML applications or HTML.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1098-1103
• /
• 2005

The edge and contour information are very much appreciated by the human visual systems and are responsible for our perceptions and recognitions. Therefore, if edge information is integrated during extracting video objects, we can generate boundaries of oects closer to human visual systems for multimedia applications such as interaction between video objects, object-based coding, and representation. Most of object extraction methods are difficult to implement real-time systems due to their iterative and complex arithmetic operations. In this paper, we propose a VLSI architecture integrating edge information to extract video objects for precisely located object boundaries. The proposed architecture can be easily implemented into hardware due to simple arithmetic operations. Also, it can be applied to real-time object extraction for object-oriented multimedia applications.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2671-2678
• /
• 1997

The MHEG-5 standard defines representation of multimedia and hypermedia information. The MHEG-5 can make it possible to interchange and present information between heterogeneous networked environment. Also, it can provide real-time user interaction. MHEG-5 object generating is the essential requirements for the MHEG-5 applications, In this paper, we designed encoding/decoding class library for the MHEG-5 objects. We can use it for the interchange on the network. The designed class library can provide base technology for the MHEG-5 based distributed multimedia and hypermedia services on the networked environment.

• Journal of Korea Multimedia Society
• /
• v.22 no.5
• /
• pp.626-637
• /
• 2019

Due to the rapid development of computer and digital technologies, those technologies were used in advertising. In order to meet the needs of marketing, a virtual space or character using 3D graphic augmented reality technology was developed and applied to advertisement. This study analyzed the characteristics of augmented reality in terms of interface design and spatial expression of augmented reality through case study. Firstly, we wanted to find the relationship between the types of the augmented reality advertisement and interface effects. Secondly, we wanted to find the spatial expression methods. The sample survey case studies based on 42 articles from 2012 to 2018 using Chinese and Korean site sharing augmented reality advertisement. The results of the case studies were divided into two parts. Firstly, the relationship between augmented reality types and interface effects were found basing on the augmented reality index. It means that the augmented reality index can be illustrated by using the augmented reality type. Simultaneously, the augmented reality type can be illustrated using the interface effect. The second part was that the types of display were used as a spatial representation. And the results showed that mobile display and public place display were the most frequently used.

• Journal of Korea Multimedia Society
• /
• v.22 no.3
• /
• pp.335-348
• /
• 2019

Cell segmentation and counting represent one of the most important tasks required in order to provide an exhaustive understanding of biological images. Conventional features suffer the lack of spatial consistency by causing the joining of the cells and, thus, complicating the cell counting task. We propose, in this work, a cascade of networks that take as inputs different versions of the original image. After constructing a Gaussian pyramid representation of the microscopy data, the inputs of different size and spatial resolution are given to a cascade of deep convolutional autoencoders whose task is to reconstruct the segmentation mask. The coarse masks obtained from the different networks are summed up in order to provide the final mask. The principal and main contribution of this work is to propose a novel method for the cell counting. Unlike the majority of the methods that use the obtained segmentation mask as the prior information for counting, we propose to utilize the hidden latent representations, often called the high-level features, as the inputs of a neural network based regressor. While the segmentation part of our method performs as good as the conventional deep learning methods, the proposed cell counting approach outperforms the state-of-the-art methods.