OpenCV中概率霍夫变换的具体实现是什么? [英] What is the particular implementation of Probabilistic Hough Transform in OpenCV?

问题描述

有人知道OpenCV实现中的概率霍夫变换的特定算法吗?我的意思是，是否有关于该算法的参考文件或文档?

Does anyone know the particular algorithm for Probabilistic Hough Transform in the OpenCV's implementation? I mean, is there a reference paper or documentation about the algorithm?

要理解这个主意，我当然可以研究一下源代码，但是我想知道是否有任何有关它的文档. -它不在源代码的注释中(OpenCV 1.0).

To get the idea, I can certainly look into the source code, but I wonder if there is any documentation about it. -- it's not in the source code's comments (OpenCV 1.0).

谢谢！

-金

推荐答案

这里有一篇有关随机霍夫变换的文章，我相信它与OpenCV中使用的概率霍夫变换"相同 http://en.wikipedia.org/wiki/Randomized_Hough_Transform

Here's an article about the Randomized Hough Transform which i believe to be the same as the "probabilistic Hough transform" used in OpenCV http://en.wikipedia.org/wiki/Randomized_Hough_Transform

基本上，您不会为所有点填充累加器，而是选择具有一定条件的一组点来填充Hough变换.

basically, you dont fill up the accumulator for all points but choose a set of points with a certain criteria to fill up the Hough transform.

其结果是，有时，如果没有足够的起点，您可能会错过实际的行.我想如果您具有某种线性结构，那么您将要使用此函数，这样大多数点将是多余的. 参考编号2:L.Xu，E.Oja和P. Kultanan，一种新的曲线检测方法:随机霍夫变换(RHT)"，Pattern Recog.来吧1990年11月11日，第331-338页.

The consequence is that sometimes, you could miss the actual line if there wasnt eenough points ot start with. I guess you'd want to use this if you have somewhat linear structures so that most points would be redundant. reference no 2: L. Xu, E. Oja, and P. Kultanan, "A new curve detection method: Randomized Hough transform (RHT)", Pattern Recog. Lett. 11, 1990, 331-338.

我还阅读了一些非常不同的方法，其中算法将获取两个点，并在这两个点的中间计算该点.如果该点是边缘点，则我们将累积该线的分箱.这显然是非常快的，但是您会假设矩阵有点不稀疏，因为如果没有足够的边缘点开始，您很容易错过行.

I also read about some pretty different approaches where the algorithms would take two points and compute the point in the middle of those two points. if the point is an edge point, then we'd accumulate the bin for that line. This is apparently extremely fast but you'd assume a somewhat non-sparse matrix as you could easily miss lines if there wasnt enough edge points to start with.

这篇关于OpenCV中概率霍夫变换的具体实现是什么?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！