• Title/Summary/Keyword: 2차원 계산

Search Result 2,108, Processing Time 0.029 seconds

Curvature Estimation Based Depth Map Generation (곡률 계산에 기반한 깊이지도 생성 알고리즘)

  • Soh, Yongseok;Sim, Jae-Young;Lee, Sang-Uk
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.343-344
    • /
    • 2011
  • 최근 3 차원 디스플레이 기술의 발전에 힘입어 3 차원 컨텐츠에 대한 수요도 늘고 있다. 스테레오스코픽(Stereoscopic) 렌즈를 이용하여 3 차원 컨텐츠를 만들거나 여러 장의 2 차원 영상을 이용한 3 차원 복원 연구가 활발히 진행되는 가운데 본 논문에서는 단일 2 차원 영상을 이용해서 깊이 지도를 획득하는 알고리즘을 제안한다. 단일 영상을 보고 3 차원 구조를 파악하는 인간의 시각 체계의 능력에 착안하여 본 논문에서는 단일 영상을 이용하여 깊이 정보를 추출하는 알고리즘을 제안한다. 깊이 단서들 중, 가림 단서를 소개하고 추가로 인간의 시각 체계에서 사용하는 깊이 단서들을 결합하여 기계 학습 알고리즘에 접목시킨다. 실험을 통해 우리는 제안 알고리즘이 물체의 외곽정보를 이용하여 양질의 깊이 지도를 준다는 것을 확인할 수 있다.

  • PDF

Automatic Generation Technique of Individual Blood Vessel Model (개인 혈관모델의 자동생성 기법)

  • Lee, Na-Young;Kim, Gye-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11b
    • /
    • pp.937-939
    • /
    • 2005
  • 의료영상의 3차원 모델링은 의학 연구 및 교육, 환자 치료를 위해 보다 정확한 정보를 제공 할 수 있다. 따라서 본 논문에서는 동맥경화가 발생된 위치를 정확하게 파악하고 빠르게 진단하는데 도움을 줄 수 있도록 3차원 개인 혈관모델의 자동생성 기법을 제안한다. 개인별 3차원 혈관모델을 생성하기 위하여 개인에 따라 모양이 다른 혈관조영사진에서 추출된 혈관영역을 기반으로 표준 모델을 변형 및 조정한다. 즉, 표준모델을 2차원으로 투영시킨 영상과 개인별 2차원 혈관영상에 대응되는 특징점을 추출하고 각 특징점의 이동량을 계산한 뒤 이 결과를 3차원으로 역 투영시킴으로써 변형된 새로운 혈관 모델을 생성한다. 3차원 혈관모델을 통하여 질병의 진행 및 차도를 환자들이 시각적으로 확인할 수 있으므로 높은 안정감을 주며 빠르고 정확한 진단으로 오진율을 감소시킬 것으로 기대된다.

  • PDF

Conservative Visibility Preprocessing by Expressing 4-D visibility Information on 2-D Spaces (2차원 평면상에 4차원 가시성 정보의 표현을 통한 포괄적 가시성 전처리)

  • Heo, Jun-Hyeok;Wohn, Kwang-Yun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.5 no.2
    • /
    • pp.9-23
    • /
    • 1999
  • Visibility preprocessing is a useful method to reduce the complexity of scenes to be processed in real-time, and so enhances the overall rendering performance for interactive visualization of virtual environments. In this paper, we propose an efficient visibility preprocessing method. In the proposed method, we assume that navigatable areas in virtual environments are partitioned into rectangular parallelpiped cells or sub-worlds. To preprocess the visibility of each polygon for a given partitioned cell, we should determine at least the area-to-area visibility. This is inherently a four-dimensional problem. We efficiently express four-dimensional visibility information on two-dimensional spaces and keep it within a ternary tree, which is conceptually similar to a BSP(Binary Space Partitioning) tree, by exploiting the characteristics of conservative visibility. The proposed method is able to efficiently handle more general environments like urban scenes, and remove invisible polygons jointly blocked by multiple occluders. The proposed method requires O(nm) time and O(n+m) space. By selecting a suitable value for m, users can select a suitable level of trade-off between the preprocessing time and the quality of the computational result.

  • PDF

