• Journal of Forest and Environmental Science
• /
• 제30권1호
• /
• pp.45-49
• /
• 2014

This study was tried to find out the applicability of decision support system for forest land use conversion, which developed based on algorithm for forest land-use conversion. Decision support system developed by Ministry of Safety Administration is free from the existing licensed laws omission. And it made the input requirements for each value of the final result so that you can determine whether the permit was available by the laws and regulations related to the algorithm for forest land use conversion. Also, in order to do field surveys, equal sampling interval method is used to extract samples for the operability by comparing and analyzing the actual area. As a result, 88 areas of total 100 areas are able to get permission by the decision support system for forest land use conversion, and it means if there is enough data with sufficient research, it can make the availability permits easily.

• 한국위성정보통신학회논문지
• /
• 제9권4호
• /
• pp.104-110
• /
• 2014

본 논문에서는 무인항공기인 방송용 멀티콥터를 이용한 Full-HD급 이상 화질의 이미지를 효율적으로 전송하기 위해 이미지 압축 센싱 기법을 적용하고, Sparse 신호의 효율적 복원을 위해 Turbo 알고리즘과 Markov chain Monte Carlo (MCMC) 알고리즘의 복원 성능을 모의실험을 통해 비교 분석하였다. 제안된 복원 기법은 압축 센싱에 기반하여 데이터 용량을 줄이고 빠르고 오류 없는 원신호 복원에 중점을 두었다. 다수의 이미지 파일로 모의실험을 진행한 결과 Loopy belief propagation(BP) 기반의 Turbo 복원 알고리즘이 Gibbs sampling기반 알고리즘을 수행하는 MCMC 알고리즘 보다 평균 복원 연산 시간, NMSE 값에서 우수하여 보다 효율적인 복원 방법으로 생각된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1063-1075
• /
• 2012

To locate an object accurately in the wireless sensor networks, the distance measure based on time-delay plays an important role. In this paper, we propose a maximum likelihood (ML) time-delay estimation algorithm in multi-path wireless propagation channel. We get the joint probability density function after sampling the frequency domain response of the multi-path channel, which could be obtained by the vector network analyzer. Based on the ML criterion, the time-delay values of different paths are estimated. Considering the ML function is non-linear with respect to the multi-path time-delays, we first obtain the coarse values of different paths using the subspace fitting algorithm, then take them as an initial point, and finally get the ML time-delay estimation values with the pattern searching optimization method. The simulation results show that although the ML estimation variance could not reach the Cramer-Rao lower bounds (CRLB), its performance is superior to that of subspace fitting algorithm, and could be seen as a fine algorithm.

• 로봇학회논문지
• /
• 제17권3호
• /
• pp.365-372
• /
• 2022

The accurate object recognition is important for the precise and accurate manipulation. To enhance the recognition performance, we can use various types of sensors. In general, acquired data from sensors have a high sampling rate. So, in the past, the RNN-based model is commonly used to handle and analyze the time-series sensor data. However, the RNN-based model has limitations of excessive parameters. CNN-based model also can be used to analyze time-series input data. However, CNN-based model also has limitations of the small receptive field in early layers. For this reason, when we use a CNN-based model, model architecture should be deeper and heavier to extract useful global features. Thus, traditional methods like RN N -based and CN N -based model needs huge amount of learning parameters. Recently studied result shows that Fast Fourier Convolution (FFC) can overcome the limitations of traditional methods. This operator can extract global features from the first hidden layer, so it can be effectively used for feature extracting of sensor data that have a high sampling rate. In this paper, we propose the algorithm to recognize objects using tactile sensor data and the FFC model. The data was acquired from 11 types of objects to verify our posed model. We collected pressure, current, position data when the gripper grasps the objects by random force. As a result, the accuracy is enhanced from 84.66% to 91.43% when we use the proposed FFC-based model instead of the traditional model.

• 지능정보연구
• /
• 제14권3호
• /
• pp.133-154
• /
• 2008

