• Wind and Structures
• /
• 제36권6호
• /
• pp.355-366
• /
• 2023

Although machine learning (ML) techniques have been widely used in various fields of engineering practice, their applications in the field of wind engineering are still at the initial stage. In order to evaluate the feasibility of machine learning algorithms for prediction of wind loads on high-rise buildings, this study took the exposure category type, wind direction and the height of local wind force as the input features and adopted four different machine learning algorithms including k-nearest neighbor (KNN), support vector machine (SVM), gradient boosting regression tree (GBRT) and extreme gradient (XG) boosting to predict wind force coefficients of CAARC standard tall building model. All the hyper-parameters of four ML algorithms are optimized by tree-structured Parzen estimator (TPE). The result shows that mean drag force coefficients and RMS lift force coefficients can be well predicted by the GBRT algorithm model while the RMS drag force coefficients can be forecasted preferably by the XG boosting algorithm model. The proposed machine learning based algorithms for wind loads prediction can be an alternative of traditional wind tunnel tests and computational fluid dynamic simulations.

• 대한의용생체공학회:의공학회지
• /
• 제41권5호
• /
• pp.185-194
• /
• 2020

Arrhythmia is basically diagnosed with the electrocardiogram (ECG) signal, however, ECG is difficult to measure and it requires expert help in analyzing the signal. On the other hand, the radial pulse can be measured with easy and uncomplicated way in daily life, and could be suitable bio-signal for the recent untact paradigm and extensible signal for diagnosis of Korean medicine based on pulse pattern. In this study, we developed an irregular radial pulse detection algorithm based on a learning model and considered its applicability as arrhythmia screening. A total of 1432 pulse waves including irregular pulse data were used in the experiment. Three data sets were prepared with minimal preprocessing to avoid the heuristic feature extraction. As classification algorithms, elastic net logistic regression, random forest, and extreme gradient boosting were applied to each data set and the irregular pulse detection performances were estimated using area under the receiver operating characteristic curve based on a 10-fold cross-validation. The extreme gradient boosting method showed the superior performance than others and found that the classification accuracy reached 99.7%. The results confirmed that the proposed algorithm could be used for arrhythmia screening. To make a fusion technology integrating western and Korean medicine, arrhythmia subtype classification from the perspective of Korean medicine will be needed for future research.

• 대한기계학회논문집A
• /
• 제37권12호
• /
• pp.1513-1519
• /
• 2013

유전 알고리즘은 자연의 진화 과정에 기초한 계산 모델로서 전역 최적화 결과를 제공할 수 있다. 변화율(gradient)을 기반으로 하는 방법들과는 달리, 민감도 해석이 요구되지 않으므로 민감도 해석이 어려운 전계(electric field)에서의 나노 단위 구조물의 형상 설계에 적합하다. 본 연구는 유전 알고리즘과 ON/OFF 방법을 기반으로 위상최적화를 수행하여 가시광선 영역에서 새로운 형태의 나노개구 설계를 목표로 하였다. 연구의 목적은 나노개구 아래10nm에 위치한 측정영역에서의 전계 투과효율(transmission rate)을 최대화하며, 동시에 다른 영역에서의 전계 분포를 최소화하는 것이다. 유한요소해석 및 최적화 과정은 상용 프로그램 COMSOl과 Matlab 프로그램의 연동에 의하여 수행되었다. 최적화 모델의 결과는 초기 모델과의 전계 강도 (electric field intensity) 및 근접장의 초점치수(spot size)를 비교하여 분석하였다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제6권2호
• /
• pp.93-101
• /
• 2017

This paper proposes an algorithm for adaptive loop filter (ALF) complexity reduction in the decoding process. In the original ALF algorithm, filtering for I frames is performed in the frame unit, and thus, all of the pixels in a frame are filtered if the current frame is an I frame. The proposed algorithm is designed on top of the local gradient calculation. On both the encoder side and the decoder side, homogeneous areas are checked and skipped in the filtering process, and the filter coefficient calculation is only performed in the inhomogeneous areas. The proposed algorithm is implemented in Joint Exploration Model (JEM) version 3.0 future video coding reference software. The proposed algorithm is applied for frame-level filtering and intra configuration. Compared with the JEM 3.0 anchor, the proposed algorithm has 0.31%, 0.76% and 0.73% bit rate loss for luma (Y) and chroma (U and V), respectively, with about an 8% decrease in decoding time.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2008년도 제39차 동계학술발표논문집 16권2호
• /
• pp.207-210
• /
• 2009

Edge detection is an important process in low level image processing. But many proposed methods for edge detection are not very robust to the image noise and are not flexible for different images. To solve the both problems, an algorithm is proposed which eliminate the noise by mean shift algorithm in advance, and then adaptively determine the double thresholds based on gradient histogram and minimum interclass variance, With this algorithm, it can fade out almost all the sensitive noise and calculate the both thresholds for different images without necessity to setup any parameter artificially, and choose edge pixels by fuzzy algorithm.

