Symbolic Music Representation in MPEG

Bellini, Pierfrancesco; Nesi, Paolo; Zoia, Giorgio

doi:10.1109/mmul.2005.82

Cited by 9 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, if we skip DNG 1 at this moment, we will eventually miss D in the final answers. Therefore, we take the minimum among the three cells C 4,5 , C 5,5 and C 5,4 as the criterion to be checked. Since in this case the minimum (1) does not exceed the error bound, DNG 1 will be kept in the query buffer of QNG 1 , and the final answer D can be identified as we merge DNG 1 with DNG 5 .…”

Section: Figmentioning

confidence: 99%

“…Our approach is based on the assumption that each music piece or multimedia object is accompanied with its SMR. Recent music-related applications and projects [4,5] support this assumption. Our approach addresses the two new issues that the traditional approaches of content-based music retrieval never encounter, i.e., simultaneous processing of multiple queries and unbounded amount of data.…”

mentioning

confidence: 96%

See 1 more Smart Citation

Continuous query processing over music streams based on approximate matching mechanisms

Chen

Soo

et al. 2007

Multimedia Systems

View full text Add to dashboard Cite

It is foreseen that more and more music objects in symbolic format and multimedia objects, such as audio, video, or lyrics, integrated with symbolic music representation (SMR) will be published and broadcasted via the Internet. The SMRs of the flowing songs or multimedia objects will form a music stream. Many interesting applications based on music streams, such as interactive music tutorials, distance music education, and similar theme searching, make the research of content-based retrieval over music streams much important. We consider multiple queries with error tolerances over music streams and address the issue of approximate matching in this environment. We propose a novel approach to continuously process multiple queries over the music streams for finding all the music segments that are similar to the queries. Our approach is based on the concept of n-grams, and two mechanisms are designed to reduce the heavy computation of approximate matching. One mechanism uses the clustering of query n-grams to prune the query n-grams that are irrelevant to the incoming data n-gram. The other mechanism records the data n-gram that matches a query n-gram as a partial answer and incrementally merges the partial answers of the same query. We implement a prototype system for experiments in which songs in the MIDI format are continuously broadcasted, and the user can specify musical segments as queries to monitor the music streams. Experiment results show the effectiveness and efficiency of the proposed approach.

show abstract

Section: Figmentioning

confidence: 99%

mentioning

confidence: 96%