• Title/Summary/Keyword: 2D/3D converting algorithm

Search Result 24, Processing Time 0.024 seconds

Implementation of Real-time Stereoscopic Image Conversion Algorithm Using Luminance and Vertical Position (휘도와 수직 위치 정보를 이용한 입체 변환 알고리즘 구현)

  • Yun, Jong-Ho;Choi, Myul-Rul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.5
    • /
    • pp.1225-1233
    • /
    • 2008
  • In this paper, the 2D/3D converting algorithm is proposed. The single frame of 2D image is used fur the real-time processing of the proposed algorithm. The proposed algorithm creates a 3D image with the depth map by using the vertical position information of a object in a single frame. In order to real-time processing and improve the hardware complexity, it performs the generation of a depth map using the image sampling, the object segmentation with the luminance standardization and the boundary scan. It might be suitable to a still image and a moving image, and it can provide a good 3D effect on a image such as a long distance image, a landscape, or a panorama photo because it uses a vertical position information. The proposed algorithm can adapt a 3D effect to a image without the restrictions of the direction, velocity or scene change of an object. It has been evaluated with the visual test and the comparing to the MTD(Modified Time Difference) method using the APD(Absolute Parallax Difference).

An Algorithim for Converting 2D Face Image into 3D Model (얼굴 2D 이미지의 3D 모델 변환 알고리즘)

  • Choi, Tae-Jun;Lee, Hee-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.4
    • /
    • pp.41-48
    • /
    • 2015
  • Recently, the spread of 3D printers has been increasing the demand for 3D models. However, the creation of 3D models should have a trained specialist using specialized softwares. This paper is about an algorithm to produce a 3D model from a single sheet of two-dimensional front face photograph, so that ordinary people can easily create 3D models. The background and the foreground are separated from a photo and predetermined constant number vertices are placed on the seperated foreground 2D image at a same interval. The arranged vertex location are extended in three dimensions by using the gray level of the pixel on the vertex and the characteristics of eyebrows and nose of the nomal human face. The separating method of the foreground and the background uses the edge information of the silhouette. The AdaBoost algorithm using the Haar-like feature is also employed to find the location of the eyes and nose. The 3D models obtained by using this algorithm are good enough to use for 3D printing even though some manual treatment might be required a little bit. The algorithm will be useful for providing 3D contents in conjunction with the spread of 3D printers.

Real-time Line Interpolation of a 2.3D Circular Arc based on the Acceleration and Deceleration of a Servo Motor (서보 모터의 가감속을 고려한 2.3차원 원호의 실시간 직선 보간)

  • Lee, Je-Phill;Lee, Cheol-Soo
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2001.04a
    • /
    • pp.399-404
    • /
    • 2001
  • In CNC machining, a 3D(3-dimension) linear segment and a 2D(2-dimension) circular arc are general forms given by CAD/CAM system. Generally, the 2D circular arc machining is processed using dividing into some linear segments. A 3D circular arc also don't exist in the standard form of NC data. This paper present a algorithm and method for real-time machining of a circular arc(not only the 2D one, but also the 3D one). The 3D circular arc machining is based on the 2D circular arc machining. It only needs making a new coordinate system, converting given 3D points(a start point, a end point, and a center point of a 3D circular arc) into points of the new coordinate system, and processing a inverse transformation about a interpolated point. The proposed algorithm was implemented and simulated on PC system. It was confirmed to give a gcod result.

  • PDF

Two dimensional Fast DCT using Polynomial Transform without Complex Computations (복소연산이 없는 Polynomial 변환을 이용한 2차원 고속 DCT)

  • Park, Hwan-Serk;Kim, Won-Ha
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.6
    • /
    • pp.127-140
    • /
    • 2003
  • This paper develops a novel algorithm of computing 2 Dimensional Discrete Cosine Transform (2D-DCT) via Polynomial Transform (PT) converting 2D-DCT to the sum of 1D-DCTs. In computing N${\times}$M size 2D-DCT, the conventional row-column algorithm needs 3/2NMlog$_2$(NM)-2NM+N+M additions and 1/2NMlog$_2$(NM) additions and 1/2NMlog$_2$(NM) multiplications, while the proposed algorithm needs 3/2NMlog$_2$M+NMlog$_2$N-M-N/2+2 additions and 1/2NMlog$_2$M multiplications The previous polynomial transform needs complex operations because it applies the Euler equation to DCT. Since the suggested algorithm exploits the modular regularity embedded in DCT and directly decomposes 2D DCT into the sum of ID DCTs, the suggested algorithm does not require any complex operations.

단면도를 이용한 3차원 파라메트릭 설계

  • Kim, Byung-In;Kim, Kwang-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.3
    • /
    • pp.35-53
    • /
    • 1994
  • Orthographic views ore traditionally used for engineering drawings. This paper presents a methodology for 3D parametric design using orthographic views. The parametric design technique, which is used to design 2D orthographic views, is based on production rules. In the production rule-base, several view interrelation rules and over 50 geometric rules are included. An efficient algorithm is also developed to expedite the reasoning process. For 3D object construction from orthographic views, the approach known as bottom-up geometrical approach is used. The approach consists of 4 steps : 1) generation of wire-frame, 2) construction of face from wire frame, 3) formation of 3D subobjects from faces, and 4) construction of final 3D objects. Curvilinear solids as well as planar solids can be constructed. A method of converting existing 2D CAD data to parametric 3D CAD data is also presented.

  • PDF

