Fast Edge-Preserving PatchMatch for Large Displacement Optical Flow
Linchao Bao, Qingxiong Yang, Hailin Jin; Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 3534-3541
Abstract
We present a fast optical flow algorithm that can handle large displacement motions. Our algorithm is inspired by recent successes of local methods in visual correspondence searching as well as approximate nearest neighbor field algorithms. The main novelty is a fast randomized edge-preserving approximate nearest neighbor field algorithm which propagates self-similarity patterns in addition to offsets. Experimental results on public optical flow benchmarks show that our method is significantly faster than state-of-the-art methods without compromising on quality, especially when scenes contain large motions.
Related Material
[pdf]
[
bibtex]
@InProceedings{Bao_2014_CVPR,
author = {Bao, Linchao and Yang, Qingxiong and Jin, Hailin},
title = {Fast Edge-Preserving PatchMatch for Large Displacement Optical Flow},
booktitle = {Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2014}
}