• Title/Summary/Keyword: on line algorithm

Search Result 2,426, Processing Time 0.037 seconds

An Internal Segmentation Method for the On-line Recognition of Run-on Characters (온라인 연속 필기 한글의 인식을 위한 내부 문자 분할에 관한 연구)

  • 정진영;전병환;김우성;김재희
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.1231-1238
    • /
    • 1995
  • In on-line character recognition, to segment input character is important. This paper proposes an internal character segmentation algorithm. The internal segmentation algorithm produces candidate words by considering possible combinations of Korean alphabets. In this process, we make use of projections of strokes onto the horizontal axis to remove ambiguities among candidate words. As a result of experiments, the internal segmentation algorithm shows better performance than external segmentation algorithm as the gap between sample characters becomes smaller.

  • PDF

RANSAC-based Or thogonal Vanishing Point Estimation in the Equirectangular Images

  • Oh, Seon Ho;Jung, Soon Ki
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.12
    • /
    • pp.1430-1441
    • /
    • 2012
  • In this paper, we present an algorithm that quickly and effectively estimates orthogonal vanishing points in equirectangular images of urban environment. Our algorithm is based on the RANSAC (RANdom SAmple Consensus) algorithm and on the characteristics of the line segment in the spherical panorama image of the $360^{\circ}$ longitude and $180^{\circ}$ latitude field of view. These characteristics can be used to reduce the geometric ambiguity in the line segment classification as well as to improve the robustness of vanishing point estimation. The proposed algorithm is validated experimentally on a wide set of images. The results show that our algorithm provides excellent levels of accuracy for the vanishing point estimation as well as line segment classification.

Line Segment Detection Algorithm Using Improved PPHT (개선된 PPHT를 이용한 선분 인식 알고리즘)

  • Lee, Chanho;Moon, Ji-hyun;Nguyen, Duy Phuong
    • Journal of IKEEE
    • /
    • v.20 no.1
    • /
    • pp.82-88
    • /
    • 2016
  • The detection rate of Progressive Probability Hough Transform(PPHT) is decreased when a lot of noise components exist due to an unclear or complex original image although it is quite a good algorithm that detects line segments accurately. In order to solve the problem, we propose an improved line detecting algorithm which is robust to noise components and recovers slightly damaged edges. The proposed algorithm is based on PPHT and traces a line segments by pixel and checks of it is straight. It increases the detection rate by reducing the effect of noise components and by recovering edge patterns within a limited pixel size. The proposed algorithm is applied to a lane detection method and the false positive detection rate is decreased by 30% and the line detection rate is increased by 15%.

Hough Transform Using Straight Line Information of Edge Pixels (에지 화소들의 직선 정보를 이용한 허프변환)

  • Kim, Jin-tae;Oh, Jeong-su
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.674-677
    • /
    • 2017
  • The Hough transform is the most representative algorithm for a straight line detection based on edge pixels. It shows excellent performance in a simple linear image but requires a considerable amount of computation in a noisy or complex image and has a problem of detecting a pseudo straight line easily. In this paper, we propose a straight line detection algorithm to solve the problem of the conventional Hough transform. The proposed algorithm detects the straight line information of edge pixels by using principal component analysis (PCA) before performing Hough transform and performs the Hough transform of the limited slope area in the valid edge pixels based on the detected straight line information of edge pixels. Simulation results show that the proposed algorithm reduces the amount of computation as well as eliminates pseudo straight lines.

  • PDF

Optimal Engine Operation by Shift Speed Improvement for a CVT (CVT 변속속도 개선에 의한 엔진최적운전)

  • Lee, Hee-Ra;Kim, Hyun-Soo
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.546-551
    • /
    • 2001
  • In this paper, an algorithm to improve the optimal engine operation is suggested by increasing the CVT shift speed. By rearranging the CVT shift dynamic equation, it is found that the CVT shift speed depends on the line pressure as well as the primary pressure. Based on the shift dynamics, an algorithm to accomplish a faster shift speed is presented by increasing the line pressure. In order to apply the algorithm, dynamic models of the line pressure control valve and the ratio control valve are obtained by considering the CVT shift dynamics and model based controllers are designed. It is found from the simulation results that fuel economy can be improved by 2% in spite of the increased hydraulic loss due to the increased line pressure.

  • PDF

