2016 6th International Conference on System Engineering and Technology (ICSET) 2016
DOI: 10.1109/icsengt.2016.7849633
|View full text |Cite
|
Sign up to set email alerts
|

Kalman filter and Iterative-Hungarian Algorithm implementation for low complexity point tracking as part of fast multiple object tracking system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 50 publications
(17 citation statements)
references
References 2 publications
0
17
0
Order By: Relevance
“…Various studies have been performed object matching based on the SURF features [42,43], Harris corner [44,45], and Hungarian method [46,47]. In Hungarian method, the objects are matched based on their optimal distance from each other.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Various studies have been performed object matching based on the SURF features [42,43], Harris corner [44,45], and Hungarian method [46,47]. In Hungarian method, the objects are matched based on their optimal distance from each other.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Another challenge is the association of detection results from different video frames. Traditional approaches utilize the Hungarian algorithm [16] to check if the object in the current frame is the same as in the previous frame. However, the input to the Hungarian method is only the bounding box information, and thus may result in an unsolved matched due to the limited information.…”
Section: First Stage -Local Fusion and Associationmentioning
confidence: 99%
“…Stage -Track Fusion and Association. The Hungarian algorithm [16] is often used as the matching step for the trackers, which checks if the object in the current frame is the same as in the previous frame. For the set of a given detector matrix m from the CNN network and tracker matrix from the Kalman filter, it builds the association vector [ , ].…”
Section: Secondmentioning
confidence: 99%
“…t and c k t are k-th detection and candidate in frame t, respectively. To connect the candidate and detection within inter-frames, we match the candidates c k t and d k t in a bipartite graph with Hungarian algorithm [21]. The bi-…”
Section: Tracklet Generationmentioning
confidence: 99%