{'fraction_non_alphanumeric': 0.01034928848641656, 'fraction_numerical': 0.00129366106080207, 'mean_word_length': 5.142857142857143, '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}}
Constrained Nonnegative Matrix Factorization with Applications to Music Transcription

We apply nonnegative matrix factorization to the task of music transcription. In music transcription we are given an audio recording of a musical piece and attempt to find the underlying sheet music which generated the music. We improve upon current transcription results by imposing novel temporal and sparsity constraints which exploit the structure of music. We demonstrate the effectiveness or our technique on the MAPS dataset. 1 Matrix Factorization In this work we consider the problem of matrix factorization and its applications to music transcription. Given a data matrix X with columns as data points, we wish to approximate X as the product of two smaller matrices, B and G.