{'fraction_non_alphanumeric': 0.0315648085963734, 'fraction_numerical': 0.009402283411685695, 'mean_word_length': 4.8893280632411065, '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}}
Differential Effect of Object Complexity on 2-D and 3-D Matching Processes

Previously, we found that two matching processes work in parallel when an object is recognised from unknown viewpoints: the 2-dimensional (2-D) and the 3-dimensional (3-D) matching process. These processes were shown to differ in several respects, including recognition speed, generalisation range, and learning ability. We have now examined the effect of the complexity of an object on these two matching processes. We performed a recognition experiment where the subjects had to compare two sequentially presented images. The stimuli were objects that had different numbers of segments, presented for either 1.5 s (short condition) or 3.0 s (long condition). The different presentation times enabled us to separate the two processes, as 3-D matching requires a longer processing time. We adopted the ability to generalise from a known view as a measure of the performance of each process. Under the ‘short’ condition, the generalisation range for objects of high complexity was almost the same as that for objects of low complexity. Under the ‘long’ condition, however, the ranges for objects differing in complexity were significantly different. Our interpretation is that the effect of complexity was mainly associated with the 3-D matching process. The matching performed by the 2-D process under a shorter duration may be a simple image-to-image matching without recourse to the 3-D structure of the object.