• ETRI Journal
• /
• v.34 no.5
• /
• pp.791-794
• /
• 2012

We propose an efficient framework to realistically render 3D faces with a reduced set of points. First, a robust active appearance model is presented to detect facial features in the projected faces under different illumination conditions. Then, an adaptive simplification of 3D faces is proposed to reduce the number of points, yet preserve the detected facial features. Finally, the point model is rendered directly, without such additional processing as parameterization of skin texture. This fully automatic framework is very effective in rendering massive facial data on mobile devices.

• Culinary science and hospitality research
• /
• v.13 no.3
• /
• pp.1-11
• /
• 2007

This study aims at inquiring into new generations' recognition of traditional foods to present the alternatives and suggestions of simplification, popularization and processed food for popularizing the foods suited to them. The findings on survey showed that they had a preference for development of simple food-oriented menu suited to new generation's way of thinking, under the maintenance of flavor and nutrition so that they can simply eat traditional foods through the simplification of cooking and the development of processed food. The result of this study showed significant influences that the first result is the knowledge on the cooking method in simplification, the second result is the knowledge on the flavor and nutrition in popularization of traditional food, and the third is the knowledge on the cooking method, the flavor and nutrition in the processed food.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.435-440
• /
• 2009

The scalable vector graphics (SVG) standard has allowed the complex bitmap images to be represented by vector based graphics and provided some advantages over the raster based graphics in applications, for example, where scalability is required. This paper presents an algorithmto convert bitmap images into SVG format. The algorithm is an integration of pixel-level triangulation, data dependent triangulation, a new image mesh simplification algorithm, and a polygonization process. Both triangulation techniques enable the image quality (especially the edge features) to be preserved well in the reconstructed image and the simplification and polygonization procedures reduce the size of the SVG file. Experiments confirm the effectiveness of the proposed algorithm.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.32 no.2
• /
• pp.43-49
• /
• 1983

In this study, model simplification problem using singular perturbation technique is considered. The correctness and errors of simplified model which is obtained by the use of this technique, depends upon the order and the time scaling factor of the simplified model But, unfortunately, there is no explicit criteria for selections of these parameters. In this paper, error equations are derived and expanded by using the useful properties of $L_2$-norm. Then, new criteria for selecting the order of the simplified model and time scaling factor with respect to error bound are suggested. Since these criteria, newly proposed in this study, have strong concern about error bound, it can be used to choose the minimum order of the simplified model and time scaling factor with respect to given error bound. Conversely, if the order of the simplified model and time scaling factor are given, the error induced by the simplification can also be computed easily.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.69-76
• /
• 2003

Recently, in computer graphics, researches on 3D animations have been very active. one of the important research areas in 3D animation is animation of human being. The creation and animation of 3D facial models has depended on animators' manual work frame by frame. Thus, it needs many efforts and time as well as various hardwares and softwares. In this paper, we implements a way to generation 3D human face model easily and quickly just with the front face images. Then, we suggests a methodology for mesh data simplification of 3D generic model.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.474-477
• /
• 2000

This paper presents an algorithm for simplification of 3D triangular mesh data, based on mesh simplification. The proposed algorithm is first attempt to segment the entire mesh into several parts using the orientation of triangles. Then simplification algorithm is applied to each segment that has similar geometric property. The proposed two step multi-resolution modeling scheme would yield better performance then conventional algorithm like edge collapse technique, since the segmentation step can give global information on the input shape. The experimental results show that the proposed algorithm is performed efficiently.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.31 no.8
• /
• pp.33-38
• /
• 1982

This paper deals with the simplification of the transfer function in a frequency domain, viz. the integral of the squared errors between the original and the simplified model is minimized and the latter is estimated by the Walsh function. It tries to minimize the errors between the frequency responses of the two functions. This method is compared with the existing method by means of a numercal example. The frequency response of this simplified model approximates closely to that of the original model. The proposed method is simpler in analysis and easier in implementation than the existing methods. Though the Walsh function can be easily generated with the discrete values, it has errors because its zero crossings are not continuous. This method aims at the reduction of the errors in the real parts and the imaginary parts of the two functions by dividing into the more sub-intervals, and selecting the reduced-order model according to the response of the model. As a result, it can be applied for the simplification of higher order functions into lower order functions and for the design of control systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.432-443
• /
• 1997

This paper presents contour simplification method and a regional hierarchical segmentation algorithm based on PSNR for the transmission of image in mobile communication, of which available bandwidth is very limited. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, each segmented region has different quality. Thus, the region with low quality is selected by PSNR and improved by introducing regions corresponding to more local information. It is able to improve the subjective quality of image and reduce contour information. In addition, contour simplification method is proposed for the efficient lossless chain coding. The proposed method can be applied to the applications such as mobile communications and videotelephone through PSTN, of which the available transmission bandwidth is very limited.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.173-178
• /
• 2012

The quantity bill writing of organized electrical construction can be an effective to quality and process management in the construction. Therefore, in order to overcome confusion of the construction and doing an effective work, the clearly quantity bill writing is need. This paper is a focused to solve a problem of existing quantity bill as the difference in terms of work section and item information, regulatory information of ordering authority. Therefore, a terms of work section and item information, regulatory information of ordering authority has been normalized. Moreover, basic data of simplification for quantity bill writing and structure has been guaranteed.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.445-448
• /
• 2003

This paper presents a novel iris recognition method using wavelet transform and curve simplification. One-dimensional signals, which are calculated over circles on the iris, are decomposed into a multiple frequency bands. Each decomposed signal is approximated by a piecewise linear curve connecting node points. The curve is simplified by progressively removing unimportant node points while keeping the shape of the curve. Finally, a small number of node points represent features of each signal. Experiment results show that the presented method results in good performance in various noise environments.