Received 30.07.2014, Revised 28.10.2014, Accepted 10.12.2014

A method for increasing the speed of searching for a fragment of an audio recording from a set of kd-trees

Oleksandr Tkachenko, Oksana Hrijo Tukalo

The article is devoted to solving the problem of musical identification by the short fragment. The method of the nearest template search for audio fragment (5s) based on kd-tree was proposed in the paper, which allowed to reduce the computational complexity significantly compared to full search. To perform a quick search based on kd-tree in pre-formed body of templates algorithms and software were developed. Analytical relation for evaluating the proximity between the unknown fragment and templates was proposed, which is based on calculating the distance from the fragment to the specified number of the nearest centroids

quick search, kd-tree, Euclidean distance, audio fragment identification, parameterization, mel-frequency cepstral coefficients, cluster analysis
57-66
Tkachenko, O., & Hrijo Tukalo, O. (2014). A method for increasing the speed of searching for a fragment of an audio recording from a set of kd-trees. Information Technologies and Computer Engineering, 11(3), 57-66.

References

References in the process of publication