• 제목/요약/키워드: decomposition-coordination method

검색결과 15건 처리시간 0.019초

Multiscale self-coordination of bidimensional empirical mode decomposition in image fusion

  • An, Feng-Ping;Zhou, Xian-Wei;Lin, Da-Chao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권4호
    • /
    • pp.1441-1456
    • /
    • 2015
  • The bidimensional empirical mode decomposition (BEMD) algorithm with high adaptability is more suitable to process multiple image fusion than traditional image fusion. However, the advantages of this algorithm are limited by the end effects problem, multiscale integration problem and number difference of intrinsic mode functions in multiple images decomposition. This study proposes the multiscale self-coordination BEMD algorithm to solve this problem. This algorithm outside extending the feather information with the support vector machine which has a high degree of generalization, then it also overcomes the BEMD end effects problem with conventional mirror extension methods of data processing,. The coordination of the extreme value point of the source image helps solve the problem of multiscale information fusion. Results show that the proposed method is better than the wavelet and NSCT method in retaining the characteristics of the source image information and the details of the mutation information inherited from the source image and in significantly improving the signal-to-noise ratio.

분야별 하부시스템의 최적화를 통합한 분해기반 MDO 방법론 (A Decomposition Based MDO by Coordination of Disciplinary Subspace Optimization)

  • 정희석;이종수
    • 대한기계학회논문집A
    • /
    • 제26권9호
    • /
    • pp.1822-1830
    • /
    • 2002
  • The paper describes the development of a decomposition based multidisciplinary design optimization (MDO) method that coordinates each of disciplinary subspace optimization (DSO). A multidisciplinary design system considered in the present study is decomposed into a number of subspaces based on their own design objective and constraints associated with engineering discipline. The coupled relations among subspaces are identified by interdisciplinary design variables. Each of subsystem level optimization, that is DSO would be performed in parallel, and the system level coordination is determined by the first order optimal sensitivities of subspace objective functions with respect to interdisciplinary design variables. The central of the present work resides on the formulation of system level coordination strategy and its capability in decomposition based MDO. A fluid-structure coupled design problem is explored as a test-bed to support the proposed MDO method.

모델링 및 전산모사를 통한 연료전지공정의 제어전략에 관한 연구 (Modeling, simulation and control strategy for the fuel cell process)

  • 이상범;이익형;윤인섭
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.1012-1015
    • /
    • 1996
  • This study focuses on the optimal operation and control strategy of the fuel cell process. The control objective of the Phosphoric Acid Fuel Cell (PAFC) is established and dynamic modeling equations of the entire fuel cell process are formulated as discrete-time type. On-line optimal control of the MIMO system employs the direct decomposition-coordination method. The objective function is modified as the tracking form to enhance the response capability to the load change. The weight factor matrices Q,R, which are design parameters, are readjusted. This control system is compared with LQI method and the results show that the suggested method is better than the traditional method in pressure difference control.

  • PDF

Flexible Mixed decomposition Method for Large Scale Linear Programs: -Integration of a Network of Process Models-

  • Ahn, Byong-Hun;Rhee, Seung-Kyu
    • 한국경영과학회지
    • /
    • 제11권2호
    • /
    • pp.37-50
    • /
    • 1986
  • In combining dispersed optimization models, either primal or dual(or both) decomposition method widely used as an organizing device. Interpreting the methods economically, the concepts of price and resource-directive coordination are generally well accepted. Most of deomposition/ integration methods utilize either primal information of dual information, not both, from subsystems, while some authors have developed mixed decomposition approaches employing two master problems dealing primal and dual proposals separately. In this paper a hybrid decomposition method is introduced, where one hybrid master problem utilizes the underlying relationships between primal and dual information from each subsystem. The suggested method is well justified with respect to the flexibility in information flow pattern choice (some prices and other quantities) and to the compatibility of subdivision's optimum to the systemwide optimum, that is often lacking in conventional decomposition methods such as Dantzig-Wolfe's. A numerical example is also presented to illustrate the suggested approach.

  • PDF

Delay Time Optimal Coordination Planning for Two Robot Systems

  • Lee, Ji-Hong;Nam, Heon-Seong;Joon Lyou
    • Journal of Electrical Engineering and information Science
    • /
    • 제2권3호
    • /
    • pp.51-60
    • /
    • 1997
  • A practically applicable collision free trajectory planning technique for tow robot systems is proposed. The robot trajectories considered in this work are composed of many segments, an at the intersection points between segments robots stop to assemble, weld, ordo other jobs by the attached a end-effectors. The proposed method is based on the Planning-Coordination Decomposition where planning is to find a trajectory of each robot independently according to their tasks and coordination is to find a velocity modification profile to avoid collision with each other. To fully utilize the independently planned trajectories and to ensure no geometrical path deviation after coordination, we develop a simple technique added the minimal delay time to avoid collision just before moving along path segments. We determine the least delay time by the graphical method in the Coordination space where collisions and coordinations are easily visualized. We classify all possible cases into 3 group and derive the optimal solution for each group.

  • PDF

