|
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/10275
|
| Title: | In-place Algorithm for Erasing a Connected Component ina Binary Image |
| Authors: | Asano, Tetsuo |
| Keywords: | algorithm
binary image
component
connectivity
constant work space |
| Issue Date: | 2011-06-11 |
| Publisher: | Springer |
| Magazine name: | Theory of Computing Systems |
| Volume: | 50 |
| Number: | 1 |
| Start page: | 111 |
| End page: | 123 |
| DOI: | 10.1007/s00224-011-9335-6 |
| Abstract: | 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: | https://hdl.handle.net/10119/10275 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 17229.pdf | | 182Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
