• Title/Summary/Keyword: 수렴점

Search Result 615, Processing Time 0.026 seconds

An Improved Subspace Iteration Method for Structures with Multiple Natural Frequencies (중복근을 갖는 구조물에 대한 개선된 부분공간 반복법)

  • Jung, Hyung-Jo;Park, Sun-Kyu;Lee, In-Won
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.12 no.3
    • /
    • pp.371-383
    • /
    • 1999
  • An efficient and numerically stable eigensolution method for structures with multiple natural frequencies is presented. The proposed method is developed by improving the well-known subspace iteration method with shift. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. In this paper, the above singularity problem has been solved by introducing side conditions without sacrifice of convergence. The proposed method is always nonsingular even if a shift is on a distinct eigenvalue or multiple ones. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

  • PDF

Improvement of Active Contour Model for Detection of Pulmonary Region in Medical Image (의학 영상에서 폐 영역 검출을 위한 Active Contour 모델 개선)

  • Kwon Y. J.;Won C. H.;Park H. J.;Lee J. H.;Lee S. H.;Cho J. H.
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.3
    • /
    • pp.336-344
    • /
    • 2005
  • In this paper, we extracted the contour of lung parenchyma on EBT images with the improved active contour model. The objects boundary in conventional active contour model can be extracted by controlling internal energy and external energy as energy minimizing form. However, there are a number of problems such as initialization and the poor convergence about concave part. Expecially, contour can not enter the concave region by discouraging characteristic about stretching and bending in internal energy. We controlled internal energy by moving local perpendicular bisector point of each control point in the contour and implemented the object boundary by minimizing energy with external energy The convergence of concave part could be efficiently implemented toward lung parenchyma region by this internal energy and both lung images for initial contour could also be detected by multi-detection method. We were sure this method could be applied detection of lung parenchyma region in medical image.

  • PDF

Fast Simulated Annealing with Greedy Selection (Greedy 선택방법을 적용한 빠른 모의 담금질 방법)

  • Lee, Chung-Yeol;Lee, Sun-Young;Lee, Soo-Min;Lee, Jong-Seok;Park, Cheol-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.14B no.7
    • /
    • pp.541-548
    • /
    • 2007
  • Due to the mathematical convergence property, Simulated Annealing (SA) has been one of the most popular optimization algorithms. However, because of its problem of slow convergence in the practical use, many variations of SA like Fast SA (FSA) have been developed for faster convergence. In this paper, we propose and prove that Greedy SA (GSA) also finds the global optimum in probability in the continuous space optimization problems. Because the greedy selection does not allow the cost to become worse, GSA is expected to have faster convergence than the conventional FSA that uses Metropolis selection. In the computer simulation, the proposed method is shown to have as good performance as FSA with Metropolis selection in the viewpoints of the convergence speed and the quality of the found solution. Furthermore, the greedy selection does not concern the cost value itself but uses only dominance of the costs of solutions, which makes GSA invariant to the problem scaling.

A New Approach for Hierarchical Optimization of Large Scale Non-linear Systems (대규모 비선형 시스템의 새로운 계층별 최적제어)

  • Park, Joon-Hoon;Kim, Jong-Boo
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.2
    • /
    • pp.21-31
    • /
    • 1999
  • This paper presents a new possibility of calculating optimal control for large scale which consist of non-linear dynamic sub-systems using two level hierarchical structures method. And the proposed method is based on the idea of block pulse transformation to simplify the algorithm and its calculation. This algorithm used an expansion around the equilibrium point of the system to fix the second and higher order terms. These terms are compensated for iteratively at the second level by providing a prediction for the states and controls which form of a part of the higher order terms. In this new approach the quadratic penalty terms are not used in the cost function. This allows convergence over a longer time horizon and also provides faster convergence. And the method is applied to the problem of optimization of the synchronous machine. Results show that the new approach is superior to conventional numerical method or other previous algorithm.

  • PDF

Convergence Property Analysis of Multiple Modulus Self-Recovering Equalization According to Error Dynamics Boosting (다중 모듈러스 자기복원 등화의 오차 역동성 증강에 따른 수렴 특성 분석)

  • Oh, Kil Nam
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.1
    • /
    • pp.15-20
    • /
    • 2016
  • The existing multiple modulus-based self-recovering equalization type has not been applied to initial equalization. Instead, it was used for steady-state performance improvement. In this paper, for the self-recovering equalization type that considers the multiple modulus as a desired response, the initial convergence performance was improved by extending the dynamics of the errors using error boosting and their characteristics were analyzed. Error boosting in the proposed method was carried out in proportion to a symbol decision for the equalizer output. Furthermore, having the initial convergence capability by extending the dynamics of errors, it showed excellent performance in the initial convergence rate and steady-state error level. In particular, the proposed method can be applied to the entire process of equalization through a single algorithm; the existing methods of switching over or the selection of other operation modes, such as concurrent operating with other algorithms, are not necessary. The usefulness of the proposed method was verified by simulations performed under the channel conditions with multipath propagation and additional noise, and for performance analysis of self-recovering equalization for high-order signal constellations.

