Online Sequence Clustering Algorithm for Video Trajectory Analysis

• URL: http://arxiv.org/abs/2305.08418v1
• Date: Mon, 15 May 2023 07:57:55 GMT
• Title: Online Sequence Clustering Algorithm for Video Trajectory Analysis
• Abstract summary: We propose a real-time video analysis scheme that uses a model learned from motion patterns to monitor the behavior of objects. The intrinsic repeatability of the target object trajectory is used to automatically construct the behavioral model. This scheme has real-time online learning and processing of motion models while avoiding a large number of arithmetic operations.
• Score: 1.4190701053683017
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Target tracking and trajectory modeling have important applications in surveillance video analysis and have received great attention in the fields of road safety and community security. In this work, we propose a lightweight real-time video analysis scheme that uses a model learned from motion patterns to monitor the behavior of objects, which can be used for applications such as real-time representation and prediction. The proposed sequence clustering algorithm based on discrete sequences makes the system have continuous online learning ability. The intrinsic repeatability of the target object trajectory is used to automatically construct the behavioral model in the three processes of feature extraction, cluster learning, and model application. In addition to the discretization of trajectory features and simple model applications, this paper focuses on online clustering algorithms and their incremental learning processes. Finally, through the learning of the trajectory model of the actual surveillance video image, the feasibility of the algorithm is verified. And the characteristics and performance of the clustering algorithm are discussed in the analysis. This scheme has real-time online learning and processing of motion models while avoiding a large number of arithmetic operations, which is more in line with the application scenarios of front-end intelligent perception.

Related papers

• Visualizing Critic Match Loss Landscapes for Interpretation of Online Reinforcement Learning Control Algorithms [12.940253083606066]
  This work proposes a critic match loss landscape visualization method for online reinforcement learning.<n>The method constructs a loss landscape by projecting recorded critic parameter trajectories onto a low-dimensional linear subspace.<n>It yields a three-dimensional loss surface together with a two-dimensional optimization path that characterizes critic learning behavior.
  arXiv  Detail & Related papers  (2026-03-15T18:20:12Z)
• Real-Time Instrument Planning and Perception for Novel Measurements of Dynamic Phenomena [2.489387152315786]
  We present an automated workflow that synthesizes the detection of dynamic events in satellite imagery with autonomous trajectory planning for a follow-up high-resolution sensor to obtain pinpoint measurements.<n>We analyze classification approaches including traditional machine learning algorithms and convolutional neural networks.<n>We show through simulation an order of magnitude increase in the utility return of the high-resolution instrument compared to baselines.
  arXiv  Detail & Related papers  (2025-09-03T17:32:15Z)
• Fine-Tuning is Subgraph Search: A New Lens on Learning Dynamics [13.58024883022897]
  We develop a fine-tuning method for analyzing the mechanism behind learning.<n>Inspired by the concept of intrinsic dimension, we view a model as a computational graph with redundancy for a specific task.<n>We propose circuit-tuning, an algorithm that iteratively builds the subgraph for a specific task and updates the relevant parameters in a way.
  arXiv  Detail & Related papers  (2025-02-10T02:35:53Z)
• Safe Active Learning for Time-Series Modeling with Gaussian Processes [7.505622158856545]
  Learning time-series models is useful for many applications, such as simulation and forecasting. In this study, we consider the problem of actively learning time-series models while taking given safety constraints into account. The proposed approach generates data appropriate for time series model learning, i.e. input and output trajectories, by dynamically exploring the input space.
  arXiv  Detail & Related papers  (2024-02-09T09:40:33Z)
• A Target Detection Algorithm in Traffic Scenes Based on Deep Reinforcement Learning [2.8554857235549753]
  This research presents a novel active detection model utilizing deep reinforcement learning to accurately detect traffic objects in real-world scenarios. The model employs a deep Q-network based on LSTM-CNN that identifies and aligns target zones with specific categories of traffic objects. Tests conducted demonstrate the model's proficiency, exhibiting exceptional precision and performance in locating traffic signal lights and speed limit signs.
  arXiv  Detail & Related papers  (2023-12-25T04:23:30Z)
