{'fraction_non_alphanumeric': 0.01858736059479554, 'fraction_numerical': 0.007434944237918215, 'mean_word_length': 5.298245614035087, '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}}
An improved Non-Local Cost Aggregation method for stereo matching based on color and boundary cue

Recently, a novel Non-Local Cost Aggregation (NLCA) algorithm based on a minimum spanning tree (MST) has been proposed [1] for stereo matching providing extremely low computational complexity and outstanding performance. However, since the MST is constructed only based on color cue, this approach suffers from some improper connections at the boundaries of two objects with similar color distribution. In this paper, we propose a new weight function which includes not only the color cue but also the boundary cue of the reference image. Because the boundary cue is more discriminative than the color cue to distinguish the object from the background with similar color, the previous improper connections can be avoided and a more faithful MST can be constructed. Experimental results performed on Middlebury benchmark demonstrate the effectiveness of the improvements. The improved algorithm achieves rank 18th out of 143 submissions, while the original algorithm ranks 31th.