• Title/Summary/Keyword: Rendering Map

Search Result 147, Processing Time 0.021 seconds

Hybrid Down-Sampling Method of Depth Map Based on Moving Objects (움직임 객체 기반의 하이브리드 깊이 맵 다운샘플링 기법)

  • Kim, Tae-Woo;Kim, Jung Hun;Park, Myung Woo;Shin, Jitae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.918-926
    • /
    • 2012
  • In 3D video transmission, a depth map being used for depth image based rendering (DIBR) is generally compressed by reducing resolution for coding efficiency. Errors in resolution reduction are recovered by an appropriate up-sampling method after decoding. However, most previous works only focus on up-sampling techniques to reduce errors. In this paper, we propose a novel down-sampling technique of depth map that applies different down-sampling rates on moving objects and background in order to enhance human perceptual quality. Experimental results demonstrate that the proposed scheme provides both higher visual quality and peak signal-to-noise ratio (PSNR). Also, our method is compatible with other up-sampling techniques.

Research of Searching Algorithm for Cutting Region using Quadtree (Quadtree를 이용한 절삭 영역 탐색 기법에 관한 연구)

  • 김용현;고성림;이상규
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.873-876
    • /
    • 2003
  • Z-map model is the most widely used model for NC simulation and verification. But it has several limitations to get a high precision, to apply 5 axis machining simulation. In this paper, we tried to use quadtree for searching cutting region. Quadtree representation of two dimensional objects is performed with a tree that describes the recursive subdivision. By using these quadtree model. storage requirements were reduced. And also, recursive subdivision was processed in the boundries, so, useless computation could be reduced, too. To get more high Accuracy, we applied the supersampling method in the boundaries. The Supersampling method is the most common form of the antialiasing and usually used with polygon mesh rendering in computer graphics To verify quadtree model we compared simulated results with z-map model and enhanced z-map model

  • PDF

Fast NC Cutting Verification Using Graphic Hardware (그래픽 하드웨어를 이용한 NC 가공 검증의 고속화)

  • 김경범;이상헌;우윤환
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.616-619
    • /
    • 2002
  • The z-map structure is widely used for NC tool path verification as it is very simple and fast in calculation of Boolean operations. However, if the number of the x-y grid points in a z-map is increased to enhance its accuracy, the computation time for NC verification increases rapidly. To reduce this computation time, we proposed a NC verification method using 3-D graphic acceleration hardwares. In this method, the z-map of the resultant workpiece machined by a NC program is obtained by rendering tool swept volumes along tool pathos and reading the depth buffer of the graphic card. The experimental results show that this hardware-based method is faster than the conventional software-based method.

  • PDF

Implementation of Tile Searching and Indexing Management Algorithms for Mobile GIS Performance Enhancement

  • Lee, Kang-Won;Choi, Jin-Young
    • Journal of Internet of Things and Convergence
    • /
    • v.1 no.1
    • /
    • pp.11-19
    • /
    • 2015
  • The mobile and ubiquitous environment is experiencing a rapid development of information and communications technology as it provides an ever increasing flow of information. Particularly, GIS is now widely applied in daily life due to its high accuracy and functionality. GIS information is utilized through the tiling method, which divides and manages large-scale map information. The tiling method manages map information and additional information to allow overlay, so as to facilitate quick access to tiled data. Unlike past studies, this paper proposes a new architecture and algorithms for tile searching and indexing management to optimize map information and additional information for GIS mobile applications. Since this involves the processing of large-scale information and continuous information changes, information is clustered for rapid processing. In addition, data size is minimized to overcome the constrained performance associated with mobile devices. Our system has been implemented in actual services, leading to a twofold increase in performance in terms of processing speed and mobile bandwidth.

GPU-only Terrain Rendering for Walk-through (Walk-through를 지원하는 GPU 기반 지형렌더링)

  • Park, Sun-Yong;Oh, Kyoung-Su;Cho, Sung-Hyun
    • Journal of Korea Game Society
    • /
    • v.7 no.4
    • /
    • pp.71-80
    • /
    • 2007
  • In this paper, we introduce an efficient GPU-based real-time rendering technique applicable to every kind of game. Our method, without an extra geometry, can represent terrain just with a height map. It makes it possible to freely go around in the air or on the surface, so we can directly apply it to any computer games as well as a virtual reality. Since our method is not based on any geometrical structure, it doesn't need special LOD policy and the precision of geometrical representation and visual quality absolutely depend on the resolution of height map and color map. Moreover, GPU-only technique allows the general CPU to be dedicated to more general work, and as a result, enhances the overall performance of the computer. To date, there have been many researches related to the terrain representation, but most of them rely on CPU or confmed its applications to flight simulation, Improving existing displacement mapping techniques and applying it to our terrain rendering, we completely ruled out the problems, such as cracking, poping etc, which cause in polygon-based techniques, The most important contributions are to efficiently deal with arbitrary LOS(Line Of Sight) and dramatically improve visual quality during walk-through by reconstructing a height field with curved patches. We suggest a simple and useful method for calculating ray-patch intersections. We implemented all these on GPU 100%, and got tens to hundreds of framerates with height maps a variety of resolutions$(256{\times}256\;to\;4096{\times}4096)$.

  • PDF

