• Title/Summary/Keyword: Map texture

Search Result 208, Processing Time 0.028 seconds

An Algorithm of MIP-Map Level Selection for Ray-Traced Texture Mapping (광선 추적법 텍스쳐 매핑을 위한 MIP-Map 수준 선택 알고리즘 연구)

  • Park, Woo-Chan;Kim, Dong-Seok
    • Journal of Korea Game Society
    • /
    • v.10 no.4
    • /
    • pp.73-80
    • /
    • 2010
  • This paper proposes an effective method to select MIP-Map level of texture images for ray-traced texture mapping. This MIP-Map level selection method requires only the total length of intersected ray. By supporting MIP-Map for texture mapping, we can reduce the texture aliasing effects, while our approach decreases rendering performance very slightly.

Polygonal Model Simplification Method for Game Character (게임 캐릭터를 위한 폴리곤 모델 단순화 방법)

  • Lee, Chang-Hoon;Cho, Seong-Eon;Kim, Tai-Hoon
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.1
    • /
    • pp.142-150
    • /
    • 2009
  • It is very important to generate a simplified model from a complex 3D character in computer game. We propose a new method of extracting feature lines from a 3D game character. Given an unstructured 3D character model containing texture information, we use model feature map (MFM), which is a 2D map that abstracts the variation of texture and curvature in the 3D character model. The MFM is created from both a texture map and a curvature map, which are produced separately by edge-detection to locate line features. The MFM can be edited interactively using standard image-processing tools. We demonstrate the technique on several data sets, including, but not limited to facial character.

  • PDF

An Image Synthesis Technique Based on the Pyramidal Structure and MAP Estimation Technique (계층적 Pyramid구조와 MAP 추정 기법을 이용한 Texture 영상 합성 기법)

  • 정석윤;이상욱
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.8
    • /
    • pp.1238-1246
    • /
    • 1989
  • In this paper, a texture synthesis technique based on the NCAR(non-causal auto-regressive) model and the pyramid structure is proposed. In order to estimate the NCAR model parameters accurately from a noisy texture, the MAP(maximum a posteriori) estimation technique is also employed. In our approach, since the input texture is decomposed into the Laplacian oyramid planes first and then the NCAR model is applied to each plane, we are able to obtain a good synthesized texture even if the texture exhibits some non-random local structure or non-homogenity. The usrfulness of the proposed method is demonstrated with seveal real textures in the Brodatz album. Finally, the 2-dimensional MAP estimation technique can be used to the image restoration for noisy images as well as a texture image synthesis.

  • PDF

3D Mesh Simplification from Range Image Considering Texture Mapping (Texture Mapping을 고려한 Rang Image의 3차원 형상 간략화)

  • Kong, Changhwan;Kim, Changhun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.3 no.1
    • /
    • pp.23-28
    • /
    • 1997
  • We reconstruct 3D surface from range image that consists of range map and texture map, and simplify the reconstructed triangular mesh. In this paper, we introduce fast simplification method that is able to glue texture to 3D surface model and adapt to real-time multipled level-of detail. We will verify the efficiency by applying to the scanned data of Korean relics.

  • PDF

Fast Intra Mode Decision Algorithm for Depth Map Coding using Texture Information in 3D-AVC (3D-AVC에서 색상 영상 정보를 이용한 깊이 영상의 빠른 화면 내 예측 모드 결정 기법)

  • Kang, Jinmi;Chung, Kidong
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.2
    • /
    • pp.149-157
    • /
    • 2015
  • The 3D-AVC standard aims at improving coding efficiency by applying new techniques for utilizing intra, inter and view predictions. 3D video scenes are rendered with existing texture video and additional depth map. The depth map comes at the expense of increased computational complexity of the encoding process. For real-time applications, reducing the complexity of 3D-AVC is very important. In this paper, we present a fast intra mode decision algorithm to reduce the complexity burden in the 3D video system. The proposed algorithm uses similarity between texture video and depth map. The best intra prediction mode of the depth map is similar to that of the corresponding texture video. The early decision algorithm can be made on the intra prediction of depth map coding by using the coded intra mode of texture video. Adaptive threshold for early termination is also proposed. Experimental results show that the proposed algorithm saves the encoding time on average 29.7% without any significant loss in terms of the bit rate or PSNR value.

