{'fraction_non_alphanumeric': 0.01607717041800643, 'fraction_numerical': 0.003215434083601286, 'mean_word_length': 4.5625, '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 fitting of ellipses with heuristics

In this paper we solve the problem of robust fitting of ellipses to a set of points under condition of very high noise (when more than 50% of the points are outliers), using the sum of the orthogonal distances (instead of the sum of the squares of the distances) from the given points to the fitted ellipse. The fitting problem now is nonlinear and is solved using Differential Evolution. We demonstrate by simulations that one or several ellipses can be extracted from the data set of points. The proposed method is compared with the least median of squares solved with RANSAC.