资源分类
》 资源 》论文》Occlusion Detection and Motion Estimation with Convex Optimization

Occlusion Detection and Motion Estimation with Convex Optimization

2020-01-06 | |  63 |   45 |   0

Abstract

We tackle the problem of simultaneously detecting occlusions and estimating optical flow. We show that, under standard assumptions of Lambertian reflection and static illumination, the task can be posed as a convex minimization problem. Therefore, the solution, computed using efficient algorithms, is guaranteed to be globally optimal, 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.

上一篇：Towards Property-Based Classification of Clustering Paradigms

下一篇：Large-Scale Matrix Factorization with Missing Data under Additional Constraints

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...