• Title/Summary/Keyword: 영상 텍스처

Search Result 188, Processing Time 0.024 seconds

Texture Image Rearrangement for Texture Coordinate Coding of Three-dimensional Mesh Models (삼차원 메쉬 모델의 텍스처 좌표 부호화를 위한 텍스처 영상의 재배열 방법)

  • Kim, Sung-Yeol;Ho, Yo-Sung
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.963-966
    • /
    • 2005
  • Previous works related to texture coordinate coding of the three-dimensional(3-D) mesh models employed the same predictor as the geometry coder. However, discontinuities in the texture coordinates cause unreasonable prediction. Especially, discontinuities become more serious for the 3-D mesh model with a non-atlas texture image. In this paper, we propose a new coding scheme to remove discontinuities in the texture coordinates by reallocating texture segments according to a coding order. Experiment results show that the proposed coding scheme outperforms the MPEG-4 3DMC standard in terms of compression efficiency. The proposed scheme not only overcome the discontinuity problem by regenerating a texture image, but also improve coding efficiency of texture coordinate compression.

  • PDF

Obtaining the Surface Orientation of Texture Image using the Texture Spectrum and Mathematical Morphology (텍스처 스펙트럼을 이용한 텍스처 영상의 표면 방향 추출)

  • Kim, Do-Nyun;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.989-991
    • /
    • 1995
  • In this paper, we present a new morphological texture spectrum approach to obtain a surface orientation using the variation of texture image caused by projective distortions. Under the assumption that the surface of texture image is smooth continuous, and specially plane or sphere, we apply the mathematical morphology and texture spectrum in order to compute the 3-D surface orientation. If the surface of texture image is plane, the surface orientation can be obtained through a simple procedure. If the surface of texture image is sphere, we find the centroids of texels, and may compute several major axes, their slopes, and vanishing points. Using the texture spectrum between the intersections of the vanishing points and the size of elements in each texels, we can find the surface orientation of texels on the sphere.

  • PDF

A Depth-based Disocclusion Filling Method for Virtual Viewpoint Image Synthesis (가상 시점 영상 합성을 위한 깊이 기반 가려짐 영역 메움법)

  • Ahn, Il-Koo;Kim, Chang-Ick
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.6
    • /
    • pp.48-60
    • /
    • 2011
  • Nowadays, the 3D community is actively researching on 3D imaging and free-viewpoint video (FVV). The free-viewpoint rendering in multi-view video, virtually move through the scenes in order to create different viewpoints, has become a popular topic in 3D research that can lead to various applications. However, there are restrictions of cost-effectiveness and occupying large bandwidth in video transmission. An alternative to solve this problem is to generate virtual views using a single texture image and a corresponding depth image. A critical issue on generating virtual views is that the regions occluded by the foreground (FG) objects in the original views may become visible in the synthesized views. Filling this disocclusions (holes) in a visually plausible manner determines the quality of synthesis results. In this paper, a new approach for handling disocclusions using depth based inpainting algorithm in synthesized views is presented. Patch based non-parametric texture synthesis which shows excellent performance has two critical elements: determining where to fill first and determining what patch to be copied. In this work, a noise-robust filling priority using the structure tensor of Hessian matrix is proposed. Moreover, a patch matching algorithm excluding foreground region using depth map and considering epipolar line is proposed. Superiority of the proposed method over the existing methods is proved by comparing the experimental results.

Effective Gray-white Matter Segmentation Method based on Physical Contrast Enhancement in an MR Brain Images (MR 뇌 영상에서 물리기반 영상 개선 작업을 통한 효율적인 회백질 경계 검출 방법)

  • Eun, Sung-Jong;Whangbo, Taeg-Keun
    • Journal of Digital Contents Society
    • /
    • v.14 no.2
    • /
    • pp.275-282
    • /
    • 2013
  • In medical image processing field, object recognition is usually carried out by computerized processing of various input information such as brightness, shape, and pattern. If the information mentioned does not make sense, however, many limitations could occur with object recognition during computer processing. Therefore, this paper suggests effective object recognition method based on the magnetic resonance (MR) theory to resolve the basic limitations in computer processing. We propose the efficient method of robust gray-white matter segmentation by texture analysis through the Susceptibility Weighted Imaging (SWI) for contrast enhancement. As a result, an average area difference of 5.2%, which was higher than the accuracy of conventional region segmentation algorithm, was obtained.

Automatic Boundary Detection from 3D Cloud Points Using Color Image (칼라영상을 이용한 3차원 점군데이터 윤곽선 자동 검출)

  • Kim, Nam-Woon;Roh, Yi-Ju;Jeong, Hee-Seok;Jeong, Joong-Yeon;Jung, Kyeong-Hoon;Kang, Dong-Wook;Kim, Ki-Doo
    • Proceedings of the KIEE Conference
    • /
    • 2008.10b
    • /
    • pp.141-142
    • /
    • 2008
  • 본 논문은 텍스처된 3차원 점군데이터를 효율적으로 모델링하는 방법을 제안한다. 지상라이다로부터 획득한 3차원 점군데이터는 많은 노이즈를 가지고 있으며 이로 인해 자동적인 모델링이 어렵다. 3차원 모델링에 있어서 메쉬를 생성해야 3차원 랜더링이 가능하지만 3차원 메쉬 생성은 노이즈에 취약하기 때문에 디자이너들이 수작업으로 노이즈를 제거해야만 한다. 하지만 노이즈 자제가 지상 라이다로부터 들어온 데이터이기 때문에 자동적인 노이즈 제거가 어렵다. 본 논문에서는 텍스처된 지상 라이다 데이터로부터 칼라 영상의 정보를 이용한 윤곽선 정보 검출 방법을 제안한다. 대부분의 건물과 같은 구조물에서 최 외곽은 같은 색의 정보를 가지고 있다. 최 외곽 칼라의 정보를 이용하여 칼라 정보의 변화를 제한하고, 유사 칼라 정보를 가지고 있는 픽셀만 얻어냄으로써 최외각 정보를 얻어낸다. 칼라 이미지를 이용만 필터링 된 점군데이터는 xy, xz, yz 각각의 평면에서 윤곽선 데이터를 가지며 이는 구조물에 대한 모델링의 속도를 빠르게 해준다.

  • PDF

