|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4725
|
| タイトル: | On Detecting Digital Line Components in a Binary Image |
| 著者: | ASANO, Tetsuo
OBOKATA, Koji
TOKUYAMA, Takeshi |
| キーワード: | algorithm
computer vision
computational geometry |
| 発行日: | 2001-05-01 |
| 出版者: | 電子情報通信学会 |
| 誌名: | IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences |
| 巻: | E84-A |
| 号: | 5 |
| 開始ページ: | 1120 |
| 終了ページ: | 1129 |
| 抄録: | 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: | http://hdl.handle.net/10119/4725 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 672.pdf | | 346Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
