Memory-efficient iterative process on a two-dimensional first-order regular graph
SCIE
SCOPUS
- Title
- Memory-efficient iterative process on a two-dimensional first-order regular graph
- Authors
- Park, SC; Jeong, H
- Date Issued
- 2008-01-01
- Publisher
- OPTICAL SOC AMER
- Abstract
- We present a parallel and memory-efficient iterative algorithm based on 2D first-order regular graphs. For an M x N regular graph with L iterations, a carefully chosen computation order can reduce the memory resources from O(MN) to O(ML). This scheme can achieve a memory reduction of 4 to 27 times in typical computation-intensive problems such as stereo and motion. (c) 2007 Optical Society of America
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/22972
- DOI
- 10.1364/OL.33.000074
- ISSN
- 0146-9592
- Article Type
- Article
- Citation
- OPTICS LETTERS, vol. 33, no. 1, page. 74 - 76, 2008-01-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.