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.
展开▼
机译：我们提出了一种基于二维一阶正则图的并行且高效存储的迭代算法。对于具有L次迭代的M X N正则图，精心选择的计算顺序可以将内存资源从O（MN）减少到O（ML）。在典型的计算密集型问题（例如立体声和运动）中，该方案可以将内存减少4到27倍。
展开▼
