文件名称:Algorithmic-Evaluation-of-Line-Detection-Problem.
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出,可右键点击选“另存为”。
失败请重下,重下不扣分。
如迅雷强制弹出,可右键点击选“另存为”。
失败请重下,重下不扣分。
介绍说明--下载内容均来自于网络,请自行研究使用
The Hough transform is a well-established scheme for detecting digital line components
in a binary edge image. A key to its success in practice is the notion of voting on an
accumulator array in the parameter plane. This paper discusses computational limitation
of such voting-based schema under the constraint that all possible line components in a
given image must be reported. Various improvements are presented based on algorithmic
techniques and data structures. New schema with less computation time and working space
based on totally dierent ideas are also proposed with some experimental results.
in a binary edge image. A key to its success in practice is the notion of voting on an
accumulator array in the parameter plane. This paper discusses computational limitation
of such voting-based schema under the constraint that all possible line components in a
given image must be reported. Various improvements are presented based on algorithmic
techniques and data structures. New schema with less computation time and working space
based on totally dierent ideas are also proposed with some experimental results.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Algorithmic Evaluation of Line Detection Problem.pdf