|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/9514
|
| Title: | Do We Need a Stack to Erase a Component in a Binary Image? |
| Authors: | Asano, Tetsuo |
| Keywords: | constant work space
binary image
component |
| Issue Date: | 2010-05-29 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 6099/2010 |
| Start page: | 16 |
| End page: | 27 |
| DOI: | 10.1007/978-3-642-13122-6_4 |
| Abstract: | 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: | https://hdl.handle.net/10119/9514 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 15867-1.pdf | | 143Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
