• Title/Summary/Keyword: Correction algorithm

Search Result 1,153, Processing Time 0.023 seconds

Optimal design of water distribution system using modified hybrid vision correction algorithm (Modified hybrid vision correction algorithm을 활용한 상수관망 최적설계)

  • Ryu, Yong Min;Lee, Eui Hoon
    • Journal of Korea Water Resources Association
    • /
    • v.55 no.spc1
    • /
    • pp.1271-1282
    • /
    • 2022
  • The optimal design of Water Distribution System (WDS) is used in various ways according to the purpose set by the user. The optimal design of WDS has various purposes, such as minimizing costs and minimizing energy generated when manufacturing pipes. In this study, based on the Modified Hybrid Vision Correction Algorithm (MHVCA), a cost-optimal design was conducted for various WDSs. We also propose a new evaluation index, Best Rate (BR). BR is an evaluation index developed based on the K-mean Clustering Algorithm. Through BR, a comparison was made on the possibility of searching for the optimal design of each algorithm used in the optimal design of WDS. The results of MHVCA for WDS were compared with Vision Correction Algorithm (VCA) and Hybrid Vision Correction Algorithm (HVCA). MHVCA showed a lower cost design than VCA and HVCA. In addition, MHVCA showed better probability of lower cost designs than VCA and HVCA. MHVCA will be able to show good results when applied to the optimal design of WDS for various purposes as well as the optimal design of WDS for cost minimization applied in this study.

Development of the new meta-heuristic optimization algorithm inspired by a vision correction procedure: Vision Correction Algorithm (시력교정 과정에서 착안된 새로운 메타휴리스틱 최적화 알고리즘의 개발: Vision Correction Algorithm)

  • Lee, Eui Hoon;Yoo, Do Guen;Choi, Young Hwan;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.3
    • /
    • pp.117-126
    • /
    • 2016
  • In this study, a new meta-heuristic optimization algorithm, Vision Correction Algorithm (VCA), designed according to the optical properties of glasses was developed. The VCA is a technique applying optometry and vision correction procedure to optimization algorithm through the process of myopic/hyperopic correction-brightness adjustment-compression enforcement-astigmatism adjustment. The proposed VCA unlike the conventional meta-heuristic algorithm is an automatically adjusting global/local search rate and global search direction based on accumulated optimization results. The proposed algorithm was applied to the representative optimization problem (mathematical and engineering problem) and results of the application are compared with that of the present algorithms.

Development of Self-Adaptive Meta-Heuristic Optimization Algorithm: Self-Adaptive Vision Correction Algorithm (자가 적응형 메타휴리스틱 최적화 알고리즘 개발: Self-Adaptive Vision Correction Algorithm)

  • Lee, Eui Hoon;Lee, Ho Min;Choi, Young Hwan;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.6
    • /
    • pp.314-321
    • /
    • 2019
  • The Self-Adaptive Vision Correction Algorithm (SAVCA) developed in this study was suggested for improving usability by modifying four parameters (Modulation Transfer Function Rate, Astigmatic Rate, Astigmatic Factor and Compression Factor) except for Division Rate 1 and Division Rate 2 among six parameters in Vision Correction Algorithm (VCA). For verification, SAVCA was applied to two-dimensional mathematical benchmark functions (Six hump camel back / Easton and fenton) and 30-dimensional mathematical benchmark functions (Schwefel / Hyper sphere). It showed superior performance to other algorithms (Harmony Search, Water Cycle Algorithm, VCA, Genetic Algorithms with Floating-point representation, Shuffled Complex Evolution algorithm and Modified Shuffled Complex Evolution). Finally, SAVCA showed the best results in the engineering problem (speed reducer design). SAVCA, which has not been subjected to complicated parameter adjustment procedures, will be applicable in various fields.

A New Correction Algorithm of Servo Track Writing Error in High-Density Disk Drives (고밀도 디스크 드라이브의 서보트랙 기록오차 보정 알고리즘)

  • 강창익;김창환
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.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.

Performance analysis on the geometric correction algorithms using GCPs - polynomial warping and full camera modelling algorithm

  • Shin, Dong-Seok;Lee, Young-Ran
    • Proceedings of the KSRS Conference
    • /
    • 1998.09a
    • /
    • 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.

  • PDF

A Improved Scene based Non-uniformity Correction Algorithm for Infrared Camera

  • Hyun, Ho-Jin;Choi, Byung-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.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.

Position Correction Algorithm of Door Mounting Robot based on Door-Chassis Gap Sleasure (도어-차체 틈새 측정에 근거한 도어 장착 로보트의 위치 보정 알고리즘 개발)

  • 김미경;강희준
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • 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.

  • PDF

A study on the correction of a position and orientation of the chip using DSP in the 2nd plane (DSP를 이용한 2차원 평면에서 chip의 위치와 자세보정에 관한 연구)

  • 유창목;차영엽
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • 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.

  • PDF

A Light Exposure Correction Algorithm Using Binary Image Segmentation and Adaptive Fusion Weights (이진화 영상분할기법과 적응적 융합 가중치를 이용한 광노출 보정기법)

  • Han, Kyu-Phil
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.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.

Numerical algorithm with the concept of defect correction for incompressible fluid flow analysis (오차수정법을 도입한 비압축성 유체유동 해석을 위한 수치적 방법)

  • Gwon, O-Bung
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.21 no.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.