A PROBABILISTIC ALGORITHM FOR COMPUTING HOUGH TRANSFORMS

被引：52

作者：

BERGEN, JR ^{[1
]}

SHVAYTSER, H ^{[1
]}

机构：

[1] SRI INT,DAVID SARNOFF RES CTR,PRINCETON,NJ 08543

来源：

JOURNAL OF ALGORITHMS | 1991年 / 12卷 / 04期

关键词：

D O I：

10.1016/0196-6774(91)90037-Y

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Hough transform is a common technique in computer vision and pattern recognition for recognizing patterns of points. We describe an efficient probabilistic algorithm for a Monte-Carlo approximation to the Hough transform. Our algorithm requires substantially less computation and storage than the standard Hough transform when applied to patterns that are easily recognized by humans. The probabilistic steps involve randomly choosing small subsets of points that jointly vote for likely patterns. © 1991.

引用

页码：639 / 656

页数：18

共 12 条

[1] FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J].