透過您的圖書館登入
IP:18.188.92.213
  • 學位論文

使用GPU進行哼唱選歌的比對加速機制

Speedup Mechanism for Comparison of Query by Singing/Humming over GPUs

指導教授 : 張智星
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


在本論文中,我們使將哼唱選歌 (Query by Singing/Humming, QBSH)系統中的比對方法,使用平行化的方式實作至GPU上。此系統可提供使用者哼或唱一首曲子,接著會從資料庫的13000首歌當中,進行比對,最後回傳最相似的歌曲給使用者。 為了減少比對時所需時間,我們同時也針對資料庫進行優化,找出每首歌曲重複出現片段中最長的一段,並將之移除,重複的片段只保留第一次出現的部分。比起未移除前,比對時間縮短了21%。 此外,我們在GPU上提供了兩種不同的哼唱搜尋方式,分別為從頭比對與從任意處比對。在任意處比對方面,我們又探討了不同的平行化實作方式,在不犧牲準確率的情況下,來改進平行化運算的程度。在經過最佳化後,我們使用GPU來加速哼唱選歌效率加快了17倍之多。最後,我們同時也成功地將此哼唱搜尋技術實作至一個公開的線上系統中。

並列摘要


This thesis presents the use of graphics processing units (GPUs) for implementing a parallelized comparison engine in a query-by-singing/humming (QBSH) system, which takes a user's singing or humming input and returns the most likely songs from a database of about 13,000 song tracks. To speed up the comparison, we employ a repeating pattern removal technique to retain only unique tunes in the database. This technique yields a 21% reduction in computing time. Moreover, two comparison methods are provided in the proposed scheme: compare-from-the-beginning and compare-from-anywhere. For the compare-from-anywhere scenario, we explore different parallel schemes in GPU for achieving the best efficiency without sacrificing the retrieval accuracy. With an optimal speedup factor of 17, we have successfully implemented an online and publicly available QBSH system.

參考文獻


[3] J.-S. R. Jang, H.-R. Lee, and M.-Y. Kao, “Content-based Music Retrieval Using Linear Scaling and Branch-and-Bound Tree search,” in Proc. of IEEE International Conference on Multimedia and Expo, August 2001.
[5] G. Poli, A. L. M. Levada, J. F. Mari, J. H. Satio, “Voice Command Recognition with Dynamic Time Warping (DTW) using Graphics Processing Units (GPU) with Compute Unified Device Architecture (CUDA),” in Proceedings of the 19th International Symposium on Computer Architecture and High Performance Computing , SBAC-PAD 2007, Brazil, pp. 19–25, 2007.
[7] D. Sart, A. Mueen, W. Najjar, E. Keogh, and V. Niennattrakul, “Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs,” in ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining, pp. 1001-1006, 2010.
[11] Jia-Lien Hsu, Chih-Chin Liu, and Arbee L. P. Chen, “Efficient Repeating Pattern Finding in Music Databases,” International Conference on Information and Knowledge Management (ACM CIKM),ACM ,pp. 281-288, November 03. 1998.
[1] J. Ghias, D. C. Logan, and B. C. Smith, “Query by humming-musical information retrieval in an audio database,” in Proc. ACM Multimedia’95, San Francisco, pp. 216–221, 1995.

延伸閱讀