• 한국수자원학회논문집
• /
• 제55권spc1호
• /
• pp.1271-1282
• /
• 2022

상수관망 최적설계는 사용자가 설정한 목적에 따라 다양하게 사용된다. 상수관망 최적설계는 비용의 최소화 및 관의 제작 시 발생하는 에너지 최소화 등 목적이 다양하게 존재한다. 본 연구에서는 Modified Hybrid Vision Correction Algorithm (MHVCA)을 기반으로 다양한 상수관망에 대한 비용 최적설계를 진행하였다. 또한 새로운 평가지표인 Best Rate (BR)를 제안하였다. BR은 K-mean Clustering Algorithm을 기반으로 개발된 평가지표이다. BR을 통해 상수관망 최적설계에 사용된 각 알고리즘의 최적 설계안 탐색 가능성에 대한 비교를 하였다. 다양한 관망에 대한 MHVCA의 최적설계 결과를 Vision Correction Algorithm (VCA) 및 Hybrid Vision Correction Algorithm (HVCA)과 비교하였다. MHVCA는 VCA 및 HVCA보다 낮은 비용의 설계안을 탐색하였다. 또한 MHVCA는 낮은 비용의 설계안을 탐색할 확률이 VCA 및 HVCA보다 높았다. MHVCA는 본 연구에서 적용한 비용 최소화를 위한 상수관망 최적설계 뿐만이 아닌 다양한 목적을 위한 상수관망 최적설계에 적용할 경우 좋은 결과를 나타낼 수 있을 것이다.

• 한국산학기술학회논문지
• /
• 제17권3호
• /
• pp.117-126
• /
• 2016

본 연구에서는 안경의 광학적 특성에서 고안된 새로운 메타휴리스틱 최적화 알고리즘인 Vision Correction Algorithm(VCA)을 개발하였다. VCA는 안경광학분야에서 수행되는 검안과 교정과정을 최적해 탐색 과정에 적용한 기법으로 근시/원시교정-밝기조정-압축시행-난시교정의 과정을 거쳐 최적화를 수행하게 된다. 제안된 VCA는 기존의 메타휴리스틱 알고리즘과 달리 현재까지 축적된 최적화 결과를 기반으로 전역탐색과 국지탐색 적용 확률, 그리고 전역탐색의 방향이 자동적으로 조정 된다. 제안된 방법을 대표적인 최적화 문제(수학 및 공학 분야)에 적용하고, 그 결과를 기존 알고리즘들과 비교하여 제시하였다.

• 한국산학기술학회논문지
• /
• 제20권6호
• /
• pp.314-321
• /
• 2019

본 연구에서 개발된 Self-Adaptive Vision Correction Algorithm (SAVCA)은 광학적 특성을 모방하여 개발된 Vision Correction Algorithm (VCA)의 총 6개의 매개변수 중 자가 적응형태로 구축된 Division Rate 1 (DR1) 및 Division Rate 2 (DR2)를 제외한 Modulation Transfer Function Rate (MR), Astigmatic Rate (AR), Astigmatic Factor (AF) 및 Compression Factor (CF) 등 4개의 매개변수를 변경하여 사용성을 증대시키기 위해 제시되었다. 개발된 SAVCA의 검증을 위해 기존 VCA를 적용하였던 2개 변수를 갖는 수학 문제 (Six hump camel back 및 Easton and fenton) 및 30개 변수를 갖는 수학 문제 (Schwefel 및 Hyper sphere)에 적용한 결과 SAVCA는 비교한 다른 알고리즘 (Harmony Search, Water Cycle Algorithm, VCA, Genetic Algorithms with Floating-point representation, Shuffled Complex Evolution algorithm 및 Modified Shuffled Complex Evolution)에 비해 우수한 성능을 보여주었다. 마지막으로 공학 문제인 Speed reducer design에서도 SAVCA는 가장 좋은 결과를 보여주었다. 복잡한 매개변수 조절과정을 거치지 않은 SAVCA는 여러 분야에서 적용이 가능할 것이다.

• 제어로봇시스템학회논문지
• /
• 제9권4호
• /
• pp.284-295
• /
• 2003

The servo tracks of disk drives are constructed at the time of manufacture with the equipment of servo track writer. Because of the imperfection of servo track writer, disk vibrations and head fluctuations during servo track writing process, the constructed servo tracks might deviate from perfect circles and take eccentric shapes. The servo track writing error should be corrected because it might cause interference with adjacent tracks and irrecoverable operation error of disk drives. The servo track writing error is repeated every disk rotation and so is periodic time function. In this paper, we propose a new correction algorithm of servo track writing error based on iterative teaming approach. Our correction algorithm can learn iteratively the servo track writing error as accurately as is desired. Furthermore, our algorithm is robust to system model errors, is computationally simple, and has fast convergence rate. In order to demonstrate the generality and practical use of our work, we present the convergence analysis of our correction algorithm and some simulation results.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 1998년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.252-256
• /
• 1998

