Exploring Trade-Offs between Specialized Dataflow Kernels and a Reusable Overlay in a Stereo Matching Case Study

Figure 11

Illustration of downward scanline compute pattern with blocks of width 4 indicating the unrolling potential in -dimension. Arrows indicate dependencies; for the computation of the red boxes (scanline cost is computed; minimum is updated), data from all yellow boxes is required. Paths are chosen either as previous scanline cost at the same disparity without any penalty (red box) or as previous scanline cost at neighboring disparity plus penalty (boxes next to red box) or as global minimum of previous line plus penalty (outer boxes).