Name
Abstract | ||
|---|---|---|
Polyphonic music transcription is a fundamental problem in computer music and over the last decade many sophisticated and application-specific methods have been proposed for its solution. However, most techniques cannot make fully use of all the available training data efficiently and do not scale well beyond a certain size. In this study, we develop an approach based on matrix factorization that can easily handle very large training corpora encountered in real applications. We evaluate and compare four different techniques that are based on randomized approaches to SVD and CUR decompositions. We demonstrate that by only retaining the relevant parts of the training data via matrix skeletonization based on CUR decomposition, we maintain comparable transcription performance with only 2% of the training data. The method seems to compete with the state-of-the-art techniques in the literature. Furthermore, it is very efficient in terms of time and space complexities, can work even in real time without compromising the success rate. |
Year | Venue | Keywords |
|---|---|---|
2012 | European Signal Processing Conference | Polyphonic music transcription,CUR decomposition,singular value decomposition,matrix skeletonization,randomized matrix decompositions |
Field | DocType | ISSN |
Training set,Singular value decomposition,Matrix (mathematics),Computer science,Matrix decomposition,Computer music,Theoretical computer science,Skeletonization,Polyphony,Computational complexity theory | Conference | 2076-1465 |
Citations | PageRank | References |
4 | 0.43 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ismail An | 1 | 4 | 0.43 |
| Umut Simsekli | 2 | 99 | 21.68 |
| Ali Taylan Cemgil | 3 | 535 | 54.39 |
| lale akarun | 4 | 1201 | 70.68 |