An Efficient Incremental Maintenance Method for Data Cubes in Data Warehouses (데이타 웨어하우스에서 데이타 큐브를 위한 효율적인 점진적 관리 기법)

  • Lee, Ki-Yong;Park, Chang-Sup;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.2
    • /
    • pp.175-187
    • /
    • 2006
  • The data cube is an aggregation operator that computes group-bys for all possible combination of dimension attributes. %on the number of the dimension attributes is n, a data cube computes $2^n$ group-bys. Each group-by in a data cube is called a cuboid. Data cubes are often precomputed and stored as materialized views in data warehouses. These data cubes need to be updated when source relation change. The incremental maintenance of a data cube is to compute and propagate only its changes. To compute the change of a data cube of $2^n$ cuboids, previous works compute a delta cube that has the same number of cuboids as the original data cube. Thus, as the number of dimension attributes increases, the cost of computing a delta cube increases significantly. Each cuboid in a delta cube is called a delta cuboid. In this paper. we propose an incremental cube maintenance method that can maintain a data cube by using only $_nC_{{\lceil}n/2{\rceil}}$ delta cuboids. As a result, the cost of computing a delta cube is substantially reduced. Through various experiments, we show the performance advantages of our method over previous methods.

Acceleration of computation speed for elastic wave simulation using a Graphic Processing Unit (그래픽 프로세서를 이용한 탄성파 수치모사의 계산속도 향상)

  • Nakata, Norimitsu;Tsuji, Takeshi;Matsuoka, Toshifumi
    • Geophysics and Geophysical Exploration
    • /
    • v.14 no.1
    • /
    • pp.98-104
    • /
    • 2011
  • Numerical simulation in exploration geophysics provides important insights into subsurface wave propagation phenomena. Although elastic wave simulations take longer to compute than acoustic simulations, an elastic simulator can construct more realistic wavefields including shear components. Therefore, it is suitable for exploration of the responses of elastic bodies. To overcome the long duration of the calculations, we use a Graphic Processing Unit (GPU) to accelerate the elastic wave simulation. Because a GPU has many processors and a wide memory bandwidth, we can use it in a parallelised computing architecture. The GPU board used in this study is an NVIDIA Tesla C1060, which has 240 processors and a 102 GB/s memory bandwidth. Despite the availability of a parallel computing architecture (CUDA), developed by NVIDIA, we must optimise the usage of the different types of memory on the GPU device, and the sequence of calculations, to obtain a significant speedup of the computation. In this study, we simulate two- (2D) and threedimensional (3D) elastic wave propagation using the Finite-Difference Time-Domain (FDTD) method on GPUs. In the wave propagation simulation, we adopt the staggered-grid method, which is one of the conventional FD schemes, since this method can achieve sufficient accuracy for use in numerical modelling in geophysics. Our simulator optimises the usage of memory on the GPU device to reduce data access times, and uses faster memory as much as possible. This is a key factor in GPU computing. By using one GPU device and optimising its memory usage, we improved the computation time by more than 14 times in the 2D simulation, and over six times in the 3D simulation, compared with one CPU. Furthermore, by using three GPUs, we succeeded in accelerating the 3D simulation 10 times.

Improvement of Medical Ultrasound Strain Image Using Lateral Motion Compensation (측방향 움직임 보상을 이용한 초음파 의료용 변형률 영상의 화질개선)

  • Park, Myung-Ki;Kwon, Sung-Jae;Jeong, Mok-Kun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.5
    • /
    • pp.239-248
    • /
    • 2011
  • In order to improve the quality of strain images in medical ultrasound imaging, displacements need to be accurately estimated. In this paper, in order to apply one-dimensional displacement estimation methods to two-dimensional motion estimation, the axial and lateral displacements are separately estimated. In order to estimate lateral displacements, one-dimensional signals aligned in the lateral direction are converted to analytic signals, which are then crosscorrelated. Strain images are produced by first compensating two-dimensional displacements for lateral motion with lateral motion displacement estimates obtained from the proposed lateral displacement estimation algorithm and then estimating axial displacements. Both phantom and human data experiments show that the proposed method provides better signal-to-noise ratio and contrast-to-noise ratio characteristics than a conventional strain imaging method that utilizes axial displacement estimates only.

