{'fraction_non_alphanumeric': 0.011128775834658187, 'fraction_numerical': 0.001589825119236884, 'mean_word_length': 5.326633165829146, '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}}
Image Clustering under Domain Shift

We address domain adaptation in the context of clustering where we are given a set of unlabeled data, coming from several domains, and the goal is to group data into different categories regardless of the domain they come from. This is a challenging problem since we do not have any supervision unlike most adaptation scenarios studied earlier, and is very relevant in practical industry applications where labeled data often comes at a premium especially while deploying services that do not have a comparable predecessor. Our philosophy in addressing this problem draws motivation from the concept of dirty paper coding, a communications technique where the signal being transmitted through a noisy channel is encoded with priors on the possible noise patterns to assist reliable decoding of the signal at the receiver. We focus on image applications in this paper, where we encode priors on possible image domain shift factors such as viewpoint, lighting, blur and appearance variations and utilize geometric adaptation mechanisms to perform clustering. We illustrate the utility of our approach on standard datasets involving objects and faces, by obtaining around 18% improvement on average over existing approaches.