Ant colony search algorithms for optimal polygonal approximation of plane curves

@article{Yin2003AntCS,
  title={Ant colony search algorithms for optimal polygonal approximation of plane curves},
  author={Peng-Yeng Yin},
  journal={Pattern Recognition},
  year={2003},
  volume={36},
  pages={1783-1797}
}
This paper presents a new polygonal approximation method using ant colony search algorithm. The problem is represented by a directed graph such that the objective of the original problem becomes to .nd the shortest closed circuit on the graph under the problem-speci.c constraints. A number of arti.cial ants are distributed on the graph and communicate with one another through the pheromone trails which are a form of the long-term memory guiding the future exploration of the graph. The important… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

76 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 76 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Genetic algorithms for polygonal approximation of digital curves

  • P. Y. Yin
  • Int. J. Pattern Recognition Artif. Intell. 13
  • 1999
Highly Influential
8 Excerpts

Optimization

  • M. Dorigo
  • learning, and natural algorithms, Ph.D. Thesis…
  • 1992
Highly Influential
4 Excerpts

Combined heat and power economic dispatch by improved ant colony search algorithm

  • Y. H. Song, C. S. Chou, T. J. Stonham
  • Electric Power Systems Res. 52
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…