Optimal polygonal approximation of digital planar curves using Genetic Algorithm and Tabu Search

被引:0
|
作者
Zhang, Hongbin
Guo, Jianjun
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh-chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
引用
收藏
页码:20 / 28
相关论文
共 50 条
  • [21] Polygonal approximation of digital planar curves through break point suppression
    Carmona-Poyato, A.
    Madrid-Cuevas, F. J.
    Medina-Carnicer, R.
    Munoz-Salinas, R.
    PATTERN RECOGNITION, 2010, 43 (01) : 14 - 25
  • [22] A fast near-optimal algorithm for approximation of polygonal curves
    Kolesnikov, A
    Fränti, P
    16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITON, VOL IV, PROCEEDINGS, 2002, : 335 - 338
  • [23] AN OPTIMAL ALGORITHM FOR POLYGONAL-APPROXIMATION OF DIGITIZED-CURVES
    RAY, BKR
    RAY, KS
    MAJUMDER, DD
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1994, 25 (1-2): : 113 - 126
  • [24] Genetic particle swarm optimization for polygonal approximation of digital curves
    Yin P.Y.
    Pattern Recognition and Image Analysis, 2006, 16 (2) : 223 - 233
  • [25] A Genetic algorithm-based approach for detection of significant vertices for polygonal approximation of digital curves
    Sarkar, Biswajit
    Singh, Lokendra Kumar
    Sarkar, Debranjan
    International Journal of Image and Graphics, 2004, 4 (02) : 223 - 239
  • [26] Genetic algorithm for error-bounded polygonal approximation of curves
    School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
    Jisuanji Yanjiu yu Fazhan, 2007, 11 (1939-1945):
  • [27] Ant colony search algorithms for optimal polygonal approximation of plane curves
    Yin, PY
    PATTERN RECOGNITION, 2003, 36 (08) : 1783 - 1797
  • [28] Fast computation of optimal polygonal approximations of digital planar closed curves
    Aguilera-Aguilera, E. J.
    Carmona-Poyato, A.
    Madrid-Cuevas, F. J.
    Marin-Jimenez, M. J.
    GRAPHICAL MODELS, 2016, 84 : 15 - 27
  • [29] Multiresolution polygonal approximation of digital curves
    Kolesnikov, A
    Fränti, P
    Wu, XL
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 2, 2004, : 855 - 858
  • [30] Piecewise polygonal approximation of digital curves
    Sarfraz, M
    Asim, MR
    Masood, A
    EIGHTH INTERNATIONAL CONFERENCE ON INFORMATION VISUALISATION, PROCEEDINGS, 2004, : 991 - 996