• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1418-1433
• /
• 2019

In computer graphics, 3D mesh segmentation is a challenging research field. This paper presents a 3D mesh model segmentation algorithm that focuses on removing exterior salient parts from the original 3D mesh model based on prominent feature points and marching plane. To begin with, the proposed approach uses multi-dimensional scaling to extract prominent feature points that reside on the tips of each exterior salient part of a given mesh. Subsequently, a set of planes intersect the 3D mesh; one is the marching plane, which start marching from prominent feature points. Through the marching process, local cross sections between marching plane and 3D mesh are extracted, subsequently, its corresponding area are calculated to represent local volumes of the 3D mesh model. As the boundary region of an exterior salient part generally lies on the location at which the local volume suddenly changes greatly, we can simply cut this location with the marching plane to separate this part from the mesh. We evaluated our algorithm on the Princeton Segmentation Benchmark, and the evaluation results show that our algorithm works well for some categories.

• 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.

• 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.

• 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.

• 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.

• 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.

• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.8
• /
• pp.91-97
• /
• 2010

Micro-abrasive Jet Machining is one of the new technology which enables micro-scale machining on the surface of high brittle materials. In this technology it is very important to fabricate a mask that prevents excessive abrasives not to machine un-intend surface. Our previous work introduced the micro-stereolithography technology for the mask fabrication. And is good to not only planar material but also for non-planar materials. But the technology requires a 3 dimensional mask CAD model which is perfectly matched with the surface topology of parent material as an input. Therefore there is strong need to develop an automated modeling technology which produce adequate 3D mask CAD model in fast and simple way. This paper introduces a fast and simple mask modeling algorithm which represents geometry of models in voxel. Input of the modeling system is 2D pattern image, 3D CAD model of parent material and machining parameters for Micro-abrasive Jet Machining. And the output is CAD model of 3D mask which reflects machining parameters and geometry of the parent material. Finally the suggested algorithm is implemented as software and verified by some test cases.

• Fire Science and Engineering
• /
• v.11 no.4
• /
• pp.3-14
• /
• 1997

The smoke filling process for the atrium space containing a fire source is simulated using two types of deterministic fire model : Zone model and Field model. The zone model used is the CFAST(version 1.6) model developed at the Building and Fire Research Laboratories, NIST in the USA. The field model is a self-developed frie field model based on Computational Fluid Dynamic (CFD) theories. This article is focused on finding out the smoke movement and temperature distribution in atrium space which is cubic in shape. For solving the liked set of velocity and pressure equation, the PISO algorithm, which strengthened the velocity-pressure coupling, was used. Since PISO algorithm is a time-marching procedure, computing time si very fast. A computational procedure for predicting velocity and temperature distribution in fire-induced flow is based on the solution, in finite volume method and non-staggered grid system, of 3-dimensional equations for the conservation of mass, momentum, energy, species and so forth. The fire model i.e Zone model and Field model predicted similar results for clear heights and the smoke layer temperature.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.267-273
• /
• 2011

In this paper, we proposed the method to detect brain tumor region in MR images. Our method is composed of 3 parts, detection of tumor slice, detection of tumor region and tumor boundary detection. In the tumor slice detection step, a slice which contains tumor regions is distinguished using symmetric analysis in 3D brain volume. The tumor region detection step is the process to segment the tumor region in the slice distinguished as a tumor slice. And tumor region is finally detected, using spatial feature and symmetric analysis based on the cluster information. The process for detecting tumor slice and tumor region have advantages which are robust for noise and requires less computational time, using the knowledge of the brain tumor and cluster-based on symmetric analysis. And we use the level set method with fast marching algorithm to detect the tumor boundary. It is performed to find the tumor boundary for all other slices using the initial seeds derived from the previous or later slice until the tumor region is vanished. It requires less computational time because every procedure is not performed for all slices.