• 대한수학회보
• /
• 제49권4호
• /
• pp.749-759
• /
• 2012

A globally convergent algorithm for solving equilibrium problems is proposed. The algorithm is based on a proximal point algorithm (shortly (PPA)) with a positive definite matrix M which is not necessarily symmetric. The proximal function in existing (PPA) usually is the gradient of a quadratic function, namely, ${\nabla}({\parallel}x{\parallel}^2_M)$. This leads to a proximal point-type algorithm. We first solve pseudomonotone equilibrium problems without Lipschitzian assumption and prove the convergence of algorithms. Next, we couple this technique with the Banach contraction method for multivalued variational inequalities. Finally some computational results are given.

• 전자공학회논문지B
• /
• 제31B권9호
• /
• pp.27-35
• /
• 1994

It is known that a unified phase I-phase II semi-infinite optimization algorithm with a steerign parameter performs better than the original unified phase I-phase II algorithm. In this paper, the effect of the steering parameter is analized and a new algorithm is presented based on the facts that when the point x is far away from the feasible region, reaching to the feasible region is more important than minimizing the cost functio and that when the point x is near the region, it is more efficient to try to reach the feasible region and to minimize the cost function concurrently. It is also important to consider the relationship between the feasible direction and the gradient of the cost function. Even though changing the steering parameter does not change the rate of convergence of the algorithm, it is shown from examples that given new algorithm is more efficient than the previous ones.

• International Journal of Control, Automation, and Systems
• /
• 제4권5호
• /
• pp.624-636
• /
• 2006

This paper proposes a hybrid approach involving Genetic Algorithm (GA) and Bacterial Foraging (BF) for tuning the PID controller of an AVR. Recently the social foraging behavior of E. coli bacteria has been used to solve optimization problems. We first illustrate the proposed method using four test functions and the performance of the algorithm is studied with an emphasis on mutation, crossover, variation of step sizes, chemotactic steps, and the life time of the bacteria. Further, the proposed algorithm is used for tuning the PID controller of an AVR. Simulation results are very encouraging and this approach provides us a novel hybrid model based on foraging behavior with a possible new connection between evolutionary forces in social foraging and distributed non-gradient optimization algorithm design for global optimization over noisy surfaces.

• 대한전자공학회논문지SP
• /
• 제48권2호
• /
• pp.96-101
• /
• 2011

소실점이란 실제 공간의 평행한 선들이 영상 내에 투영되면서 한곳에 모이는 점이다. 본 논문에서는 이러한 소실점의 특성을 이용한 실시간 소실점 검출 알고리즘을 제안한다. 기존의 소실점 검출 방법은 1) 복잡한 계산이 요구되거나 2) 알고리즘에 따라 소실점을 검출할 수 있는 영상이 제한되어 있다. 제안하는 방법은 블록 기반의 HOG(Histogram of Oriented Gradient)를 구하여 영상의 구조적 특성을 이용하는 것으로 영상 내에 존재하는 소실점을 실시간으로 검출한다. 먼저 영상의 블록 단위로 HOG 기술자를 구한 뒤, 제안하는 동적 프로그래밍(dynamic programing)을 이용하여 소실점의 위치를 예측한다. 본 논문에서는 다양한 영상에 대한 실험을 통해 제안하는 알고리즘이 효율적인 소실점 검출 방법임을 보이고자 한다.

• 한국통신학회논문지
• /
• 제29권10C호
• /
• pp.1402-1413
• /
• 2004

비강체 (non-rigid) 영상 등록에서 추정되는 좌표변환은 가역이어야 함으로 그 변환의 Jacobian 행렬식은 항상 양수 값을 가져야 한다. 본 논문에서는 이러한 가역 조건을 만족하는 좌표변환의 조건을 gradient 크기 제한의 조건으로 구한다. 또한 cubic B-spline을 이용한 변환 모델의 경우, 이 gradient 크기 제한 조건을 만족시키는 인수 집합을 이웃한 두 계수들의 차이가 제한된 인수들의 집합으로 구하였다. 이러한 인수들의 집합은 half space들의 교집합으로 이루어진 convex 집합이다. 본 논문에서는 이 convex 집합에 속하는 인수로 구성되는 좌표변환들 중에서 유사지수 (similarity measure) 를 최대로 만드는 변환을 gradient projection 최적화 기법을 통해 발견하였다. 이론적 분석, 폐 CT (Computed Tomography) 영상을 이용한 시뮬레이션 및 실험을 통하여, 제안된 알고리즘의 성능이 벌칙 함수 penalty function) 를 이용하는 기존의 방법보다 우수함을 증명하였다.