arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.01662cs.CG
收藏

一种最大距离变换算法的正确性证明及时间复杂度分析

Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm

Mihir Sahasrabudhe, Siddhartha Chandra

摘要:

距离变换算法是计算机视觉和机器学习领域的一种常用算法。它用于在点的网格上最小化二次函数。Felzenszwalb和Huttenlocher(2004)描述了一个O(N)算法来计算二次函数的最小距离变换。他们的算法通过计算定义在函数域上的一组抛物线的下包络来工作。在这项工作中,我们描述了一个平均时间O(N)算法,通过计算一组抛物线的上包络来最大化这个函数。我们研究了最小和最大距离变换的对偶性,给出了算法的正确性证明及其运行时间,并讨论了潜在的应用。

英文摘要:

The distance transform algorithm is popular in computer vision and machine learning domains. It is used to minimize quadratic functions over a grid of points. Felzenszwalb and Huttenlocher (2004) describe an O(N) algorithm for computing the minimum distance transform for quadratic functions. Their algorithm works by computing the lower envelope of a set of parabolas defined on the domain of the function. In this work, we describe an average time O(N) algorithm for maximizing this function by computing the upper envelope of a set of parabolas. We study the duality of the minimum and maximum distance transforms, give a correctness proof of the algorithm and its runtime, and discuss potential applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