An Efficient Labeled/Unlabeled Random Finite Set Algorithm for Multiobject Tracking
원문 초록
We propose an efficient random finite set (RFS) based algorithm for multiobject tracking in which the object states are modeled by a combination of a labeled multi-Bernoulli (LMB) RFS and a Poisson RFS. The less computationally demanding Poisson part of the algorithm is used to track potential objects whose existence is unlikely. Only if a quantity characterizing the plausibility of object existence is above a threshold, a new labeled Bernoulli component is created and the object is tracked by the more accurate but more computationally demanding LMB part of the algorithm. Conversely, a labeled Bernoulli component is transferred back to the Poisson RFS if the corresponding existence probability falls below another threshold. Contrary to existing hybrid algorithms based on multi-Bernoulli and Poisson RFSs, the proposed method facilitates track continuity and implements complexity-reducing features. Simulation results demonstrate a large complexity reduction relative to other RFS-based algorithms with comparable performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
RoHOI: Robustness Benchmark for Human-Object Interaction Detection
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
NOCTIS: Novel Object Cyclic Threshold based Instance Segmentation
Refine Any Object in Any Scene
DenseWorld-1M: Towards Detailed Dense Grounded Caption in the Real World
Towards Reliable Detection of Empty Space: Conditional Marked Point Processes for Object Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.