• Appearance-Based Refinement for Object-Centric Motion Segmentation [85.2426540999329]
  We introduce an appearance-based refinement method that leverages temporal consistency in video streams to correct inaccurate flow-based proposals. Our approach involves a sequence-level selection mechanism that identifies accurate flow-predicted masks as exemplars. Its performance is evaluated on multiple video segmentation benchmarks, including DAVIS, YouTube, SegTrackv2, and FBMS-59.
  arXiv  Detail & Related papers  (2023-12-18T18:59:51Z)
• Online Network Source Optimization with Graph-Kernel MAB [62.6067511147939]
  We propose Grab-UCB, a graph- kernel multi-arms bandit algorithm to learn online the optimal source placement in large scale networks. We describe the network processes with an adaptive graph dictionary model, which typically leads to sparse spectral representations. We derive the performance guarantees that depend on network parameters, which further influence the learning curve of the sequential decision strategy.
  arXiv  Detail & Related papers  (2023-07-07T15:03:42Z)
• Transfer RL across Observation Feature Spaces via Model-Based Regularization [9.660642248872973]
  In many reinforcement learning (RL) applications, the observation space is specified by human developers and restricted by physical realizations. We propose a novel algorithm which extracts the latent-space dynamics in the source task, and transfers the dynamics model to the target task. Our algorithm works for drastic changes of observation space without any inter-task mapping or any prior knowledge of the target task.
  arXiv  Detail & Related papers  (2022-01-01T22:41:19Z)
• Goal Agnostic Planning using Maximum Likelihood Paths in Hypergraph World Models [1.370633147306388]
  We present a hypergraph-based machine learning algorithm, a datastructure--driven maintenance method, and a planning algorithm based on a probabilistic application of Dijkstra's algorithm. We prove that the algorithm determines optimal solutions within the problem space, mathematically bound learning performance, and supply a mathematical model analyzing system state progression through time.
  arXiv  Detail & Related papers  (2021-10-18T16:22:33Z)
• Using Graph Neural Networks to model the performance of Deep Neural Networks [2.1151356984322307]
  We develop a novel performance model that adopts a graph representation. Experimental evaluation shows a 7:75x and 12x reduction in prediction error compared to the Halide and TVM models, respectively.
  arXiv  Detail & Related papers  (2021-08-27T20:20:17Z)
• Goal-Aware Prediction: Learning to Model What Matters [105.43098326577434]
  One of the fundamental challenges in using a learned forward dynamics model is the mismatch between the objective of the learned model and that of the downstream planner or policy. We propose to direct prediction towards task relevant information, enabling the model to be aware of the current task and encouraging it to only model relevant quantities of the state space. We find that our method more effectively models the relevant parts of the scene conditioned on the goal, and as a result outperforms standard task-agnostic dynamics models and model-free reinforcement learning.
  arXiv  Detail & Related papers  (2020-07-14T16:42:59Z)
• Unsupervised Learning of Video Representations via Dense Trajectory Clustering [86.45054867170795]
  This paper addresses the task of unsupervised learning of representations for action recognition in videos. We first propose to adapt two top performing objectives in this class - instance recognition and local aggregation. We observe promising performance, but qualitative analysis shows that the learned representations fail to capture motion patterns.
  arXiv  Detail & Related papers  (2020-06-28T22:23:03Z)
• Self-supervised Video Object Segmentation [76.83567326586162]
  The objective of this paper is self-supervised representation learning, with the goal of solving semi-supervised video object segmentation (a.k.a. dense tracking) We make the following contributions: (i) we propose to improve the existing self-supervised approach, with a simple, yet more effective memory mechanism for long-term correspondence matching; (ii) by augmenting the self-supervised approach with an online adaptation module, our method successfully alleviates tracker drifts caused by spatial-temporal discontinuity; (iv) we demonstrate state-of-the-art results among the self-supervised approaches on DAVIS-2017 and YouTube
  arXiv  Detail & Related papers  (2020-06-22T17:55:59Z)
• Model-Augmented Actor-Critic: Backpropagating through Paths [81.86992776864729]
  Current model-based reinforcement learning approaches use the model simply as a learned black-box simulator. We show how to make more effective use of the model by exploiting its differentiability.
  arXiv  Detail & Related papers  (2020-05-16T19:18:10Z)

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.