|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/4725
|
| Title: | On Detecting Digital Line Components in a Binary Image |
| Authors: | ASANO, Tetsuo
OBOKATA, Koji
TOKUYAMA, Takeshi |
| Keywords: | algorithm
computer vision
computational geometry |
| Issue Date: | 2001-05-01 |
| Publisher: | 電子情報通信学会 |
| Magazine name: | IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume: | E84-A |
| Number: | 5 |
| Start page: | 1120 |
| End page: | 1129 |
| Abstract: | This paper addresses the problem of detecting digital line components in a given binary image consisting of n black dots arranged over N × N integer grids. The most popular method in computer vision for this purpose is the one called Hough Transform which transforms each black point to a sinusoidal curve to detect digital line components by voting on the dual plane. We start with a definition of a line component to be detected and present several different algorithms based on the definition. The one extreme is the conventional algorithm based on voting on the subdivided dual plane while the other is the one based on topological walk on an arrangement of sinusoidal curves defined by the Hough transform. Some intermediate algorithm based on half-planar range counting is also presented. Finally, we discuss how to incorporate several practical conditions associated with minimum density and restricted maximality. |
| Rights: | Copyright (C)2001 IEICE. T. Asano, K. Obokata, T. Tokuyama, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E84-A(5), 2001, 1120-1129. http://www.ieice.org/jpn/trans_online/ |
| URI: | https://hdl.handle.net/10119/4725 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 672.pdf | | 346Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
