|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10275
|
| タイトル: | In-place Algorithm for Erasing a Connected Component ina Binary Image |
| 著者: | Asano, Tetsuo |
| キーワード: | algorithm
binary image
component
connectivity
constant work space |
| 発行日: | 2011-06-11 |
| 出版者: | Springer |
| 誌名: | Theory of Computing Systems |
| 巻: | 50 |
| 号: | 1 |
| 開始ページ: | 111 |
| 終了ページ: | 123 |
| DOI: | 10.1007/s00224-011-9335-6 |
| 抄録: | Removing noise in a given binary image is a common operation. A generalization of the operation is to erase an arbitrarily specified component by reversing pixel values in the component. This paper shows that this operation can be done without using any data structure like a stack or queue, or more exactly using only constant extra memory (consisting of a constant number of words of O(log n) bits for an image of n pixels) in O(mlog m) time for a component consisting of m pixels. This is an in-place algorithm, but the image matrix cannot be used as work space since it has just one bit for each pixel. Whenever we flip a pixel value in a target component, the component shape is also deformed, which causes some difficulty. The main idea for our constant work space algorithm is to deform a component so that its connectivity is preserved. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano, Theory of Computing Systems, 50(1), 2011, 111-123. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/s00224-011-9335-6 |
| URI: | http://hdl.handle.net/10119/10275 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 17229.pdf | | 182Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
