2017
DOI: 10.1134/s0361768817040053
|View full text |Cite
|
Sign up to set email alerts
|

Markov chain Monte Carlo based video tracking algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0
1

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 6 publications
0
2
0
1
Order By: Relevance
“…In most online algorithms tracks are constructed frame by frame, each frame creates a matrix of the cost of matching new detections and existing tracks, then the problem of matching is solved by a greedy algorithm (searching for the maximum in each row/column) [12,13] or by a Hungarian algorithm [14] [4, 5, 6]. Sometimes MCMC is used to bind all the detections to tracks [7,15].…”
Section: Related Workmentioning
confidence: 99%
“…In most online algorithms tracks are constructed frame by frame, each frame creates a matrix of the cost of matching new detections and existing tracks, then the problem of matching is solved by a greedy algorithm (searching for the maximum in each row/column) [12,13] or by a Hungarian algorithm [14] [4, 5, 6]. Sometimes MCMC is used to bind all the detections to tracks [7,15].…”
Section: Related Workmentioning
confidence: 99%
“…In most online algorithms tracks are constructed frame by frame, each frame creates a matrix of the cost of matching new detections and existing tracks, then the problem of matching is solved by a greedy algorithm (searching for the maximum in each row/column) [11,12] or by a Hungarian algorithm [13] [2,3,4]. Sometimes MCMC is used to bind all the detections to tracks [5,14].…”
Section: Related Workmentioning
confidence: 99%
“…Могут быть рассмотрены связи между соседними обнаружениями [9], могут учитываться несколько последних обнаружений [5] или же на вход подается вся видеопоследовательность целиком, и есть возможность учитывать обнаружения на всех кадрах: предыдущих и последующих. А в некоторых работах предлагают строить траектории из обнаружений с помощью MCMC (Markov chain monte carlo) [12], [14]…”
Section: обзор существующих методовunclassified