• 제목/요약/키워드: SA algorithm

검색결과 284건 처리시간 0.031초

통신에서의 무선 데이터 방송을 위한 샘플링 기법 (Sampling Techniques for Wireless Data Broadcast in Communication)

  • 이선의;박구만;김진영
    • 한국위성정보통신학회논문지
    • /
    • 제10권3호
    • /
    • pp.57-61
    • /
    • 2015
  • 본 논문에서는 3D 방송의 기본적인 원리를 설명하고 실감영상 CS 기술을 적용하여 데이터 용량을 줄이는 방식을 제안한다. 샘플링 이론과 CS 기술의 차이점을 설명하고 개념과 동작원리를 설명한다. 압축 센싱의 복원 알고리즘인 SS-CoSaMP(Single-Space Compressive Sampling Matched Pursuit) 와 AMP(Approximate Message Passing)를 소개하고 이를 이용하여 이미지 데이터를 압축 복원하여 비교한다. 계산시간을 비교하여 낮은 복잡도를 갖는 알고리즘을 판단한다.

유전자 알고리즘과 시뮬레이티드 어닐링을 이용한 활성외곽선모델의 에너지 최소화 기법 비교 (Comparison of Genetic Algorithm and Simulated Annealing Optimization Technique to Minimize the Energy of Active Contour Model)

  • 박선영;박주영;김명희
    • 한국컴퓨터그래픽스학회논문지
    • /
    • 제4권1호
    • /
    • pp.31-40
    • /
    • 1998
  • 활성외곽선모델(active contour model)은 물체의 경계를 분할하기 위한 효과적인 방법으로 사용되고 있다. 그런데, 기존 활성외곽선모텔에서는 초기곡선을 분할하고자하는 물체의 경계면에 위치시키고 지역적으로 에너지를 최소화 함에 따라 결과가 초기 곡선의 위치와 형태에 따라 달라지는 단점이 있었다. 본 논문에서는 활성외곽선모델을 B-Spline 곡선에 의해 표현하고, 에너지 최소화 과정에 유전자 알고리즘(Genetic Algorithm: GA)과 시뮬레이티드 어닐링 (Simulated Annealing : SA)을 적용함으로써 기존 활성외곽선모델이 갖는 초기 곡선에 대한 제약성을 개선하고자 했으며, 두가지 방법에 따른 분할 결과와 문제점을 비교하고자 하였다. 제안한 방법의 성능비교를 위하여 이진 합성 영상과 CT 영상, MR 영상을 대상으로 실험을 수행하였다.

  • PDF

최적화 기법을 이용한 로터 축 유한요소모델 개선 (FE MODEL UPDATING OF ROTOR SHAFT USING OPTIMIZATION TECHNIQUES)

  • Kim, Yong-Han;Feng, Fu-Zhou;Yang, Bo-Suk
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2003년도 추계학술대회논문집
    • /
    • pp.104-108
    • /
    • 2003
  • Finite element (FE) model updating is a procedure to minimize the differences between analytical and experimental results, which can be usually posed as an optimization problem. This paper aims to introduce a hybrid optimization algorithm (GA-SA), which consists of a Genetic algorithm (GA) stage and an Adaptive Simulated Annealing (ASA) stage, to FE model updating for a shrunk shaft. A good agreement of the first four natural frequencies has been achieved obtained from GASA based updated model (FEgasa) and experiment. In order to prove the validity of GA-SA, comparisons of natural frequencies obtained from the initial FE model (FEinit), GA based updated model (FEga) and ASA based updated model (FEasa) are carried out. Simultaneously, the FRF comparisons obtained from different FE models and experiment are also shown. It is concluded that the GA, ASA, GA-SA are powerful optimization techniques which can be successfully applied to FE model updating, the natural frequencies and FRF obtained from all the updated models show much better agreement with experiment than that obtained from FEinit model. However, FEgasa is proved to be the most reasonable FE model, and also FEasa model is better than FEga model.

  • PDF

