Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Fundamentals of speech recognition
Fundamentals of speech recognition
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
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)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Hierarchical filtering method for content-based music retrieval via acoustic input
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Super MBox: an efficient/effective content-based music retrieval system
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Content-based retrieval of MP3 music objects
Proceedings of the tenth international conference on Information and knowledge management
Music ranking techniques evaluated
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
The effectiveness study of various music information retrieval approaches
Proceedings of the eleventh international conference on Information and knowledge management
Tries for Approximate String Matching
IEEE Transactions on Knowledge and Data Engineering
Efficient acoustic index for music retrieval with various degrees of similarity
Proceedings of the tenth ACM international conference on Multimedia
Approximate String Joins in a Database (Almost) for Free
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Theme and Non-Trivial Repeating Pattern Discovering in Music Databases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Approximate matching algorithms for music information retrieval using vocal input
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Music scale modeling for melody matching
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Efficient K-NN search in polyphonic music databases using a lower bounding mechanism
MIR '03 Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval
Searching notated polyphonic music using transportation distances
Proceedings of the 12th annual ACM international conference on Multimedia
K-BOX: a query-by-singing based music retrieval system
Proceedings of the 12th annual ACM international conference on Multimedia
Exploring composite acoustic features for efficient music similarity query
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
QueST: querying music databases by acoustic and textual features
Proceedings of the 15th international conference on Multimedia
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Improving music genre classification using collaborative tagging data
Proceedings of the Second ACM International Conference on Web Search and Data Mining
An FPGA based parallel architecture for music melody matching
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Hi-index | 0.00 |
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is easy to quantize music into a discrete string representation, retrieval by content requires (approximate) sub-string matching, which is hard. In this paper, we present a novel system, called MUSIG, that uses compact MUsic SIGnatures for efficient contentbased music retrieval. The signature is computed as follows: (a) each music file is split into a set of (overlapping) segments; (b) similar segments are clustered together; the number of clusters corresponds to the number of dimensions; (c) for each music file, the number of its segments that fall into a cluster determines the key value in that dimension. Most index structures for multimedia are only able to provide an initial filtering and return a set of candidate answers that must be further examined. For MUSIG, we have also designed a scoring function that permits a ranked answer set to be generated directly based only on the signatures. Our experimental results show that this scheme retains a high degree of accuracy while being very efficient.