{'fraction_non_alphanumeric': 0.016587677725118485, 'fraction_numerical': 0.0, 'mean_word_length': 5.507692307692308, '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}}
Low complexity SIFT compression techniques

Visual search for mobile devices relies on transmitting wirelessly image descriptors to a remote server. Hence, descriptors needs to be compressed to reduce bandwidth occupancy and network latency. In this paper, we investigate on the compression ratio versus accuracy of two low complexity coding schemes, based on Arithmetic and Type coding, applied to SIFT local descriptors.