{'fraction_non_alphanumeric': 0.01670843776106934, 'fraction_numerical': 0.001670843776106934, 'mean_word_length': 5.112244897959184, '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}}
Looking near one object for another

In order to search for an object as efficiently as possible, it can be very useful to take advantage of the spatial relationships in which it commonly participates. Searches that do so, which we call indirect searches, can be modeled as two-stage processes that first find an intermediate object that commonly participates in a spatial relationship for the target object, and then look for the target in the restricted region specified by this relationship. Using this model, previous work has determined that over a wide range of situations, for searches that involve rotating a camera about a fixed location, indirect searches improve efficiency by factors of 2 to 8. However, several areas require future research if indirect search is to become a widely applicable easily usable technique. This paper describes three major areas in need of study -- recognizing typical intermediate objects, defining spatial relationships, and constructing mechanisms for moving a camera to examine cluttered regions of space. It concentrates especially on the latter topic, discussing many issues arising in the design of systems for looking around clutter and occlusions.