title: Memory-efficient iterative process on a two-dimensional first-order regular graph.
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.
authors.affiliation: Electronic Department, Pohang University of Science and Technology, Pohang 790-784, South Korea. mrzoo@postech.ac.kr
authors.forename: S C
authors.initials: SC
authors.lastname: Park
authors.forename: H
authors.initials: H
authors.lastname: Jeong