關鍵字查詢 | 類別:期刊論文 | | 關鍵字:Music Matching Based on Rough Longest Common Subsequence

[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 01 筆查詢結果
序號 學年期 教師動態
1 99/1 資工系 林慧珍 教授 期刊論文 發佈 Music Matching Based on Rough Longest Common Subsequence , [99-1] :Music Matching Based on Rough Longest Common Subsequence期刊論文Music Matching Based on Rough Longest Common SubsequenceLin, Hwei-Jen; Wu, Hung-Hsuan; Wang, Chun-Wei淡江大學資訊工程學系Taipei: Institute of Information ScienceJournal of Information Science and Engineering 27(1), pp.95-110100學年度研究獎補助論文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 me
[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 01 筆查詢結果