{'fraction_non_alphanumeric': 0.020460358056265986, 'fraction_numerical': 0.0, 'mean_word_length': 5.415300546448087, '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}}
Index-based Similarity Searching with Partial Sequence Comparison for Query-by-Content Audio Retrieval

An efficient representation and organization of acoustic-based music data sequences can help to accelerate the retrieval procedure. In this paper we investigate suitable indexing structures applicable to audio content, depict musical objects representations from NoteSet to spectrum, and consider the design of hashing functions to organize the spectral features. Going on this premise, we present a fast and efficient index-based audio searching algorithm with Partial Sequence Comparison (PSC) for query-by-content music retrieval. Specifically, the features of the reference melodies are organized in terms of the hash function where the similar features collide with a high probability. With a query melody, only a few of the reference features in the database are indexed out. Fewer reference features remain after filtering. They are compared with the query by the proposed PSC method. Experimental results show that the proposed approach achieves high accuracy and the retrieval speed is more than ten times faster than the conventional Dynamic Programming (DP).