[论文解读] Geometric primitive feature extraction - concepts, algorithms, and applications

Dilip K. Prasad|arXiv (Cornell University)|May 16, 2013

Image and Object Detection Techniques参考文献 295被引用 5

一句话总结

本文提出了一套全面的框架，用于从数字曲线中提取几何原语——多边形、切线和椭圆。该框架引入了一种无需参数的多边形逼近方法，具有可证明的误差界；一种针对圆锥曲线的切线估计技术，具有保证的误差上限；以及一种线性、非迭代的椭圆拟合与检测方法，具备优异的选择性和稳定性，在准确性和鲁棒性方面显著优于现有方法。

ABSTRACT

This thesis presents important insights and concepts related to the topic of the extraction of geometric primitives from the edge contours of digital images. Three specific problems related to this topic have been studied, viz., polygonal approximation of digital curves, tangent estimation of digital curves, and ellipse fitting anddetection from digital curves. For the problem of polygonal approximation, two fundamental problems have been addressed. First, the nature of the performance evaluation metrics in relation to the local and global fitting characteristics has been studied. Second, an explicit error bound of the error introduced by digitizing a continuous line segment has been derived and used to propose a generic non-heuristic parameter independent framework which can be used in several dominant point detection methods. For the problem of tangent estimation for digital curves, a simple method of tangent estimation has been proposed. It is shown that the method has a definite upper bound of the error for conic digital curves. It has been shown that the method performs better than almost all (seventy two) existing tangent estimation methods for conic as well as several non-conic digital curves. For the problem of fitting ellipses on digital curves, a geometric distance minimization model has been considered. An unconstrained, linear, non-iterative, and numerically stable ellipse fitting method has been proposed and it has been shown that the proposed method has better selectivity for elliptic digital curves (high true positive and low false positive) as compared to several other ellipse fitting methods. For the problem of detecting ellipses in a set of digital curves, several innovative and fast pre-processing, grouping, and hypotheses evaluation concepts applicable for digital curves have been proposed and combined to form an ellipse detection method.

研究动机与目标

• 开发一种理论基础扎实、非启发式的多边形逼近框架，对数字曲线进行逼近并具备可证明的误差界。
• 设计一种切线估计方法，对圆锥曲线和非圆锥曲线数字曲线均能保证上界误差。
• 提出一种数值稳定、线性、非迭代的椭圆拟合方法，最小化几何距离并提升检测选择性。
• 将创新的预处理、分组和假设评估技术整合到一个快速且准确的椭圆检测流水线中，用于数字曲线。
• 建立一种统一的、经过性能评估的几何原语提取方法，适用于多种计算机视觉任务。

提出的方法

• 对性能度量的理论分析揭示了其对局部和全局拟合特性的依赖，从而实现对多边形逼近方法的更优评估。
• 推导出数字化线段的显式误差界，为占优点检测中的无参数框架奠定基础。
• 提出一种基于局部曲线几何的新切线估计方法，证明其在圆锥数字曲线上的误差具有有界性。
• 在椭圆拟合中，采用几何距离最小化模型，并将其转化为无约束的线性系统，无需迭代求解。
• 设计一种快速的预处理流水线，利用曲率和方向对候选点进行分组，从而降低椭圆检测中的误报率。
• 通过多阶段过滤与验证过程增强假设评估，提升检测速度与准确性。

实验结果

研究问题

• RQ1 如何在不依赖启发式参数的前提下实现多边形逼近，同时保持准确性？
• RQ2 数字曲线上切线估计的理论误差界是什么？该误差界是否可在圆锥与非圆锥形状上均实现？
• RQ3 线性、非迭代的椭圆拟合方法能否在无收敛问题的前提下实现高几何精度与选择性？
• RQ4 预处理与分组策略如何提升在噪声数字曲线中椭圆检测的效率与可靠性？
• RQ5 使用几何距离最小化模型对椭圆拟合的鲁棒性与稳定性有何影响？

主要发现

• 所提出的多边形逼近框架由于具备理论误差界，可在无需手动调参的情况下，在各类曲线上保持一致的性能表现。
• 切线估计方法对圆锥曲线实现了保证的上界误差，并在圆锥与非圆锥数字曲线上的准确性上优于72种现有方法。
• 椭圆拟合方法具有数值稳定性，是非迭代的，且相比竞争方法显著提升了真正例率，同时降低了假正例率。
• 集成的椭圆检测流水线通过结合基于曲率的分组与高效的假设验证，实现了快速且可靠的检测。
• 几何距离最小化模型即使在高度数字化的曲线上也能实现鲁棒拟合，相较于迭代方法具有更好的收敛性与稳定性。
• 实证评估证实，所提出的方法在多个基准数据集上，持续在准确性、速度和鲁棒性方面优于最先进技术。