Approximate Nearest Neighbor Fields in Video

Nir Ben-Zrihem, Lihi Zelnik-Manor; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 5233-5242


We introduce RIANN (Ring Intersection Approximate Nearest Neighbor search), an algorithm for matching patches of a video to a set of reference patches in real-time. For each query, RIANN finds potential matches by intersecting rings around key points in appearance space. Its search complexity is reversely correlated to the amount of temporal change, making it a good fit for videos, where typically most patches change slowly with time. Experiments show that RIANN is up to two orders of magnitude faster than previous ANN methods, and is the only solution that operates in real-time. We further demonstrate how RIANN can be used for real-time video processing and provide examples for a range of real-time video applications, including colorization, denoising, and several artistic effects.

Related Material

author = {Ben-Zrihem, Nir and Zelnik-Manor, Lihi},
title = {Approximate Nearest Neighbor Fields in Video},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2015}