An Efficient One-dimensional Array Approach for Non-trivial Repeating Pattern Extracting in Music Data
碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 93 === A repeating pattern is a sequence of notes appearing more than once in a music object. Most of the repeating patterns, which are always shorter than their original object, are key melodies or easy to familiarize and remember for people. Therefore, to represent a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/pw9842 |
| Summary: | 碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 93 === A repeating pattern is a sequence of notes appearing more than once in a music object. Most of the repeating patterns, which are always shorter than their original object, are key melodies or easy to familiarize and remember for people. Therefore, to represent an original music by the repeating patterns, the content-based retrieval for music searching will promote the query performance. A non-trivial repeating pattern is commonly used in analyzing the repeated part of music data and looking for themes. Non-trivial repeating patterns exclude those patterns which are all contained in other longer patterns such that they can reduce the redundancy of the repeating patterns and memory space needed for indices. However, the existing techniques for discovering the theme and non-trivial repeating patterns for a music object are significantly time and memory space consuming. In this paper, we will propose an efficient one-dimensional array approach which needs less executing time and fewer of memory space to extract all non-trivial repeating patterns from a music object. Our experimental results also show that the proposed approach outperforms existing schemes.
|
|---|