• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2004.10a
• /
• pp.79-82
• /
• 2004

In this study, a new refinement technique for 3-dimensional hexahedral element mesh is proposed, which is aimed at the control of mesh density. With the proposed scheme the mesh is refined adaptively to the elemental error which is estimated by 'a posteriori' error estimator based on the energy norm. A desired accuracy of an analysis i.e. a limit of error defines the new desired mesh density map on the current mesh. To obtain the desired mesh density, the refinement procedure is repeated iteratively until no more elements to be refined exist. In the algorithm, at first the regions of mesh to be refined are defined and, then, the zero-thickness element layers are inserted into the interfaces between the regions. All the meshes in the regions, in which the zero-thickness layers are inserted, are to be regularized in order to improve the shape of the slender elements on the interfaces. This algorithm is tested on a simple shape of 2-d quadrilateral element mesh and 3-d hexahedral element mesh. A numerical example of elastic deformation of a plate with a hole shows the effectiveness of the proposed refinement scheme.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.6
• /
• pp.988-994
• /
• 1997

The demands for robotic and automatic system are continually increasing in manufacturing fields. There have been many studies to monitor and predict the system, but they have mainly focused upon measuring cutting force, and current of motor spindle, and upon using acoustic sensor, etc. In this study, digital image of time series sequence was acquired by taking advantage of optical technique. Mean square error was obtained from it and was available for useful observation data. The parameter was estimated using PAA(parameter adaptation algorithm) from observation data. AR(auto regressive) model was selected for system model and fifth order was decided according to parameter estimation. Uncorrelation test was also carried out to verify convergence of parameter. Through the proceedings, it was found that there was a system stability.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.6
• /
• pp.1004-1014
• /
• 2001

The fully automatic algorithm from initial finite element mesh generation to remeshing in two dimensional geometry is introduced using bubble packing method (BPM) for finite element analysis. BPM determines the node placement by force-balancing configuration of bubbles and the triangular meshes are made by Delaunay triangulation with advancing front concept. In BPM, we suggest two node-search algorithms and the adaptive/recursive bubble controls to search the optimal nodal position. To use the automatically generated mesh information in FEA, the new enhanced bandwidth minimization scheme with high efficiency in CPU time is developed. In the remeshing stage, the mesh refinement is incorporated by the control of bubble size using two parameters. And Superconvergent Patch Recovery (SPR) technique is used for error estimation. To verify the capability of this algorithm, we consider two elasticity problems, one is the bending problem of short cantilever beam and the tension problem of infinite plate with hole. The numerical results indicate that the algorithm by BPM is able to refine the mesh based on a posteriori error and control the mesh size easily by two parameters.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.10
• /
• pp.7061-7070
• /
• 2015

Multi-Response Surface Optimization aims at finding the optimal setting of input variables considering multiple responses simultaneously. The Weighted Mean Squared Error (WMSE) minimization approach, which imposes a different weight on the two components of mean squared error, squared bias and variance, first obtains WMSE for each response and then minimizes all the WMSEs at once. Most of the methods proposed for the WMSE minimization approach to date are classified into the prior preference articulation approach, which requires that a decision maker (DM) provides his/her preference information a priori. However, it is quite difficult for the DM to provide such information in advance, because he/she cannot experience the relationships or conflicts among the responses. To overcome this limitation, this paper proposes a posterior preference articulation method to the WMSE minimization approach. The proposed method first generates all (or most) of the nondominated solutions without the DM's preference information. Then, the DM selects the best one from the set of nondominated solutions a posteriori. Its advantage is that it provides an opportunity for the DM to understand the tradeoffs in the entire set of nondominated solutions and effectively obtains the most preferred solution suitable for his/her preference structure.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.19 no.4 s.74
• /
• pp.429-440
• /
• 2006

This paper comprises two specific objectives. The first is to examine the applicability of ordinary kriging interpolation(OK) to the p-adaptivity of the finite element method that is based on variogram modeling. The second objective Is to present the adaptive procedure by the hierarchical p-refinement in conjunction with a posteriori error estimator using the modified S.P.R. (superconvergent patch recovery) method. The ordinary kriging method that is one of weighted interpolation techniques is applied to obtain the estimated exact solution from the stress data at the Gauss points. The weight factor is determined by experimental and theoretical variograms for interpolation of stress data apart from the conventional interpolation methods that use an equal weight factor. In the p-refinement, the analytical domain has to be refined automatically to obtain an acceptable level of accuracy by increasing the p-level non-uniformly or selectively. To verify the performance of the modified S.P.R. method, the new error estimator based on limit value has been proposed. The validity of the proposed approach has been tested with the help of some benchmark problems of linear elastic fracture mechanics such as a centrally cracked panel, a single edged crack, and a double edged crack.

• Journal of Korean Association for Spatial Structures
• /
• v.8 no.4
• /
• pp.81-90
• /
• 2008

