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.

Algorithmic Evaluation of Line Detection Problem.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．