A Study on Detection Method of Specific Waveform in Distribution Line (배전선로의 특이파형 검출 방법에 관한 연구)

  • Lee, Jin;Park, Chan
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.32 no.2
    • /
    • pp.151-156
    • /
    • 2019
  • The aim of this investigation is to detect specific waveforms in a distribution line prior to the occurrence of a fault. Conditions were introduced such that a feeder remote terminal unit (FRTU) of the distribution automation system selects and stores fault waveforms from the different waveforms detected in the distribution line. In addition, an algorithm was developed to detect specific waveforms from the fault waveforms stored using the FRTU. This algorithm exploits the duration and periodicity of harmonic changes in voltage and current. The efficacy of the algorithm was confirmed based on the measurements of fault waveforms in an actual distribution line. The results indicated that faults in a distribution line can be predicted via experimental measurements.

A Tangential Cutting Algorithm for Rapid Prototyping (쾌속조형을 위한 효과적인 경사절단 알고리즘 개발)

  • 공용해;엄태준;주영철;안덕상
    • Proceedings of the IEEK Conference
    • /
    • 2002.06c
    • /
    • pp.55-58
    • /
    • 2002
  • Rapid Prototyping(RP) systems, that fabricate objects with slicers, typically bear staircase artifacts when slices has a certain degree of thickness. A tangential cutting algorithm is developed in order to remove surface distortion as well as to generate smooth laser-cutting trajectory. For this, an energy function is defined with tangential line length and distance between tangential line and middle contour. Then, the energy is minimized to generate effective tangential line segments. The proposed algorithm is tested and verified on 3D object samples and the results show that the generated tangential lines effectively approximate layer surface and make laser trajectory smooth.

  • PDF

A Study on Effective Moving Object Segmentation and Fast Tracking Algorithm (효율적인 이동물체 분할과 고속 추적 알고리즘에 관한 연구)

  • Jo, Yeong-Seok;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.359-368
    • /
    • 2002
  • In this paper, we propose effective boundary line extraction algorithm for moving objects by matching error image and moving vectors, and fast tracking algorithm for moving object by partial boundary lines. We extracted boundary line for moving object by generating seeds with probability distribution function based on Watershed algorithm, and by extracting boundary line for moving objects through extending seeds, and then by using moving vectors. We processed tracking algorithm for moving object by using a part of boundary lines as features. We set up a part of every-direction boundary line for moving object as the initial feature vectors for moving objects. Then, we tracked moving object within current frames by using feature vector for the previous frames. As the result of the simulation for tracking moving object on the real images, we found that tracking processing of the proposed algorithm was simple due to tracking boundary line only for moving object as a feature, in contrast to the traditional tracking algorithm for active contour line that have varying processing cost with the length of boundary line. The operations was reduced about 39% as contrasted with the full search BMA. Tracking error was less than 4 pixel when the feature vector was $(15\times{5)}$ through the information of every-direction boundary line. The proposed algorithm just needed 200 times of search operation.

The On-Line Economic Load Dispatch Program of Kwangyang Steel Works (광양제철소의 실시간 경제운용 프로그램 개발)

  • Kim, Jae-Chul;Baek, Young-Sik;Lee, Hee-Choon
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.7
    • /
    • pp.318-323
    • /
    • 2001
  • This paper proposes an efficient method of On-Line Economic Load Dispatch(ELD) using Evolutionary Programming(EP) technique at KwangYang steel works. The economic operation of steel works is done by experienced engineer. So far, there is no formulation and algorithm of economic operation of steel works. In this paper, we propose the formulation and On-Line algorithm of economic operation of steel works. The EP technique is the kind of Evolutionary Computation(EC), which has become a candidate for many optimization applications due to its flexibility and efficiency. Based on the EP technique, the proposed algorithm is capable of not only solving the economic problem, but also obtaining the global optimal solutions within reasonable execution time. To validate our proposed approach, the algorithm is demonstrated on many sample systems and compared to actual values of steel works.

  • PDF

The On-Line Economic Load Dispatch Program of Kwangyang Steel Works (광양제철소의 실시간 경제운용 프로그램 개발)

  • Kim, Jae-Chul;Baek, Young-Sik;Lee, Hee-Choon
    • Proceedings of the KIEE Conference
    • /
    • 2000.11a
    • /
    • pp.116-118
    • /
    • 2000
  • This paper proposes an efficient method of On-Line Economic Load Dispatch(ELD) using Evolutionary Programming(EP) technique at Kwangyang steel works. The economic operation of steel works is done by experienced engineer. So far, there is no formulation and algorithm of economic operation of steel works. In this paper, we propose the formulation and On-Line algorithm of economic operation of steel works. The EP technique is the kind of Evolutionary Computation(EC) which has become a candidate for many optimization applications due to its flexibility and efficiency. Based on the EP technique, the proposed algorithm is capable of not only solving the economic problem, but also obtaining the global optimal solutions within reasonable execution time. To validate our proposed approach, the algorithm is demonstrated on many sample systems and compared to actual values of steel works.

  • PDF