데이터 마이닝 분류 문제에서 발생하는 데이터 불균형 문제는 한 범주에 속한 데이터의 수가 다른 범주에 속한 데이터의 수보다 극히 많거나 작은 경우를 말한다. 이러한 불균형 문제를 해결하기 위해 표본추출과 오분류 비용에 근거한 여러 가지 기법들이 제시되었으며, 이들 간의 성능 비교에 대한 연구들도 이루어졌다. 본 논문에서는 기존에 제시된 불균형 문제 해소기법들의 조합적 활용에 대한 타당성에 대해 살펴보고 유전자 알고리즘을 통해 그 결합 비율을 결정하여 더 좋은 성과를 낼 수 있는지에 대해 살펴보도록 한다. 소수 범주에 대한 정확성을 높이기 위해 소수 범주에 대한 F-value에 기초하여 기법들의 결합비율을 결정하고 기존 단일 기법들의 성과와 임의의 비율에 의한 격자표 형태의 결합 성과를 비교하여 결합적 활용의 타당성을 살펴본다. 이를 실증적으로 검토하기 위해서, 일반적으로 데이터 불균형 문제를 해결하기 위해 많이 사용되는 4개의 공개 데이터 집합을 이용하여 타당성 분석을 수행하였다. 분석 결과, 전체적으로 단일 기법들의 결합적 활용이 데이터 불균형 해소에 유용한 것으로 나타났다.

• 한국CDE학회논문집
• /
• 제15권2호
• /
• pp.115-123
• /
• 2010

We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

• 한국정밀공학회지
• /
• 제24권5호
• /
• pp.127-134
• /
• 2007

Presented in the paper is an algorithm to generate a section curve by slicing a point cloud including tens of thousands of points. Although, there have been previous research results on the slicing problem, they are quite sensitive on the density variations of the point cloud, as well as on the local noise in the point cloud. To relive the difficulties, three technological requirements are identified; 1) dominant point sampling, 2) avoiding local vibration, and 3) robustness on the density changes. To satisfy these requirements, we propose a new slicing algorithm which is based on a node-sphere diagram. The algorithm has been implemented and tested with various examples.

• 제어로봇시스템학회논문지
• /
• 제16권7호
• /
• pp.703-710
• /
• 2010

In this paper, an overload detecting algorithm for an excavator is presented. The proposed overload detecting algorithm is based on the time series analysis especially correlation function. The main purpose of this paper is to prevent damage or crack from the fatigue loaded on an excavator in advance. Generally, the larger data, the longer processing time, and the amount of the data used in this paper are also large, especially every sampling period, 1600 data are gathered and calculated. So this paper focuses on minimizing the number of required sensors by using the correlation function. From the cross correlation function, similar pattern sensors are eliminated and dissimilar pattern sensors are considered, and from the auto correlation function, the overload can be detected. To prove the efficiency of the proposed overload detecting algorithm, this paper shows the computer simulation results.

• 한국군사과학기술학회지
• /
• 제14권3호
• /
• pp.517-523
• /
• 2011

The estimation filter in radar systems must track targets' position within low tracking error. In the Multi-Function Radar(MFR), ${\alpha}-{\beta}$ filter and Kalman filter are widely used to track single or multiple targets. However, due to target maneuvering, these filters may not reduce tracking error, therefore, may lost target tracks. In this paper, a target tracking filter based on particle filtering algorithm is proposed for the MFR. The advantage of this method is that it can track targets within low tracking error while targets maneuver and reduce impoverishment of particles by the proposed resampling method. From the simulation results, the improved tracking performance is obtained by the proposed filtering algorithm.

• 한국통신학회논문지
• /
• 제21권7호
• /
• pp.1777-1786
• /
• 1996

This paper describes theories and implementation techniques of a digital high-definition television(HDTV) modem based on 32-QAM for terrestrial broadcasting. We proposed a digital demodulation scheme and a symbol timing recovery structure based on the band edge component maximization(BECM) method. The adaptive equalizer has 256 complex taps to remove the multipath of delays ranging from -2.mu.s~+24.mu.s with a new T/2-spaced blind equalization algorithm. computer simulation results reveal that the proposed algorithm outperforms other conventional blind equalization algorithm a digital HDTV modem with 4.91MHz symobol rate is implemented by utilizing the proposed algorithms. All processings for modem operations such as demodulation, estimation of symbol timing phase error, adaptive equalization, and carrier recovery except IF signal processing and sampling phase control part of the AD converter are done in digital domain. Especially, the carrier recovery loop can track a carrier offset of upto .+-.350KHz.