• Title/Summary/Keyword: Depth map

Search Result 813, Processing Time 0.026 seconds

Environment Map Based Disparity (환경맵 기반 디스페러티)

  • Ryoo Seung-Taek
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.1
    • /
    • pp.109-118
    • /
    • 2006
  • In this paper, we suggest the environment based disparity method that calculate the depth value of the objects from environment maps. This method using the disparity of the environment map can calculate the depth value from two environment map that acquire at different viewpoint. This method can decide the visibility of the object whether it is occluded others or not. Also, we can analogize the depth value of the object that does not relate the reference plane(in case of being in the air) and make three dimensional environment model using the proposed method

  • PDF

Depth-map Preprocessing Algorithm Using Two Step Boundary Detection for Boundary Noise Removal (경계 잡음 제거를 위한 2단계 경계 탐색 기반의 깊이지도 전처리 알고리즘)

  • Pak, Young-Gil;Kim, Jun-Ho;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.12
    • /
    • pp.555-564
    • /
    • 2014
  • The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.

High Resolution Depth-map Estimation in Real-time using Efficient Multi-threading (효율적인 멀티 쓰레딩을 이용한 고해상도 깊이지도의 실시간 획득)

  • Cho, Chil-Suk;Jun, Ji-In;Choo, Hyon-Gon;Park, Jong-Il
    • Journal of Broadcast Engineering
    • /
    • v.17 no.6
    • /
    • pp.945-953
    • /
    • 2012
  • A depth map can be obtained by projecting/capturing patterns of stripes using a projector-camera system and analyzing the geometric relationship between the projected patterns and the captured patterns. This is usually called structured light technique. In this paper, we propose a new multi-threading scheme for accelerating a conventional structured light technique. On CPUs and GPUs, multi-threading can be implemented by using OpenMP and CUDA, respectively. However, the problem is that their performance changes according to the computational conditions of partial processes of a structured light technique. In other words, OpenMP (using multiple CPUs) outperformed CUDA (using multiple GPUs) in partial processes such as pattern decoding and depth estimation. In contrast, CUDA outperformed OpenMP in partial processes such as rectification and pattern segmentation. Therefore, we carefully analyze the computational conditions where each outperforms the other and do use the better one in the related conditions. As a result, the proposed method can estimate a depth map in a speed of over 25 fps on $1280{\times}800$ images.

A Depth Creation Method Using Frequency Based Focus/Defocus Analysis In Image (영상에서 주파수 기반의 초점/비초점 분석을 이용한 깊이 지도 생성 기법)

  • Lee, Seung Kap;Park, Young Soo;Lee, Sang Hun
    • Journal of Digital Convergence
    • /
    • v.12 no.11
    • /
    • pp.309-316
    • /
    • 2014
  • In this paper, we propose an efficient detph map creation method using Graph Cut and Discrete Wavelet Transform. First, we have segmented the original image by using Graph Cut to process with its each areas. After that, the information which describes segmented areas of original image have been created by proposed labeling method for segmented areas. And then, we have created four subbands which contain the original image's frequency information. Finally, the depth map have been created by frequency map which made with HH, HL subbands and depth information calculation along the each segmented areas. The proposed method can perform efficient depth map creation process because of dynamic allocation using depth information. We also have tested the proposed method using PSNR(Peak Signal to Noise Ratio) method to evaluate ours.

Generation of Stereoscopic Image from 2D Image based on Saliency and Edge Modeling (관심맵과 에지 모델링을 이용한 2D 영상의 3D 변환)

  • Kim, Manbae
    • Journal of Broadcast Engineering
    • /
    • v.20 no.3
    • /
    • pp.368-378
    • /
    • 2015
  • 3D conversion technology has been studied over past decades and integrated to commercial 3D displays and 3DTVs. The 3D conversion plays an important role in the augmented functionality of three-dimensional television (3DTV), because it can easily provide 3D contents. Generally, depth cues extracted from a static image is used for generating a depth map followed by DIBR (Depth Image Based Rendering) rendering for producing a stereoscopic image. However except some particular images, the existence of depth cues is rare so that the consistent quality of a depth map cannot be accordingly guaranteed. Therefore, it is imperative to make a 3D conversion method that produces satisfactory and consistent 3D for diverse video contents. From this viewpoint, this paper proposes a novel method with applicability to general types of image. For this, saliency as well as edge is utilized. To generate a depth map, geometric perspective, affinity model and binomic filter are used. In the experiments, the proposed method was performed on 24 video clips with a variety of contents. From a subjective test for 3D perception and visual fatigue, satisfactory and comfortable viewing of 3D contents was validated.

