• Title/Summary/Keyword: Iterative refinement

Search Result 36, Processing Time 0.023 seconds

Anterior Cruciate Ligament Segmentation in Knee MRI with Locally-aligned Probabilistic Atlas and Iterative Graph Cuts (무릎 자기공명영상에서 지역적 확률 아틀라스 정렬 및 반복적 그래프 컷을 이용한 전방십자인대 분할)

  • Lee, Han Sang;Hong, Helen
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1222-1230
    • /
    • 2015
  • Segmentation of the anterior cruciate ligament (ACL) in knee MRI remains a challenging task due to its inhomogeneous signal intensity and low contrast with surrounding soft tissues. In this paper, we propose a multi-atlas-based segmentation of the ACL in knee MRI with locally-aligned probabilistic atlas (PA) in an iterative graph cuts framework. First, a novel PA generation method is proposed with global and local multi-atlas alignment by means of rigid registration. Second, with the generated PA, segmentation of the ACL is performed by maximum-aposteriori (MAP) estimation and then by graph cuts. Third, refinement of ACL segmentation is performed by improving shape prior through mask-based PA generation and iterative graph cuts. Experiments were performed with a Dice similarity coefficients of 75.0%, an average surface distance of 1.7 pixels, and a root mean squared distance of 2.7 pixels, which increased accuracy by 12.8%, 22.7%, and 22.9%, respectively, from the graph cuts with patient-specific shape constraints.

Vertex Selection Scheme for Shape Approximation Based on Dynamic Programming (동적 프로그래밍에 기반한 윤곽선 근사화를 위한 정점 선택 방법)

  • 이시웅;최재각;남재열
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.3
    • /
    • pp.121-127
    • /
    • 2004
  • This paper presents a new vertex selection scheme for shape approximation. In the proposed method, final vertex points are determined by "two-step procedure". In the first step, initial vertices are simply selected on the contour, which constitute a subset of the original contour, using conventional methods such as an iterated refinement method (IRM) or a progressive vertex selection (PVS) method In the second step, a vertex adjustment Process is incorporated to generate final vertices which are no more confined to the contour and optimal in the view of the given distortion measure. For the optimality of the final vertices, the dynamic programming (DP)-based solution for the adjustment of vertices is proposed. There are two main contributions of this work First, we show that DP can be successfully applied to vertex adjustment. Second, by using DP, the global optimality in the vertex selection can be achieved without iterative processes. Experimental results are presented to show the superiority of our method over the traditional methods.

Stability Analysis of Turbo Compressor Rotor Considering the Contact Phenomena (접촉을 고려한 터보 압축기 로터의 안정성 해석)

  • Lee, Seung-Pyo;Koh, Byung-Kab
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.16 no.3
    • /
    • pp.75-80
    • /
    • 2007
  • It is necessary to analyze the contact phenomena in order to effectively design the machine components with contact surfaces. In general, the contact action is highly nonlinear and irreversible because we cannot predict the contact regions and conditions. Recently, the finite element method is used to analyze the contact problem. In this paper, the contact element method is applied to avoid the mesh refinement and iterative calculation of general contact algorithms. By use of it, the deformation and stress concentration of turbo compressor rotor are computed. It shown that the contact element is convenient analysis and the results are relatively accurate.

AN ITERATION SCHEMES FOR NONEXPANSIVE MAPPINGS AND VARIATIONAL INEQUALITIES

  • Wang, Hong-Jun;Song, Yi-Sheng
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.5
    • /
    • pp.991-1002
    • /
    • 2011
  • An iterative algorithm is provided to find a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of some variational inequality in a Hilbert space. Using this result, we consider a strong convergence result for finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping. Our results include the previous results as special cases and can be viewed as an improvement and refinement of the previously known results.

Robust Planar Tracking Based on Iterative Homography Refinement (반복적 호모그래피 개선에 의한 강건한 평면 추적)

  • Kim, Karam;Park, Jungsik;Park, Hanhoon;Park, Jong-Il
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.302-305
    • /
    • 2012
  • 평면 추적(planar tracking) 기반의 카메라 추적에 있어, 특징 검출자의 반복성과 특징 기술자(descriptor)의 정합 성능에 따라서 떨림 현상(jitter)이 발생한다. 특히, 모바일 환경에서와 같은 연산력이 부족한 환경에서 고속화를 위해 특징 검출 및 기술 알고리즘을 간략화 시킬 경우, 이러한 떨림 현상은 심각한 문제가 된다. 본 논문에서는 이러한 문제를 해결하기 위해 입력 영상을 워핑(warping)하여 특징 점을 재검출한 후 카메라 영상과 참조 영상(reference image) 사이의 호모그래피를 보완하는 방법을 제안한다. 실험을 통해 제안된 방법이 특징 검출 및 기술 알고리즘의 성능을 보완하여 떨림 현상을 크게(70% 이상) 감소시킴을 확인하였다.

  • PDF

An Automated Adaptive Finite Element Mesh Generation for Dynamics

  • Yoon, Chongyul
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.23 no.1
    • /
    • pp.83-88
    • /
    • 2019
  • Structural analysis remains as an essential part of any integrated civil engineering system in today's rapidly changing computing environment. Even with enormous advancements in capabilities of computers and mobile tools, enhancing computational efficiency of algorithms is necessary to meet the changing demands for quick real time response systems. The finite element method is still the most widely used method of computational structural analysis; a robust, reliable and automated finite element structural analysis module is essential in a modern integrated structural engineering system. To be a part of an automated finite element structural analysis, an efficient adaptive mesh generation scheme based on R-H refinement for the mesh and error estimates from representative strain values at Gauss points is described. A coefficient that depends on the shape of element is used to correct overly distorted elements. Two simple case studies show the validity and computational efficiency. The scheme is appropriate for nonlinear and dynamic problems in earthquake engineering which generally require a huge number of iterative computations.

