Speeding Melody Search With Vantage Point Trees
نویسندگان
چکیده
Melodic search engines let people find music in online collections by specifying the desired melody. Comparing the query melody to every item in a large database is prohibitively slow. If melodies can be placed in a metric space, search can be sped by comparing the query to a limited number of vantage melodies, rather than the entire database. We describe a simple melody metric that is customizable using a small number of example queries. This metric allows use of a generalized vantage point tree to organize the database. We show on a standard melodic database that the general vantage tree approach achieves superior search results for query-by-humming compared to an existing vantage point tree method. We then show this method can be used as a preprocessor to speed search for non-metric melodic comparison.
منابع مشابه
Copy-move Detection Algorithm Efficiency Increase Using Binary Space Partitioning Trees
Duplicates embedding is one of the most frequently used type of digital image change. The copy-move procedure includes copying an image fragment from one part and pasting it to another part of the same image. Moreover, this fragment can be changed using some transformations, like affine or contrast enhancement. Existing copy-move detection methods consist of two main steps: feature calculation ...
متن کاملDeveloping Self-adaptive Melody Search Algorithm for Optimal Operation of Multi-reservoir Systems
Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...
متن کاملWhat Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of nearest neighbors algorithms for speeding up this task. Since image patches follow very different distributions from the uniform and Gaussian distributions that are typically used to evaluate nearest neighbors methods, we d...
متن کاملSpeeding up Relief algorithms with k-d trees
There are certain problems in machine learning which desire special attention when we scale up the size of the data or move towards data mining. One of them is the problem of searching nearest neighbours of a given point in k dimensional space. If the space is <k than k-d trees can solve the problem in asymptotically optimal time under certain conditions. We investigate the use of k-d trees in ...
متن کاملData structures for incremental extreme ray enumeration algorithms
Given a halfspace H and a polyhedral cone P with a known extreme ray set V we consider the problem of finding the extreme ray set for the cone P ′ = H ∩ P. Regarding the computational time of the above problem, best results have been achieved with data structures based on multidimensional binary search trees. We refined the existing algorithm by developing a specific method for tree creation wh...
متن کامل