Music Matching Based on Rough Longest Common Subsequence

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/76033

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/76033

題名:	Music Matching Based on Rough Longest Common Subsequence
作者:	Lin, Hwei-Jen;Wu, Hung-Hsuan;Wang, Chun-Wei
貢獻者:	淡江大學資訊工程學系
關鍵詞:	content-based music retrieval;rough longest common subsequence;RLCS;local alignment;information retrieval;musical similarity;filtering algorithm
日期:	2011-01-01
上傳時間:	2012-04-30 17:50:31 (UTC+8)
出版者:	Taipei: Institute of Information Science
摘要:	In this paper we proposed a music matching method, called the RLCS(rough longest common subsequence) method. It is an impoved version of the LCS to avoid some problems occurring in global alignment matching. First a rough equality for two notes is defined for constructing the RLCS of two music fragments. The length of the RLCS of two music sequences defined in this work is a real number, called a weighted length. It is evaluated according to degree of similarity of every pair of matched notes from the two sequences. This method takes into account both the width-across-query(WAQ) and the width-across-reference(WAR) and combines them with the weighted length of the corresponding RLCS to define a score measurement for the RLCS. The measurement associated with WAQ and WAR enables the proposed method to tolerate dense errors. A dynamic programming algorithm is presented for simultaneously calculating the weighted length of RLCS, the WAQ, the WAR, and the score to determine the RLCS. As a result, the proposed method can perform the matching in a better and simplermanner. In order to speed up the matching process, we use the filter algorithm proposed by Tarhio and Ukkonen [22] to filter the reference and discard most off the reference areas that do not match. We applied the proposed algorithm to content-based music retrieval. The experimental results showed that with our proposed algorithm the retrieval system provides a higher retrieval rate than that with the local alignment method proposed by Suyoto et al. [20]. The use of filtering algorithm has been shown to greatly reduce the computation time for exact matching and for approximate matching with a low error tolerance.
關聯:	Journal of Information Science and Engineering 27(1), pp.95-110
顯示於類別:	[資訊工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
JISE-98-193(final version for publication).pdf		302Kb	Adobe PDF	431	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....