Data Transformation and Display Technique for 3D Visualization of Rainfall Radar (강우레이더의 3차원 가시화를 위한 데이터 변환 및 표출기법)

  • Kim, Hyeong Hun;Park, Hyeon Cheol;Choi, Yeong Cheol;Kim, Tae Su;Choung, Yun Jae
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.352-362
    • /
    • 2017
  • This paper proposes an algorithm for automatically converting and displaying rainfall radar data on a 3D GIS platform. The weather information displayed like rainfall radar data is updated frequently and large-scale. Thus, in order to efficiently display the data, an algorithm to convert and output the data automatically, rather than manually, is required. In addition, since rainfall data is extracted from the space, the use of the display image fused with the 3D GIS data representing the space enhances the visibility of the user. To meet these requirements, this study developed the Auto Data Converter application that analyzes the raw data of the rainfall radar and convert them into a universal format. In addition, Unity 3D, which has good development accessibility, was used for dynamic 3D implementation of the converted rainfall radar data. The software applications developed in this study could automatically convert a large volume of rainfall data into a universal format in a short time and perform 3D modeling effectively according to the data conversion on the 3D platform. Furthermore, the rainfall radar data could be merged with other GIS data for effective visualization.

Implementation of a 3D Recognition applying Depth map and HMM (깊이 맵과 HMM을 이용한 인식 시스템 구현)

  • Han, Chang-Ho;Oh, Choon-Suk
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.2
    • /
    • pp.119-126
    • /
    • 2012
  • Recently, we used to recognize for human motions with some recognition algorithms. examples, HMM, DTW, PCA etc. In many human motions, we concentrated our research on recognizing fighting motions. In previous work, to obtain the fighting motion data, we used motion capture system which is developed with some active markers and infrared rays cameras and 3 dimension information converting algorithms by the stereo matching method. In this paper, we describe that the different method to acquiring 3 dimension fighting motion data and a HMM algorithm to recognize the data. One of the obtaining 3d data we used is depth map algorithm which is calculated by a stereo method. We test the 3d acquiring and the motion recognition system, and show the results of accuracy and performance results.

Design and Implementation Stereo Camera based Twin Camera Module System (스테레오 카메라 기반 트윈 카메라 모듈 시스템 설계 및 구현)

  • Kim, Tae-Yeun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.6
    • /
    • pp.537-546
    • /
    • 2019
  • The paper actualizes the twin camera module system that is portable and very useful for the production of 3D contents. The suggested twin camera module system is a system to be able to display the 3D image after converting the inputted image from 2D stereo camera. To evaluate the performance of the twin camera module suggested in this paper, I assessed the correction of Rotation and Tilt created depending on the visual difference between the left and right stereoscopic image shot by the left and right lenses by using the Test Platform. In addition, I verified the efficiency of the twin camera module system through verifying Depth Error of 3D stereoscopic image by means of Scale Invariant Feature Transform(SIFT) algorithm. I think that if the user utilizes the suggested twin camera module system in displaying the image to the external after converting the shot image into the 3D stereoscopic image and the preparation image, it is possible to display the image in a matched way with an output device fit respectively for different 3D image production methods and if the user utilizes the system in displaying the created image in the form of the 3D stereoscopic image and the preparation image via different channels, it is possible to produce 3D image contents easily and conveniently with applying to lots of products.

3D Rigid Body Tracking Algorithm Using 2D Passive Marker Image (2D 패시브마커 영상을 이용한 3차원 리지드 바디 추적 알고리즘)

  • Park, Byung-Seo;Kim, Dong-Wook;Seo, Young-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.587-588
    • /
    • 2022
  • In this paper, we propose a rigid body tracking method in 3D space using 2D passive marker images from multiple motion capture cameras. First, a calibration process using a chess board is performed to obtain the internal variables of individual cameras, and in the second calibration process, the triangular structure with three markers is moved so that all cameras can observe it, and then the accumulated data for each frame is calculated. Correction and update of relative position information between cameras. After that, the three-dimensional coordinates of the three markers were restored through the process of converting the coordinate system of each camera into the 3D world coordinate system, the distance between each marker was calculated, and the difference with the actual distance was compared. As a result, an error within an average of 2mm was measured.

  • PDF

Octree Generation and Clipping Algorithm using Section Curves for Three Dimensional Cartesian Grid Generation (삼차원 직교 격자 생성을 위한 단면 커브를 이용한 옥트리 생성과 셀 절단 알고리듬)

  • Kim, Dong-Hun;Shin, Ha-Yong;Park, Se-Youn;Yi, Il-Lang;Kwon, Jang-Hyuk;Kwon, Oh-Joon
    • Korean Journal of Computational Design and Engineering
    • /
    • v.13 no.6
    • /
    • pp.450-458
    • /
    • 2008
  • Recently, Cartesian grid approach has been popular to generate grid meshes for complex geometries in CFD (Computational Fluid Dynamics) because it is based on the non-body-fitted technique. This paper presents a method of an octree generation and boundary cell clipping using section curves for fast octree generation and elimination of redundant intersections between boundary cells and triangles from 3D triangular mesh. The proposed octree generation method uses 2D Scan-Converting line algorithm, and the clipping is done by parameterization of vertices from section curves. Experimental results provide octree generation time as well as Cut-cell clipping time of several models. The result shows that the proposed octree generation is fast and has linear relationship between grid generation time and the number of cut-cells.