UnFlow: Unsupervised Learning of Optical Flow with a Bidirectional Census Loss

Simon Meister, Junhwa Hur, Stefan Roth
11/21/2017
cs.CV

Official code: simonmeister/UnFlow (308 stars, MIT, TensorFlow, last commit 2020-02-17).

Abstract

In the era of end-to-end deep learning, many advances in computer vision are driven by large amounts of labeled data. In the optical flow setting, however, obtaining dense per-pixel ground truth for real scenes is difficult and thus such data is rare. Therefore, recent end-to-end convolutional networks for optical flow rely on synthetic datasets for supervision, but the domain mismatch between training and test scenarios continues to be a challenge. Inspired by classical energy-based optical flow methods, we design an unsupervised loss based on occlusion-aware bidirectional flow estimation and the robust census transform to circumvent the need for ground truth flow. On the KITTI benchmarks, our unsupervised approach outperforms previous unsupervised deep networks by a large margin, and is even more accurate than similar supervised methods trained on synthetic datasets alone. By optionally fine-tuning on the KITTI training data, our method achieves competitive optical flow accuracy on the KITTI 2012 and 2015 benchmarks, thus in addition enabling generic pre-training of supervised networks for datasets with limited amounts of ground truth.

View on arXivView PDF

Code Implementations(1)

TensorFlowMIT

UnFlow: Unsupervised Learning of Optical Flow with a Bidirectional Census Loss

30856C++, PythonDec 2, 20176 years agoMIT
computer-visiondeep-learningflownetoptical-flowtensorflow+2 more

Similar Papers

Cite this paper

@article{meister2017unflow,
  title  = {UnFlow: Unsupervised Learning of Optical Flow with a Bidirectional Census Loss},
  author = {Simon Meister and Junhwa Hur and Stefan Roth},
  year   = {2017},
  eprint = {1711.07837},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1711.07837}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1711.07837.svg)](https://codeofpaper.com/paper/1711.07837)

Discussion