{'fraction_non_alphanumeric': 0.01680672268907563, 'fraction_numerical': 0.0, 'mean_word_length': 5.809523809523809, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Accurate Dense Stereo by Constraining Local Consistency on Superpixels

Segmentation is a low-level vision cue often deployed by stereo algorithms to assume that disparity within superpixels varies smoothly. In this paper, we show that constraining, on a superpixel basis, the cues provided by a recently proposed technique, which explicitly models local consistency among neighboring points, yields accurate and dense disparity fields. Our proposal, starting from the initial disparity hypotheses of a fast dense stereo algorithm based on scan line optimization, demonstrates its effectiveness by enabling us to obtain results comparable to top-ranked algorithms based on iterative disparity optimization methods.