BeatNet: CRNN and Particle Filtering for Online Joint Beat Downbeat and Meter Tracking

• URL: http://arxiv.org/abs/2108.03576v1
• Date: Sun, 8 Aug 2021 06:07:59 GMT
• Title: BeatNet: CRNN and Particle Filtering for Online Joint Beat Downbeat and Meter Tracking
• Authors: Mojtaba Heydari, Frank Cwitkowitz, Zhiyao Duan
• Abstract summary: We introduce an online system for joint beat, downbeat, and meter tracking, which utilizes causal convolutional and recurrent layers. The proposed system does not need to be primed with a time signature in order to perform downbeat tracking, and is instead able to estimate meter and adjust the predictions over time. Experiments on the GTZAN dataset, which is unseen during training, show that the system outperforms various online beat and downbeat tracking systems.
• Score: 21.352141245632247
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The online estimation of rhythmic information, such as beat positions, downbeat positions, and meter, is critical for many real-time music applications. Musical rhythm comprises complex hierarchical relationships across time, rendering its analysis intrinsically challenging and at times subjective. Furthermore, systems which attempt to estimate rhythmic information in real-time must be causal and must produce estimates quickly and efficiently. In this work, we introduce an online system for joint beat, downbeat, and meter tracking, which utilizes causal convolutional and recurrent layers, followed by a pair of sequential Monte Carlo particle filters applied during inference. The proposed system does not need to be primed with a time signature in order to perform downbeat tracking, and is instead able to estimate meter and adjust the predictions over time. Additionally, we propose an information gate strategy to significantly decrease the computational cost of particle filtering during the inference step, making the system much faster than previous sampling-based methods. Experiments on the GTZAN dataset, which is unseen during training, show that the system outperforms various online beat and downbeat tracking systems and achieves comparable performance to a baseline offline joint method.

Related papers

• Generalization bounds for mixing processes via delayed online-to-PAC conversions [9.763215134790478]
  We study the generalization error of statistical learning algorithms in a non-i.i.d. setting. We develop an analytic framework for this scenario based on a reduction to online learning with delayed feedback.
  arXiv  Detail & Related papers  (2024-06-18T13:31:15Z)
• TraceMesh: Scalable and Streaming Sampling for Distributed Traces [51.08892669409318]
  TraceMesh is a scalable and streaming sampler for distributed traces. It accommodates previously unseen trace features in a unified and streamlined way. TraceMesh outperforms state-of-the-art methods by a significant margin in both sampling accuracy and efficiency.
  arXiv  Detail & Related papers  (2024-06-11T06:13:58Z)
• Autoregressive Queries for Adaptive Tracking with Spatio-TemporalTransformers [55.46413719810273]
  rich-temporal information is crucial to the complicated target appearance in visual tracking. Our method improves the tracker's performance on six popular tracking benchmarks.
  arXiv  Detail & Related papers  (2024-03-15T02:39:26Z)
• Online Real-time Learning of Dynamical Systems from Noisy Streaming Data: A Koopman Operator Approach [0.0]
  We present a novel algorithm for online real-time learning of dynamical systems from noisy time-series data. The proposed algorithm employs the Robust Koopman operator framework to mitigate the effect of measurement noise.
  arXiv  Detail & Related papers  (2022-12-10T10:21:45Z)
• Better than the Best: Gradient-based Improper Reinforcement Learning for Network Scheduling [60.48359567964899]
  We consider the problem of scheduling in constrained queueing networks with a view to minimizing packet delay. We use a policy gradient based reinforcement learning algorithm that produces a scheduler that performs better than the available atomic policies.
  arXiv  Detail & Related papers  (2021-05-01T10:18:34Z)
• Learning Consistency Pursued Correlation Filters for Real-Time UAV Tracking [12.292672531693794]
  This work proposes a novel approach with dynamic consistency pursued correlation filters, i.e., the CPCF tracker. By minimizing the difference between the practical and the scheduled ideal consistency map, the consistency level is constrained to maintain temporal smoothness. The proposed tracker favorably surpasses the other 25 state-of-the-art trackers with real-time running speed ($sim$43FPS) on a single CPU.
  arXiv  Detail & Related papers  (2020-08-09T10:22:52Z)
• Cascaded Regression Tracking: Towards Online Hard Distractor Discrimination [202.2562153608092]
  We propose a cascaded regression tracker with two sequential stages. In the first stage, we filter out abundant easily-identified negative candidates. In the second stage, a discrete sampling based ridge regression is designed to double-check the remaining ambiguous hard samples.
  arXiv  Detail & Related papers  (2020-06-18T07:48:01Z)
• Towards Streaming Perception [70.68520310095155]
  We present an approach that coherently integrates latency and accuracy into a single metric for real-time online perception. The key insight behind this metric is to jointly evaluate the output of the entire perception stack at every time instant. We focus on the illustrative tasks of object detection and instance segmentation in urban video streams, and contribute a novel dataset with high-quality and temporally-dense annotations.
  arXiv  Detail & Related papers  (2020-05-21T01:51:35Z)
• Tracking Performance of Online Stochastic Learners [57.14673504239551]
  Online algorithms are popular in large-scale learning settings due to their ability to compute updates on the fly, without the need to store and process data in large batches. When a constant step-size is used, these algorithms also have the ability to adapt to drifts in problem parameters, such as data or model properties, and track the optimal solution with reasonable accuracy. We establish a link between steady-state performance derived under stationarity assumptions and the tracking performance of online learners under random walk models.
  arXiv  Detail & Related papers  (2020-04-04T14:16:27Z)
• Good Feature Matching: Towards Accurate, Robust VO/VSLAM with Low Latency [23.443265839365054]
  Analysis of state-of-the-art VO/VSLAM system exposes a gap in balancing performance (accuracy & robustness) and efficiency (latency) This paper aims to fill the performance-efficiency gap with an enhancement applied to feature-based VSLAM.
  arXiv  Detail & Related papers  (2020-01-03T03:50:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.