• 제목/요약/키워드: computational algorithm

검색결과 4,372건 처리시간 0.03초

분할 Delaunay 삼각화 알고리즘 개발 (Development of Delaunay Triangulation Algorithm Using Subdivision)

  • 박시형;이성수
    • 한국CDE학회논문집
    • /
    • 제7권4호
    • /
    • pp.248-253
    • /
    • 2002
  • Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as reverse engineering, shape reconstruction, solid modeling and volume rendering. For Example, In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are nonuniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

확장된 근사 알고리즘을 이용한 조합 방법 (Rule of Combination Using Expanded Approximation Algorithm)

  • 문원식
    • 디지털산업정보학회논문지
    • /
    • 제9권3호
    • /
    • pp.21-30
    • /
    • 2013
  • Powell-Miller theory is a good method to express or treat incorrect information. But it has limitation that requires too much time to apply to actual situation because computational complexity increases in exponential and functional way. Accordingly, there have been several attempts to reduce computational complexity but side effect followed - certainty factor fell. This study suggested expanded Approximation Algorithm. Expanded Approximation Algorithm is a method to consider both smallest supersets and largest subsets to expand basic space into a space including inverse set and to reduce Approximation error. By using expanded Approximation Algorithm suggested in the study, basic probability assignment function value of subsets was alloted and added to basic probability assignment function value of sets related to the subsets. This made subsets newly created become Approximation more efficiently. As a result, it could be known that certain function value which is based on basic probability assignment function is closely near actual optimal result. And certainty in correctness can be obtained while computational complexity could be reduced. by using Algorithm suggested in the study, exact information necessary for a system can be obtained.

공간 상관성을 이용한 적응적 움직임 추정 알고리즘 (An Adaptive Motion Estimation Algorithm Using Spatial Correlation)

  • 박상곤;정동석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
    • /
    • pp.43-46
    • /
    • 2000
  • In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.

  • PDF

Flood Impact Pressure Analysis of Vertical Wall Structures using PLIC-VOF Method with Lagrangian Advection Algorithm

  • Phan, Hoang-Nam;Lee, Jee-Ho
    • 한국전산구조공학회논문집
    • /
    • 제23권6호
    • /
    • pp.675-682
    • /
    • 2010
  • The flood impact pressure acting on a vertical wall resulting from a dam-breaking problem is simulated using a navier-Stokes(N-S) solver. The N-S solver uses Eulerian Finite Volume Method(FVM) along with Volume Of Fluid(VOF) method for 2-D incompressible free surface flows. A Split Lagrangian Advection(SLA) scheme for VOF method is implemented in this paper. The SLA scheme is developed based on an algorithm of Piecewise Linear Interface Calculation(PLIC). The coupling between the continuity and momentum equations is affected by using a well-known Semi-Implicit Method for Pressure-Linked Equations (SIMPLE) algorithm. Several two-dimensional numerical simulations of the dam-breaking problem are presented to validate the accuracy and demonstrate the capability of the present algorithm. The significance of the time step and grid resolution are also discussed. The computational results are compared with experimental data and with computations by other numerical methods. The results showed a favorable agreement of water impact pressure as well as the global fluid motion.

IR-UWB Radar 시스템에서 특이값 분해를 이용한 클러터 신호 제거 알고리즘의 연산속도 향상 기법 (Improvement of Computational Speed for the SVD Background Clutter Signal Subtraction Algorithm in IR-UWB Radar Systems)

  • 백인석;정문권;조성호
    • 한국통신학회논문지
    • /
    • 제38C권1호
    • /
    • pp.89-96
    • /
    • 2013
  • 본 논문에서는 특이값 분해을 이용한 클러터 신호 제거 알고리즘의 연산속도를 향상 시킬 수 있는 기법을 제시한다. IR-UWB Radar를 이용하여 실내 위치 추적 시스템을 위해서는 수신 신호에서 목표물 신호를 추출하여야 한다. 특이값 분해를 이용하여 클러터 신호를 제거함으로써 수신신호로 부터 목표물의 신호를 추출할 수 있다. 특이값 분해를 이용한 클러터 신호 알고리즘은 목표물의 신호 추출 성능이 우수하나 연산속도가 느리다는 단점이 있다. 본 논문에서는 이런 단점을 극복하는 기법을 제시한다. 실제 IR-UWB Radar 시스템에 적용한 실험을 통해 본 논문에서 제시한 기법이 연산속도를 향상시키는 것을 확인하였다.

Design Centering by Genetic Algorithm and Coarse Simulation

  • Jinkoo Lee
    • 한국CDE학회논문집
    • /
    • 제2권4호
    • /
    • pp.215-221
    • /
    • 1997
  • A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

  • PDF

Maneuvering Target Tracking Using Multiresolutional Interacting Multiple Model Filter

  • Yu, C,H.;Choi, J.W.;Song, T.L.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.2340-2344
    • /
    • 2003
  • This paper considers a tracking filter algorithm which can track a maneuvering target. Multiresolutional Interacting Multiple Model (MRIMM) algorithm is proposed to reduce computational burden. In this paper multiresolutional state space model equation and multiresolutional measurement equation are derived by using wavelet transform. This paper shows the outline of MRIMM algorithm. Simulation results show that MRIMM algorithm maintains a good tracking performance and reduces computational burden.

  • PDF

계산량 감소를 위한 적응 C-GSC 알고리듬 (Adaptive C-GSC Algorithm for Reducing the Computational Complexity)

  • 문성훈;한동석이규만조명제
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • pp.1187-1190
    • /
    • 1998
  • In this paper we propose a new efficient generalized sidelobe canceller(GSC) algorithm, using the efficient frequency domain LMS algorithm, which has much less weights to update. We only update part of all the weights according to magnitude of each frequency bin. So, the new proposed GSC algorithm, which is called censored GSC(C-GSC), can greatly reduce the computational complexity.

  • PDF

입체 트러스구조물의 최적설계를 위한 SA기법 (Simulated Annealing Algorithm for Optimum Design of Space Truss Structures)

  • 정제원;박효선
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1999년도 봄 학술발표회 논문집
    • /
    • pp.102-109
    • /
    • 1999
  • Two phase simulated annealing algorithm is presented as a structural optimization technique and applied to minimum weight design of space trusses subjected to stress and displacement constraints under multiple loading conditions. Univariate searching algorithm is adopted for automatic selection of initial values of design variables for SA algorithm. The proper values of cooling factors and reasonable stopping criteria for optimum design of space truss structures are proposed to enhance the performance of optimization process. Optimum weights and design solutions are presented for two well-blown example structures and compared with those reported in the literature.

  • PDF