Approximate string matching algorithm for content-based music data retrieval

46Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, an approach for content-based music data retrieval is proposed. In this approach, thematic feature strings, such as melody strings, rhythm strings, and chord strings are extracted from the original music objects and treated as the meta data to represent their contents. The problem of content-based music data retrieval is then transformed into the string matching problem. A new approximate string matching algorithm is also proposed which provides fault tolerance ability according to the music characteristics. To show the efficiency of the algorithm, a set of experiments are performed to compare with the agrep and the fgrep utility on both synthetic and real music data.

Cite

CITATION STYLE

APA

Liu, C. C., Hsu, J. L., & Chen, A. L. P. (1999). Approximate string matching algorithm for content-based music data retrieval. International Conference on Multimedia Computing and Systems -Proceedings, 1, 451–456. https://doi.org/10.1109/mmcs.1999.779244

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free