실감 영상을 위한 압축 센싱 기법 (Novel Compressed Sensing Techniques for Realistic Image)

  • 이선의;정국현;김진영;박구만
    • 한국위성정보통신학회논문지
    • /
    • 제9권3호
    • /
    • pp.59-63
    • /
    • 2014
  • 본 논문에서는 3D 방송의 기본적인 원리를 설명하고 압축 센싱(Compressed Sensing) 기술을 적용하여 3D 방송의 데이터 용량을 줄이는 방식을 제안한다. 샘플링 이론과 압축 센싱 기술의 차이점을 설명하고 개념과 동작원리를 설명한다. 최근 제안된 압축 센싱의 복원 알고리즘인 SS-CoSaMP(Single-Space Compressive Sampling Matched Pursuit) 와 CoSaMP(Compressive Sampling Matched Pursuit)를 소개하고 이를 이용하여 데이터를 압축 복원하여 정확도를 비교한다. 두 알고리즘의 다양한 이미지 복원을 수행하고 계산시간을 비교한다. 결론적으로 낮은 복잡도를 갖는 3D 방송에 적합한 알고리즘을 판단한다.

시뮬레이티드 어닐링 알고리즘을 이용한 유연생산시스템의 기계셀-부품군 형성에 관한 연구 (A Study of Formation of Machine Cell-Part Family in FMS using the Simulated Annealing Algorithm)

  • 김진용;박대극;오병완;홍성조;최진영
    • 산업공학
    • /
    • 제10권2호
    • /
    • pp.1-13
    • /
    • 1997
  • The problem of the formation of machine-part cells in FMS is a very important issue at the planning and operating stages of FMS. This problem is inherently a combinatorial optimization problem, proven to be NP-complete(or, NP-hard). Among the several kinds of approaches which have been applied to solve the combinatorial optimization problems, the Simulated Annealing(SA) algorithm, a technique of random search type with a flexibility in generating alternatives, is a powerful problem solving tool. In this paper, the SA algorithm is used to solve machine cell-part family formation problems. The primary purpose of the study is to find the near-optimal solution of machine cell-part family formation problem, whare the product volume and number of operations are prespecified, that can minimize the total material handling cost caused by exceptional elements and intercell moves as much as possible. The results show that the SA algorithm is able to find a near-optimal solution for practical problems of the machine cell-part family formation.

  • PDF

Optimal Location and Sizing of Shunt Capacitors in Distribution Systems by Considering Different Load Scenarios

  • Dideban, Mohammadhosein;Ghadimi, Noradin;Ahmadi, Mohammad Bagher;Karimi, Mohammmad
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권5호
    • /
    • pp.1012-1020
    • /
    • 2013
  • In this work, Self-adaptive Differential Evolutionary (SaDE) algorithm is proposed to solve Optimal Location and Size of Capacitor (OLSC) problem in radial distribution networks. To obtain the SaDE algorithm, two improvements have been applied on control parameters of mutation and crossover operators. To expand the study, three load conditions have been considered, i.e., constant, varying and effective loads. Objective function is introduced for the load conditions. The annual cost is fitness of problem, in addition to this cost, CPU time, voltage profile, active power loss and total installed capacitor banks and their related costs have been used for comparisons. To confirm the ability of each improvements of SaDE, the improvements are studied both in separate and simultaneous conditions. To verify the effectiveness of the proposed algorithm, it is tested on IEEE 10-bus and 34-bus radial distribution networks and compared with other approaches.

