{'fraction_non_alphanumeric': 0.013212221304706853, 'fraction_numerical': 0.0, 'mean_word_length': 5.247422680412371, '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}}
Plausible image matching: determining dense and smooth mapping between images without a priori knowledge

This paper presents a method for automatic determination of dense and smooth mapping between two images without a priori knowledge of either the camera pose or the objects in the images. We designed an algorithm to find the mapping between a pair of arbitrary images, and accomplish automatic image morphing. In order to extract image features which look natural to human, we use a set of linear filters similar to those that are used in early vision. Then the derived vector fields consisting of filter responses are matched with each other through a minimization of the cost function which expresses the similarity of transformed images and mapping smoothness, in a multiresolutional hierarchy. Since the cost function in general is highly nonlinear, we avoid excessive distortion in the estimated mapping by providing a local convexity of mapping in nonlinear optimization. In this paper, a variety of experimental results are discussed for various data sets, including images of rotating objects, static objects, human faces and texture patterns, to demonstrate the performance of the proposed method.