• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.456-463
• /
• 2003

This paper presents a texture mapping method of a 3D scanned model with 2D images from different views. The texture mapping process consists of two steps Registration of the 3D facet model to the images by interactive points matching, and 3D texture mapping of the image pieces to the corresponding facets. In this paper. some implem entation issues and illustrative examples are described.

• Journal of the Korean Society of Costume
• /
• v.58 no.10
• /
• pp.65-77
• /
• 2008

The purpose of this study is to analyze the correlation between the density, the Count and the width of cross section in 2D function through comparison the difference of simulated fabrics based on the various yarns, and to compare the 3D effect by Lay Mapping of diverse fabrics. The method of research is to weave the eight fabrics composed of cotton, linen, worsted, slender yarn, loop, $m{\acute{e}}lange$, woolen, and yarn twist with Hi-Tex program, and to practice 3D mapping with Hi-Print program. As a mapping object, the flared skirt which is a basic costume item is selected. As a result, the thickness of yarn in CAD system was fixed by the width of cross section rather than Count, especially by the width of core section not including the fluff section. The type of yarn such as cotton yarn, linen yarn, and worsted had effect on the shape of texture, but had few interrelations with dimension. In the case of 3D mapping, the textural characteristic and the dimension were presented precisely, whereas there were several limitations. First, the thickness of tissue has not been represented. Secondly, the effect of texture such as fuzzy look, loop was not expressed on the skirt outline including sideline and hemline. Thirdly, the difference of silhouette was not distinct. The common point in 2D and 3D operations is that the representation of texture is relatively accurate and that is difficult to measure and manifest of thickness, the side. For more professional digitalizing in fashion industry, above all in the domain of 3D, it must be supplement the subdivided and differentiated mapping process according to the texture, deviating from the existing analog-based organization which has to designate the form and silhouette suitable for tissue.

• 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,

• International Journal of Contents
• /
• v.12 no.2
• /
• pp.1-5
• /
• 2016

Extensible 3D (X3D) is the ISO standard for defining 3D interactive web- and broadcast-based 3D content integrated with multimedia. With the advent of this integration of interactive 3D graphics into the web, users can easily produce 3D scenes within web contents. Even though there are diverse texture nodes in X3D, projective textures are not provided. We enable X3D to provide SingularProjectiveTexture and MultiProjectiveTexture nodes by materializing independent nodes of projector nodes for a singular projector and multi-projector. Our approach takes the creation of an independent projective texture node instead of Kamburelis's method, which requires inconvenient and duplicated specifications of two nodes, ImageTexture and Texture Coordinate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5063-5073
• /
• 2016

In this paper, an efficient texture compression method is proposed for fast rendering, which exploits the spatial correlation among blocks through intra-picture block matching. Texture mapping is widely used to enhance the visual quality of results in real-time rendering applications. For fast texture mapping, it is necessary to identify an effective trade-off between compression efficiency and computational complexity. The conventional compression methods utilized for image processing (e.g., JPEG) provide high compression efficiency while resulting in high complexity. Thus, low complexity methods, such as ETC1, are often used in real-time rendering applications. Although these methods can achieve low complexity, the compression efficiency is still lower than that of JPEG. To solve this problem, we propose a texture compression method by reducing the spatial redundancy between blocks in order to achieve the better compression performance than ETC1 while maintaining complexity that is lower than that of JPEG. Experimental results show that the proposed method achieves better compression efficiency than ETC1, and the decoding time is significantly reduced compared to JPEG while similar to ETC1.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.45-57
• /
• 2009

ETexture mapping is a technique used for adding reality to an image in 3D graphics. However. this technique becomes the bottleneck of the 3D graphics pipeline because it requires large processing power and high memory bandwidth. For reducing memory latency in texture mapping, texture cache is used. As portable devices become smaller and they have power constraint, it is important to reduce the area and the power consumption of the texture cache. In this paper we propose using a small texture cache to reduce the area and the power consumption of the texture cache. Furthermore, we propose techniques to keep a performance comparable to large texture caches by using prefetch techniques and a victim cache. Simulation results show the proposed small texture cache can reduce the area and the power consumption up to 70% and 60%, respectively, by using $1{\sim}2K$ bytes texture cache compared to the conventional 16K bytes cache while keeping the performance.

• The KIPS Transactions:PartA
• /
• v.17A no.6
• /
• pp.281-288
• /
• 2010

In this paper, we describe the development of a system for generating a 3-dimensional human face using 3D scanned facial data and photo images, and morphing animation. The system comprises a facial feature input tool, a 3-dimensional texture mapping interface, and a 3-dimensional facial morphing interface. The facial feature input tool supports texture mapping and morphing animation - facial morphing areas between two facial models are defined by inputting facial feature points interactively. The texture mapping is done first by means of three photo images - a front and two side images - of a face model. The morphing interface allows for the generation of a morphing animation between corresponding areas of two facial models after texture mapping. This system allows users to interactively generate morphing animations between two facial models, without programming, using 3D scanned facial data and photo images.

• Journal of Korea Game Society
• /
• v.21 no.2
• /
• pp.79-88
• /
• 2021

Particle and noise are effectively used to implement unspecific VFX like an explosion, magic. Particle can create freely but, The more usage, the higher CPU/GPU usage. This paper using polygon mesh that is hard to change but consumes fixed resources to overcome the demerit of particle and reduce CPU/GPU usage. Also, using shader, apply noise texture that is suitable unspecific pattern to vertex and surface texture mapping of polygon mesh for implement VFX in unity. As a result of experiment, shader applied sphere polygon mesh show 2~4ms CPU, 1~2ms GPU usage in profiler. Also It has been shown that shader can be used to implement unspecific VFX.

• Journal of Digital Convergence
• /
• v.13 no.11
• /
• pp.331-336
• /
• 2015

The texture mapping used for the low-polygon models is one of the important workflows in the graphical representation of the 3D game. Only one hand painted texture is mapped on the surface of the 3D model and represents the color of the material and visual sense of touching by itself in that process. In the 3D game graphics, it is very important to visualize the textile sensation such as protruding and denting. It can be interpreted by the Gestalt Law to recognize a plane as a 3D sense of volume. Moreover, the concept of Affordance is necessary to recognize and perceive the textile sensation. It means visual recognizing of that relationship in the learning process. In this paper, The questionnaire survey targeting 3D game graphic designers is carried out. By analyzing the survey results, we suggest the important characteristic in the process of making hand painted texture.

• Journal of Korea Game Society
• /
• v.8 no.2
• /
• pp.57-68
• /
• 2008

Texture Mapping is a technique for adding realism to an image in 3D graphics Chip. Bilinear filtering mode of this technique needs accesses of 4 texels to process one pixel. In this paper we analyzed the access pattern of texture, and proposed the high performance texture cache which can access 4 texels simultaneously. We evaluated using simulation results of 3D game(Quake 3, Unreal Tournament 2004). Simulation results show that proposed texture cache has high performance on the case where physical size is less then or equal 8KBytes.