• Title/Summary/Keyword: distance transform algorithm

Search Result 147, Processing Time 0.031 seconds

Robust Oriented Hausdorff Measure for 2-D Object Matching (이차원 물체 정합을 위한 Robust Oriented Hausdorff Measure)

  • Sim, Dong-Gyu;Park, Rae-Hong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.11
    • /
    • pp.60-67
    • /
    • 1999
  • This paper proposes a robust oriented Hausdorff measure (ROHM) for 20D object matching. The ROHM is introduced by replacing the distance concept of the conventional Hausdorff distance (HD) algorithm by the accumulation scheme of the Hough transform (HT). The proposed algorithm can be considered as the modified directed HT using the distance transform (DT). The orientation information at each pixel is also used for removing incorrect correspondences. Experiments with various test images show that the performance of the proposed algorithm is better than that of conventional HD algorithms considered.

  • PDF

Distance Transform Path Planning using DEM and Obstacle Map (DEM과 장애물 지도를 이용한 거리변환 경로계획)

  • Choe, Tok-Son;Jee, Tae-Young;Kim, Jun;Park, Yong-Woon;Ryu, Chul-Hyung
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.92-94
    • /
    • 2005
  • Unmanned ground vehicles(UGVs) are expected to play a key role in the future army. These UGVs would be used for weapons platforms. logistics carriers, reconnaissance, surveillance, and target acquisition in the rough terrain. Most of path planning methodologies for UGVs offer an optimal or sub-optimal shortest-path in a 20 space. However, those methodologies do not consider increment and reduction effects of relative distance when a UGV climbs up or goes down in the slope of rough terrain. In this paper, we propose a novel path planning methodology using the modified distance transform algorithm. Our proposed path planning methodology employs two kinds of map. One is binary obstacle map. The other is the DEM. With these two maps, the modified distance transform algorithm in which distance between cells is increased or decreased by weighting function of slope is suggested. The proposed methodology is verified by various simulations on the randomly generated DEM and obstacle map.

  • PDF

Improvement of Digital Distance Relaying Algorithm Using Wavelet Transform in Combined Transmission Line (웨이브렛을 이용한 혼합송전선로에서의 거리계전 알고리즘 개선)

  • 정채균;김경호;하체웅;이종범;윤양웅
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.10
    • /
    • pp.593-601
    • /
    • 2003
  • Distance realy is tripped by the line impedance calculated at the relay point. Accordingly the accurate operation depends on the precise calculation of line impedance. Impedance can be accurately calculated in case of overhead line. However, in case of power cables or combined transmission lines, impedance can not be accurately calculated because cable systems have the sheath, grounding resistance, and sheath voltage limiters(SVLs). There are also several grounding systems in cable systems. Therefore, if there is a fault in cable systems, these terms will severely be caused much error to calculation of impedance. Accordingly the proper compensation should be developed for the correct operation of the distance relay. This paper presents the distance calculating algorithm in combined transmission line with power cable using wavelet transform. In order to achieve such purpose, judgement method to discriminate the fault section in both sections was proposed using D1 coefficient summation in db4. And also, error compensation value was proposed for correct calculation of impedance in power cables section.

Trajectory Distance Algorithm Based on Segment Transformation Distance

  • Wang, Longbao;Lv, Xin;An, Jicun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1095-1109
    • /
    • 2022
  • Along with the popularity of GPS system and smart cell phone, trajectories of pedestrians or vehicles are recorded at any time. The great amount of works had been carried out in order to discover traffic paradigms or other regular patterns buried in the huge trajectory dataset. The core of the mining algorithm is how to evaluate the similarity, that is, the "distance", between trajectories appropriately, then the mining results will be accordance to the reality. Euclidean distance is commonly used in the lots of existed algorithms to measure the similarity, however, the trend of trajectories is usually ignored during the measurement. In this paper, a novel segment transform distance (STD) algorithm is proposed, in which a rule system of line segment transformation is established. The similarity of two-line segments is quantified by the cost of line segment transformation. Further, an improvement of STD, named ST-DTW, is advanced with the use of the traditional method dynamic time warping algorithm (DTW), accelerating the speed of calculating STD. The experimental results show that the error rate of ST-DTW algorithm is 53.97%, which is lower than that of the LCSS algorithm. Besides, all the weights of factors could be adjusted dynamically, making the algorithm suitable for various kinds of applications.

Detecton of OPtical Flow Using Cellular Nonlinear Neural Networks (셀룰라 비선형 회로 구조를 이용한 optical flow 검출)

  • Son, Hong-Rak;Kim, Hyong-Suk
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.3053-3055
    • /
    • 2000
  • The Cellular Nonlinear Networks structure for Distance Transform (DT) and the robust optical flow detection algorithm based on the DT are proposed. The proposed algorithm is for detecting the optical flows on the trajectories only of the feature points. The translation lengths and the directions of feature movements are detected on the trajectories of feature points on which Distance Transform Field is developed. The robustness caused from the use of the Distance Transform and the easiness of hardware implementation with local analog circuits are the properties of the proposed structure, To verify the performance of the proposed structure and the algorithm, simulation has been done about zooming image.

  • PDF