Multivariate pHd analysis (다변량 pHd 분석)

  • 이용구
    • The Korean Journal of Applied Statistics
    • /
    • v.8 no.1
    • /
    • pp.61-74
    • /
    • 1995
  • These days, many kinds of graphical methods have been developed, and it is possible to get information directly from data. Especially, R-code (Cook and Weisberg, 1994) make it possible to draw various kinds of two and three dimensional plots, and to rotate the axis of the plots. But the maximum dimensional of the plot is three, so we can not draw plot of one response variable with more than three explanatory variables. Li(1991, 1992) has developed a method to reduce the dimension of the explanatory variables, so it is possible to draw lower dimensional plots to get information of the full explanatory variables. One of the dimension reduction method developed by Li is pHd. In this paper, we have tried to apply the pHd method for the model with multivariate response.

  • PDF

Estimation of the maximum magnetic field applied perpendicularity on the HTS conductor for a large scale SMES (SMES용 고온초전도 코일에 인가되는 최대 자기장의 계산)

  • Lee, Ji-Young;Lee, Seyeon;Kim, Yungil;Park, Sang Ho;Choi, Kyeongdal;Lee, Ji-Kwang;Kim, Woo-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2015.07a
    • /
    • pp.1120-1121
    • /
    • 2015
  • 대용량 SMES(Superconducting Magnetic Energy Storage)를 제작하기 위해서는 높은 자장특성을 가고 있는 2세대 HTS(High-Temperature Superconductor) 선재를 사용하는 것이 효율적이다. SMES의 에너지밀도를 높이기 위해서는 선재에 많은 전류를 흘려야 하는데, 수직자기장이 커지면 임계전류가 작아지는 2세대 HTS 선재의 특성상 토로이드형태의 SMES가 유리하다. SMES를 설계하기 전에 선재의 사용량을 줄이고 체적을 줄이기 위해서 정확한 설계와 평가가 필요하다. 유한요소법을 사용한 상용프로그램을 이용하여 쉽게 해석할 수 있으나 토로이드 형태의 SMES는 대칭성의 문제로 3차원 해석을 해야만 한다. 그러나 2차원 해석에 비해 여러 가지 제약조건이 따르며 해석 시간이 많이 소요된다. 본 논문에서는 이러한 문제점을 해결하기 위해 분석적이고 통계적으로 고온 초전도 코일에서 작용하는 최대 수직자장을 결정하는데 이해하기 쉽고 효율적으로 계산하는 방법을 제시했다. 본 논문에서는 싱글펜케이크코일의 크기에 따른 최대 자장값을 계산하였고 싱글펜케이크코일이 토로이드형태로 배치된 토로이드 모델에서 주변코일이 싱글펜케이크코일의 미드포인트에 미치는 자장값을 계산하여 두 계산값을 합하는 방식으로 최대 자기장을 계산하였다. 이 방법은 현저한 시간단축과 효율적인 설계를 할 수 있는 새로운 계산 방법으로 기존 FEM을 사용해 걸리는 시간에 비해 1/1000정도의 시간단축을 할 수 있었다.

  • PDF

An Implicit Numerical Method for Two-Dimensional Tidal Computation (음해법에 의한 2차원 조류유동 계산법)

  • Sun-Young Kim;Mu-Seok Song
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.35 no.1
    • /
    • pp.1-14
    • /
    • 1998
  • A two-dimensional numerical model for tidal currents based on the depth averaged equation is developed. The mode1 employs a rectangular grid system for its simplicity in the application of complicate coastal shore lines. To raise computing efficiency, implicit approximate factorization scheme is implemented in solving governing equations. An upwind-differencing is used to discretize convective terms, which provides a numerical dissipation automatically and suppresses any oscillations caused by nonlinear instabilities. Some numerical tests are made against the analytic solutions of a linearized shallow water equation to validate the developed numerical scheme, and comparisons of the model prediction with the analytic solution are satisfactory. As a real application, the tidal currents are computed on the Inchon area where the tidal currents are important for the design of new canal which is under construction.

  • PDF