Memory-Efficient Optical Flow via Radius-Distribution Orthogonal Cost Volume

Gangwei Xu, Shujun Chen, Hao Jia, Miaojie Feng, Xin Yang
12/6/2023
cs.CV

No official code found. Best implementation: gangweix/MeFlow (17 stars, last commit 2024-09-06).

Abstract

The full 4D cost volume in Recurrent All-Pairs Field Transforms (RAFT) or global matching by Transformer achieves impressive performance for optical flow estimation. However, their memory consumption increases quadratically with input resolution, rendering them impractical for high-resolution images. In this paper, we present MeFlow, a novel memory-efficient method for high-resolution optical flow estimation. The key of MeFlow is a recurrent local orthogonal cost volume representation, which decomposes the 2D search space dynamically into two 1D orthogonal spaces, enabling our method to scale effectively to very high-resolution inputs. To preserve essential information in the orthogonal space, we utilize self attention to propagate feature information from the 2D space to the orthogonal space. We further propose a radius-distribution multi-scale lookup strategy to model the correspondences of large displacements at a negligible cost. We verify the efficiency and effectiveness of our method on the challenging Sintel and KITTI benchmarks, and real-world 4K ($2160\!\times\!3840$) images. Our method achieves competitive performance on both Sintel and KITTI benchmarks, while maintaining the highest memory efficiency on high-resolution inputs.

View on arXivView PDF

Code Implementations(1)

gangweix/MeFlowCommunity100%
170Shell, Python2 years ago

Cite this paper

@article{xu2023memoryefficient,
  title  = {Memory-Efficient Optical Flow via Radius-Distribution Orthogonal Cost Volume},
  author = {Gangwei Xu and Shujun Chen and Hao Jia and Miaojie Feng and Xin Yang},
  year   = {2023},
  eprint = {2312.03790},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.03790v2}
}

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/2312.03790.svg)](https://codeofpaper.com/paper/2312.03790)

Discussion