TY - JOUR

T1 - Fast algorithms for fundamental frequency estimation in autoregressive noise

AU - Quinn, Barry Gerard

AU - Nielsen, Jesper Kjær

AU - Christensen, Mads Græsbøll

PY - 2021/3

Y1 - 2021/3

N2 - Many signals can accurately be modelled as a periodic function in coloured noise. An important parameter of the periodic function is the fundamental frequency. Often, fundamental frequency estimators are either ad hoc or have been derived under a white Gaussian noise (WGN) assumption. In this paper, we first derive the joint maximum likelihood (ML) estimator of the fundamental frequency estimator in autoregressive noise. Since a naïve implementation of this ML estimator has a very high computational complexity, we derive three fast algorithms that produce either exact or asymptotically equivalent estimators for all candidate sinusoidal and AR-orders. Through experiments, we show that the fast algorithms are at least two orders of magnitude faster than the naïve implementation and that the two fast approximate algorithm are faster and have a worse time-frequency resolution than the fast exact algorithm. Moreover, we show that jointly estimating the fundamental frequency and AR-parameters using our fast, exact algorithm is both faster and more accurate than computing the estimates iteratively. Finally, we apply the estimator to real data to show examples of how modelling the noise to be coloured significantly reduces the number of outliers produced by the fundamental frequency estimator compared to modelling the noise as WGN.

AB - Many signals can accurately be modelled as a periodic function in coloured noise. An important parameter of the periodic function is the fundamental frequency. Often, fundamental frequency estimators are either ad hoc or have been derived under a white Gaussian noise (WGN) assumption. In this paper, we first derive the joint maximum likelihood (ML) estimator of the fundamental frequency estimator in autoregressive noise. Since a naïve implementation of this ML estimator has a very high computational complexity, we derive three fast algorithms that produce either exact or asymptotically equivalent estimators for all candidate sinusoidal and AR-orders. Through experiments, we show that the fast algorithms are at least two orders of magnitude faster than the naïve implementation and that the two fast approximate algorithm are faster and have a worse time-frequency resolution than the fast exact algorithm. Moreover, we show that jointly estimating the fundamental frequency and AR-parameters using our fast, exact algorithm is both faster and more accurate than computing the estimates iteratively. Finally, we apply the estimator to real data to show examples of how modelling the noise to be coloured significantly reduces the number of outliers produced by the fundamental frequency estimator compared to modelling the noise as WGN.

KW - Coloured noise estimation

KW - Fundamental frequency estimation

KW - Harmonic regression

KW - Pitch estimation

UR - https://github.com/jkjaer/fastF0ArMl

UR - http://www.scopus.com/inward/record.url?scp=85095433049&partnerID=8YFLogxK

U2 - 10.1016/j.sigpro.2020.107860

DO - 10.1016/j.sigpro.2020.107860

M3 - Journal article

SN - 0165-1684

VL - 180

JO - Signal Processing

JF - Signal Processing

M1 - 107860

ER -