Voxel-wise UV parameterization and view-dependent texture synthesis for immersive rendering of truncated signed distance field scene model

  • Kim, Soowoong;Kang, Jungwon
    • ETRI Journal
    • /
    • v.44 no.1
    • /
    • pp.51-61
    • /
    • 2022
  • In this paper, we introduced a novel voxel-wise UV parameterization and view-dependent texture synthesis for the immersive rendering of a truncated signed distance field (TSDF) scene model. The proposed UV parameterization delegates a precomputed UV map to each voxel using the UV map lookup table and consequently, enabling efficient and high-quality texture mapping without a complex process. By leveraging the convenient UV parameterization, our view-dependent texture synthesis method extracts a set of local texture maps for each voxel from the multiview color images and separates them into a single view-independent diffuse map and a set of weight coefficients for an orthogonal specular map basis. Furthermore, the view-dependent specular maps for an arbitrary view are estimated by combining the specular weights of each source view using the location of the arbitrary and source viewpoints to generate the view-dependent textures for arbitrary views. The experimental results demonstrate that the proposed method effectively synthesizes texture for an arbitrary view, thereby enabling the visualization of view-dependent effects, such as specularity and mirror reflection.

Texture Segmentation Using Statistical Characteristics of SOM and Multiscale Bayesian Image Segmentation Technique (SOM의 통계적 특성과 다중 스케일 Bayesian 영상 분할 기법을 이용한 텍스쳐 분할)

  • Kim Tae-Hyung;Eom Il-Kyu;Kim Yoo-Shin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.43-54
    • /
    • 2005
  • This paper proposes a novel texture segmentation method using Bayesian image segmentation method and SOM(Self Organization feature Map). Multi-scale wavelet coefficients are used as the input of SOM, and likelihood and a posterior probability for observations are obtained from trained SOMs. Texture segmentation is performed by a posterior probability from trained SOMs and MAP(Maximum A Posterior) classification. And the result of texture segmentation is improved by context information. This proposed segmentation method shows better performance than segmentation method by HMT(Hidden Markov Tree) model. The texture segmentation results by SOM and multi-sclae Bayesian image segmentation technique called HMTseg also show better performance than by HMT and HMTseg.

Application of Library-Based Texture Mapping Method (라이브러리 기반의 Texture Mapping 기법 활용연구)

  • Song Jeong-Heon;Park Su-Yong;Lim Hyo-Suk;Kim Yong-Il
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2006.04a
    • /
    • pp.369-373
    • /
    • 2006
  • A 3D modeling of urban area can be composed the terrain modeling that can express specific and shape of the terrain and the object modeling such as buildings, trees and facilities which are found in urban areas. Especially in a 3D modeling of building, it is very important to make a unit model by simplifying 3D structure and to take a texture mapping, which can help visualize surface information. In this study, the texture mapping technique, based on library for 3D urban modeling, was used for building modeling. This technique applies the texture map in the form of library which is constructed as building types, and then take mapping to the 3D building frame. For effectively apply, this technique, we classified buildings automatically using LiDAR data and made 3D frame using LiDAR and digital map. To express the realistic building texture, we made the texture library using real building photograph.

  • PDF

Texture superpixels merging by color-texture histograms for color image segmentation

  • Sima, Haifeng;Guo, Ping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2400-2419
    • /
    • 2014
  • Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

Bayesian Texture Segmentation Using Multi-layer Perceptron and Markov Random Field Model (다층 퍼셉트론과 마코프 랜덤 필드 모델을 이용한 베이지안 결 분할)

  • Kim, Tae-Hyung;Eom, Il-Kyu;Kim, Yoo-Shin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.1
    • /
    • pp.40-48
    • /
    • 2007
  • This paper presents a novel texture segmentation method using multilayer perceptron (MLP) networks and Markov random fields in multiscale Bayesian framework. Multiscale wavelet coefficients are used as input for the neural networks. The output of the neural network is modeled as a posterior probability. Texture classification at each scale is performed by the posterior probabilities from MLP networks and MAP (maximum a posterior) classification. Then, in order to obtain the more improved segmentation result at the finest scale, our proposed method fuses the multiscale MAP classifications sequentially from coarse to fine scales. This process is done by computing the MAP classification given the classification at one scale and a priori knowledge regarding contextual information which is extracted from the adjacent coarser scale classification. In this fusion process, the MRF (Markov random field) prior distribution and Gibbs sampler are used, where the MRF model serves as the smoothness constraint and the Gibbs sampler acts as the MAP classifier. The proposed segmentation method shows better performance than texture segmentation using the HMT (Hidden Markov trees) model and HMTseg.