Alternating Direction Method를 이용한 최적조류계산의 분산처리 (An Efficient Implementation of Optimal Power Flow using the Alternating Direction Method)

  • 김호웅;박만근;김발호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권11호
    • /
    • pp.1424-1428
    • /
    • 1999
  • This paper presents a mathematical decomposition coordination method to implementing the distributed optimal power flow (OPF), wherein a regional decomposition technique is adopted to parallelize the OPT. The proposed approach is based on the Alternating Direction Method (ADM), a variant of the conventional Augmented Lagrangian approach, and makes it possible the independent regional AC-OPF for each control area while the global optimum for the entire system is assured. This paper is an extension of our previous work based on the auxiliary problem principle (APP). The proposed approach in this paper is a completely new one, however, in that ADM is based on the Proximal Point Algorithm which has long been recognized as one of the attractive methods for convex programming and min-max-convex-concave programming. The proposed method was demonstrated with IEEE 50-Bus system.

  • PDF

최적조류계산 분산처리 기법의 비교 (A Comparison of Distributed Optimal Power Flow Algorithm)

  • 김호웅;박만근;김발호;김정훈
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1046-1048
    • /
    • 1999
  • This Paper compares two mathematical decomposition coordination methods to implementing the distributed optimal Power flow(OPF) using the regional decomposition: the Auxiliary Problem Principle(APP) and the Alternating Direction Method(ADM), a variant of the conventional Augmented Lagrangian approach. A case study was performed with IEEE 50-bus system.

  • PDF

최적조류계산의 분산처리기법에 관한 연구 (An Approach to Implementing Distributed Optimal Power Flow)

  • 김호웅;김발호;김정훈
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1997년도 추계학술대회 논문집 학회본부
    • /
    • pp.182-186
    • /
    • 1997
  • This paper presents a mathematical approach to implementing distributed optimal power flow (OPF), wherein a regional decomposition technique is adopted to parallelize the OPF. Three mathematical decomposition coordination methods are introduced firs to implement the proposed distributed scheme: the Auxiliary Problem Principle (APP), the Predictor-Corrector Proximal Multiplier Method (PCPM), and the Alternating Direction Method (ADM). Then two alternative schemes for modeling distributed OPF are introduced; the Dummy Generator-Dummy Generator (DGDG) scheme and Dummy Generator-Dummy Load (DGDL) scheme. We present the mathematical analyses of the proposed approach, and demonstrate the approach on several test, systems, including IEEE Reliability Test Systems and parts of the ERCOT (Electric Reliability Council of Texas) system.

  • PDF

Potential of Mean Force Calculations for Ion Selectivity in a Cyclic Peptide Nanotube

  • Choi, Kyu-Min;Kwon, Chan-Ho;Kim, Hong-Lae;Hwang, Hyon-Seok
    • Bulletin of the Korean Chemical Society
    • /
    • 제33권3호
    • /
    • pp.911-916
    • /
    • 2012
  • Ion selectivity in a simple cyclic peptide nanotube, composed of four cyclo[-(D-Ala-Glu-D-Ala-Gln)$_2-$] units, is investigated by calculating the PMF profiles of $Na^+$, $K^+$, and $Cl^-$ ions permeating through the peptide nanotube in water. The final PMF profiles of the ions obtained from the umbrella sampling (US) method show an excellent agreement with those from the thermodynamic integration (TI) method. The PMF profiles of $Na^+$ and $K^+$ display free energy wells while the PMF curve of $Cl^-$ features free energy barriers, indicating the selectivity of the cyclic peptide nanotube to cations. Decomposition of the total mean force into the contribution from each component in the system is also accomplished by using the TI method. The mean force decomposition profiles of $Na^+$ and $K^+$ demonstrate that the dehydration free energy barriers by water molecules near the channel entrance and inside the channel are completely compensated for by attractive electrostatic interactions between the cations and carbonyl oxygens in the nanotube. In the case of $Cl^-$, the dehydration free energy barriers are not eliminated by an interaction between the anion and the peptide nanotube, leading to the high free energy barriers in the PMF profile. Calculations of the coordination numbers of the ions with oxygen atoms pertaining to either water molecules or carbonyl groups in the peptide nanotube reveal that the stabilization of the cations in the midplane regions of the nanotube arises from the favorable interaction of the cations with the negatively charged carbonyl oxygens.

강바닥판교의 다단계 최적설계 (Multi-level Optimization for Orthotropic Steel Deck Bridges)

  • Cho, Hyo-Nam;Chung, Jee-Sung;Min, Daee-Hong;Lee, Kwang-Min
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2000년도 봄 학술발표회논문집
    • /
    • pp.439-448
    • /
    • 2000
  • A multi-level design synthesis (MLDA) algorithm for efficiently optimizing orthotropic steel deck bridges is proposed in the paper, because it is usually very difficult to optimize orthotropic steel deck bridges using a conventional single-level (CSL) algorithn since the bridges have a large number of members and show complex structural behaviors. In the proposed MLDS algorithms a coordination method is introduced to divide the bridges into main girders and orthotropic steel decks and decomposition method is also used to reduce the number of design variables of the decks for system level optimization. For efficient optimization of the bridges the MLDS algorithm incorporates the crucial approximation techliques such as constraints deletion and stress reanalysis. The constraint deletion technique for deflection is found to be very useful for the optimization problem of the bridges, since a deflection constraint is usually inactive in the design. Considering the complex system of the bridges, the proposed the efficient stress reanalysis technique may prove to be a very effective method, since it does not require expensive design sensitivity analyses. The applicability and robustness of the MLDS algorithm is demonstrated using various numerical examples and compared with other algorithm presently available so far.

  • PDF