Camera Extrinsic Parameter Estimation using 2D Homography and Nonlinear Minimizing Method based on Geometric Invariance Vector (기하학적 불변벡터 기탄 2D 호모그래피와 비선형 최소화기법을 이용한 카메라 외부인수 측정)

  • Cha, Jeong-Hee
    • Journal of Internet Computing and Services
    • /
    • v.6 no.6
    • /
    • pp.187-197
    • /
    • 2005
  • In this paper, we propose a method to estimate camera motion parameter based on invariant point features, Typically, feature information of image has drawbacks, it is variable to camera viewpoint, and therefore information quantity increases after time, The LM(Levenberg-Marquardt) method using nonlinear minimum square evaluation for camera extrinsic parameter estimation also has a weak point, which has different iteration number for approaching the minimal point according to the initial values and convergence time increases if the process run into a local minimum, In order to complement these shortfalls, we, first proposed constructing feature models using invariant vector of geometry, Secondly, we proposed a two-stage calculation method to improve accuracy and convergence by using 2D homography and LM method, In the experiment, we compared and analyzed the proposed method with existing method to demonstrate the superiority of the proposed algorithms.

  • PDF

A Study on the providing urban planing information in the homepage of local governments (지방자치단체 홈페이지의 도시계획정보 제공실태 평가를 위한 지표개발 연구)

  • 최봉문
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.05a
    • /
    • pp.237-244
    • /
    • 2003
  • With the rapid development of information and communication technologies(ICTs) and internet technology and the explosive increasing of internet users, we can find almost every municipal information of local governments by visiting the home page without visiting the city hall personally. And in the case of urban planning information they provide many kinds of information to inform the policy and results of urban planning to citizens The differences of urban planning information from other municipal information, at first many information of urban planning should be presented as spatial data, so we have to provide the geographic information with internet GIS, and second to realize bottom-up decision making process the exchanging of information between citizen and government should be adopted as bulletin board system(BBS) and an questionnaire in internet In this paper I evaluated the sites of urban planning information in the homepage of local governments by many index. the index are composed with 4 categories 20 items on information providing, 3 categories 12 items on communication, and 2 categories 8 items on internet GIS. And as a result I introduce some high scored sites at each category, and propose that we have to recognize the internet as the technological media to broaden the opportunities for the community people to participate in the policy-making in reference to their political demands.

  • PDF

A Study on the Index to Evaluate the Homepage of Local Governments on the Scope of the Urban Planning Information (지방자치단체 홈페이지에서 도시계획관련 정보의 제공 실태 분석연구)

  • 최봉문
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.4
    • /
    • pp.77-85
    • /
    • 2003
  • With the rapid development of information and communication technologies(ICTs) and the explosive increasing of inter net users, we can find municipal information in Internet Homepage of local governments without visiting City Hall. And most part of municipal information are related with urban planning and geographic information. In this paper 1try to propose the index to evaluate the sites of urban planning information in the homepage of local governments which are classified 3 Groups. The first group is called information providing and composed with 4 categories and 20 items. The second Group is Communication between local government and citizens with 3 categories (12 items). And the third Group is Internet GIS with 2 categories (8 items). And 1 propose that we have to recognize the internet as the technological media to broaden the opportunities for the community people to participate in the policy-making in reference to their political demands.

  • PDF

Improvement of the Convergence Capability of a Single Loop Single Vector Approach Using Conjugate Gradient for a Concave Function (오목한 성능함수에서 공액경사도법을 이용한 단일루프 단일벡터 방법의 수렴성 개선)

  • Jeong, Seong-Beom;Lee, Se-Jung;Park, Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.7
    • /
    • pp.805-811
    • /
    • 2012
  • The reliability based design optimization (RBDO) approach requires high computing cost to consider uncertainties. In order to reduce the design cost, the single loop single vector (SLSV) approach has been developed for RBDO. This method can reduce the cost in calculating deign sensitivity by elimination of the nested optimization process. However, this process causes the increment of the instability or inaccuracy of the method according to the problem characteristics. Therefore, the method may not give accurate solution or the robustness of the solution is not guaranteed. Especially, when the function is concave, the process frequently diverges. In this research, the concept of the conjugate gradient method for unconstrained optimization is utilized to develop a new single loop single vector method. The conjugate gradient is calculated with gradient directions at the most probable points (MPP) of previous cycles. Mathematical examples are solved for the verification of the proposed method. The numeri cal performances of the obtained results are compared to those of other RBDO methods. The SLSV approach using conjugate gradient is not greatly influenced by the problem characteristics and improves its convergence capability.

An Analysis of the Relationship between Public Opinion on Social Bigdata and Results after Implementation of Public Policies: A Case Study in 'Welfare' Policy (소셜 빅데이터 기반 공공정책 국민의견 수렴과 정책 시행 이후 결과 관계 분석: '복지' 정책 사례를 중심으로)

  • Kim, Tae-Young;Kim, Yong;Oh, Hyo-Jung
    • Journal of Digital Convergence
    • /
    • v.15 no.3
    • /
    • pp.17-25
    • /
    • 2017
  • Horizon scanning that one of the methods for future prediction is adaptable way of establishing the policy strategy based on big data. This study aims to understand the social problems scientifically utilized horizon scanning technique, and contribute to public policy formulation based on scanning analysis. In this paper, we proposed a public opinion framework for public policy based on social bigdata, and then confirmed the feasibility this framework by analysis of the relationship between public opinion and results after implementation of public policy. Consequently, based on the analysis, we also drew implications of policy formulation about 'free childcare for under 5-years of age' as an object of study. The method that collects public opinion is very important to effective policy establishment and make contribution to constructing national response systems for social development.