Accurate mapping of satellite images is one of the most important Parts in many remote sensing applications. Since the position and the attitude of a satellite during image acquisition cannot be determined accurately enough, it is normal to have several hundred meters' ground-mapping errors in the systematically corrected images. The users which require a pixel-level or a sub-pixel level mapping accuracy for high-resolution satellite images must use a number of Ground Control Points (GCPs). In this paper, the performance of two geometric correction algorithms is tested and compared. One is the polynomial warping algorithm which is simple and popular enough to be implemented in most of the commercial satellite image processing software. The other is full camera modelling algorithm using Physical orbit-sensor-Earth geometry which is used in satellite image data receiving, pre-processing and distribution stations. Several criteria were considered for the performance analysis : ultimate correction accuracy, GCP representatibility, number of GCPs required, convergence speed, sensitiveness to inaccurate GCPs, usefulness of the correction results. This paper focuses on the usefulness of the precision correction algorithm for regular image pre-processing operations. This means that not only final correction accuracy but also the number of GCPs and their spatial distribution required for an image correction are important factors. Both correction algorithms were implemented and will be used for the precision correction of KITSAT-3 images.

• 한국컴퓨터정보학회논문지
• /
• 제23권1호
• /
• pp.67-74
• /
• 2018

In this paper, we propose an efficient scene based non-uniformity correction algorithm which performs the offset correction using the uniform obtained from input scenes for Infrared camera. In general, pixel outputs of a infrared detector can not be uniform. Therefore, the non-uniformity correction procedure need to be performed to make the image outputs uniform. A typical non-uniformity correction method uses a black body at the laboratory to obtain the output of the infrared detector's pixels for two temperatures, HOT and COLD, and calculates the non-uniformity correction parameters. However, output characteristics of the Infrared detector changes while the Infrared camera is operated, the fixed pattern noise of the Infrared detector and dead pixels are generated. To remove the noise, the offset correction is generally performed. The offset correction procedure usually need the additional device such as a thermo-electric cooler, shutter, or non-uniformity correction lens. Therefore, we introduce a general scene based non-uniformity correction technique without additional equipment, and then we propose an improved non-uniformity correction algorithm based on image to solve the problem of the existing technique.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1994년도 추계학술대회 논문집
• /
• pp.565-570
• /
• 1994

This work deals with finding a suitable position correction algorithm of industrial robot based on measuring gaps between door and chassis. The algorithm calculates correction quantities and then must allow visually acceptable door-chassis assembly take. The algorithm simulation is performed for a simple door-chassis model, and its effectiveness is addressed in terms of the predefined total unformity, line uniformity. In addition, the error sensitivity analysis of the rotation center of door due to the mismatch of robot grasping is performed using the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1316-1319
• /
• 1996

This paper proposes the algorithm for the correction of a position and orientation of small object such as chip in the precise construction process. In the past, it is general to correct position and orientation of object using human sight and simple vision sensors. But recently, researches using image processing devices have been studied to improve the corrective precision of a position and orientation of object. In this piper, maximum-axis moment and p-theta algorithm are used to correct the position and orientation. Algorithm of maximum-axis moment is widely applied to hetero-object except being applied to a perfect rectangle. This is reason that moments of the X and Y-axis are equal. Therefore, being the shape of a perfect rectangle, the object is applied to other algorithm. In the light of time problem, real-time control is as important as correction of object. To solve it, we use the DSP(Digital Signal Processing) which is far more fast than PC.

• 한국멀티미디어학회논문지
• /
• 제24권11호
• /
• pp.1461-1471
• /
• 2021

This paper presents a light exposure correction algorithm for less pleasant images, acquired with a light metering failure. Since conventional tone mapping and gamma correction methods adopt a function mapping with the same range of input and output, the results are pleasurable for almost symmetric distributions to their intensity average. However, their corrections gave insufficient outputs for asymmetric cases at either bright or dark regions. Also, histogram modification approaches show good results on varied pattern images, but these generate unintentional noises at flat regions because of the compulsive shift of the intensity distribution. Therefore, in order to sufficient corrections for both bright and dark areas, the proposed algorithm calculates the gamma coefficients using primary parameters extracted from the global distribution. And the fusion weights are adaptively determined with complementary parameters, considering the classification information of a binary segmentation. As the result, the proposed algorithm can obtain a good output about both the symmetric and the asymmetric distribution images even with severe exposure values.

• 대한기계학회논문집B
• /
• 제21권3호
• /
• pp.341-349
• /
• 1997

The characteristics of defect correction method are discussed in a sample heat conduction problem showing the numerical solution of the error correction equation can predict the error of the numerical solution of the original governing equation. A way of using defect correction method combined with the existing algorithm for the incompressible fluid flow, is proposed and subsequently tested for the driven square cavity problem. The error correction equations for the continuity equation and the momentum equations are considered to estimate the errors of the numerical solutions of the original governing equations. With this new approach, better velocity and pressure fields can be obtained by correcting the original numerical solutions using the estimated errors. These calculated errors also can be used to estimate the orders of magnitude of the errors of the original numerical solutions.