So here is the "seminal" YIN paper:
Cheveigne A, Kawahara H. - YIN, a fundamental frequency estimator for speech and music
and the new, improved probabilistic YIN:
Now, I am already at a point where I am unimpressed with the only new idea in YIN which is this "cumulative mean normalized difference function" (CMNDF) which seems to have, for its only purpose, to avoid picking the minimum of the "average squared difference function" (ASDF) that always exists at zero lag. Big deeel. There are other, better ways of avoiding that obvious error.
What I am trying to figure out with this pYIN is the pitch tracking and pitch candidate evaluation model. I understand Markov processes and I think I understand what the Hidden Markov Model (HMM) is. And I believe that they are trying to connect pitch candidates of the previous frame to pitch candidates of the current frame. I have done this with my pitch detectors (but not so much using an HMM). We do this to avoid glitches and bleeps arising from an octave error when either the presence of a subharmonic causes the period to appear to be twice as long as the desired period, or weak odd-harmonics causes the period to appear to be half as long as the desired period. I am quite familiar with this problem and have attacked it with my own bonehead technique which seems to work pretty well, is simple, and makes very few assumptions about the model of the quasi-periodic signal of which we wanna know the period.
I haven't groked from the pYIN paper how a finite (hopefully small) number of pitch candidates are chosen in the current frame and how they are related to pitch candidates of the previous frame.
And then I wanna grok how they eventually score each pitch candidate for the final decision.
In my pitch detectors, I use a variant of autocorrelation computed directly from the ASDF function, and maxima of the autocorrection always correspond to minima of the ASDF. Avoiding the peak at zero lag is trivial if you guarantee that the input to the pitch detector is DC free, but then of each peak that exceeds a very gross threshold, I handicap peaks at larger lags only slightly so that I do not spuriously pick the lag at two periods simply because it looks slightly better than the lag at one period.
Not shown in that SE answer of mine is how each peak that I consider a candidate to be a pitch candidate (these are peaks that exceed a gross threshold), determine the exact location (to fractional sample precision) and height of the peak using parabolic interpolation, and if that peak is one of the, say, five highest peaks, I call it a "pitch candidate" and associate that candidate with a candidate in the previous frame closest to the current candidate in log frequency (which is pitch). Then a score is made to each current candidate that is a heuristic function of the current peak height and the previous frame assuming this current peak is tied one of the previous frame. And for "stickiness", whatever candidate wins in the previous frame, if there is a candidate in the current frame that is tied to the previous frame winner, there is an extra boost to that candidate score. A slight preference is give to the candidate that I had previously chosen.
But, what is Mauch and Dixon doing? If there was some code outlining this, I would be interested. I want to ditch the YIN thing but consider their candidate scoring method. But I cannot decode it from the paper.
