• Corpus ID: 246294732

Rapid solution for searching similar audio items

@article{Kadriu2022RapidSF,
  title={Rapid solution for searching similar audio items},
  author={Kastriot Kadriu},
  journal={ArXiv},
  year={2022},
  volume={abs/2201.11178}
}
A naive approach for finding similar audio items would be to compare each entry from the feature vector of the test example with each feature vector of the candidates in a knearest neighbors fashion. There are already two problems with this approach: audio signals are represented by high dimensional vectors and the number of candidates can be very large think thousands. The search process would have a high complexity. Our paper will treat this problem through hashing methodologies more… 

References

SHOWING 1-10 OF 13 REFERENCES

Bucket-size balancing locality sensitive hashing using the map reduce paradigm

The proposed method extends the hyperplanes to occupy their vicinity so that the data objects in the vicinity of a hyperplane are treated as belonging to both sides of the hyperplane simultaneously.

EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph

EFANNA is the fastest algorithm so far both on approximate nearest neighbor graph construction and approximate nearest neighbour search and Efanna nicely combines the advantages of hierarchical structure based methods and nearest-neighbor-graph based methods.

ANN: library for approximate nearest neighbor searching

ANN is a library of C++ objects and procedures that supports approximate nearest neighbor searching, and is written as a testbed for a class of nearest neighbour searching algorithms, particularly those based on orthogonal decompositions of space.

Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement

A comprehensive experimental evaluation of many state-of-the-art methods for approximate nearest neighbor search and proposes a new method that achieves both high query efficiency and high recall empirically on majority of the datasets under a wide range of settings.

On the resemblance and containment of documents

  • A. Broder
  • Computer Science
    Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)
  • 1997
The basic idea is to reduce these issues to set intersection problems that can be easily evaluated by a process of random sampling that could be done independently for each document.

FMA: A Dataset for Music Analysis

The Free Music Archive is introduced, an open and easily accessible dataset suitable for evaluating several tasks in MIR, a field concerned with browsing, searching, and organizing large music collections, and some suitable MIR tasks are discussed.

Random projection in dimensionality reduction: applications to image and text data

It is shown that projecting the data onto a random lower-dimensional subspace yields results comparable to conventional dimensionality reduction methods such as principal component analysis: the similarity of data vectors is preserved well under random projection.

Similarity estimation techniques from rounding algorithms

It is shown that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects.

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

Two algorithms for the approximate nearest neighbor problem in high dimensional spaces for data sets of size n living in IR are presented, achieving query times that are sub-linear in n and polynomial in d.

Learning to Recognize Musical Genre from Audio

The authors here summarize the experience running a challenge with open data for musical genre recognition with some statistics about the submissions, and present the results.