{'fraction_non_alphanumeric': 0.012448132780082987, 'fraction_numerical': 0.0, 'mean_word_length': 5.355263157894737, '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}}
Case deletion for fundamental matrix computation

This paper reevaluates the case deletion algorithm for fundamental matrix computation and compares it against two RANSAC variants. The case deletion algorithm has several advantages for use in low-power devices in real-time applications including guaranteed time performance and excellent accuracy. This paper shows that case deletion can be just as accurate, but much more efficient than RANSAC when the ratio of outliers is large.