This paper presents a finite element formulation for the three-dimensional hierarchical solid element using Integrals of Legendre polynomials. The proposed hexahedral solid element is composed of four different modes including vertex, edge, face, and internal mode, respectively. The eigenvalue and patch test have been carried out to confirm the zero-energy mode and constant strain condition. In addition to these, a posteriori error estimation has been studied for the p-adaptive finite element analysis that is based on a smoothing technique to compute a post-processed solution from the finite element solution. The uniform p-refinement and non-uniform p-refinement are compared in terms of convergence rate as the number of degree of freedom is increased. The simple cantilever beam is tested to show the performance of the proposed solid element.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.4
• /
• pp.11-19
• /
• 2016

In this paper, we propose an automatic segmentation method of renal parenchyma on abdominal CT image using graph-cuts with shape constraint based on multi-probabilistic atlas. The proposed method consists of following three steps. First, to use the various shape information of renal parenchyma, multi-probabilistic atlas is generated by cortex-based similarity registration. Second, initial seeds for graph-cuts are extracted by maximum a posteriori (MAP) estimation and renal parenchyma is segmented by graph-cuts with shape constraint. Third, to reduce alignment error of probabilistic atlas and increase segmentation accuracy, registration and segmentation are iteratively performed. To evaluate the performance of proposed method, qualitative and quantitative evaluation are performed. Experimental results show that the proposed method avoids a leakage into neighbor regions with similar intensity of renal parenchyma and shows improved segmentation accuracy.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.1-8
• /
• 2006

In this paper, we propose carrier phase synchronization algorithm which are base on turbo coded system for DVB-RCS. There have been two categories of phase estimator, single estimator outside turbo code decoder and multiple estimators inside turbo code decoder. In single estimator, we use the estimation algorithm that ML(Maximum Likelihood) and LMS(Least Mean Square), also three different soft decision methods are proposed. Multiple estimator apply PSP(Per Survivor Processing) algorithm additionally. We compared performance between single estimator and Multiple estimator in AWGN channel. We presented the two methods of PSP algorithm for performance elevation. First is the Bi-directional channel estimation and second is binding method.

• Journal of Biomedical Engineering Research
• /
• v.21 no.5
• /
• pp.441-448
• /
• 2000

방출단층영상 재구성을 위한 최대우도 기대값최대화(maximum likelihood expectation maximization, MLEM) 방법은 영상 획득과정을 통계학적으로 모델링하여 영상을 재구성한다. MLEM은 일반적으로 사용하여 여과후역투사(filtered backprojection)방법에 비해 많은 장점을 가지고 있으나 반복횟수 증가에 따른 발산과 재구성 시간이 오래 걸리는 단점을 가지고 있다. 이 논문에서는 이러한 단점을 보완하기 위해 계산시간을 현저히 단축시킨 배열된부분집합 기대값최대화(ordered subsets expectation maximization. OSEM)에 Gibbs 선행치인 membrance (MM) 또는 thin plate(TP)을 첨가한 OSEM-MAP (maximum a posteriori)을 구현함으로써 알고리즘의 안정성 및 재구성된 영상의 질을 향상시키고자 g나다. 실험에서 알고리즘의 수렴시간을 가속화하기 위해 투사 데이터를 16개의 부분집합으로 분할하여 반복연산을 수행하였으며, 알고리즘의 성능을 비교하기 위해 소프트웨어 모형(원숭이 뇌 자가방사선, 수학적심장흉부)을 사용한 영상재구성 결과를 제곱오차로 비교하였다. 또한 알고리즘의 사용 가능성을 평가하기 위해 물리모형을 사용하여 PET 기기로부터 획득한 실제 투사 데이터를 사용하였다.

• The Korean Journal of Nuclear Medicine
• /
• v.39 no.6
• /
• pp.464-472
• /
• 2005

Purpose: SPECT using a fan-beam collimator improves spatial resolution and sensitivity. For the reconstruction from fan-beam projections, it is necessary to implement direct fan-beam reconstruction methods without transforming the data into the parallel geometry. In this study, various fan-beam reconstruction algorithms were implemented and their performances were compared. Materials and Methods: The projector for fan-beam SPECT was implemented using a ray-tracing method. The direct reconstruction algorithms implemented for fan-beam projection data were FBP (filtered backprojection), EM (expectation maximization), OS-EM (ordered subsets EM) and MAP-EM OSL (maximum a posteriori EM using the one-step late method) with membrane and thin-plate models as priors. For comparison, the fan-beam protection data were also rebinned into the parallel data using various interpolation methods, such as the nearest neighbor, bilinear and bicubic interpolations, and reconstructed using the conventional EM algorithm for parallel data. Noiseless and noisy projection data from the digital Hoffman brain and Shepp/Logan phantoms were reconstructed using the above algorithms. The reconstructed images were compared in terms of a percent error metric. Results: for the fan-beam data with Poisson noise, the MAP-EM OSL algorithm with the thin-plate prior showed the best result in both percent error and stability. Bilinear interpolation was the most effective method for rebinning from the fan-beam to parallel geometry when the accuracy and computation load were considered. Direct fan-beam EM reconstructions were more accurate than the standard EM reconstructions obtained from rebinned parallel data. Conclusion: Direct fan-beam reconstruction algorithms were implemented, which provided significantly improved reconstructions.