• Title/Summary/Keyword: Depth Information Matching

Search Result 181, Processing Time 0.024 seconds

Intermediate View Image and its Digital Hologram Generation for an Virtual Arbitrary View-Point Hologram Service (임의의 가상시점 홀로그램 서비스를 위한 중간시점 영상 및 디지털 홀로그램 생성)

  • Seo, Young-Ho;Lee, Yoon-Hyuk;Koo, Ja-Myung;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.15-31
    • /
    • 2013
  • This paper proposes an intermediate image generation method for the viewer's view point by tracking the viewer's face, which is converted to a digital hologram. Its purpose is to increase the viewing angle of a digital hologram, which is gathering higher and higher interest these days. The method assumes that the image information for the leftmost and the rightmost view points within the viewing angle to be controlled are given. It uses a stereo-matching method between the leftmost and the rightmost depth images to obtain the pseudo-disparity increment per depth value. With this increment, the positional informations from both the leftmost view point and the rightmost view point are generated, which are blended to get the information at the wanted intermediate viewpoint. The occurrable dis-occlusion region in this case is defined and a inpainting method is proposed. The results from implementing and experimenting this method showed that the average image qualities of the generated depth and RGB image were 33.83[dB] and 29.5[dB], respectively, and the average execution time was 250[ms] per frame. Also, we propose a prototype system to service digital hologram interactively to the viewer by using the proposed intermediate view generation method. It includes the operations of data acquisition for the leftmost and the rightmost viewpoints, camera calibration and image rectification, intermediate view image generation, computer-generated hologram (CGH) generation, and reconstruction of the hologram image. This system is implemented in the LabView(R) environments, in which CGH generation and hologram image reconstruction are implemented with GPGPUs, while others are implemented in software. The implemented system showed the execution speed to process about 5 frames per second.

Feature-based Disparity Correction for the Visual Discomfort Minimization of Stereoscopic Video Camera (입체영상의 시각 피로 최소화를 위한 특징기반 시차 보정)

  • Jung, Eun-Kyung;Kim, Chang-Il;Baek, Seung-Hae;Park, Soon-Yong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.6
    • /
    • pp.77-87
    • /
    • 2011
  • In this paper, we propose a disparity correction technique to reduce the inherent visual discomfort while watching stereoscopic videos. The visual discomfort must be solved for commercial 3D display systems to provide natural stereoscopic videos to human eyes. The proposed disparity correction technique consists of horizontal and vertical disparity corrections. The horizontal disparity correction is implemented by controlling the depth budget of stereoscopic video using the geometric relations of a stereoscopic camera system. In addition, the vertical disparity correction is implemented by using a feature-based stereo matching algorithm. Conventional vertical disparity corrections have been done by only using camera calibration parameters, which still cause systematic errors in vertical disparities. In this paper, we minimize the vertical disparity as small as possible by using a feature-based correction algorithm. Through the comparisons of conventional feature-based correction algorithms, we analyze the performance of the proposed technique.

Candidate First Moves for Solving Life-and-Death Problems in the Game of Go, using Kohonen Neural Network (코호넨 신경망을 이용 바둑 사활문제를 풀기 위한 후보 첫 수들)

  • Lee, Byung-Doo;Keum, Young-Wook
    • Journal of Korea Game Society
    • /
    • v.9 no.1
    • /
    • pp.105-114
    • /
    • 2009
  • In the game of Go, the life-and-death problem is a fundamental problem to be definitely overcome when implementing a computer Go program. To solve local Go problems such as life-and-death problems, an important consideration is how to tackle the game tree's huge branching factor and its depth. The basic idea of the experiment conducted in this article is that we modelled the human behavior to get the recognized first moves to kill the surrounded group. In the game of Go, similar life-and-death problems(patterns) often have similar solutions. To categorize similar patterns, we implemented Kohonen Neural Network(KNN) based clustering and found that the experimental result is promising and thus can compete with a pattern matching method, that uses supervised learning with a neural network, for solving life-and-death problems.

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

Fast Generation of Intermediate View Image Using GPGPU-Based Disparity Increment Method (GPGPU 기반의 변위증분 방법을 이용한 중간시점 고속 생성)

  • Koo, Ja-Myung;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.8
    • /
    • pp.1908-1918
    • /
    • 2013
  • Free-view, auto-stereoscopic video service is a next generation broadcasting system which offers a three-dimensional video, images of the various point are needed. This paper proposes a method that parallelizes the algorithm for arbitrary intermediate view-point image fast generation and make it faster using General Propose Graphic Processing Unit(GPGPU) with help of the Compute Unified Device Architecture(CUDA). It uses a parallelized stereo-matching method between the leftmost and the rightmost depth images to obtain disparity information and It use data calculated disparity increment per depth value. The disparity increment is used to find the location in the intermediate view-point image for each depth in the given images. Then, It is eliminate to disocclusions complement each other and remaining holes are filled image using hole-filling method and to get the final intermediate view-point image. The proposed method was implemented and applied to several test sequences. The results revealed that the quality of the generated intermediate view-point image corresponds to 30.47dB of PSNR in average and it takes about 38 frames per second to generate a Full HD intermediate view-point image.

