Ant colony search algorithms for optimal polygonal approximation of plane curves.

DOI10.1016/S0031-3203(02)00321-7zbMath1055.68104MaRDI QIDQ1403765

Peng-Yeng Yin

Publication date: 4 September 2003

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

Genetic algorithmTabu searchPolygonal approximationAnt colony search algorithmGlobal optimal solutionLocal optimal solution

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Automatic segmentation of metaphase cells based on global context and variant analysis, Polygonal approximation of closed discrete curves, On the Farey sequence and its augmentation for applications to image analysis, A discrete geometry approach for dominant point detection, An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP), Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique, Polygonal approximation using integer particle swarm optimization, Digital Straightness, Circularity, and Their Applications to Image Analysis, Data reduction of large vector graphics, Ant colony optimization for the nonlinear resource allocation problem, A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test

Cites Work

• Unnamed Item
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Efficiently searching a graph by a smell-oriented vertex process
• Polygonal approximation by the minimax method