• Title/Summary/Keyword: 3차원 지도

Search Result 4,568, Processing Time 0.036 seconds

A Study on the Image-Based 3D Modeling Using Calibrated Stereo Camera (스테레오 보정 카메라를 이용한 영상 기반 3차원 모델링에 관한 연구)

  • 김효성;남기곤;주재흠;이철헌;설성욱
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.3
    • /
    • pp.27-33
    • /
    • 2003
  • The image-based 3D modeling is the technique of generating a 3D graphic model from images acquired using cameras. It is being researched as an alternative technique for the expensive 3D scanner. In this paper, we propose the image-based, 3D modeling system using calibrated stereo cameras. The proposed algorithm for rendering, 3D model consists of three steps, camera calibration, 3D reconstruction, and 3D registration step. In the camera calibration step, we estimate the camera matrix for the image aquisition camera. In the 3D reconstruction step, we calculate 3D coordinates using triangulation from corresponding points of the stereo image. In the 3D registration step, we estimate the transformation matrix that transforms individually reconstructed 3D coordinates to the reference coordinate to render the single 3D model. As shown the result, we generated relatively accurate 3D model.

  • PDF

Link-Disjoint Embedding of Complete Binary Trees into 3D-Meshes using Dimension-Ordered Routing (순위차원라우팅을 사용한 완전 이진트리의 3차원 메쉬로의 링크 충돌 없는 임베딩)

  • Park, Sang-Myeong;Lee, Sang-Kyu;Moon, Bong-Hee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.169-176
    • /
    • 2000
  • This paper is considered with the problem of embedding complete binary trees into 3-dimensional meshes using dimension-ordered routing with primary concern of minimizing link congestion. The authors showed that a complete binary tree with $2^P-1$ nodes can be embedded into a 3-dimensional mesh with optimum size, $2^P$ nodes, if the link congestion is two[14], (More precisely, the link congestion of each dimension is two, two, and one if the dimension-ordered routing is used, and two, one, and one if the dimension-ordered routing is not imposed.) In this paper, we present a scheme to find an embedding of a complete binary tree into a 3-dimensional mesh of size no larger than 1.27 times the optimum with link congestion one while using dimension-ordered routing.

  • PDF

3D Panoramic Mosaiciking to Silppress the Ghost Effect at Long Distance Scene for Urban Area Visualization (도심영상 입체 가시화 중 발생하는 원거리 환영현상 해소를 위한 3차원 파노라믹 모자이크)

  • Chon, Jae-Choon;Kim, Hyong-Suk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.87-94
    • /
    • 2005
  • 3D image mosaicking is useful for 3D visualization of the roadside scene of urban area by projecting 2D images to the 3D planes. When a sequence of images are filmed from a side-looking video camera passing long distance areas, the ghost effect in which same objects appear repeatively occurs. To suppress such ghost effect, the long distance range areas are detected by using the distance between the image frame and the 3D coordinate of tracked optical flows. The ghost effects are suppressed by projecting the part of image frames onto 3D multiple planes utilizing vectors passing the focal point of frames and a virtual focal point. The virtual focal point is calculated by utilizing the first and last frames of the long distance range areas. We demonstrate algorithm that creates efficient 3D Panoramic mosaics without the ghost effect at the long distance area.

