Label Space Partition Selection for Multi-Object Tracking Using Two-Layer Partitioning
Estimating the trajectories of multi-objects poses a significant challenge due to data association ambiguity, which leads to a substantial increase in computational requirements. To address such problems, a divide-and-conquer manner has been employed with parallel computation. In this strategy, distinguished objects that have unique labels are grouped based on their statistical dependencies, the intersection of predicted measurements. Several geometry approaches have been used for label grouping since finding all intersected label pairs is clearly infeasible for large-scale tracking problems. This paper proposes an efficient implementation of label grouping for label-partitioned generalized labeled multi-Bernoulli filter framework using a secondary partitioning technique. This allows for parallel computation in the label graph indexing step, avoiding generating and eliminating duplicate comparisons. Additionally, we compare the performance of the proposed technique with several efficient spatial searching algorithms. The results demonstrate the superior performance of the proposed approach on large-scale data sets, enabling scalable trajectory estimation.
Code (0)
등록된 구현이 없습니다.
Tasks
Multi-Object TrackingObject TrackingSimilar Papers 제목 키워드 기반
Label Disentanglement in Partition-based Extreme Multilabel Classification
Partition-based methods are increasingly-used in extreme multi-label classification (XMC) problems due to their scalability to large output spaces (e.g., millions or more). However, existing methods partition the large l…
ClassificationDisentanglementExtreme Multi-Label ClassificationMulti-Label Classification+1Tips, guidelines and tools for managing multi-label datasets: the mldr.datasets R package and the Cometa data repository
New proposals in the field of multi-label learning algorithms have been growing in number steadily over the last few years. The experimentation associated with each of them always goes through the same phases: selection …
ManagementMulti-Label LearningRobust Markov stability for community detection at a scale learned based on the structure
Community detection, the unsupervised task of clustering nodes of a graph, finds applications across various fields. The common approaches for community detection involve optimizing an objective function to partition the…
Community DetectionClass-Partitioned VQ-VAE and Latent Flow Matching for Point Cloud Scene Generation
Most 3D scene generation methods are limited to only generating object bounding box parameters while newer diffusion methods also generate class labels and latent features. Using object size or latent feature, they then …
Point Cloud GenerationScene GenerationA Multilabel Classification Framework for Approximate Nearest Neighbor Search
Both supervised and unsupervised machine learning algorithms have been used to learn partition-based index structures for approximate nearest neighbor (ANN) search. Existing supervised algorithms formulate the learning t…
ClassificationGeneral ClassificationMulti-Label Classification