GPU (graphics processing unit) based melody matching parallelization method

A melody matching and initialization technology, applied in the field of computer science, can solve the problems of long time required for retrieval, long waiting time for users, high complexity of melody matching algorithm, and achieve high cost performance, fast development progress and high acceleration ratio. Effect

Active Publication Date: 2014-02-05
上海芷锐电子科技有限公司
View PDF5 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The main problem of humming retrieval is the lack of user experience. Due to the high complexity of the melody matching algorithm used in humming retrieval, the time required for retrieval is relatively long, and the waiting time for users is correspondingly long
Note that the matrix D can be calculated in the form of column priority, that is, calculating

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • GPU (graphics processing unit) based melody matching parallelization method
  • GPU (graphics processing unit) based melody matching parallelization method
  • GPU (graphics processing unit) based melody matching parallelization method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0088] In order to express the purpose, technical solution and advantages of the present invention more clearly, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific implementation methods. figure 1 is a schematic diagram of the multi-task DTW algorithm; figure 2 It is a schematic diagram of the calculation sequence of the cumulative distance matrix in the classic DTW algorithm; image 3 is a schematic diagram of the calculation sequence of the cumulative distance matrix in the parallel DTW algorithm; Figure 4 is a schematic diagram of a 3×N array space; Figure 5 is a schematic diagram of an N×N cumulative distance matrix.

[0089] The steps of the method of this patent application are described in further detail below in conjunction with a specific example in humming retrieval:

[0090] When performing humming retrieval, assuming that the length of the humming input sequence X to be matched is N, and ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A GPU based melody matching parallelization method comprises four steps as follows: step one, performing calculation preparation work on a CPU (central processing unit); step two, performing variable initialization operation on a GPU before calculation; step three, performing actual DTW (dynamic time warping) calculation on the GPU; and step four, organizing follow-up results on the CPU. According to the method, a computation sequence of accumulated distance matrixes in a DTW algorithm is changed, and data dependence among matrix elements during calculation is eliminated with a diagonal calculation method, so that a single DTW calculation is accelerated by using the GPU; and then, the diagonal calculation method and parallel calculation of multiple DTW calculation tasks are combined, so that multiple DTW calculations can be accelerated by the GPU. According to the method, the programming is simple, the speed-up ratio and the performance cost ratio are high, and the method has a wide application prospect in the technical field of computers.

Description

technical field [0001] The present invention proposes a parallelization method for melody matching based on GPU, and specifically relates to a method for parallelizing the melody matching algorithm in humming retrieval from the data calculation method of the algorithm itself and the execution process of multiple algorithms by using GPU , belonging to the field of computer science and technology. Background technique [0002] Content-Based Audio Information Retrieval (CBAIR) is the future development trend in the field of music retrieval, which is different from the traditional classification and retrieval methods based on text description. Carry out automatic classification and replace manual text description. Query By Humming (QBH) is a main retrieval method in content-based music retrieval. Compared with traditional music retrieval methods, humming retrieval is more in line with Music is a query work that has a highly subjective carrier. The main problem of humming retri...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30G06F9/38
CPCG06F9/3877
Inventor 肖利民唐文琦郑尧阮利
Owner 上海芷锐电子科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap