{'fraction_non_alphanumeric': 0.021505376344086023, 'fraction_numerical': 0.0, 'mean_word_length': 5.1753554502369665, '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}}
Robust scene matching using line segments

Scene matching is of great interest in the pattern recognition and computer vision domain. Some researchers investigated the problem of scene matching, by employing phase correlation and neural network. Although varying good results have been obtained, noise and occlusion appear to affect the robustness of these matching algorithms. In order to develop a scene matching system that is robust to adverse condition (i.e. occlusion and added noise) and produces intuitively reasonable results, a robust scene matching system based on line segments is proposed in this paper. Since line pattern is effective for scene representation and matching, the proposed system employs a two-stage hierarchy, i.e. line segmentation and matching. In the first stage, the raw scenes are transformed into line segment maps (LSM); in the second stage, the Line Segment Hausdorff Distance (LHD) measure is applied to generate the matches. The line segmentation approach is based on robust shape feature and tends to generate more consistent LSM, while the LHD has the advantage to incorporate structural and spatial information to compute dissimilarity between two sets of line segments rather than two sets of points. Encouraging results have been obtained with aerial images.