Performance evaluation of bit-plane slicing based stereo matching techniques

In this paper, we propose a hierarchical framework for stereo matching. Similar to the conventional image pyramids, a series of images with less and less information is constructed. The objective is to use bit-plane slicing technique to investigate the feasibility of correspondence matching with less bits of intensity information. In the experiments, stereo matching with various bit-rate image pairs are carried out using graph cut, semi-global matching, and non-local aggregation methods. The results are submitted to Middlebury stereo page for performance evaluation.