{'fraction_non_alphanumeric': 0.020361990950226245, 'fraction_numerical': 0.0022624434389140274, 'mean_word_length': 5.188811188811189, '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}}
Performance Bound of Position Estimation in Image Matching

Position estimation in image matching is a fundamental step in computer vision and image processing. To deal with the problem of performance prediction, we formulate it under statistical parameter estimation aspect. The lower bound of position estimation variance is obtained based on Cramer-Rao lower bound (CRLB) theory. This paper analyses the impact of noise to 1-D signal matching, derives the lower bound of variance, and then extends it to 2-D image matching. Furthermore, we derive numerical expression that can be computed from observed data. Finally, we use Monte Carlo simulation method to verify the derived analytical expressions. Experimental results show that the derived CRLB is tight to simulation estimated variance. The CRLB can characterize the performance bound of position estimation in image matching.