|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9514
|
| タイトル: | Do We Need a Stack to Erase a Component in a Binary Image? |
| 著者: | Asano, Tetsuo |
| キーワード: | constant work space
binary image
component |
| 発行日: | 2010-05-29 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 6099/2010 |
| 開始ページ: | 16 |
| 終了ページ: | 27 |
| DOI: | 10.1007/978-3-642-13122-6_4 |
| 抄録: | Removing noises in a given binary image is one of common operations. A generalization of the operation is to erase arbitrarily specified component by reversing pixels values in the component. This paper shows that this operation is done without using any data structure like a stack or queue, or without using any extra work space in O(n logn) time for a component consisting of n pixels. This is an in-place algorithm, but the image matrix cannot be used as work space since it has a single bit for each pixel. Whenever we flip pixel value in an objective component, the component shape also changes, which causes some difficulty. An idea for our constant work space algorithm is a conversion keeping its topology. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano, Lecture Notes in Computer Science, 6099/2010, 2010, 16-27. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-13122-6_4 |
| URI: | http://hdl.handle.net/10119/9514 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 15867-1.pdf | | 143Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
