Article

Efficient K-NN search in polyphonic music databases using a lower bounding mechanism

Authors:

Arbee L. P. ChenAuthors Info & Claims

MIR '03: Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval

Pages 163 - 170

https://doi.org/10.1145/973264.973291

Published: 07 November 2003 Publication History

Abstract

Querying polyphonic music from a large data collection is an interesting and challenging topic. Recently, researchers attempt to provide efficient techniques for content-based retrieval in polyphonic music databases where queries can also be polyphonic. However, most of the techniques do not perform the approximate matching well. In this paper, we present a novel method to efficiently retrieve k music works that contain segments most similar to the user query based on the edit distance. A list-based index structure is first constructed using the feature of the polyphony. A set of candidate approximate answers is then generated for the user query. A lower bounding mechanism is proposed to prune these candidates such that the k answers can be obtained efficiently. The efficiency of the proposed method is evaluated by real data set and synthetic data set, reporting significant improvement over existing approaches in the response time yielded.

References

[1]

M. Clausen, R. Engelbrecht, D. Meyer and J. Schmitz. Proms: A web-based tool for searching in polyphonic music. In Proceedings of the 1st International Symposium on Music Information Retrieval (ISMIR), 2000.

[2]

M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1994.

Digital Library

[3]

M. J. Dovey. A technique for "regular expression" style searching in polyphonic music. In Proceedings of the 2nd International Symposium on Music Information Retrieval (ISMIR), 2001.

[4]

S. Downie and M. Nelson. Evaluation of a simple and effective music information retrieval method. In Proceedings of ACM Special Interest Group on Information Retrieval (SIGIR), 2000.

Digital Library

[5]

J. L. Hsu, A. L. P. Chen, H. C. Chen and N. H. Liu. The Effectiveness Study of Various Music Information Retrieval Approaches. In Proceedings of ACM International Conference on Information and knowledge Management (CIKM), 2002.

Digital Library

[6]

A. Kornstadt. Themefinder: A Web-Based Melodic Search Tool. Computing in Musicology 11, MIT Press, 1998.

[7]

K. Lemström and S. Perttu. SEMEX -- An Efficient Music Retrieval Prototype. In Proceedings of the 1st International Symposium on Music Information Retrieval (ISMIR), 2000.

[8]

C. C. Liu, J. L. Hsu and A. L. P. Chen. An Approximate String Matching Algorithm for Content-based Music Data Retrieval. In Proceedings of International Conferences on Multimedia Computing and Systems (ICMCS), 1999.

Digital Library

[9]

R. J. MacNab, L. A. Smith, D. Bainbridge and I. H. Witten. The New Zealand Digital Library MELodyinDEX. Digital Library Magazine, May 1997.

[10]

E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2): 262---272, 1976.

Digital Library

[11]

MIDI Manufaturers Association, Los Angeles, California. The Complete Detailed MIDI 1.0 Specification, 1996.

[12]

S. Park, W. W. Chu, J. Yoon and C. Hsu. Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases. In Proceedings of the International Conference on Data Engineering (ICDE), 2000.

Digital Library

[13]

J. Pickens. A Survey of Feature Selection Techniques for Music Information Retrieval. In Proceedings of the 2nd International Symposium on Music Information Retrieval (ISMIR), 2001.

[14]

J. Pickens and T. Crawford. Harmonic Models for Polyphonic Music Retrieval. In Proceedings of ACM International Conference on Information and knowledge Management (CIKM), 2002.

Digital Library

[15]

G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. Mc Graw Hill. 1983.

Digital Library

[16]

A. Uitdenbogerd and J. Zobel. Melodic Matching Techniques for Large Music Databases, In Proceedings of ACM Multimedia, 1999.

Digital Library

[17]

G. Wiggins, E. Miranda, A. Smaill and M. Harris. A framework for the evaluation of music representation systems, Computer Music Journal, 17(3): 31--42, 1997.

[18]

S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10): 83--91, October 1992.

Digital Library

Cited By

Cui BJagadish HOoi BTan KMouaddib NValduriez PKemper ABouzeghoub MMarkl VAmsaleg LManolescu ITeubner J(2008)Compacting music signatures for efficient music retrievalProceedings of the 11th international conference on Extending database technology: Advances in database technology10.1145/1353343.1353374(229-240)Online publication date: 25-Mar-2008
https://dl.acm.org/doi/10.1145/1353343.1353374
Cui BLiu LPu CShen JTan KLienhart RPrasad AHanjalic AChoi SBailey BSebe N(2007)QueSTProceedings of the 15th ACM international conference on Multimedia10.1145/1291233.1291465(1055-1064)Online publication date: 29-Sep-2007
https://dl.acm.org/doi/10.1145/1291233.1291465
Cui BShen JCong GShen HYu CNahrstedt KTurk MRui YKlas WMayer-Patel K(2006)Exploring composite acoustic features for efficient music similarity queryProceedings of the 14th ACM international conference on Multimedia10.1145/1180639.1180725(412-420)Online publication date: 23-Oct-2006
https://dl.acm.org/doi/10.1145/1180639.1180725

Index Terms

Efficient K-NN search in polyphonic music databases using a lower bounding mechanism
1. Information systems
  1. Information retrieval

Recommendations

Efficient kNN search in polyphonic music databases using a lower bounding mechanism

Querying polyphonic music from a large data collection is an interesting topic. Recently, researchers have attempted to provide efficient methods for content-based retrieval in polyphonic music databases where queries are polyphonic. However, most of ...
Efficient Processing of Metric Skyline Queries

Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the database whose attribute vector is not dominated by that of any other ...
Robust Polyphonic Music Retrieval with N-grams

In this paper we investigate the retrieval performance of monophonic and polyphonic queries made on a polyphonic music database. We extend the n-gram approach for full-music indexing of monophonic music data to polyphonic music using both rhythm and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MIR '03: Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval

November 2003

281 pages

ISBN:1581137788

DOI:10.1145/973264

Conference Chairs:
Nicu Sebe
University of Amsterdam
,
Michael S. Lew
LIACS Media Lab
,
Chabanne Djeraba
LIFL, University of Sciences and Technologies of Lille

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMM: ACM Special Interest Group on Multimedia

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
392
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cui BJagadish HOoi BTan KMouaddib NValduriez PKemper ABouzeghoub MMarkl VAmsaleg LManolescu ITeubner J(2008)Compacting music signatures for efficient music retrievalProceedings of the 11th international conference on Extending database technology: Advances in database technology10.1145/1353343.1353374(229-240)Online publication date: 25-Mar-2008
https://dl.acm.org/doi/10.1145/1353343.1353374
Cui BLiu LPu CShen JTan KLienhart RPrasad AHanjalic AChoi SBailey BSebe N(2007)QueSTProceedings of the 15th ACM international conference on Multimedia10.1145/1291233.1291465(1055-1064)Online publication date: 29-Sep-2007
https://dl.acm.org/doi/10.1145/1291233.1291465
Cui BShen JCong GShen HYu CNahrstedt KTurk MRui YKlas WMayer-Patel K(2006)Exploring composite acoustic features for efficient music similarity queryProceedings of the 14th ACM international conference on Multimedia10.1145/1180639.1180725(412-420)Online publication date: 23-Oct-2006
https://dl.acm.org/doi/10.1145/1180639.1180725

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents