|
|
| (29 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| = Introduction =
| |
|
| |
|
| [[File:Figure1.png|thumb|400px|right]]
| |
| * Dance Dance Revolution (DDR)
| |
| Dance Dance Revolution (DDR) is a rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. The dance pad contains up, down, left, and right arrows, each of which can be in one of four states: on, off, hold, or release. There are $4^4 = 256$ possible step combinations at any instant since the four arrows can be in any of the four states independently. The terms jump: hitting two or more arrows at once; freeze: holding on one arrow for some duration. (Figure 1 (A) & (B))
| |
|
| |
| Step charts exhibit complex semantics and tend to mirror musical structure: particular sequences of steps correspond to different motifs and reoccur as sections of the song are repeated. (Figure 1) The DDR community uses simulators, such as the opensource StepMania, which allow fans to create their own charts. Typically, for each song, packs containing one chart for five difficulty levels are created.
| |
|
| |
|
| |
| [[File:Figure2.png|thumb|250px|right|Figure 2. Proposed learning to choreograph pipeline for four seconds of the song Knife Party feat. Mistajam - Sleaze. The pipeline ingests audio features (Bottom) and produces a playable DDR choreography (Top) corresponding to the audio.]]
| |
| * Learning to Choreograph
| |
| While players may grow tired of existing charts in standardized packs or creating charts can be really time-consuming for players, the authors introduce the task of learning to choreograph, which learns to produce new step charts given raw audio tracks. This task has been approached via ad-hoc method, it is the first time to be casted as a learning task to mimic the semantics of human-generated charts. The learning task is broke into two subtasks: First, step placement task decides when to place steps conditioning on various diffculty levels. Second, step selection task decides which steps to select at each timestamp.
| |
|
| |
|
| |
| * Music Information Retrieval (MIR)
| |
| Music information retrieval (MIR) may be involved in the progress on learning to choreograph. 1) step placement task closely resembles onset detection, a well-studied MIR problem. Onset detection identifies the times of all musically salient events, such as melody notes or drum strikes and each DDR step corresponds to an onset.
| |
|
| |
| 2) DDR packs specify a metronome click track for each song. For songs with changing tempos, the location of change and the new tempo are annotated. This click data could help for beat tracking and tempo detection.
| |
|
| |
|
| |
| * Contributions
| |
| 1) Defining learning to choreograph, a new task with real-world usefulness and strong connections to fundamental problems in MIR.
| |
|
| |
| 2) Introducing two large, curated datasets for benchmarking DDR choreography algorithms.
| |
|
| |
| 3) Presenting an effective pipeline for learning to choreograph with deep neural networks.
| |
|
| |
| = Data =
| |
| Basic statistics of the two datasets are shown in Table 1.
| |
| [[File:DDRTable1.png|thumb|400px|center]]
| |
|
| |
| * Notes from Table 1:
| |
| 1) '''Fraxtil''': single author vs. '''In The Groove (ITG)''': multi-author
| |
|
| |
| 2) Each dataset contains five charts per song corresponding to increasing difficulty levels except that ITG dataset has 13 songs that lack charts for the highest difficulty.
| |
|
| |
| 3) The two datasets have similar vocabulary sizes (81 and 88 '''distinct step combinations''', respectively).
| |
|
| |
| 4) The datasets contain around 35 hours of annotations and 350,000 steps considering all charts across all songs.
| |
|
| |
|
| |
| * Data Augmentation:
| |
| Four instances of each chart, by mirroring left/right, up/down (or both), are generated to augment the amount of data available for training.
| |
|
| |
| * (beat, time, step) tuples:
| |
| To make the data easier to work with, the authors convert the useful data correspoding to the metadata to a canonical form consisting of (beat, time, step) tuples.
| |
|
| |
| * Number of steps per rhythmic subdivision by difficulty (Figure4)
| |
| An increase in difficulty corresponds to increasing trend for steps to appear at finer rhythmic subdivisions.
| |
| [[File:DDRFigure3n4.png|thumb|600px|center]]
| |
|
| |
|
| |
| = Methods =
| |
| Pipeline:
| |
|
| |
| 1) extract an audio feature representation
| |
|
| |
| 2) feed the representation into a step placement algorithm estimating probabilities that a step lies within that frame
| |
|
| |
| 3) use a peak-picking process on the sequence of probabilities to identify the timestamps at which to place steps
| |
|
| |
| 4) given a sequence of timestamps, use a step selection algorithm to choose which steps to place at each time. Note the approach to this problem involves modeling the probability distribution $\mathbb{P}(m_n|m_{n-1},...,m_1)$, where $m_{n}$ is the $n^{th}$ step in the sequence.
| |
|
| |
| == Audio Representation ==
| |
|
| |
| The final audio representation is a 15×80×3 tensor. These correspond to the temporal width of 15 representing 150ms of audio context, 80 frequency bands, and 3 different window lengths of 23ms, 46ms, and 93ms from short-time Fourier transform (STFT), where shorter window sizes preserve low-level features such as pitch and timbre while larger window sizes provide more context for high-level features such as melody and rhythm (Hamel et al., 2012)<sup>[[#References|[1]]]</sup>. Their approach to acoustic feature representation follows the work of Schlüter & Böck (2014)<sup>[[#References|[2]]]</sup>, who develop similar representations to perform onset detection with CNNs. (Figure 5)
| |
| [[File:DDRFigure5.png|thumb|600px|center|Figure 5: Network: 1)From the 3-channel spectrogram (corresponding to small, medium, large window sizes) excerpts of 15 frames by 80 bands 2)A convolutional layer with filters of 7 frames by 3 bands (by 3 channels) computes 10 feature maps of 9 frames by 78 bands. 3)Max-pooling over 3 adjacent bands without overlap, reducing the maps to 26 bands. 4)Another convolutional layer of 3×3 filters computes 20 feature maps of 7 frames by 24 bands. 5)Another 3-band max-pooling layer result in 20 maps of 7 frames by 8 bands (1120 neurons in total). 6)A fully-connected layer of 256 units 7)Applying the logistic sigmoid function, resulting in a single output unit with onset probability between 0.0 and 1.0]]
| |
|
| |
| == Step Placement ==
| |
|
| |
| * LSTM <sup>[[#References|[3][4]]]</sup>
| |
|
| |
| LSTM is able to handle sequences of any length and capture long-term dependencies
| |
| [[File:DDRFigure6.png|thumb|220px|right|Figure 6: LSTM]]
| |
|
| |
| $i_t = σ(W_i·[h_{t−1},x_t]+b_i)$
| |
|
| |
| $f_t = σ(W_f·[h_{t−1},x_t]+b_f)$
| |
|
| |
| $\tilde{c_t} = tanh(W_q·[h_{t−1},x_t]+b_q)$
| |
|
| |
| $o_t = σ(W_o·[h_{t−1},x_t]+b_o)$
| |
|
| |
| $c_t = f_t⊙c_{t−1}+i_t⊙\tilde{c_t}$
| |
|
| |
| $h_t = o_t⊙tanh(c_t)$
| |
|
| |
| where,
| |
|
| |
| $i_t$: input gate, to control how much new information is going to be stored in the current memory cell.
| |
|
| |
| $f_t$: forget gate, to control to what extent the information from the old memory cell is going to be thrown away.
| |
|
| |
| $o_t$: output gate, to control what to output based on the memory cell $c_t$.
| |
|
| |
| $h_{t-1}$: old hidden state
| |
|
| |
| $x_t$: input at the current time step.
| |
|
| |
| $c_t$: current memory cell
| |
|
| |
| $σ$ is the logistic sigmoid function that has an output in [0, 1], $tanh$ denotes the hyperbolic tangent function that has an output in [−1, 1], and ⊙ denotes the elementwise multiplication.
| |
|
| |
|
| |
| * C-LSTM
| |
| Since CNN is able to learn trained features or, say, local response from temporal or spatial data but lacks the ability of learning sequential correlations; on the other hand, RNN(LSTM) is specilized for sequential modelling but unable to extract features in a parallel way. C-LSTM is created by proceeding LSTMs with a few fully connected CNN layers.
| |
| [[File:DDRFigure7.png|thumb|220px|right|Figure 7: C-LSTM model used for step placement]]
| |
|
| |
|
| |
| For step placement, all models considered have output consisting a single sigmoid unit which estimates the probability that a step is placed. Also, the authors augment the audio features with a one-hot representation of difficulty.
| |
|
| |
| First, they use CNN model with the same structure as the CNN for onset detection (Figure 5) except for replacing 7) with another fully connected layer of 128 nodes.
| |
|
| |
| Second the authors propose a C-LSTM model to improve upon the CNN by combining a convolutional encoding with an RNN that integrates information across longer windows of time. first apply two convolutional layers (of the same shape as the CNN) across the full unrolling length to encode the raw audio at each time step. The 3D tensor of the output is flattened along the channel and frequency axes (preserving the temporal dimension) and then the flattened features at each time step become the inputs to a two-layer RNN(LSTM). (Figure 7) LSTM consists of 2 layers with 200 nodes each. Two fully connected ReLU layers of dimension 256 and 128 are followed by the LSTM layers. The model is trained using 100 unrollings for backpropagation through time.
| |
|
| |
| Note that a one-hot difficulty vector is added to improve the C-LSTM model. Since the paper does not show how it is added to the model, I modify the equations representing the operations of the LSTM cell to add the difficulty vector D to the input gate, forget gate, cell and output gate following the process of Ghosh 2016<sup>[[#References|[6]]]</sup>.
| |
|
| |
| $i_t = σ(W_i·[h_{t−1},x_t,'''D''']+b_i)$
| |
|
| |
| $f_t = σ(W_f·[h_{t−1},x_t,'''D''']+b_f)$
| |
|
| |
| $\tilde{c_t} = tanh(W_q·[h_{t−1},x_t,'''D''']+b_q)$
| |
|
| |
| $o_t = σ(W_o·[h_{t−1},x_t,'''D''']+b_o)$
| |
|
| |
| $c_t = f_t⊙c_{t−1}+i_t⊙\tilde{c_t}$
| |
|
| |
| $h_t = o_t⊙tanh(c_t)$
| |
|
| |
| Comparing the input gate equations before and after adding the difficulty vector D, we can see that having a difficulty vector D added into the CLSTM cell is equivalent to considering a composite input $[x_i D]$ to the LSTM cell that concatenates the original inputs and difficulty vectors.
| |
|
| |
| == Peak Picking ==
| |
|
| |
| == Step Selection ==
| |
|
| |
| = Experiments =
| |
|
| |
| == Step Placement ==
| |
|
| |
| == Step Selection ==
| |
|
| |
|
| |
|
| |
|
| |
|
| |
| = References =
| |
|
| |
| 1. Hamel, Philippe, Bengio, Yoshua, and Eck, Douglas. Building musically-relevant audio features through multiple timescale representations. In ISMIR, 2012.
| |
|
| |
| 2. [https://www.ofai.at/~jan.schlueter/pubs/2014_icassp.pdf Improved musical onset detection with CNN Schlüter & Böck (2014)]
| |
|
| |
| 3. (Hochreiter and Schmidhuber, 1997)
| |
|
| |
| 4. [https://arxiv.org/pdf/1511.08630.pdf A C-LSTM Neural Network for Text Classification]
| |
|
| |
| 5. [https://research.google.com/pubs/pub43455.html Convolutional, Long Short-Term Memory, Fully Connected Deep Neural Networks]
| |
|
| |
| 6. [https://arxiv.org/pdf/1602.06291.pdf Contextual LSTM (CLSTM) models for Large scale NLP tasks]
| |