Development of Drought Map Based on Three-dimensional Spatio-temporal Analysis of Drought (가뭄사상에 대한 3차원적 시공간 분석을 통한 가뭄지도 개발)

  • Yoo, Jiyoung;So, Byung-Jin;Kwon, Hyun-Han;Kim, Tae-Woong
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.40 no.1
    • /
    • pp.25-33
    • /
    • 2020
  • A drought event is characterized by duration, severity and affected area. In general, after calculating a drought index using hydro-meteorological time series at a station, a drought event is defined based on the run theory to identify the beginning and end time. However, this one-dimensional analysis has limitations for analyzing the spatio-temporal occurrence characteristics and movement paths of drought. Therefore, this study is to define a three-dimensional drought event using a simple clustering algorithm and to develop a drought map that can be used to understand the drought severity according to the spatio-temporal expansion of drought. As a result, compared with the two-dimensional monitoring information to show spatial distribution of drought index, a proposed drought map is able to show three-dimensional drought characteristics inclusing drought duration, spatial cumulative severity, and centroid of drought. The analysis of drought map indicated that there was a drought event which had the affected area less than 10 % while on occations while there were 11 drought events (44 %) which had the affected area more a than 90 % of the total area. This means that it is important to understand the relationship between spatial variation of drought affected area and severity corresponding to various drought durations. The development of drought map based on three-dimensional drought analysis is useful to analyze the spatio-temporal occurrence characteristics and propagation patterns of regional drought which can be utilized in developing mitigation measures for future extreme droughts.

Design of 3-Dimension Interleaver for Improving of Transmission Efficiency in Next Generation Wireless Communication System (차세대 무선통신시스템에서 전송효율의 향상을위한 3차원 인터리버의 설계)

  • 공형윤;이창희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.3B
    • /
    • pp.369-374
    • /
    • 2001
  • 본 논문에서는 터보코드의 설계를 위한 새로운 일터리버 방식(3차원 블록 인터리버)을 소개한다. 3차원 블록 인터리버는 같은 블록크기를 가지는 2차원의 블록 인터리버보다 최소 비트간의 거리를 크게 할 수 있는 방버븡로, 3 차원 인터리빙 알고리즘에 의해 계산된 주소 값을 이용하여 입/출력 데이터의 순서를 조절함으로서 데이터의 비트 거리 특성을 향상시킨 것이다. 터보코드는 데이터 율, 부호기의 구속장의 길이, 복호방식, 순환복호의 횟수 등 여러 가지 요소들에 의해 성능이 좌우되며, 특히 인터리버의 종류 및 크기의 선택에 따라서 성느의 차이를 보인다. 컴퓨터 시뮬레이션을 이용하여 3차원 블록 인터리버의 성능을 분석하였으며, 전송 환경을 가우시안 및 비가우시간 채널로 설정하였다.

  • PDF

Robust 3-D Points Estimation and Tracking with Dynamic Model for Optical Motion Capture (광학식 동작 포착에서 동적 모델을 이용한 신뢰성있는 3-D 좌표 추정 및 추적)

  • Lee, Dong-Hun;Chu, Chang-U;Kim, Seong-Jin;Jeong, Sun-Gi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.10
    • /
    • pp.825-834
    • /
    • 2000
  • 광학식 동작 포착(optical motion capture)시스템에서 신뢰할만한 3차원 좌표의 획득과 마커의 궤적 추적은 매우 중요한 문제이다. 3차원 좌표를 획득하기 이해서는 다중의 카메라로부터 2차원의 데이터 간의 대응관계를 구해야 한다. 본 논문에서는 각 카메라에서의 3차원 마커들 간의 대응관계를 k-partite graph로 모델링하고, 릴렉세이션 알고리즘을 사용하여 고스트가 제거된 신뢰성있는 클릭을 추출한다. 이를 통해 정확하고 안정적인 3차원의 좌표를 생성할 수 있다. 또한 추출된 3차원 마커의 궤적의 추적을 위해 칼만 필터를 사용한 마커의 예측과 데이터 연계 문제의 해결을 위한 전략을 제안하고. 사라진 마커의 궤적을 유지시키기 위해 다이나믹 모델을 사용한 추적 알고리즘을 제시한다.

  • PDF

