Optimal polygonal approximation of digital planar curves using meta heuristics

被引：14

作者：

Zhang, HB ^{[1
]}

Guo, JJ ^{[1
]}

机构：

[1] Beijing Polytech Univ, Comp Inst, Beijing 100044, Peoples R China

来源：

PATTERN RECOGNITION | 2001年 / 34卷 / 07期

基金：

中国国家自然科学基金;

关键词：

digital planar curves; polygonal approximation; genetic algorithm; pareto optimal solution; tabu search;

D O I：

10.1016/S0031-3203(00)00097-2

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents three heuristic algorithms For optimal polygonal approximation of digital planar curves. We use genetic algorithm (GR), improved genetic algorithm based on Pareto optimal solution (GAP) and tabu search (TS) to obtain a near optimal polygonal approximation. 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. (C) 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

引用

页码：1429 / 1436

页数：8

共 50 条

[41] Comparison of two evolutionary approaches for the polygonal approximation of digital curves
Alvarado-Velazco, Paola Berenice
Ayala-Ramirez, Victor
Advances in Intelligent Systems and Computing, 2013, 175 ADVANCES : 387 - 395
[42] Genetic particle swarm optimization for polygonal approximation of digital curves
Yin P.Y.
Pattern Recognition and Image Analysis, 2006, 16 (2) : 223 - 233
[43] Comparison of Two Evolutionary Approaches for the Polygonal Approximation of Digital Curves
Berenice Alvarado-Velazco, Paola
Ayala-Ramirez, Victor
EVOLVE - A BRIDGE BETWEEN PROBABILITY, SET ORIENTED NUMERICS, AND EVOLUTIONARY COMPUTATION II, 2013, 175 : 387 - 395
[44] A NONPARAMETRIC SEQUENTIAL METHOD FOR POLYGONAL-APPROXIMATION OF DIGITAL CURVES
RAY, BK
RAY, KS
PATTERN RECOGNITION LETTERS, 1994, 15 (02) : 161 - 167
[45] Polygonal approximation of digital curves based on the principles of perceptual organization
Hu, JM
Yan, H
PATTERN RECOGNITION, 1997, 30 (05) : 701 - 718
[46] Handwritten multilingual word segmentation using polygonal approximation of digital curves for Indian languages
Gupta, Deepika
Bag, Soumen
MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (14) : 19361 - 19386
[47] Handwritten multilingual word segmentation using polygonal approximation of digital curves for Indian languages
Deepika Gupta
Soumen Bag
Multimedia Tools and Applications, 2019, 78 : 19361 - 19386
[48] Robust Automatic Traffic Signs Detection Using Fast Polygonal Approximation of Digital Curves
Salhi, Abderrahim
Minaoui, Brahim
Fakir, Mohamed
2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS), 2014, : 433 - 437
[49] An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
Horng, JH
Li, JT
PATTERN RECOGNITION LETTERS, 2002, 23 (1-3) : 171 - 182
[50] An Online Polygonal Approximation of Digital Signals and Curves with Dynamic Programming Algorithm
Kolesnikov, Alexander
19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 1770 - 1773

← 1 2 3 4 5 →