Memory-efficient iterative process on a two-dimensional first-order regular graph.
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.