|
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/9185
|
| Title: | Constant-Working-Space Algorithms for Image Processing |
| Authors: | Asano, Tetsuo |
| Issue Date: | 2009 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 5416/2009 |
| Start page: | 268 |
| End page: | 283 |
| DOI: | 10.1007/978-3-642-00826-9_12 |
| Abstract: | This chapter surveys recent progress in constant-working-space algorithms for problems related to image processing. An extreme case is when an input image is given as read-only memory in which reading an array element is allowed but writing any value at any array element is prohibited, and also the number of working storage cells available for algorithms is at most some constant. This chapter shows how a number of important fundamental problems can be solved in such a highly constrained situation. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano, Lecture Notes in Computer Science, 5416/2009, 2009, 268-283. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-00826-9_12 |
| URI: | https://hdl.handle.net/10119/9185 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 14488.pdf | | 244Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
