Stereo matching using sub-segmentation and robust higher-order graph cut

Abstract

This paper provides a novel and efficient approach to dense stereo matching. The first contribution is, rather than applying disparity distribution inside a segment as hard constraint to directly project the likelihood of corresponding candidates to each Show more