• Journal of the Korea Computer Graphics Society
• /
• v.18 no.4
• /
• pp.1-8
• /
• 2012

We present improved deformation energy to enhance the visual quality of a shape deformation technique, where we preserve the local structure of an input planar shape. The deformation energy, in general, consists of several constraints such as Laplacian coordinate constraint to preserve the quality of deformed silhouette edges, mean value coordinates and edge length constraints to preserve the quality of deformed internal shape, and user-specified position constraints to control the shape deformation. When the positions of user-specified vertices change, shape deformation techniques compute the positions of the other vertices by means of nonlinear least squares optimization to minimize the deformation energy. When a user-specified vertex changes its position rapidly, it is frequently observed that the visual quality of the deformed shape decrease rapidly, which is mainly caused by unnecessary enlargement of the Laplacian vectors and unnecessary change of the edge directions along the boundary of the shape. In this paper, we propose improved deformation energy by prohibiting the Laplacian and edge length constraints from changing unnecessarily. The proposed deformation energy incorporated with well-known optimization technique can enhance the visual quality of shape deformation along the silhouette and within the interior of the planar shape while sacrificing only a little execution time.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.11
• /
• pp.134-143
• /
• 2007

A new approach based on mean value coordinate combined with Laplacian coordinate is proposed for shape deformation of a large polygon model composed of triangular net. In the method, the spherical mean value coordinates for closed control meshes is introduced to describe a vertex in the triangle meshes to be deformed. Furthermore, the well known quardratic least square method for the Laplacian coordinates is employed in order to deform the control meshes. Because the mean value coordinates are continuous and smooth on the interior of control meshes, deforming operation of control meshes change the shape of polygon model while preserving the intrinsic surface detail. The effectiveness and validity of this novel approach was demonstrated by using it to deform large and complex polygon models with arbitrary topologies.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.1
• /
• pp.160-170
• /
• 2008

Shape morphing is the process of transforming a source shape, through intermediate shapes, into a target shape. Two main problems to be considered in three dimensional shape morphing are vertex correspondence and path interpolation. In this paper, an approach which uses the linear interpolation of the Laplacian coordinates of the source and target meshes is introduced for the determination of more plausible path when two topologically identical shapes are morphed. When two shapes to be morphed are different in shape and topology, a new method which combines shape deformation theory based on Laplacian coordinate and mean value coordinate with distance field theory is proposed for the efficient treatment of vertex correspondence and path interpolation problems. The validity and effectiveness of the suggested method was demonstrated by using it to morph large and complex polygon models including male and female whole body models.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.292-298
• /
• 2022

There is a limit to improving the image quality through global processing of images taken under backlighting because too bright and dark parts are mixed in one scene. This paper introduces a method to improve the quality of a photo by making two virtual images that improve the dark and bright areas of a backlit photo, and fusing them with the original image into a Laplacian pyramid. The proposed method reduces the computational burden by using histogram stretching and gamma transformation that can be simplified with LUT when creating the two virtual images. In addition, in order to obtain a color-enhanced image, contrast conversion was performed only on the luminance using the HSV coordinate system. The proposed technique showed its effectiveness by calculating several NIQA indicators using standard image data sets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.935-943
• /
• 1993

In this paper, robust recognition system for tilted facial image was developed. At first, standard facial image and lilted facial image are captured by CCTV camera and then transformed into binary image. The binary image is processed in order to obtain contour image by Laplacian edge operator. We trace and delete outermost edge line and use inner contour lines. We label four inner contour lines in order among the inner lines, and then we extract left and right eye with known distance relationship and with two eyes coordinates, and calculate slope information. At last, we rotate the tilted image in accordance with slope information and then calculate the ten distance features between element and element. In order to make the system invariant to image scale, we normalize these features with distance between left and righ eye. Experimental results show 88% recognition rate for twenty five face images when tilted degree is considered and 60% recognition rate when tilted degree is not considered.

• Journal of the Korea Computer Graphics Society
• /
• v.27 no.1
• /
• pp.1-8
• /
• 2021

This paper proposes a simple deformation method for editing the trajectory of a walking motion with preserving its style. To this end, our method analyzes the trajectory of the root joint into the graph and deforms it by applying the graph Laplace operator. The trajectory of the root joint is presented as a graph with a vertex defined the position and direction at each time frame on the motion dataThe graph transforms the trajectory into the differential coordinate, and if the constraints are set on the trajectory vertex, the solver iterative approaches to the solution. By modifying the root trajectory, we can continuously vary the walking motion, which reduces the cost of capturing a whole motion that is required. After computes the root trajectory, other joints are copied on the root and post-processed as a final motion. At the end of our paper, we show the application that the character continuously walks in a complex environment while satisfying user constraints.