• Title/Summary/Keyword: Fast Marching Method

Search Result 13, Processing Time 0.024 seconds

Background Generation using Temporal and Spatial Information of Pixels (시간축과 공간축 화소 정보를 이용한 배경 생성)

  • Cho, Sang-Hyun;Kang, Hang-Bong
    • The KIPS Transactions:PartB
    • /
    • v.17B no.1
    • /
    • pp.15-22
    • /
    • 2010
  • Background generation is very important for accurate object tracking in video surveillance systems. Traditional background generation techniques have some problems with non-moving objects for longer periods. To overcome this problem, we propose a newbackground generation method using mean-shift and Fast Marching Method (FMM) to use pixel information along temporal and spatial dimensions. The mode of pixel value density along time axis is estimated by mean-shift algorithm and spatial information is evaluated by FMM, and then they are used together to generate a desirable background in the existence of non-moving objects during longer period. Experimental results show that our proposed method is more efficient than the traditional method.

A Field Application of 3D Seismic Traveltime Tomography (II);Application of 3D Seismic Traveltime Tomography to a dam-planned area (3차원 탄성파 토모그래피의 현장 적용 (II);댐 예정지에서의 3차원 토모그래피 적용 사례)

  • Moon, Yoon-Sup;Ha, Hee-Sang;Ko, Kwang-Buem;Kim, Ji-Soo
    • Tunnel and Underground Space
    • /
    • v.18 no.4
    • /
    • pp.263-271
    • /
    • 2008
  • 3D seismic tomography technique was assessed for applicability of developed 3D tomography algorithm based on Fresnel volume in the dam-planned area. Reconstructed 3D tomogram based on Fresnel volume and Fast Marching Method(FMM) reveals similar velocity structure to the other geotechnical survey results. With the correlation analysis between RMR data and seismic velocity information, it could provide reliable information of rock mass rate. The applicability of 3D seismic tomography was verified in this study. It would be expected to apply 3D tomography with new developed first arrival calculation and inversion algorithm to the engineering field economically.

Numerical Prediction of Rotor Tip-Vortex Roll-Up in Axial Flights by Using a Time-Marching Free-Wake Method

  • Chung, Ki-Hoon;Na, Seon-Uk;Jeon, Wan-Ho;Lee, Duck-Joo
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.1 no.1
    • /
    • pp.1-12
    • /
    • 2000
  • The wake geometries of a two-bladed rotor in axial flights using a time-marching free-wake method without a non-physical model of the far wake are calculated. The computed free-wake geometries of AH-1G model rotor in climb flight are compared with the experimental visualization results. The time-marching free-wake method can predict the behavior of the tip vortex and the wake roil-up phenomena with remarkable agreements. Tip vortices shed from the two-bladed rotor can interact with each other significantly. The interaction consists of a turn of the tip vortex from one blade rolling around the tip vortex from the other. Wake expansion of wake geometries in radial direction after the contraction is a result of adjacent tip vortices begging to pair together and spiral about each other. Detailed numerical results show regular pairing phenomenon in the climb flights, the hover at high angle of attack and slow descent flight too. On the contrary, unstable motions of wake are observed numerically in the hover at low angle of attack and fast descent flight. It is because of the inherent wake instability and blade-vortex-interaction rather then the effect of recirculation due to the experimental equipment.

  • PDF

A Field Application of 3D Seismic Traveltime Tomography (I) - Constitution of 3D Seismic Traveltime Tomography Algorithm - (3차원 탄성파 토모그래피의 현장 적용 (1) - 3차원 토모그래피 알고리즘의 구성 -)

  • Moon, Yoon-Sup;Ha, Hee-Sang;Ko, Kwang-Buem;Kim, Ji-Soo
    • Tunnel and Underground Space
    • /
    • v.18 no.3
    • /
    • pp.202-213
    • /
    • 2008
  • In this study, theoretical approach of 3D seismic traveltime tomography was investigated. To guarantee the successful field application of 3D tomography, appropriate control of problem associated with blind zone is pre-requisite. To overcome the velocity distortion of the reconstructed tomogram due to insufficient source-receiver array coverage, the algorithm of 3D seismic traveltime tomography based on the Fresnel volume was developed as a technique of ray-path broadening. For the successful reconstruction of velocity cube, 3D traveltime algorithm was explored and employed on the basis of 2nd order Fast Marching Method(FMM), resulting in improvement of precision and accuracy. To prove the validity and field application of this algorithm, two numerical experiments were performed for globular and layered models. The algorithm was also found to be successfully applicable to field data.

An Efficient Polygonal Surface Reconstruction (효율적인 폴리곤 곡면 재건 알고리즘)

  • Park, Sangkun
    • Journal of Institute of Convergence Technology
    • /
    • v.10 no.1
    • /
    • pp.7-12
    • /
    • 2020
  • We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

