Arranging and Interpolating Sparse Unorganized Feature Points With Geodesic Circular Arc
Arranging and Interpolating Sparse Unorganized Feature Points With Geodesic Circular Arc
复制标题
DOI：
10.1109/tip.2008.2010146
复制
发表时间：
2009-03
影响因子：
10.6
通讯作者：
S. Xie;Delu Zeng;Zhiheng Zhou;Jun Zhang
中科院分区：
文献类型：
--
作者：
S. Xie;Delu Zeng;Zhiheng Zhou;Jun Zhang
提出了一种利用测地线圆弧重构物体边界的新方法。在该框架内，利用圆弧样条的能量，从期望的边界同时排列和插值稀疏无组织特征点集中的每个成员。首先导出了参数圆弧样条族的一般形式，然后提出了一种基于圆弧样条组形的能量项最小化的特征点排列方法。针对能量函数在其临界点处通常是非凸不可导的事实，本文给出了一种改进的粒子群优化算法来求能量的最小值。该改进方案从稀疏无组织特征点集中提取目标边界上的每对相邻特征点，同时计算对应的方向弦切角，完成插值。实验和比较表明，该方法可以有效地抑制弱边界上的泄漏和长凹边界上的过早收敛。此外，该方法具有良好的噪声鲁棒性，可以很好地提取多边界和开放边界。
A novel method to reconstruct object boundaries with geodesic circular arc is proposed in this paper. Within this framework, an energy of circular arc spline is utilized to simultaneously arrange and interpolate each member in the set of sparse unorganized feature points from the desired boundaries. A general form for a family of parametric circular arc spline is firstly derived and followed by a novel method of arranging these feature points by minimizing an energy term depending on the circular arc spline configuration defined on these feature points. With regard to the fact that the energy function is usually nonconvex and nondifferentiable at its critical points, an improved scheme of particle swarm optimizer is given to find the minimum for the energy in this paper. With this improved scheme, each pair of neighboring feature points along the boundaries of the desired objects are picked out from the set of sparse unorganized feature points, and the corresponding directional chord tangent angles are computed simultaneously to finish interpolation. We show experimentally and comparatively that the proposed method can perform effectively to restrict leakage on weak boundaries and premature convergence on long concave boundaries. Besides, it has good noise robustness and can as well extract multiple and open boundaries.