Generation Method of Depth Map based on Vanishing Line using Gabor Filter (Gabor Filter를 이용한 소실선 검출 기반의 깊이 지도 생성 기법)

  • Yoo, Tae-Hoon;Lee, Sang-Hun
    • Journal of the Korea Convergence Society
    • /
    • v.3 no.1
    • /
    • pp.13-17
    • /
    • 2012
  • In this paper, we propose method of generation of depth map using vanishing line and texture. vanishing line is generated by parallel lines in image. For generate vanishing line, show boundary of particular angle through Gabor Filter and extract line through Hough Transform. Initial Depth Map is estimated based on vanisihng line and combine Relative Depth map that generated using Texture Cue. The proposed algorithm advanced due to combine Initial Depth Map and Relative Depth Map.

Static Conformance Test of MPEG-4 Visual Decoders Using Test Bitstreams (시험 비트열을 이용한 MPEG-4 텍스처 디코딩의 정적 Conformance Test)

  • Kim, U-Sik;Park, In-Su;Park, Su-Hyeon;Lee, Byeong-Uk;Park, Rae-Hong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.1
    • /
    • pp.69-78
    • /
    • 2001
  • MPEG-4 visual conformance standard specifies methods to verify whether bitstreams and decoders meet the requirements at the specified profile and level. The test of decoders can be divided into two parts: the static test and the dynamic test. The static test can be performed by examining the decoder output with that of a reference decoder. This paper proposes design methods of test bitstreams for static test of texture decoding, and shows the test results.

  • PDF

Digital Watermarking Algorithm of Still Image Using Human Visual System Characteristics (인간시각체계 특성을 이용한 정지영상 디지털 워터마킹 알고리즘)

  • 지남현;전병민
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.2
    • /
    • pp.31-38
    • /
    • 2003
  • This paper proposes method to insert soong Watermark considering dull HVS properties to big change of Edge and Texture area. While conversion of existent Fourier form can acquire information for whole frequency ingredient of image, but Wavelet transform can look for Edge and Texture area locally. Therefore, use Wavelet transform to use HVS properites, and compare with Xia's Watermarking techniques to use Wavelet transform simply arid experimented these proposal algorithm. Experimented about fidelity and robusthness by attack method that is used in existing paper, and as a result, confirmed that proposal algorithm that use HVS properties is more superior than Xia's techniques.

  • PDF

Real-Time Stereoscopic Visualization of Very Large Volume Data on CAVE (CAVE상에서의 방대한 볼륨 데이타의 실시간 입체 영상 가시화)

  • 임무진;이중연;조민수;이상산;임인성
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.6
    • /
    • pp.679-691
    • /
    • 2002
  • Volume visualization is an important subarea of scientific visualization, and is concerned with techniques that are effectively used in generating meaningful and visual information from abstract and complex volume datasets, defined in three- or higher-dimensional space. It has been increasingly important in various fields including meteorology, medical science, and computational fluid dynamics, and so on. On the other hand, virtual reality is a research field focusing on various techniques that aid gaining experiences in virtual worlds with visual, auditory and tactile senses. In this paper, we have developed a visualization system for CAVE, an immersive 3D virtual environment system, which generates stereoscopic images from huge human volume datasets in real-time using an improved volume visualization technique. In order to complement the 3D texture-mapping based volume rendering methods, that easily slow down as data sizes increase, our system utilizes an image-based rendering technique to guarantee real-time performance. The system has been designed to offer a variety of user interface functionality for effective visualization. In this article, we present detailed description on our real-time stereoscopic visualization system, and show how the Visible Korean Human dataset is effectively visualized on CAVE.

Lightweight video coding using spatial correlation and symbol-level error-correction channel code (공간적 유사성과 심볼단위 오류정정 채널 코드를 이용한 경량화 비디오 부호화 방법)

  • Ko, Bong-Hyuck;Shim, Hiuk-Jae;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.13 no.2
    • /
    • pp.188-199
    • /
    • 2008
  • In conventional video coding, encoder complexity is much higher than that of decoder. However, investigations for lightweight encoder to eliminate motion prediction/compensation claiming most complexity in encoder have recently become an important issue. The Wyner-Ziv coding is one of the representative schemes for the problem and, in this scheme, since encoder generates only parity bits of a current frame without performing any type of processes extracting correlation information between frames, it has an extremely simple structure compared to conventional coding techniques. However, in Wyner-Ziv coding, channel decoding errors occur when noisy side information is used in channel decoding process. These channel decoding errors appear more frequently, especially, when there is not enough correlation between frames to generate accurate side information and, as a result, those errors look like Salt & Pepper type noise in the reconstructed frame. Since this noise severely deteriorates subjective video quality even though such noise rarely occurs, previously we proposed a computationally extremely light encoding method based on selective median filter that corrects such noise using spatial correlation of a frame. However, in the previous method, there is a problem that loss of texture from filtering may exceed gain from error correction by the filter for video sequences having complex torture. Therefore, in this paper, we propose an improved lightweight encoding method that minimizes loss of texture detail from filtering by allowing information of texture and that of noise in side information to be utilized by the selective median filter. Our experiments have verified average PSNR gain of up to 0.84dB compared to the previous method.