harvest: Compute f0 using the Harvest algorithm

In humlab-speech/superassp: A speech signal processing using various framworks using a wrassp-like interface

Compute f0 using the Harvest algorithm

Description

The Harvest algorithm \insertCiteMorise.2017.10.21437/interspeech.2017-68superassp was developed for the WORLD vocoder \insertCiteMORISE.2016.10.1587/transinf.2015edp7457superassp and aims to obtain a reliable F0 contour and reduce erroneously identified voice frames.

Usage

harvest(
  listOfFiles,
  beginTime = 0,
  endTime = 0,
  windowShift = 5,
  minF = 70,
  maxF = 200,
  explicitExt = "hf0",
  outputDirectory = NULL,
  toFile = TRUE
)

Arguments

listOfFiles	A vector of file paths to wav files.
beginTime	The start time of the section of the sound file that should be processed.
endTime	The end time of the section of the sound file that should be processed.
windowShift	The measurement interval (frame duration), in seconds.
minF	Candidate f0 frequencies below this frequency will not be considered.
maxF	Candidates above this frequency will be ignored.
explicitExt	the file extension that should be used.
outputDirectory	set an explicit directory for where the signal file will be written. If not defined, the file will be written to the same directory as the sound file.
toFile	write the output to a file? The file will be written in outputDirectory, if defined, or in the same directory as the soundfile.

Details

The algorithm consists of two steps. In the first step, the algorithm uses fundamental component extraction by many band-pass filters with different center frequencies and obtains the basic f0 candidates from filtered signals. In the second step, basic f0 candidates are refined and scored by using the instantaneous frequency, and then several f0 candidates in each frame are estimated.

Value

An SSFF track object containing two tracks (f0 and corr) that are either returned (toFile == FALSE) or stored on disk.

References

\insertAllCited

humlab-speech/superassp documentation built on May 8, 2024, 2:27 p.m.