Unverified70% confidenceFactExact time
Mainstream 2D tracking algorithms (such as SORT, DeepSORT, and ByteTrack) rely on Kalman filtering to predict the target's position in the next frame and use the Hungarian algorithm to achieve optimal matching between detection boxes and existing trajectories.
2
Sources
70%
Confidence
Long-term
Relevance
7/19/2026
First Seen
Sources
Related Claims
Unverified质心追踪算法通过计算当前帧质心与上一帧已注册目标质心的欧氏距离进行配对，计算复杂度随目标数量呈线性甚至平方级增长79% similarUnverifiedSORT/DeepSORT算法采用'tentative track'机制，要求目标被连续检测到N帧后才确认为有效轨迹75% similarUnverifiedDETR relies on the Hungarian matching algorithm to find the optimal one-to-one correspondence between predicted boxes and ground-truth targets via bipartite graph matching in order to compute the loss.74% similarUnverifiedCommon tracking methods include correlation filter-based CSRT/KCF, as well as deep learning-based approaches such as SiamRPN and ByteTrack.71% similarUnverifiedThe algorithm includes a pruning method that ensures only the relevant candidates that approximately match the hidden weight vectors at the target accuracy are maintained.69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/558091API
curl https://kongchang.com/api/v1/knowledge/claims/558091MCP
get_claim(id=558091)