Algorithmic Evaluation of Line Detection Problem
スポンサーリンク
概要
- 論文の詳細を見る
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 different ideas are also proposed with some experimental results.
- 東北大学の論文
著者
-
Asano Tetsuo
School Of Information Science Jaist
-
Asano Tetsuo
School Of Information Sciences Jaist (japan Advanced Institute Of Science And Technology)
関連論文
- Voronoi Diagrams with Respect to Criteria on Vision Information
- Space-Efficient Algorithm for Image Rotation
- Constant-Work-Space Image Scan with a Given Angle
- Inserting Points Uniformly at Every Instance
- On Detecting Digital Line Components in a Binary Image
- Digital Curve Approximation with Length Evaluation
- Topological Walk Revisited(Special Section on Discrete Mathematics and Its Applications)
- A Linear Time Algorithm for Binary Fingerprint Image Denoising Using Distance Transform
- Digital Halftoning Algorithm Based on Random Space-Filling Curve
- Arranging Fewest Possible Probes to Detect a Hidden Object with Industrial Application
- Digital Halftoning: Algorithm Engineering Challenges
- Algorithmic Evaluation of Line Detection Problem
- Halftoning Through Optimization of Restored Images : A New Approach with Hardware Acceleration
- NP-completeness of generalized Kaboozle
- A Small-Space Algorithm for Removing Small Connected Components from a Binary Image