Spatial Gap-Filling of Hourly AOD Data from Himawari-8 Satellite Using DCT (Discrete Cosine Transform) and FMM (Fast Marching Method)

  • Youn, Youjeong;Kim, Seoyeon;Jeong, Yemin;Cho, Subin;Kang, Jonggu;Kim, Geunah;Lee, Yangwon
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.4
    • /
    • pp.777-788
    • /
    • 2021
  • Since aerosol has a relatively short duration and significant spatial variation, satellite observations become more important for the spatially and temporally continuous quantification of aerosol. However, optical remote sensing has the disadvantage that it cannot detect AOD (Aerosol Optical Depth) for the regions covered by clouds or the regions with extremely high concentrations. Such missing values can increase the data uncertainty in the analyses of the Earth's environment. This paper presents a spatial gap-filling framework using a univariate statistical method such as DCT-PLS (Discrete Cosine Transform-based Penalized Least Square Regression) and FMM (Fast Matching Method) inpainting. We conducted a feasibility test for the hourly AOD product from AHI (Advanced Himawari Imager) between January 1 and December 31, 2019, and compared the accuracy statistics of the two spatial gap-filling methods. When the null-pixel area is not very large (null-pixel ratio < 0.6), the validation statistics of DCT-PLS and FMM techniques showed high accuracy of CC=0.988 (MAE=0.020) and CC=0.980 (MAE=0.028), respectively. Together with the AI-based gap-filling method using extra explanatory variables, the DCT-PLS and FMM techniques can be tested for the low-resolution images from the AMI (Advanced Meteorological Imager) of GK2A (Geostationary Korea Multi-purpose Satellite 2A), GEMS (Geostationary Environment Monitoring Spectrometer) and GOCI2 (Geostationary Ocean Color Imager) of GK2B (Geostationary Korea Multi-purpose Satellite 2B) and the high-resolution images from the CAS500 (Compact Advanced Satellite) series soon.

Volume Data Modeling by Using Wavelets Transformation and Tetrahedrization (웨이브렛 변환과 사면체 분할을 이용한 볼륨 데이터 모델링)

  • Gwun, Ou-Bong;Lee, Kun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1081-1089
    • /
    • 1999
  • Volume data modeling is concerned with finding a mathematical function which represents the relationship implied by the 3D data. Modeling a volume data geometrically can visualize a volume data using surface graphics without voxelization. It has many merits in that it is fast and requires little memory. We proposes, a method based on wavelet transformation and tetrahedrization. we implement a prototype system based on the proposed method. Last, we evaluated the proposed method comparing it with marching cube algorithm. the evaluation results show that though the proposed method uses only 13% of the volume data, the images generated is as good as the images generated by the marching cubes algorithm.

  • PDF

Confocal Microscopy Image Segmentation and Extracting Structural Information for Morphological Change Analysis of Dendritic Spine (수상돌기 소극체의 형태변화 분석을 위한 공초점현미경 영상 분할 및 구조추출)

  • Son, Jeany;Kim, Min-Jeong;Kim, Myoung-Hee
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.167-174
    • /
    • 2008
  • The introduction of confocal microscopy makes it possible to observe the structural change of live neuronal cell. Neuro-degenerative disease, such as Alzheimer;s and Parkinson’s diseases are especially related to the morphological change of dendrite spine. That’s the reason for the study of segmentation and extraction from confocal microscope image. The difficulty comes from uneven intensity distribution and blurred boundary. Therefore, the image processing technique which can overcome these problems and extract the structural information should be suggested. In this paper, we propose robust structural information extracting technique with confocal microscopy images of dendrite in brain neurons. First, we apply the nonlinear diffusion filtering that enhance the boundary recognition. Second, we segment region of interest using iterative threshold selection. Third, we perform skeletonization based on Fast Marching Method that extracts centerline and boundary for analysing segmented structure. The result of the proposed method has been less sensitive to noise and has not been affected by rough boundary condition. Using this method shows more accurate and objective results.

  • PDF

Thangka Image Inpainting Algorithm Based on Wavelet Transform and Structural Constraints

  • Yao, Fan
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1129-1144
    • /
    • 2020
  • The thangka image inpainting method based on wavelet transform is not ideal for contour curves when the high frequency information is repaired. In order to solve the problem, a new image inpainting algorithm is proposed based on edge structural constraints and wavelet transform coefficients. Firstly, a damaged thangka image is decomposed into low frequency subgraphs and high frequency subgraphs with different resolutions using wavelet transform. Then, the improved fast marching method is used to repair the low frequency subgraphs which represent structural information of the image. At the same time, for the high frequency subgraphs which represent textural information of the image, the extracted and repaired edge contour information is used to constrain structure inpainting in the proposed algorithm. Finally, the texture part is repaired using texture synthesis based on the wavelet coefficient characteristic of each subgraph. In this paper, the improved method is compared with the existing three methods. It is found that the improved method is superior to them in inpainting accuracy, especially in the case of contour curve. The experimental results show that the hierarchical method combined with structural constraints has a good effect on the edge damage of thangka images.

CONVERGENCE CHARACTERISTICS OF MULTI-STAGE RUNGE-KUTTA METHODS IN INCOMPRESSIBLE VISCOUS FLOW COMPUTATIONS (비압축성 점성유동 해석에서의 Multi-Stage Runge-Kutta 기법의 수렴특성 연구)

  • Park Won C.;Moon Young J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.73-80
    • /
    • 1997
  • Objective of the present study is to examine the convergence characteristics of the various multi-stage Runge-Kutta methods in solving the incompressible Navier-Stokes equations of a time-marching from casted by the artificial compressibility method. Convergence characteristics are examined over 2-stage, 4-stage and hybrid type (using 4-, 3-, 2-stages sequentially) Runge-Kutta methods for a laminar lid-driven cavity flow, and also for a turbulent bump channel flow using Chien's low-Reynolds number turbulence model. Efforts are made to establish a stable and fast convergent multi-stage Runge-Kutta method with minimal artificial dissipations.

  • PDF