Characterizing the hierarchical Hough transform through a polygonal approximation algorithm

1995 ◽  
Vol 16 (4) ◽  
pp. 389-397 ◽  
Author(s):  
Souheil Ben Yacoub ◽  
Jean-Michel Jolion
Keyword(s):  
Approximation Algorithm ◽  
Hough Transform ◽  
Polygonal Approximation

An Improved Sequential Polygonal Approximation Algorithm on Skeleton Curves

2009 ◽  
Vol 34 (12) ◽  
pp. 1467-1474
Author(s):  
Zhe LV ◽  
Fu-Li WANG ◽  
Yu-Qing CHANG ◽  
Yang LIU
Keyword(s):  
Approximation Algorithm ◽  
Polygonal Approximation

GENETIC ALGORITHMS FOR ERROR-BOUNDED POLYGONAL APPROXIMATION

2000 ◽  
Vol 14 (03) ◽  
pp. 297-314 ◽  
Author(s):  
YUNG-NIEN SUN ◽  
SHU-CHIEN HUANG
Keyword(s):  
Genetic Algorithms ◽  
Approximation Algorithm ◽  
Genetic Evolution ◽  
Optimal Solutions ◽  
Polygonal Approximation ◽  
Genetic Operators ◽  
The Given ◽  
Number Of Segments ◽  
Crossover And Mutation ◽  
Error Condition

A new polygonal approximation algorithm, employing the concept of genetic evolution, is presented. In the proposed method, a chromosome is used to represent a polygon by a binary string. Each bit, called a gene, represents a point on the given curve. Three genetic operators, including selection, crossover, and mutation, are designed to obtain the approximated polygon whose error is bounded by a given norm. Many experiments show that the convergence is guaranteed and the optimal or near-optimal solutions can be obtained. Compared with the Zhu–Seneviratne algorithm,24 the proposed algorithm successfully reduced the number of segments under the same error condition in the polygonal approximation.

scholarly journals Expanded Douglas–Peucker Polygonal Approximation and Opposite Angle-Based Exact Cell Decomposition for Path Planning with Curvilinear Obstacles

2019 ◽  
Vol 9 (4) ◽  
pp. 638 ◽  
Author(s):  
Jin-Woo Jung ◽  
Byung-Chul So ◽  
Jin-Gu Kang ◽  
Dong-Woo Lim ◽  
Yunsik Son
Keyword(s):  
Approximation Algorithm ◽  
Path Planning ◽  
Cell Decomposition ◽  
Decomposition Algorithm ◽  
Planning Problem ◽  
Polygonal Approximation ◽  
Robot Path Planning ◽  
Path Planning Problem ◽  
Robot Path ◽  
Vertical Cell

The Expanded Douglas–Peucker (EDP) polygonal approximation algorithm and its application method for the Opposite Angle-Based Exact Cell Decomposition (OAECD) are proposed for the mobile robot path-planning problem with curvilinear obstacles. The performance of the proposed algorithm is compared with the existing Douglas–Peucker (DP) polygonal approximation and vertical cell decomposition algorithm. The experimental results show that the path generated by the OAECD algorithm with EDP approximation appears much more natural and efficient than the path generated by the vertical cell decomposition algorithm with DP approximation.

Modified Hough Transform in Problem of Increasing Probability of Target Detection in Electronic Surveillance Systems

2019 ◽  
Vol 24 (3) ◽  
pp. 291-300
Author(s):  
Evgeny I. Minakov ◽  
◽  
Aleksandr V. Meshkov ◽  
Elena O. Meshkova ◽  
◽  
...  
Keyword(s):  
Target Detection ◽  
Hough Transform ◽  
Surveillance Systems ◽  
Electronic Surveillance
Sign in / Sign up

Export Citation Format

Share Document