2007
DOI: 10.1007/978-3-540-74048-3
|View full text |Cite
|
Sign up to set email alerts
|

Information Retrieval for Music and Motion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
789
0
28

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 1,063 publications
(817 citation statements)
references
References 0 publications
0
789
0
28
Order By: Relevance
“…This way, a key-independent feature sequence is obtained [2,43,68]. This idea, which is grounded in existing research on symbolic music processing [12,45,56,67,81], has been recently extended to PCP sequences [40,38] by using the concept of optimal (or minimizing) transposition indices [52,76].…”
Section: Key Invariancementioning
confidence: 99%
See 1 more Smart Citation
“…This way, a key-independent feature sequence is obtained [2,43,68]. This idea, which is grounded in existing research on symbolic music processing [12,45,56,67,81], has been recently extended to PCP sequences [40,38] by using the concept of optimal (or minimizing) transposition indices [52,76].…”
Section: Key Invariancementioning
confidence: 99%
“…Several alignment algorithms for MIR have been proposed (e.g. [1,15,52]) which, sometimes, derive from general string and sequence alignment/similarity algorithms [31,65,69]. In cover song identification, dynamic programming [31] is a routinely employed technique for aligning two representations and automatically discovering their local correspondences [4,20,25,28,29,35,43,49,55,74,76,78,79,89].…”
Section: Tempo Invariancementioning
confidence: 99%
“…The motions are classified over the human action set A h . For classifying the motions, we use Import Vector Machine (IVM) [41] for classification and a Dynamic Time Warping (DTW) [21] kernel function for incorporating the temporal information. Given the human motions database of each action type, we train future motions using Sparse Pseudo-input Gaussian Process (SPGP) [34].…”
Section: Online Motion Planningmentioning
confidence: 99%
“…The version of DTW utilized in this paper follows the approach found in [59,60]. In this approach, a two-dimensional M by N cost matrix D is constructed, where each of the D(i,j) values is the minimum distance warped path at time i for the time series x and time j for time series y, where x = (x 1, .…”
Section: Template Probability Multi Dimensional Dynamic Time Warpingmentioning
confidence: 99%