International Symposium/Conference on Music Information Retrieval · 2004 · 143 citations · 12 references
ComputingElectrical EngineeringMachine LearningMusic AnalysisTime Series AnalysisComputational MusicologyDigital Signal ProcessingSignal ProcessingSpectral AnalysisSpectral Data ProcessingTime-frequency AnalysisIndependent Component AnalysisPiano TranscriptionPower Spectral DensityPower Spectral Density EstimationSparse CodingSpectral DecompositionSpectral Feature ExtractionSpectral Features
We present a system for adaptive spectral basis decomposition that learns to identify independent spectral features given a sequence of short-term Fourier spectra. When applied to recordings of polyphonic piano music, the individual notes are identified as salient features, and hence each short-term spectrum is decomposed into a sum of note spectra; the resulting encoding can be used as a basis for polyphonic transcription. The system is based on a probabilistic model equivalent to a form of noisy independent component analysis (ICA) or sparse coding with non-negativity constraints. We introduce a novel modification to this model that recognises that a short-term Fourier spectrum can be thought of as a noisy realisation of the power spectral density of an underlying Gaussian process, where the noise is essentially multiplicative and non-Gaussian. Results are presented for an analysis of a live recording of polyphonic piano music.
12
Learning the parts of objects by non-negative matrix factorization
Daniel D. Lee, H. Sebastian Seung · Nature · 1999 · 14.1K citations
Algorithms for Non-negative Matrix Factorization
Daniel D. Lee, H. Sebastian Seung · 2000 · 5.5K citations
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
D Seung, Lin-Wen Lee · 2001 · 4.8K citations
Learning Overcomplete Representations
Michael S. Lewicki, Terrence J. Sejnowski · Neural Computation · 2000 · 1.1K citations