Optimal sensor placement for mode shapes using improved simulated annealing

  • Tong, K.H.;Bakhary, Norhisham;Kueh, A.B.H.;Yassin, A.Y. Mohd
    • Smart Structures and Systems
    • /
    • 제13권3호
    • /
    • pp.389-406
    • /
    • 2014
  • Optimal sensor placement techniques play a significant role in enhancing the quality of modal data during the vibration based health monitoring of civil structures, where many degrees of freedom are available despite a limited number of sensors. The literature has shown a shift in the trends for solving such problems, from expansion or elimination approach to the employment of heuristic algorithms. Although these heuristic algorithms are capable of providing a global optimal solution, their greatest drawback is the requirement of high computational effort. Because a highly efficient optimisation method is crucial for better accuracy and wider use, this paper presents an improved simulated annealing (SA) algorithm to solve the sensor placement problem. The algorithm is developed based on the sensor locations' coordinate system to allow for the searching in additional dimensions and to increase SA's random search performance while minimising the computation efforts. The proposed method is tested on a numerical slab model that consists of two hundred sensor location candidates using three types of objective functions; the determinant of the Fisher information matrix (FIM), modal assurance criterion (MAC), and mean square error (MSE) of mode shapes. Detailed study on the effects of the sensor numbers and cooling factors on the performance of the algorithm are also investigated. The results indicate that the proposed method outperforms conventional SA and Genetic Algorithm (GA) in the search for optimal sensor placement.

Long-term prediction of safety parameters with uncertainty estimation in emergency situations at nuclear power plants

  • Hyojin Kim;Jonghyun Kim
    • Nuclear Engineering and Technology
    • /
    • 제55권5호
    • /
    • pp.1630-1643
    • /
    • 2023
  • The correct situation awareness (SA) of operators is important for managing nuclear power plants (NPPs), particularly in accident-related situations. Among the three levels of SA suggested by Ensley, Level 3 SA (i.e., projection of the future status of the situation) is challenging because of the complexity of NPPs as well as the uncertainty of accidents. Hence, several prediction methods using artificial intelligence techniques have been proposed to assist operators in accident prediction. However, these methods only predict short-term plant status (e.g., the status after a few minutes) and do not provide information regarding the uncertainty associated with the prediction. This paper proposes an algorithm that can predict the multivariate and long-term behavior of plant parameters for 2 h with 120 steps and provide the uncertainty of the prediction. The algorithm applies bidirectional long short-term memory and an attention mechanism, which enable the algorithm to predict the precise long-term trends of the parameters with high prediction accuracy. A conditional variational autoencoder was used to provide uncertainty information about the network prediction. The algorithm was trained, optimized, and validated using a compact nuclear simulator for a Westinghouse 900 MWe NPP.

Simulated Annealing 알고리듬을 이용한 SAM-X 추가전력의 최적배치 (Efficient Simulated Annealing Algorithm for Optimal Allocation of Additive SAM-X Weapon System)

  • 이상헌;백장욱
    • 산업공학
    • /
    • 제18권4호
    • /
    • pp.370-381
    • /
    • 2005
  • This study is concerned with seeking the optimal allocation(disposition) for maximizing utility of consolidating old fashioned and new air defense weapon system like SAM-X(Patriot missile) and developing efficient solution algorithm based on simulated annealing(SA) algorithm. The SED(selection by effectiveness degree) procedure is implemented with an enhanced SA algorithm in which neighboring solutions could be generated only within the optimal feasible region by using a specially designed PERTURB function. Computational results conducted on the problem sets with a variety of size and parameters shows the significant efficiency of our SED algorithm over existing methods in terms of both the computation time and the solution quality.

Application of Ray Following Algorithm to High Resolution Satellite Image Simulation

  • Shin, Dong-Seok;Park, Won-Kyu
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.559-564
    • /
    • 2002
  • This paper describes a new algorithm named as ray following algorithm which is applied for high-resolution satellite image simulation. The problems of the conventional ray tracing algorithm are pointed out especially when terrain elevations vary abruptly. The proposed algorithm follows the directional ray vector sequentially and thoroughly in order to determine the crossing point of the ray with the terrain surface. This way of sequential height comparison method is regarded as the only way to obtain accurate surface cross-section when a highly variant digital surface model is used. The experimental results show and compare the validities of the conventional and proposed algorithms.

  • PDF