• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2019년도 춘계학술발표대회
• /
• pp.76-78
• /
• 2019

Sampling-based algorithms are one of the most commonly approaches which give good results in robot path planning with many degree of freedom. So that many proposed methods as well as their improvement based on these approaches have been proposed. The purpose of this paper is to survey some current algorithms using for path planning, the original proposed methods as well as their improvement. Some advantages and disadvantages of these algorithms will be also mentioned, how the improved version of the proposed methods overcome the original proposed methods' drawback.

• 방송공학회논문지
• /
• 제9권4호
• /
• pp.384-390
• /
• 2004

본 논문에서는 44.1KHz에서 48KHz로 표본화 주파수를 변환하는 알고리듬들의 성능을 비교한다. 비교 한 기법은 다위상 구조로 구현된 기본적인 기법, sinc 함수를 이용한 기법, 다위상 구조의 다단계 구현 기법, 그리고 B-spline을 이용한 기법 등이다. 먼저, 공정한 비교를 위해 이 4가지 기법을 이용한 표본화율 변환기들을 고품질 조건하에 재설계하고, 이들의 H/W 복잡도를 메모리 요구량과 계산량 측면에서 비교하였다. 그 결과, 메모리 요구량 측면에서는 B-spline을 이용한 기법이 가장 우수하였지만, 계산량 측면에서는 기본적인 기법과 sinc 함수를 이용한 기법이 가장 우수함을 확인할 수 있었다.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.27-39
• /
• 2016

This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

• Journal of Power Electronics
• /
• 제16권6호
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• 응용통계연구
• /
• 제27권3호
• /
• pp.357-371
• /
• 2014

최근 들어 데이터 마이닝의 분류문제에 있어 목표변수의 불균형 문제가 많은 관심을 받고 있다. 이러한 문제를 해결하기 위해, 이전 연구들은 원 자료에 대하여 데이터 전처리 과정을 실시했는데, 전처리 과정에는 목표변수의 다수계급을 소수계급의 비율에 맞게 조정하는 과소표집법, 소수계급을 복원추출하여 다수계급의 비율에 맞게 조정하는 과대표집법, 소수계급에 K-최근접 이웃 방법 등을 활용하여 과대표집법을 적용 후 다수계급에는 과소표집법을 적용한 하이브리드 기법 등이 있다. 또한 앙상블 기법도 이러한 불균형 데이터의 분류 성능을 높일 수 있다고 알려져 있어, 본 논문에서는 데이터의 전처리 과정과 앙상블 기법을 함께 고려한 여러 모형들을 사용하여, 불균형 자료에 대한 이들모형의 분류성능을 비교평가한다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.295-298
• /
• 2000

In this research, a novel sampling strategy for a CMM to inspect freeform surfaces is proposed. Unlike primitive surfaces, it is not easy to determine the number of sampling points and their locations for inspecting freeform surfaces. Since a CMM operates with slower speed in measurement than optical measuring devices, it is important to optimize the number and the locations of sampling points in the inspection process. When a complete inspection of a surface is required, it becomes more critical. Among various factors to cause shape errors of a final product, curvature characteristic is essential due to its effect such as stair-step errors in rapid prototyping and interpolation errors in NC tool paths generation. Shape errors are defined in terms of the average and standard deviation of differences between an original model and a produced part. Proposed algorithms determine the locations of sampling points by analyzing curvature distribution of a given surface. Based on the curvature distribution, a surface area is divided into several sub-areas. In each sub-area, sampling points are located as further as possible. The optimal number of sub-areas. In each sub-area, sampling points are located as further as possible. The optimal number os sub-areas is determined by estimating the average of curvatures. Finally, the proposed method is applied to several surfaces that have shape errors for verification.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2003년도 추계학술대회
• /
• pp.239-247
• /
• 2003

Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, etc. CHAID(Chi-square Automatic Interaction Detector), is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose and CHAID algorithm by cube-based sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• 한국음향학회지
• /
• 제38권5호
• /
• pp.534-542
• /
• 2019

능동소나에서는 표적의 거리 도플러 정보를 탐지하기 위해 여러 가지 기법을 사용한다. 그중 압축 센싱을 적용한 기법은 기존의 방식보다 더욱 정밀한 탐지가 가능하며 우수한 성능을 나타낸다. 능동 소나의 거리 도플러 추정에 적용할 수 있는 압축 센싱 알고리즘은 여러 가지 있다. 압축 센싱 알고리즘 마다 계산 성능이 다르며 압축 센싱 알고리즘에 따라 신호 대 잡음비와 센싱 행렬의 코히런스가 거리 도플러 추정에 미치는 영향의 정도가 다르다. 본 논문은 능동 소나의 거리 도플러 추정을 위한 여러 가지 압축 센싱 알고리즘의 계산 성능과 정확도를 비교, 분석하였다. 여러 신호대 잡음비, 상호간섭성 값에 대한 OMP(Orthogonal Matching Pursuit), CoSaMP(Compressive Sampling Matching Pursuit), BPDN(CVX)(Basis Pursuit Denoising), LARS(Least Angle Regression) 알고리즘의 추정 성능을 확인하였으며, 상황에 따른 최적의 압축 센싱 알고리즘을 보인다.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2004년도 춘계학술대회
• /
• pp.39-50
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID(Chi-square Automatic Interaction Detector) uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.803-816
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.