WEKO3
アイテム
領域分離と最小二乗法による濃淡画像からの線分抽出
https://ipsj.ixsq.nii.ac.jp/records/53791
https://ipsj.ixsq.nii.ac.jp/records/53791d7139be7-6400-4cc0-9c89-b1b474861f4f
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-CVIM84031003.pdf (535.1 kB)
|
Copyright (c) 1984 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | SIG Technical Reports(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1984-07-19 | |||||||
| タイトル | ||||||||
| タイトル | 領域分離と最小二乗法による濃淡画像からの線分抽出 | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | LINE FINDING BY USING AREA CONSTRUCTION AND LEAST SQURES FIT | |||||||
| 言語 | ||||||||
| 言語 | jpn | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
| 資源タイプ | technical report | |||||||
| 著者所属 | ||||||||
| 筑波大学 | ||||||||
| 著者所属 | ||||||||
| 筑波大学 | ||||||||
| 著者所属 | ||||||||
| 筑波大学 | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| University of Tsukuba | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| University of Tsukuba | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| University of Tsukuba | ||||||||
| 著者名 |
坪内, 孝司
× 坪内, 孝司
|
|||||||
| 著者名(英) |
Takashi, Tsubouchi
× Takashi, Tsubouchi
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper describes how to find straight line segments from gray scale images. It should be paid attention to the fact that directions of gradient of brightness of pixels on a line segment are approximately equal. Pixels having the follwing properties are firstly connected together to construct an area: (1) Magnitude of the gradient of the pixel is greater than a threshold value. (2) Direction of the gradient of the pixel falls within a small range of directions. (3) All pixels are connected each other. Linearity of each area is evaluated by computing the long and short diameters of the inertially equivalent ellipse. The advantages of this method are (1) the algorithm is fast because it needs only one scan to obtain the moments (2) the effect of local noise is greatly reduced and (3) the "reliability" of the linearity can be quantitatively expressed by means of the moments. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper describes how to find straight line segments from gray scale images. It should be paid attention to the fact that directions of gradient of brightness of pixels on a line segment are approximately equal. Pixels having the follwing properties are firstly connected together to construct an area: (1) Magnitude of the gradient of the pixel is greater than a threshold value. (2) Direction of the gradient of the pixel falls within a small range of directions. (3) All pixels are connected each other. Linearity of each area is evaluated by computing the long and short diameters of the inertially equivalent ellipse. The advantages of this method are (1) the algorithm is fast because it needs only one scan to obtain the moments, (2) the effect of local noise is greatly reduced, and (3) the "reliability" of the linearity can be quantitatively expressed by means of the moments. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11131797 | |||||||
| 書誌情報 |
情報処理学会研究報告コンピュータビジョンとイメージメディア（CVIM） 巻 1984, 号 23(1984-CVIM-031), p. 1-6, 発行日 1984-07-19 |
|||||||
| Notice | ||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
