WEKO3
インデックスリンク
アイテム
A small-space algorithm for removing small connected components from a binary image
https://doi.org/10.24517/00063386
https://doi.org/10.24517/00063386284dd144-2901-4f53-8bf8-7964339917fc
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
TE-PR-ASANO-T-1044.pdf (73.0 kB)
|
.png)
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2021-07-16 | |||||||
| タイトル | ||||||||
| タイトル | A small-space algorithm for removing small connected components from a binary image | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| ID登録 | ||||||||
| ID登録 | 10.24517/00063386 | |||||||
| ID登録タイプ | JaLC | |||||||
| 著者 |
Asano, Tetsuo
× Asano, Tetsuo× Kumar, Revant |
|||||||
| 著者別表示 |
浅野, 哲夫
× 浅野, 哲夫
|
|||||||
| 提供者所属 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 金沢大学 | |||||||
| 書誌情報 |
IEICE transactions on fundamentals of electronics, communications and computer sciences 巻 E96-A, 号 6, p. 1044-1050, 発行日 2013-06-01 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 0916-8508 | |||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1745-1337 | |||||||
| NCID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA10826239 | |||||||
| DOI | ||||||||
| 関連タイプ | isIdenticalTo | |||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | 10.1587/transfun.E96.A.1044 | |||||||
| 出版者 | ||||||||
| 出版者 | Institute of Electronics, Information and Communication, Engineers, IEICE | |||||||
| 抄録 | ||||||||
| 内容記述タイプ | Abstract | |||||||
| 内容記述 | Given a binary image I and a threshold t, the size-thresholded binary image I(t) defined by I and t is the binary image after removing all connected components consisting of at most t pixels. This paper presents space-efficient algorithms for computing a size-thresholded binary image for a binary image of n pixels, assuming that the image is stored in a read-only array with random-access. With regard to the problem, there are two cases depending on how large the threshold t is, namely, Relatively large threshold where t=Ω(√n), and Relatively small threshold where t=O(√n). In this paper, a new algorithmic framework for the problem is presented. From an algorithmic point of view, the problem can be solved in O(n) time and O(n) work space. We propose new algorithms for both the above cases which compute the size-threshold binary image for any binary image of n pixels in O(n log n) time using only O(√n) work space. | |||||||
| 権利 | ||||||||
| 権利情報 | Copyright © Institute of Electronics, Information and Communication, Engineers, IEICE | |||||||
| 著者版フラグ | ||||||||
| 出版タイプ | VoR | |||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||
| 関連URI | ||||||||
| 識別子タイプ | URI | |||||||
| 関連識別子 | https://www.jstage.jst.go.jp/browse/transfun/-char/ja | |||||||
| 関連名称 | https://www.jstage.jst.go.jp/browse/transfun/-char/ja | |||||||