A Image-based 3-D Shape Reconstruction using Pyramidal Volume Intersection (피라미드 볼륨 교차기법을 이용한 영상기반의 3차원 형상 복원)

  • Lee Sang-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.1
    • /
    • pp.127-135
    • /
    • 2006
  • The image-based 3D modeling is the technique of generating a 3D graphic model from images acquired using cameras. It is being researched as an alternative technique for the expensive 3D scanner. In this paper, I propose the image-based 3D modeling system using calibrated camera. The proposed algorithm for rendering 3D model is consisted of three steps, camera calibration, 3D shape reconstruction and 3D surface generation step. In the camera calibration step, I estimate the camera matrix for the image aquisition camera. In the 3D shape reconstruction step, I calculate 3D volume data from silhouette using pyramidal volume intersection. In the 3D surface generation step, the reconstructed volume data is converted to 3D mesh surface. As shown the result, I generated relatively accurate 3D model.

Design and Implementation of Spatial Guide System Using Google Maps API (구글맵 API를 이용한 공간적 방향안내 시스템의 설계 및 구현)

  • Kim, Taehyeok;Moon, Hyoenjun;Moon, Mikyeong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.1264-1266
    • /
    • 2017
  • 현재 사람들이 원하는 목적지를 가기 위해 스마트 폰의 여러 지도 애플리케이션들이나 이정표를 이용한다. 그러나 2차원으로 나타나는 스마트폰의 지도 애플리케이션들로 3차원인 현실의 방향을 파악하기란 쉽지 않고, 이정표 또한 안내 가능한 방향, 게시되는 언어의 수가 제한되는 등의 문제가 있다. 본 논문에서는 이러한 문제를 보완할 수 있는 구글 맵 API를 이용하여 공간적으로 방향을 안내 해주는 시스템의 설계 및 개발 내용에 대해 기술한다. 이 시스템은 구글맵 API의 검색 기능을 통해 얻은 목적지를 안내판이 회전하여 이용자에게 방향과 거리를 안내함으로써, 3차원인 현실에서의 공간적 방향을 파악하는데 도움을 준다. 또한 기존의 이정표와 달리 새로운 장소에 대해 소프트웨어적인 업데이트만 실시하면 되므로 유지비용을 줄이는 효과를 기대 할 수 있다.

Robust Watermarking Algorithm for 3D Mesh Models (3차원 메쉬 모델을 위한 강인한 워터마킹 기법)

  • 송한새;조남익;김종원
    • Journal of Broadcast Engineering
    • /
    • v.9 no.1
    • /
    • pp.64-73
    • /
    • 2004
  • A robust watermarking algorithm is proposed for 3D mesh models. Watermark is inserted into the 2D image which is extracted from the target 3D model. Each Pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model. This extracted image is defined as “range image” in this paper. Watermark is embedded into the range image. Then, watermarked 3D mesh is obtained by modifying vertices using the watermarked range Image. In extraction procedure, the original model is needed. After registration between the original and the watermarked models, two range images are extracted from each 3D model. From these images. embedded watermark is extracted. Experimental results show that the proposed algorithm is robust against the attacks such as rotation, translation, uniform scaling, mesh simplification, AWGN and quantization of vertex coordinates.

Registration of the 3D Range Data Using the Curvature Value (곡률 정보를 이용한 3차원 거리 데이터 정합)

  • Kim, Sang-Hoon;Kim, Tae-Eun
    • Convergence Security Journal
    • /
    • v.8 no.4
    • /
    • pp.161-166
    • /
    • 2008
  • This paper proposes a new approach to align 3D data sets by using curvatures of feature surface. We use the Gaussian curvatures and the covariance matrix which imply the physical characteristics of the model to achieve registration of unaligned 3D data sets. First, the physical characteristics of local area are obtained by the Gaussian curvature. And the camera position of 3D range finder system is calculated from by using the projection matrix between 3D data set and 2D image. Then, the physical characteristics of whole area are obtained by the covariance matrix of the model. The corresponding points can be found in the overlapping region with the cross-projection method and it concentrates by removed points of self-occlusion. By the repeatedly the process discussed above, we finally find corrected points of overlapping region and get the optimized registration result.

  • PDF