• 한국건설관리학회논문집
• /
• 제24권2호
• /
• pp.70-78
• /
• 2023

선행연구에서는 지중경사계의 문제점인 1) 지중경사계관 설치의 어려움, 2) 단면 변위 파악의 한계성, 3) 인력 중심의 계측 방식을 해결하기 위한 2D LiDAR 센서 기반의 흙막이 벽체 변위 계측 시스템을 개발하였다. 본 연구의 목적은 선행연구에서 개발된 흙막이 벽체 변위 계측 시스템 내 탑재될 변위 분석 알고리즘을 선정하는 것이다. 변위 분석 알고리즘 선정 결과, 변위 추정 오차가 2mm인 M3C2 알고리즘이 흙막이 벽체 변위 분석 알고리즘으로 선정되었다. 본 연구 결과에서 선정된 M3C2 알고리즘이 흙막이 벽체 변위 계측 시스템에 탑재되고 수차례의 현장 실험을 통해 변위 분석 결과의 신뢰성이 담보될 경우 흙막이 벽체 변위 계측 시스템이 현행 계측관리 대비 변위 계측의 편리성 측면에서 효과적으로 흙막이 벽체의 변위를 관리할 수 있을 것으로 판단된다.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2000년도 전력전자학술대회 논문집
• /
• pp.697-700
• /
• 2000

This paper introduces a new rotor position estimation algorithm for the SRM based on the magnetizing curves of aligned and unaligned rotor positions. The flux linkage is calculated by the measured data from phase voltage and phase current and the calculated data are used as the input of magnetizing profiles for rotor position detection. Each of the magnetizing profiles consisted of the methods using the neural network and fuzzy algorithm And also the optima phase is selected by phase selector. To demonstrate the promise of this approach the proposed rotor position estimation algorithms are verified by the experiment results or variable spee range.

• The Journal of the Acoustical Society of Korea
• /
• 제16권2E호
• /
• pp.38-46
• /
• 1997

The objective of the paper is to compare the computational complexity of five algorithms for computing time-domain second-order Volterra filter outputs in terms of number of real multiplication and addition operations required for implementation. This study shows that if the filter memory length is greater that or equal to 16, the fast algorithm using the overlap-save method and the frequency-domain symmetry properties of the quadratic coefficients is the most efficient among the algorithms investigated in this paper, When the filter memory length is less than 16, the algorithm using the time-domain symmetry properties is better than any other algorithm.

• 경영과학
• /
• 제13권1호
• /
• pp.97-109
• /
• 1996

Genetic Algorithms have been successfully applied to various problems (for example, engineering design problems with a mix of continuous, integer and discrete design variables) that could not have been readily solved with traditional computational techniques. But, several problems for which conventional Genetic Algorithms are ill defined are premature convergence of solution and application of exterior penalty function. Therefore, we developed an Improved Genetic Algorithms (IGAs) to solve above two problems. As a case study, IGAs is applied to several nonlinear optimization problems and it is proved that this algorithm is very useful and efficient in comparison with traditional methods and conventional Genetic Algorithm.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
• /
• pp.6-9
• /
• 2012

In this study, we compare two image denoising methods which are the Rudin-Osher-Fatemi total variation (TV) model and the nonlocal means (NLM) algorithm on medical images. To evaluate those methods, we used two well known measuring metrics. The methods are tested with a CT image, one X-Ray image, and three MRI images. Experimental result shows that the NML algorithm can give better results than the ROF TV model, but computational complexity is high.

• Journal of the Korean Data and Information Science Society
• /
• 제16권4호
• /
• pp.1079-1086
• /
• 2005

Most discussions of single imputation methods and the EM algorithm concern point estimation of population quantities with missing values. A second concern is how to get standard errors of the point estimates obtained from the filled-in data by single imputation methods and EM algorithm. Now we focus on how to estimate standard errors with incorporating the additional uncertainty due to nonresponse. There are some approaches to account for the additional uncertainty. The general two possible approaches are considered. One is the jackknife method of resampling methods. The other is multiple imputation(MI). These two approaches are reviewed and compared through simulation studies.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2463-2466
• /
• 2003

This paper studied the pattern recognition algorithm and feature parameters for emotion recognition. In this paper, KNN algorithm was used as the pattern matching technique for comparison, and also VQ and GMM were used lot speaker and context independent recognition. The speech parameters used as the feature are pitch, energy, MFCC and their first and second derivatives. Experimental results showed that emotion recognizer using MFCC and their derivatives as a feature showed better performance than that using the Pitch and energy Parameters. For pattern recognition algorithm, GMM based emotion recognizer was superior to KNN and VQ based recognizer

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제14권3호
• /
• pp.191-196
• /
• 2007

The main components in the generalized Mandelbrot sets are under a theoretical investigation for their parametric boundary equations. Using the boundary geometries, a fast construction algorithm is introduced for the generalized Mandelbrot set. This fast algorithm definitely reduces the construction CPU time in comparison with the naive algorithm. Its graphic implementation displays the mysterious and beautiful fractal sets.

• 한국국방경영분석학회지
• /
• 제25권2호
• /
• pp.73-83
• /
• 1999

In this paper, we consider the shortest path network problem with fixed charges. A turn penalty algorithm for the shortest path problem with fixed charges or turn penalties is presented, which is using the next node comparison method. The algorithm described here is designed to determine the shortest route in the shortest path network problem including turn penalties. Additionally, the way to simplify the computation for the shortest path problem with turn penalties was pursued.

• 한국음향학회지
• /
• 제3권1호
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.