Cell Counting Algorithm Using Radius Variation, Watershed and Distance Transform

  • Kim, Taehoon;Kim, Donggeun;Lee, Sangjoon
    • Journal of Information Processing Systems
    • /
    • v.16 no.1
    • /
    • pp.113-119
    • /
    • 2020
  • This study proposed the structure of the cluster's cell counting algorithm for cell analysis. The image required for cell count is taken under a microscope. At present, the cell counting algorithm is reported to have a problem of low accuracy of results due to uneven shape and size clusters. To solve these problems, the proposed algorithm has a feature of calculating the number of cells in a cluster by applying a radius change analysis to the existing distance conversion and watershed algorithm. Later, cell counting algorithms are expected to yield reliable results if applied to the required field.

Path Planning and Tracking for Mobile Robots Using An Improved Distance Transform Algorithm (개선된 거리변환 알고리즘을 이용한 이동 로봇의 경로 계획 및 추적)

  • Park Jin-Hyun;Park Gi-Hyung;Choi Young-Kiu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.4
    • /
    • pp.782-791
    • /
    • 2005
  • In this paper, path planning and tracking problems are mentioned to guarantee efficient and safe navigation of autonomous mobile robots. We focus on the path planning and also deal with the path tracking and obstacle avoidance. We improved the conventional distance transform (DT) algorithm for the path planning. Using the improved DT algorithm, we obtain paths with shorter distances compared to the conventional DT algorithm. In the stage of the Path tracking, we employ the fuzzy logic controller to conduct the path tracking behavior and obstacle avoidance behavior. Through computer simulation studies, we show the effectiveness of the Nosed navigational algorithm for autonomous mobile robots.

Path Planning and Tracking for Mobile Robots Using An Improved Distance Transform Algorithm (개선된 거리변환 알고리즘을 이용한 이동 로봇의 경로 계획 및 추적)

  • Park, Jin-Hyun;Park, Gi-Hyung;Choi, Young-Kiu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.295-299
    • /
    • 2005
  • In this paper, path planning and tracking problems are mentioned to guarantee efficient and safe navigation of autonomous mobile robots. We focus on the path planning and also deal with the path tracking and obstacle avoidance. We improved the conventional distance transform (DT) algorithm for the path planning. Using the improved DT algorithm, we obtain paths with shorter distances compared to the conventional DT algorithm. In the stage of the path tracking, we employ the fuzzy logic controller to conduct the path tracking behavior and obstacle avoidance behavior. Through computer simulation studies, we show the effectiveness of the proposed navigational algorithm for autonomous mobile robots.

  • PDF

Detection of Optical Flows on the Trajectories of Feature Points Using the Cellular Nonlinear Neural Networks (셀룰라 비선형 네트워크를 이용한 특징점 궤적 상에서 Optical Flow 검출)

  • Son, Hon-Rak;Kim, Hyeong-Suk
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.6
    • /
    • pp.10-21
    • /
    • 2000
  • The Cellular Noninear Networks structure for Distance Transform(DT) and the robust optical flow detection algorithm based on the DT are proposed. For some applications of optical flows such as target tracking and camera ego-motion computation, correct optical flows at a few feature points are more useful than unreliable one at every pixel point. The proposed algorithm is for detecting the optical flows on the trajectories only of the feature points. The translation lengths and the directions of feature movements are detected on the trajectories of feature points on which Distance Transform Field is developed. The robustness caused from the use of the Distance Transform and the easiness of hardware implementation with local analog circuits are the properties of the proposed structure. To verify the performance of the proposed structure and the algorithm, simulation has been done about various images under different noisy environment.

  • PDF

Distance Relaying Algorithm Using a DFT-based Modified Phasor Estimation Method (DFT 기반의 개선된 페이저 연산 기법을 적용한 거리계전 알고리즘)

  • Lee, Dong-Gyu;Kang, Sang-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.8
    • /
    • pp.1360-1365
    • /
    • 2010
  • In this paper, we propose a distance relaying algorithm using a Discrete Fourier Transform (DFT)-based modified phasor estimation method to eliminate the adverse influence of exponentially decaying DC offsets. Most distance relays are based on estimating phasors of the voltage and current signals. A DFT is generally used to calculate the phasor of the fundamental frequency component in digital protective relays. However, the output of the DFT contains an error due to exponentially decaying DC offsets. For this reason, distance relays have a tendency to over-reach or under-reach in the presence of DC offset components in a fault current. Therefore, the decaying DC components should be taken into consideration when calculating the phasor of the fundamental frequency component of a relaying signal. The error due to DC offsets in a DFT is calculated and eliminated using the outputs of an even-sample-set DFT and an odd-sample-set DFT, so that the phasor of the fundamental component can be accurately estimated. The performance of the proposed algorithm is evaluated for a-phase to ground faults on a 345 kV, 50 km, simple overhead transmission line. The Electromagnetic Transient Program (EMTP) is used to generate fault signals. The evaluation results indicate that adopting the proposed algorithm in distance relays can effectively suppress the adverse influence of DC offsets.