Depth Map Estimation Model Using 3D Feature Volume (3차원 특징볼륨을 이용한 깊이영상 생성 모델)

  • Shin, Soo-Yeon;Kim, Dong-Myung;Suh, Jae-Won
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.11
    • /
    • pp.447-454
    • /
    • 2018
  • This paper proposes a depth image generation algorithm of stereo images using a deep learning model composed of a CNN (convolutional neural network). The proposed algorithm consists of a feature extraction unit which extracts the main features of each parallax image and a depth learning unit which learns the parallax information using extracted features. First, the feature extraction unit extracts a feature map for each parallax image through the Xception module and the ASPP(Atrous spatial pyramid pooling) module, which are composed of 2D CNN layers. Then, the feature map for each parallax is accumulated in 3D form according to the time difference and the depth image is estimated after passing through the depth learning unit for learning the depth estimation weight through 3D CNN. The proposed algorithm estimates the depth of object region more accurately than other algorithms.

Two-Dimensional Depth Data Measurement using an Active Omni-Directional Range Sensor (전방향 능동 거리 센서를 이용한 2차원 거리 측정)

  • Joung, In-Soo;Cho, Hyung-Suck
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.4
    • /
    • pp.437-445
    • /
    • 1999
  • Most autonomous mobile robots view only things in front of then, and as a result, they may collide with objects moving from the side or behind. To overcome this problem, an active omni-directional range sensor system has been built that can obtain an omni-directional depth map through the use of a laser conic plane and a conic mirror. In the navigation of the mobile robot, the proposed sensor system produces a laser conic plane by rotating the laser point source at high speed: this creates a two-dimensional depth map, in real time, once an image is captured. The results obtained from experiment show that the proposed sensor system is very efficient, and can be utilized for navigation of mobile robot in an unknown environment.

  • PDF

A Study of the Use of step by preprocessing and Graph Cut for the exact depth map (깊이맵 향상을 위한 전처리 과정과 그래프 컷에 관한 연구)

  • Kim, Young-Seop;Song, Eung-Yeol
    • Journal of the Semiconductor & Display Technology
    • /
    • v.10 no.3
    • /
    • pp.99-103
    • /
    • 2011
  • The stereoscopic vision system is the algorithm to obtain the depth of target object of stereo vision image. This paper presents an efficient disparity matching method using blue edge filter and graph cut algorithm. We do recommend the use of the simple sobel edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). The basic technique is to construct a specialized graph for the energy function to be minimized such that the minimum cut on the graph also minimizes the energy (either globally or locally). This method has the advantage of saving a lot of data. We propose a preprocessing effective stereo matching method based on sobel algorithm which uses blue edge information and the graph cut, we could obtain effective depth map.

A Study of the Use of Step by Preprocessing and Dynamic Programming for the Exact Depth Map (정확한 깊이 맵을 위한 전처리 과정과 다이나믹 프로그래밍에 관한 연구)

  • Kim, Young-Seop;Song, Eung-Yeol
    • Journal of the Semiconductor & Display Technology
    • /
    • v.9 no.3
    • /
    • pp.65-69
    • /
    • 2010
  • The stereoscopic vision system is the algorithm to obtain the depth of target object of stereo vision image. This paper presents an efficient disparity matching method using nagao filter, octree color quantization and dynamic programming algorithm. we describe methods for performing color quantization on full color RGB images, using an octree data structure. This method has the advantage of saving a lot of data. We propose a preprocessing stereo matching method based on Nagao-filter algorithm using color information. using the nagao filter, we could obtain effective depth map and using the octree color quantization, we could reduce the time of computation.

Multi-scale 3D Panor ama Content Augmented System using Depth-map

  • Kim, Cheeyong;Kim, Eung-Kon;Kim, Jong-Chan
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.6
    • /
    • pp.733-740
    • /
    • 2014
  • With the development and spread of 3D display, users can easily experience an augmented reality with 3D features. Therefore, the demand for content of an augmented reality is exponentially growing in various fields. A traditional augmented reality environment was generally created by CG(Computer Graphics) modelling production tools. However, this method takes too much time and efforts to create an augmented environment. To create an augmented environment similar to the real world, everything in the real world should be measured, gone through modeling, and located in an augmented environment. But the time and efforts spent in the creation don't produce the same environment as the real world, making it hard for users to feel the sense of reality. In this study, multi-scale 3D panorama content augmented system is suggested by using a depth-map. By finding matching features from images to add 3D features to an augmented environment, a depth-map is derived and embodied as panorama, producing high-quality augmented content system with a sense of reality. With this study, limits of 2D panorama technologies will be overcome and a sense of reality and immersion will be provided to users with a natural navigation.