A chord error conforming tool path B-spline fitting method for NC machining based on energy minimization and LSPIA

  • He, Shanshan;Ou, Daojiang;Yan, Changya;Lee, Chen-Han
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.4
    • /
    • pp.218-232
    • /
    • 2015
  • Piecewise linear (G01-based) tool paths generated by CAM systems lack $G_1$ and $G_2$ continuity. The discontinuity causes vibration and unnecessary hesitation during machining. To ensure efficient high-speed machining, a method to improve the continuity of the tool paths is required, such as B-spline fitting that approximates G01 paths with B-spline curves. Conventional B-spline fitting approaches cannot be directly used for tool path B-spline fitting, because they have shortages such as numerical instability, lack of chord error constraint, and lack of assurance of a usable result. Progressive and Iterative Approximation for Least Squares (LSPIA) is an efficient method for data fitting that solves the numerical instability problem. However, it does not consider chord errors and needs more work to ensure ironclad results for commercial applications. In this paper, we use LSPIA method incorporating Energy term (ELSPIA) to avoid the numerical instability, and lower chord errors by using stretching energy term. We implement several algorithm improvements, including (1) an improved technique for initial control point determination over Dominant Point Method, (2) an algorithm that updates foot point parameters as needed, (3) analysis of the degrees of freedom of control points to insert new control points only when needed, (4) chord error refinement using a similar ELSPIA method with the above enhancements. The proposed approach can generate a shape-preserving B-spline curve. Experiments with data analysis and machining tests are presented for verification of quality and efficiency. Comparisons with other known solutions are included to evaluate the worthiness of the proposed solution.

Saw-tooth softening/stiffening - a stable computational procedure for RC structures

  • Rots, Jan G.;Invernizzi, Stefano;Belletti, Beatrice
    • Computers and Concrete
    • /
    • v.3 no.4
    • /
    • pp.213-233
    • /
    • 2006
  • Over the past years techniques for non-linear analysis have been enhanced significantly via improved solution procedures, extended finite element techniques and increased robustness of constitutive models. Nevertheless, problems remain, especially for real world structures of softening materials like concrete. The softening gives negative stiffness and risk of bifurcations due to multiple cracks that compete to survive. Incremental-iterative techniques have difficulties in selecting and handling the local peaks and snap-backs. In this contribution, an alternative method is proposed. The softening diagram of negative slope is replaced by a saw-tooth diagram of positive slopes. The incremental-iterative Newton method is replaced by a series of linear analyses using a special scaling technique with subsequent stiffness/strength reduction per critical element. It is shown that this event-by-event strategy is robust and reliable. First, the model is shown to be objective with respect to mesh refinement. Next, the example of a large-scale dog-bone specimen in direct tension is analyzed using an isotropic version of the saw-tooth model. The model is capable of automatically providing the snap-back response. Subsequently, the saw-tooth model is extended to include anisotropy for fixed crack directions to accommodate both tensile cracking and compression strut action for reinforced concrete. Three different reinforced concrete structures are analyzed, a tension-pull specimen, a slender beam and a slab. In all cases, the model naturally provides the local peaks and snap-backs associated with the subsequent development of primary cracks starting from the rebar. The secant saw-tooth stiffness is always positive and the analysis always 'converges'. Bifurcations are prevented due to the scaling technique.

Fast Algorithm for the Capacitance Extraction of Large Three Dimensional Object (대용량 3차원 구조의 정전용량 계산을 위한 Fast Algorithm)

  • Kim, Han;Ahn, Chang-Hoi
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.1
    • /
    • pp.27-32
    • /
    • 2003
  • This paper describes to extend the fast algorithm fur the capacitance extraction of large three-dimensional object. The triangular meshes are used and refined adaptively in the area where the heavy charges reside in each iterative solving. This technique is applied to the capacitance extraction of a 68-pin cerquad package. The results show fast convergence, and this adaptive technique coupled with the fast algorithm is efficient to reduce the number of elements and computing time with least additional computational efforts in large three dimensional problems.

A Tailless UAV Multidisciplinary Design Optimization Using Global Variable Fidelity Modeling

  • Tyan, Maxim;Nguyen, Nhu Van;Lee, Jae-Woo
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.18 no.4
    • /
    • pp.662-674
    • /
    • 2017
  • This paper describes the multidisciplinary design optimization (MDO) process of a tailless unmanned combat aerial vehicle (UCAV) using global variable fidelity aerodynamic analysis. The developed tailless UAV design framework combines multiple disciplines that are based on low-fidelity and empirical analysis methods. An automated high-fidelity aerodynamic analysis is efficiently integrated into the MDO framework. Global variable fidelity modeling algorithm manages the use of the high-fidelity analysis to enhance the overall accuracy of the MDO by providing the initial sampling of the design space with iterative refinement of the approximation model in the neighborhood of the optimum solution. A design formulation was established considering a specific aerodynamic, stability and control design features of a tailless aircraft configuration with a UCAV specific mission profile. Design optimization problems with low-fidelity and variable fidelity analyses were successfully solved. The objective function improvement is 14.5% and 15.9% with low and variable fidelity optimization respectively. Results also indicate that low-fidelity analysis overestimates the value of lift-to-drag ratio by 3-5%, while the variable fidelity results are equal to the high-fidelity analysis results by algorithm definition.