{'fraction_non_alphanumeric': 0.015005359056806002, 'fraction_numerical': 0.0, 'mean_word_length': 5.397260273972603, '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}}
Stratified Autocalibration of Cameras with Euclidean Image Plane

This paper tackles the problem of stratified autocalibration of a moving camera with Euclidean image plane (i.e. zero skew and unit aspect ratio) and constant intrinsic parameters. We show that with these assumptions, in addition to the polynomial derived from the so-called modulus constraint, each image pair provides a new quartic polynomial in the unknown plane at infinity. For three or more images, the plane at infinity estimation is stated as a constrained polynomial optimization problem that can efficiently be solved using Lasserre’s hierarchy of semidefinite relaxations. The calibration parameters and thus a metric reconstruction are subsequently obtained by solving a system of linear equations. Synthetic data and real image experiments show that the new polynomial in our proposed algorithm leads to a more reliable performance than existing methods.