.png){kind=icon}
.png){kind=icon}
Return
Sparse Occlusion Detection with Optical Flow
.png){kind=icon}
PRE
AI
DOI：10.1007/s11263-011-0490-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a variational optimization problem, and its solution approximated using convex minimization. We describe efficient numerical schemes that reach the global optimum of the relaxed cost functional, for any number of independently moving objects, and any number of occlusion layers. We test the proposed algorithm on benchmark datasets, expanded to enable evaluation of occlusion detection performance, in addition to optical flow.
Keywords:
Occlusion detection
Optical flow
Convex optimization
Sparse optimization
Nesterov's algorithm
Split-Bregman method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.3
Papers:
3.9K
Citations:
2.8W