Range finding algorithm of equidistance stereo catadioptric mirror (등거리 스테레오 전방위 렌즈 영상에 대한 위치 측정 알고리즘)

  • Choi, Young-Ho
    • Journal of Internet Computing and Services
    • /
    • v.6 no.6
    • /
    • pp.149-161
    • /
    • 2005
  • Catadioptric mirrors are widely used in automatic surveillance system. The major drawback of catadioptric mirror is its unequal image resolution. Equidistance catadioptric mirror can be the solution to this problem. Even double panoramic structure can generate stereo images with single camera system. So two images obtained from double panoramic equidistance catadioptric mirror can be used in finding the depth and height values of object's points. But compared to the single catadioptric mirror. the image size of double panoramic system is relatively small. This leads to the severe accuracy problem in estimation. The exact axial alignment and the exact mount of mirror are the sources that can be avoided but the focal length variation is inevitable. In this paper, the effects of focal length variation on the computation of depth and height of object' point are explained and the effective focal length finding algorithm, using the assumption that the object's viewing angles are almost same in stereo images, is presented.

  • PDF

Traveling-wave type CPW InGaAsP Photodecector at 1.55$\mu\textrm{m}$ (1.55$\mu\textrm{m}$ 진행파형 CPW InGaAsP Photodetector)

  • Yun, Yeong-Seol;Gang, Tae-Gu;Lee, Jeong-Hun;Ok, Seong-Hae;Gong, Sun-Cheol;Choe, Yeong-Wan
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.3
    • /
    • pp.41-48
    • /
    • 2002
  • The bandwidth limitation of traveling-wave electroabsorption modulator(TW-EAM) is determined by the transit time, the velocity-mismatch between optical-wave and microwave, the impedance-matching, the dispersion and the microwave loss. In this paper, we introduce an hovel impulse response of TW-EAM considering transit time as well as velocity-mismatch. We analyze the effect of transit-time and velocity-mismatch at the same time, using the FDTD method. We investigate the modulation bandwidth by changing the depth of the intrinsic region. We suggest that the optimum depth of the intrinsic region is 0.2${\mu}{\textrm}{m}$ when the absorption coefficient($\alpha$) is 0.2${\mu}{\textrm}{m}$-1.

Design and Implementation of Machine Learning System for Fine Dust Anomaly Detection based on Big Data (빅데이터 기반 미세먼지 이상 탐지 머신러닝 시스템 설계 및 구현)

  • Jae-Won Lee;Chi-Ho Lin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.1
    • /
    • pp.55-58
    • /
    • 2024
  • In this paper, we propose a design and implementation of big data-based fine dust anomaly detection machine learning system. The proposed is system that classifies the fine dust air quality index through meteorological information composed of fine dust and big data. This system classifies fine dust through the design of an anomaly detection algorithm according to the outliers for each air quality index classification categories based on machine learning. Depth data of the image collected from the camera collects images according to the level of fine dust, and then creates a fine dust visibility mask. And, with a learning-based fingerprinting technique through a mono depth estimation algorithm, the fine dust level is derived by inferring the visibility distance of fine dust collected from the monoscope camera. For experimentation and analysis of this method, after creating learning data by matching the fine dust level data and CCTV image data by region and time, a model is created and tested in a real environment.

Stereo Vision-based Visual Odometry Using Robust Visual Feature in Dynamic Environment (동적 환경에서 강인한 영상특징을 이용한 스테레오 비전 기반의 비주얼 오도메트리)

  • Jung, Sang-Jun;Song, Jae-Bok;Kang, Sin-Cheon
    • The Journal of Korea Robotics Society
    • /
    • v.3 no.4
    • /
    • pp.263-269
    • /
    • 2008
  • Visual odometry is a popular approach to estimating robot motion using a monocular or stereo camera. This paper proposes a novel visual odometry scheme using a stereo camera for robust estimation of a 6 DOF motion in the dynamic environment. The false results of feature matching and the uncertainty of depth information provided by the camera can generate the outliers which deteriorate the estimation. The outliers are removed by analyzing the magnitude histogram of the motion vector of the corresponding features and the RANSAC algorithm. The features extracted from a dynamic object such as a human also makes the motion estimation inaccurate. To eliminate the effect of a dynamic object, several candidates of dynamic objects are generated by clustering the 3D position of features and each candidate is checked based on the standard deviation of features on whether it is a real dynamic object or not. The accuracy and practicality of the proposed scheme are verified by several experiments and comparisons with both IMU and wheel-based odometry. It is shown that the proposed scheme works well when wheel slip occurs or dynamic objects exist.

  • PDF

A Fault Diagnosis Using System Matrix In Expert System (System matrix를 사용한 고장진단 전문가 시스템)

  • Sim, K.J.;Kim, K.J.;Ha, W.K.;Chu, J.B.;Oh, S.H.
    • Proceedings of the KIEE Conference
    • /
    • 1989.07a
    • /
    • pp.233-236
    • /
    • 1989
  • This paper deals with the expert system using network configuration and input information composed of protective relays and tripped circuit breakers. This system has knowlegebase independent on network dimension because network representation consists of the type of the matrix. Therefore, the knowlege of network representation is simplified, the space of knowlege is reduced, the addition of facts to the knowlege is easy and the expansion of facts is possible. In this paper, the network representation is defined to system matrix. This expert system based on the system matrix diagnoses normal, abnormal operations of protective devices as well as possible fault sections. The brach and bound search technique is used: breadth first technique mixed with depth first technique of primitive PROLOG search technique. This system will be used for real time operations. This expert system obtaines the solution using the pattern matching in working memory without no listing approach for rule control. This paper is written in PROLOG, the A.I. language.

  • PDF