Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Query by humming: musical information retrieval in an audio database
Proceedings of the third ACM international conference on Multimedia
Towards the digital music library: tune retrieval from acoustic input
Proceedings of the first ACM international conference on Digital libraries
Time-series similarity problems and well-separated geometric sets
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Factorial Hidden Markov Models
Machine Learning - Special issue on learning with probabilistic representations
Manipulation of music for melody matching
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Melodic matching techniques for large music databases
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
HMM-based musical query retrieval
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Efficient acoustic index for music retrieval with various degrees of similarity
Proceedings of the tenth ACM international conference on Multimedia
Approximate string matching with gaps
Nordic Journal of Computing
Algorithms for Transposition Invariant String Matching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Survey of Longest Common Subsequence Algorithms
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Name that tune: a pilot study in finding a melody from a sung query
Journal of the American Society for Information Science and Technology
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Speeding up transposition-invariant string matching
Information Processing Letters
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
A comparative evaluation of search techniques for query-by-humming using the MUSART testbed
Journal of the American Society for Information Science and Technology
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
A comprehensive trainable error model for sung music queries
Journal of Artificial Intelligence Research
Challenging Uncertainty in Query by Humming Systems: A Fingerprinting Approach
IEEE Transactions on Audio, Speech, and Language Processing
Multiresolution similarity search in time series data: an application to EEG signals
Proceedings of the 6th International Conference on PErvasive Technologies Related to Assistive Environments
Genre classification of symbolic music with SMBGT
Proceedings of the 6th International Conference on PErvasive Technologies Related to Assistive Environments
Hi-index | 0.00 |
Performing similarity search in large databases is a problem of particular interest in many communities, such as music, database, and data mining. Although several solutions have been proposed in the literature that perform well in many application domains, there is no best method to solve this kind of problem in a Query-By-Humming (QBH) application. In QBH the goal is to find the song(s) most similar to a hummed query in an efficient manner. In this paper, we focus on providing a brief overview of the representations to encode music pieces, and also on the methods that have been proposed for QBH or other similarly defined problems.