• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.544-547
• /
• 1999

This paper proposes a high-speed texture mapping algorithm and apply it for the realtime face animation. The mapping process devide into pixel correspondences, Z-buffering, and pixel value interpolation. Pixel correspondences and Z-buffering are calculated exactly through the algorithm. However, pixel values interpolation is approximated without additional calculations. The algorithm dramatically reduces the operations needed for texture mapping. Only three additions are needed in calculation of a pixel value. We simulate the 256$\times$240 pixel facial image with about 100 pixel face width. Simulation results shows that frame generation speed are about 60, 44, 21 frames/second in pentium PC 550MHz, 400MHz, 200MHz, respectively,

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.3
• /
• pp.208-214
• /
• 2021

Recently, much of the intelligent security scenario and criminal investigation demands for matching photo and non-photo. Existing face recognition system can not sufficiently guarantee these needs. In this paper, we propose an algorithm to improve the performance of heterogeneous face recognition systems by reducing the different modality between sketches and photos of the same person. The proposed algorithm extracts each image's texture features through texture descriptors (gray level co-occurrence matrix, multiscale local binary pattern), and based on this, generates a transformation matrix through eigenfeature regularization and extraction techniques. The score value calculated between the vectors generated in this way finally recognizes the identity of the sketch image through the score normalization methods.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.339-349
• /
• 2008

We present a novel method to estimate the light source direction and relight a face texture image of a single 3D model under arbitrary unknown illumination conditions. We create a virtual irradiance sphere to detect the light source direction from a given illuminated texture image using both normal vector mapping and weighted bilinear interpolation. We then induce a relighting equation with estimated ambient and diffuse coefficients. We provide the result of a series of experiments on light source estimation, relighting and face recognition to show the efficiency and accuracy of the proposed method in restoring the shading and shadows areas of a face texture image. Our approach for face relighting can be used for not only illuminant invariant face recognition applications but also reducing visual load and Improving visual performance in tasks using 3D displays.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.542-548
• /
• 2006

In this paper, we propose a face region detection/verification method using wavelet packet analysis and structural statistic for frontal human color image. The method extracts skin color lesions from input images, first. and then applies spatial restrictive conditions to the region, and determines whether the region is face candidate region or not. In second step, we find eye region in the face candidate region using structural statistic for standard korean faces. And in last step, the face region is verified via wavelet packet analysis if the face torture were satisfied to normal texture conditions.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.212-227
• /
• 2008

Since 3D face can be rotated freely in 3D space and illumination effects can be modeled properly, 3D face modeling Is more precise and realistic in face pose, illumination, and expression than 2D face modeling. Thus, 3D modeling is necessitated much in face recognition, game, avatar, and etc. In this paper, we propose a 3D face modeling method based on 3D morphable shape modeling. The proposed 3D modeling method first constructs a 3D morphable shape model out of 3D face scan data obtained using a 3D scanner Next, the proposed method extracts and matches feature points of the face from 2D image sequence containing a face to be modeled, and then estimates 3D vertex coordinates of the feature points using a factorization based SfM technique. Then, the proposed method obtains a 3D shape model of the face to be modeled by fitting the 3D vertices to the constructed 3D morphable shape model. Also, the proposed method makes a cylindrical texture map using 2D face image sequence. Finally, the proposed method builds a 3D face model by rendering the 3D face shape model with the cylindrical texture map. Through building processes of 3D face model by the proposed method, it is shown that the proposed method is relatively easy, fast and precise than the previous 3D face model methods.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1995.10a
• /
• pp.68-75
• /
• 1995

The milling process is one of the most important metal removal processes in industry. Due to the complexities inherent to the cutter insert geometry and the milling cutter kinematics, these processes leave an analytically difficult to predict texture on the machined surface's hills and valleys. The instantaneous uncut chip cross sectional area may be estimated by the relative position between the workpiece and the cutter inserts. furthermore, since the cutting forces are proportional to the instantaneous uncut chip cross sectional area, the cutting forces in face milling operations can not be estimated easily. A new simulation program which is based upon the numerical method has been proposed to estimate the cutting force components, with the ability to predict the machined surface texture left by the face milling operation.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.4 no.4
• /
• pp.16-24
• /
• 1995

The milling process is one of the most important metal removal processes in industry. due to the complexities inherent to the cutter insert geometry and the milling cutter kinematics, these processes leave an analytically difficult to predict texture on the machined surface's hills and valleys. The instantaneous uncut chip cross sectional area may be estimated by the relative position between the workpiece and the cutter inserts. Furthermore, since the cutting forces are proportional to the instantaneous uncut chip cross sectional area, the cutting forces in face milling operations can not be estimated easily. A new simulation program which is based upon the numerical method has been proposed to estimate the cutting force components, with the ability to predict the machined surface texture left by the face milling.

• Journal of KIISE:Software and Applications
• /
• v.32 no.1
• /
• pp.22-33
• /
• 2005

In this paper. we propose an image registration algorithm based on variable-sized blocks of ellipsoidal prototype model which is similar in shape to human face. While matching blocks, the existing cylindrical prototype model which only takes into account left and right curvature can accomplish a correct alignment on left and right images. But, registration errors are produced from up and down images because the cylindrical prototype model not reflects characteristics of head shape and jaw structure of human. The proposed method is a block matching algorithm which uses variable-sized blocks with considering left-right and up-down curvature of ellipsoidal face model and can correctly align images by using the correlation between them. We then adapt image mosaic technique to generate a face texture from aligned images. For this purpose, we stitch them with assigning linear weights according to the overlapped region and remove ghost effects to make more realistic facial texture.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.709-716
• /
• 2000

We present an efficient algorithm using region-based average of variations of local correlation coefficients (LCC) for the extraction of texture regions. The key idea of this algorithm for the classification of texture and shade regions is to utilize the fact that the averages of the variations of LCCs according to different orientations texture regions are clearly larger than those in shade regions. In order to evaluate the performance of the proposed algorithm, we use nine test images (Lena, Bsail, Camera Man, Face, Woman, Elaine, Jet, Tree, and Tank) of 8-bit 256$\times$256 pixels. Experimental results show that the proposed feature extracts well the regions which appear visually as texture regions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.871-876
• /
• 2006

In this thesis, to accurately measure 3D face information using the spatial encoding patterns, the new algorithm to segment the pattern images from initial face pattern image is proposed. If the obtained images is non-homogeneous texture and ambiguous boundary pattern, the pattern segmentation is very difficult. Furthermore. the non-encoded areas by accumulated error are occurred. In this thesis, the FCM(fuzzy c-means) clustering method is proposed to enhance the robust encoding and segmentation rate under non-homogeneous texture and ambiguous boundary pattern. The initial parameters for experiment such as clustering class number, maximum repetition number, and error tolerance are set with 2, 100, 0.0001 respectively. The proposed pattern segmentation method increased 8-20% segmentation rate with conventional binary segmentation methods.