• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.03a
• /
• pp.195-202
• /
• 1999

본 논문은 배전 계통에서 부하 제약조건과 운전 제약조건을 고려한 손실 감소와 부하 평형에 대해 시뮬레이티드 어닐링 알고리즘을 적용한 재구성 방법을 서술하였다. 네트워크 재구성은 수많은 연계 개폐기와 구분 계폐기의 조합에 의해 이루어지기 때문에 조합적인 최적화 문제이다. 이러한 문제는 수많은 조합에 제약조건까지 있어 해를 구하기가 쉽지 않을뿐 아니라 국소 해에 빠질 가능성이 많다. 따라서 신경망 중에서 제약조건에 따라 신경망 구조에 영향을 미치지 않으면서 전역 최소해에 수렴하는 특성을 가진 시뮬레이티드 어닐링 기법을 이용하여 배전 계통의 선로를 재구성하였다. 시뮬레이티드 어닐링은 이론적으로 최적해가 보장되지만 무한대의 시간이 걸리기 때문에 현실적으로 적용할 때 해 공간을 탐색하는 규칙과 온도를 적절히 내리는 냉각 스케줄(cooling schedule)이 중요하다. 본 논문에서는 알고리즘 상에서 제약조건 위한 여부를 점검할 수 있는 제약조건과 페널티 상수(penalty factor)를 통해 목적함수에 반영하는 제약조건으로 나누어 모든 후보해를 가능해가 되게 하였고 기존에 사용되는 Kirkpatrick의 냉각 스케줄 대신에 후보해의 통계적 처리에 의해 온도를 내리는 다항-시간 냉각 스케줄(polynomial-time schedule)을 사용하여 수행시간을 단축하고 수렴성을 높였다. 제안한 알고리즘의 효용성을 입증하기 위해 32,69모선 예제 계통으로 테스트하였다.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.5
• /
• pp.187-192
• /
• 2019

Majority problem and synchronization problem on cellular automata(CA) are hard to solve, since they are global problems while CA operate on local information. This paper proposes a way to find state transition rules of these problems. The rules of CA are represented as CMR(conditionally matching rules) and evolutionary algorithms are applied to find rules. We find many solution rules to these problems, compared the results with the previous studies, and demonstrated the effectiveness of CMR on one-dimensional cellular automata.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.12
• /
• pp.157-163
• /
• 2017

The object segmentation approach has the merit of reducing the processing cost required to detect moths of interest, because it applies a moth detection algorithm to the segmented objects after segmenting the objects individually in the moth image. In this paper, an object segmentation method for moth detection in pheromone trap images is proposed. Our method consists of preprocessing, thresholding, morphological filtering, and object labeling processes. Thresholding in the process is a critical step significantly influencing the performance of object segmentation. The proposed method can threshold very elaborately by reflecting the local properties of the moth images. We performed thresholding using global and local versions of Ostu's method and, used the proposed method for the moth images of Carposina sasakii acquired on a pheromone trap placed in an orchard. It was demonstrated that the proposed method could reflect the properties of light and background on the moth images. Also, we performed object segmentation and moth classification for Carposina sasakii images, where the latter process used an SVM classifier with training and classification steps. In the experiments, the proposed method performed the detection of Carposina sasakii for 10 moth images and achieved an average detection rate of 95% of them. Therefore, it was shown that the proposed technique is an effective monitoring method of Carposina sasakii in an orchard.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.960-966
• /
• 2017

In this paper, we proposed an algorithm that can extract lesion by inputting a medical image. Feature points are extracted using SIFT algorithm to extract genetic training of medical image. To increase the intensity of the feature points, the input image and that raining image are matched using vector similarity and the lesion is extracted. The vector similarity match can quickly lead to lesions. Since the direction vector is generated from the local feature point pair, the direction itself only shows the local feature, but it has the advantage of comparing the similarity between the other vectors existing between the two images and expanding to the global feature. The experimental results show that the lesion matching error rate is 1.02% and the processing speed is improved by about 40% compared to the case of not using the feature point intensity information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.181-187
• /
• 2012

Millimeter wave (MMW) readily penetrates fabrics, thus it can be used to detect objects concealed under clothing. A passive MMW imaging system can operate as a stand-off type sensor that scans people in both indoors and outdoors. However, because of the diffraction limit and low signal level, the imaging system often suffers from low image quality. Therefore, suitable statistical analysis and computational processing would be required for automatic analysis of the images. In this paper, a real-time concealed object detection is addressed by means of the multi-level segmentation. The histogram of the image is modeled with a Gaussian mixture distribution, and hidden object areas are segmented by a multi-level scheme involving $k$-means, the expectation-maximization algorithm, and a decision rule. The complete algorithm has been implemented in C++ environments on a standard computer for a real-time process. Experimental and simulation results confirm that the implemented system can achieve the real-time detection of concealed objects.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1393-1402
• /
• 1999

This paper proposes an efficient principal feature extraction of the image data using neural networks of a new learning algorithm. The proposed learning algorithm is a backpropagation(BP) algorithm based on the steepest descent and dynamic tunneling. The BP algorithm based on the steepest descent is applied for high-speed optimization, and the BP algorithm based on the dynamic tunneling is also applied for global optimization. Converging to the local minimum by the BP algorithm of steepest descent, the new initial weights for escaping the local minimum is estimated by the BP algorithm of dynamic tunneling. The proposed algorithm has been applied to the 3 image data of 12${\times}$12pixels and the Lenna image of 128${\times}$128 pixels respectively. The simulation results shows that the proposed algorithm has better performances of the convergence and the feature extraction, in comparison with those using the Sanger method and the Foldiak method for single-layer neural networks and the BP algorithm for multilayer neural network.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.31-40
• /
• 2012

Iris recognition is a biometric technology which can identify a person using the iris pattern. It is important for the iris recognition system to extract the feature which is invariant to changes in iris patterns. Those changes can be occurred by the influence of lights, changes in the size of the pupil, and head tilting. In this paper, we propose a novel method based on Zernike Moment which is robust to rotations of iris patterns. we utilized a selection of Zernike moments for the fast and effective recognition by selecting global optimum moments and local optimum moments for optimal matching of each iris class. The proposed method enables high-speed feature extraction and feature comparison because it requires no additional processing to obtain the rotation invariance, and shows comparable performance to the well-known previous methods.