Video Similarity Generating Algorithm Improving the Speed of Various Multi-Angle Image Composition (다각도 영상 합성의 속도 향상을 위한 영상유사도 생성 알고리즘)

  • Kim, Jun-sik;Jeong, Gwangil;Hwang, Yongwan;Park, Pilkyu;Park, Seonghwan;Kim, Kyuheon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2016.06a
    • /
    • pp.340-343
    • /
    • 2016
  • 현재 사용 되어지고 있는 대부분의 영상 합성 알고리즘들은 영상의 크기가 클수록 계산량이 많아지는 특징이 있다. 따라서 UHD 영상을 대상으로 영상 합성을 할 때 속도가 기존의 HD 영상에 비해 크게 느리다는 점과 특수 카메라 사용 혹은 카메라 위치 고정 등의 제한이 필요하다는 점의 단점들이 있다. 이에 본 논문에서는 스마트폰에서 콘텐츠를 촬영한 영상들을 이용하여 영상 분류, Map 생성, Rendering 의 과정을 통해 현재 사용 되어지고 있는 영상 합성 알고리즘과 비교하여 보다 빠르게 영상 합성을 할 수 있는 알고리즘을 제안한다. 촬영 시 EXIF 에 저장되는 GPS 정보를 이용하여 그룹화를 진행한 후 영상의 특징점 매칭을 통해 Map 을 생성하는 것이 본 논문에서 제안하는 알고리즘이다. 이를 위해 본 논문에서는 FAST 특징점 알고리즘과 FREAK 기술자 알고리즘을 사용하였으며 Rendering 을 통하여 해당 알고리즘을 검증 하였다.

  • PDF

Peach & Pit Volume Measurement and 3D Visualization using Magnetic Resonance Imaging Data (자기공명영상을 이용한 복숭아 및 씨의 부피 측정과 3차원 가시화)

  • 김철수
    • Journal of Biosystems Engineering
    • /
    • v.27 no.3
    • /
    • pp.227-234
    • /
    • 2002
  • This study was conducted to nondestructively estimate the volumetric information of peach and pit and to visualize the 3D information of internal structure from magnetic resonance imaging(MRI) data. Bruker Biospec 7T spectrometer operating at a proton reosonant frequency of 300 MHz was used for acquisition of MRI data of peach. Image processing algorithms and visualization techniques were implemented by using MATLAB (Mathworks) and Visualization Toolkit(Kitware), respectively. Thresholding algorithm and Kohonen's self organizing map(SOM) were applied to MRI data fur region segmentation. Volumetric information were estimated from segemented images and compared to the actual measurements. The average prediction errors of peach and pit volumes were 4.5%, 26.1%, respectively for the thresholding algorithm. and were 2.1%, 19.9%. respectively for the SOM. Although we couldn't get the statistically meaningful results with the limited number of samples, the average prediction errors were lower when the region segmentation was done by SOM rather than thresholding. The 3D visualization techniques such as isosurface construction and volume rendering were successfully implemented, by which we could nondestructively obtain the useful information of internal structures of peach.

View Synthesis Using OpenGL for Multi-viewpoint 3D TV (다시점 3차원 방송을 위한 OpenGL을 이용하는 중간영상 생성)

  • Lee, Hyun-Jung;Hur, Nam-Ho;Seo, Yong-Duek
    • Journal of Broadcast Engineering
    • /
    • v.11 no.4 s.33
    • /
    • pp.507-520
    • /
    • 2006
  • In this paper, we propose an application of OpenGL functions for novel view synthesis from multi-view images and depth maps. While image based rendering has been meant to generate synthetic images by processing the camera view with a graphic engine, little has been known about how to apply the given images and depth information to the graphic engine and render the scene. This paper presents an efficient way of constructing a 3D space with camera parameters, reconstructing the 3D scene with color and depth images, and synthesizing virtual views in real-time as well as their depth images.

Auto-Covariance Analysis for Depth Map Coding

  • Liu, Lei;Zhao, Yao;Lin, Chunyu;Bai, Huihui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3146-3158
    • /
    • 2014
  • Efficient depth map coding is very crucial to the multi-view plus depth (MVD) format of 3-D video representation, as the quality of the synthesized virtual views highly depends on the accuracy of the depth map. Depth map contains smooth area within an object but distinct boundary, and these boundary areas affect the visual quality of synthesized views significantly. In this paper, we characterize the depth map by an auto-covariance analysis to show the locally anisotropic features of depth map. According to the characterization analysis, we propose an efficient depth map coding scheme, in which the directional discrete cosine transforms (DDCT) is adopted to substitute the conventional 2-D DCT to preserve the boundary information and thereby increase the quality of synthesized view. Experimental results show that the proposed scheme achieves better performance than that of conventional DCT with respect to the bitrate savings and rendering quality.

Group-based Adaptive Rendering for 6DoF Immersive Video Streaming (6DoF 몰입형 비디오 스트리밍을 위한 그룹 분할 기반 적응적 렌더링 기법)

  • Lee, Soonbin;Jeong, Jong-Beom;Ryu, Eun-Seok
    • Journal of Broadcast Engineering
    • /
    • v.27 no.2
    • /
    • pp.216-227
    • /
    • 2022
  • The MPEG-I (Immersive) group is working on a standardization project for immersive video that provides 6 degrees of freedom (6DoF). The MPEG Immersion Video (MIV) standard technology is intended to provide limited 6DoF based on depth map-based image rendering (DIBR) technique. Many efficient coding methods have been suggested for MIV, but efficient transmission strategies have received little attention in MPEG-I. This paper proposes group-based adaptive rendering method for immersive video streaming. Each group can be transmitted independently using group-based encoding, enabling adaptive transmission depending on the user's viewport. In the rendering process, the proposed method derives weights of group for view synthesis and allocate high quality bitstream according to a given viewport. The proposed method is implemented through the Test Model for Immersive Video (TMIV) test model. The proposed method demonstrates 17.0% Bjontegaard-delta rate (BD-rate) savings on the peak signalto-noise ratio (PSNR) and 14.6% on the Immersive Video PSNR(IV-PSNR) in terms of various end-to-end evaluation metrics in the experiment.