A new fast polygonal approximation algorithm is presented.
提出一种新的多边形逼近算法。
Polygonal approximation of digital curves is one of the crucial steps prior to many image analysis tasks.
与其他步骤相比，数字曲线的多边形近似比其它图像分析任务都要重要。
An improved approach to polygonal approximation of regular digital curves based on GA algorithm is presented.
提出了一种基于遗传算法的数字曲线多边形改进逼近方法。
This paper presents a new polygonal approximation approach based on the particle swarm optimization (PSO) algorithm.
本文提出一种新的基于多边形逼近算法的粒子群优化算法。
Each particle represented as a binary vector corresponds to a candidate solution to the polygonal approximation problem.
每个粒子被描绘成一个二元向量相当于一个候选人的多边形逼近问题的解决方案。
Giving the number of segment points, a polygonal approximation method is presented. Then a fast contour interpolating method is introduced.
提出一种给定分段点数的轮廓多边形近似方法，继而提出一种快速断面图象间轮廊插值方法。
Polygonal approximation is used to find out all the possible split paths. And the optimal split path is chosen according to the assumption that blood cells are in round shapes.
这种算法在分解中利用多边形近似寻找出所有可能的分割线，结合血细胞是圆形的假设确定最佳分割线。
Detecting dominant points is an important subject in pattern recognition and computer vision. Corner detection and polygonal approximation are two major approaches for dominant point detection.
景物的特征点抽取是模式识别及计算机视觉中的一个重要问题，已出现的多种检测特征点的方法中主要有角检测法和多边形逼近法。
The quality of approximation is as good as polygonal boundary reduction, and it can process the data online in a constant buffer.
算法具有多边形约简算法相同的优良的近似质量，并可在固定数据缓冲区空间内在线运算。
The quality of approximation is as good as polygonal boundary reduction, and it can process the data online in a constant buffer.
算法具有多边形约简算法相同的优良的近似质量，并可在固定数据缓冲区空间内在线运算。
应用推荐