|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4893
|
| タイトル: | A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images |
| 著者: | Asano, Tetsuo
Katoh, Naoki
Tokuyama, Takeshi |
| キーワード: | Algorithm
Digital Curve
Arrangement
Image Recognition |
| 発行日: | 2001-03 |
| 出版者: | Elsevier |
| 誌名: | Computational Geometry |
| 巻: | 18 |
| 号: | 2 |
| 開始ページ: | 73 |
| 終了ページ: | 93 |
| DOI: | 10.1016/S0925-7721(01)00002-5 |
| 抄録: | We present a unified scheme for detecting digital components of various planar curves in a binary edge image. A digital component of a curve is the set of input edge points from each of which the horizontal or vertical distance to the curve is at most 0.5. Our algorithm outputs all curve components containing at least k points (k is a given threshold) in O(n^d) time (if d ≥ 2) and linear space, where n is the number of points, and d is a measure that reflects the complexity of a family of curves; for example, d = 2, 3, and 5 for lines, circles, and ellipses, respectively. For most of the popular families of curves, our only primitive operations are algebraic operations of bounded degree and comparisons. We also propose an approximate algorithm for computing an approximation solution with error ratio ε = 1 - α (called an α-sensitive solution), whose time complexity is O((t/ε)^<d-1>n), which is very efficient if the threshold-ratio t = n/k is small. |
| Rights: | NOTICE: This is the author's version of a work accepted for publication by Elsevier. Tetsuo Asano, Naoki Katoh and Takeshi Tokuyama, Computational Geometry, 18(2), 2001, 73-93, http://dx.doi.org/10.1016/S0925-7721(01)00002-5 |
| URI: | http://hdl.handle.net/10119/4893 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C1327.pdf | | 220Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
