政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/69135

政大典藏 > College of Informatics > Department of Computer Science > Periodical Articles > Item 140.119/69135

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/69135

Title:	Efficient kNN search in polyphonic music databases using a lower bounding mechanism
Authors:	陳良弼 Liu,Ning-Han;Wu,Yi-Hung;Chen,Arbee L. P.
Contributors:	資科系
Keywords:	Polyphonic music information retrieval;Indexing methods;Search process;Lower bounded edit distance
Date:	2005
Issue Date:	2014-08-21 14:54:46 (UTC+8)
Abstract:	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 them do not work well for similarity search, which is important to many applications. In this paper, we propose three polyphonic representations with the associated similarity measures and a novel method to retrieve k music works that contain segments most similar to the query. In general, most of the index-based methods for similarity search generate all the possible answers to the query and then perform exact matching on the index for each possible answer. Based on the edit distance, our method generates only a few possible answers by performing the deletion and/or replacement operations on the query. Each possible answer is then used to perform exact matching on a list-based index, which allows the insertion operations to be performed. For each possible answer, its edit distance to the query is regarded as a lower bound of the edit distances between the matched results and the query. Based on the kNN results that match a possible answer, the possible answers that cannot provide better results are skipped. By using this mechanism, we design a method for efficient kNN search in polyphonic music databases. The experimental results show that our method outperforms the previous methods in efficiency. We also evaluate the effectiveness of our method by showing the search results to the musician and nonmusician user groups. The experimental results provide useful guidelines on the design of a polyphonic music database.
Relation:	ACM Multimedia Systems Journal (EI,SCI), Vol. 10, No. 6, pp.513-528
Data Type:	article
DOI link:	http://dx.doi.org/10.1007/s00530-005-0179-2
DOI:	10.1007/s00530-005-0179-2
Appears in Collections:	[Department of Computer Science ] Periodical Articles

Files in This Item:

File	Description	Size	Format
513-528.pdf		570Kb	Adobe PDF2	1038	View/Open

社群 sharing

Loading...