2019
DOI: 10.1007/978-3-030-33676-9_9
|View full text |Cite
|
Sign up to set email alerts
|

Non-causal Tracking by Deblatting

Abstract: 0000−0001−9874−1349] , Jan Kotera 2[0000−0001−5528−5531] , FilipŠroubek 2[0000−0001−6835−4911] , and Jiří Matas 1[0000−0003−0863−4844]Abstract. Tracking by Deblatting 1 stands for solving an inverse problem of deblurring and image matting for tracking motion-blurred objects. We propose noncausal Tracking by Deblatting which estimates continuous, complete and accurate object trajectories. Energy minimization by dynamic programming is used to detect abrupt changes of motion, called bounces. High-order polynomial… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2
1

Relationship

3
5

Authors

Journals

citations
Cited by 15 publications
(18 citation statements)
references
References 24 publications
0
18
0
Order By: Relevance
“…This work is an extension of our earlier conference publications (Rozumnyi et al 2019) and (Kotera et al 2019). Some parts have been reported in Master Thesis by (Rozumnyi 2019).…”
mentioning
confidence: 70%
“…This work is an extension of our earlier conference publications (Rozumnyi et al 2019) and (Kotera et al 2019). Some parts have been reported in Master Thesis by (Rozumnyi 2019).…”
mentioning
confidence: 70%
“…Input image I and background B are assumed to be known. The unknowns in (2) are estimated either by alternating energy minimization with additional priors [30,48,46,31,29], or more recently by learning from synthetic data [50,49]. The formation model in (2) encodes the trajectory by the blur kernel.…”
Section: Application: Fast-moving Object Detectionmentioning
confidence: 99%
“…where the motion blur is modeled by the convolution of the sharp object appearance F and its trajectory, defined by the blur kernel H. Several follow-up methods [13,14,25,26,28,29,39] were proposed to solve for (F, M, H) given the input image I and background B. They approximate the solution in a least-squares sense by energy minimization with suitable regularizers summarized by function reg(•):…”
Section: Related Workmentioning
confidence: 99%