首页> 外文期刊>Journal of Universal Computer Science >An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
【24h】

An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm

机译:基于离散粒子群算法的数字曲线多边形近似的方法

获取原文
       

摘要

An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the polygonal approximation problem, which is represented as a binary vector. The off
机译:提出了一种基于PSO算法的常规数字曲线的多边形近似的方法。在本文中,每个粒子对应于多边形近似问题的候选解决方案,其表示为二元载体。 off.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号