A New Probabilistic Spectral Pitch Estimator: Exact and MCMC-approximate Strategies

  • Harvey D. Thornburg
  • Randal J. Leistikow
Conference paper

DOI: 10.1007/978-3-540-31807-1_3

Volume 3310 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Thornburg H.D., Leistikow R.J. (2005) A New Probabilistic Spectral Pitch Estimator: Exact and MCMC-approximate Strategies. In: Wiil U.K. (eds) Computer Music Modeling and Retrieval. CMMR 2004. Lecture Notes in Computer Science, vol 3310. Springer, Berlin, Heidelberg

Abstract

We propose a robust probabilistic pitch (f0) estimator in the presence of interference and low SNR conditions, without the computational requirements of optimal time-domain methods. Our analysis is driven by sinusoidal peaks extracted by a windowed STFT. Given f0 and a reference amplitude (A0), peak frequency/amplitude observations are modeled probabilistically in order to be robust to undetected harmonics, spurious peaks, skewed peak estimates, and inherent deviations from ideal or other assumed harmonic structure. Parameters f0 and A0 are estimated by maximizing the observations’ likelihood (here A0 is treated as a nuisance parameter). Some previous spectral pitch estimation methods, most notably the work of Goldstein [3], introduce a probabilistic framework with a corresponding maximum likelihood approach. However, our method significantly extends the latter in order to guarantee robustness under adverse conditions, facilitating possible extensions to the polyphonic context. For instance, our addressing of spurious as well as undetected peaks averts a sudden breakdown under low-SNR conditions. Furthermore, our assimilation of peak amplitudes facilitates the incorporation of timbral knowledge. Our method utilizes a hidden, discrete-valued descriptor variable identifying spurious/undetected peaks. The likelihood evaluation, requiring a computationally unwieldy summation over all descriptor states, is successfully approximated by a MCMC traversal chiefly amongst high-probability states. The MCMC traversal obtains virtually identical evaluations for the entire likelihood surface at a fraction of the computational cost.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Harvey D. Thornburg
    • 1
  • Randal J. Leistikow
    • 1
  1. 1.Center for Computer Research in Music and Acoustics (CCRMA), Department of MusicStanford UniversityStanfordUSA