Research in optical flow estimation has to a large extent focused on achieving the best possible quality with no regards to running time. Nevertheless, in a number of important applications the speed is crucial. To address this problem we present BriefMatch, a real-time optical flow method that is suitable for live applications. The method combines binary features with the search strategy from PatchMatch in order to efficiently find a dense correspondence field between images. We show that the BRIEF descriptor provides better candidates (less outlier-prone) in shorter time, when compared to direct pixel comparisons and the Census transform. This allows us to achieve high quality results from a simple filtering of the initially matched candidates. Currently, Brief-Match has the fastest running time on the Middlebury benchmark, while placing highest of all the methods that run in shorter than 0.5 s.
CITATION STYLE
Eilertsen, G., Forssén, P. E., & Unger, J. (2017). BriefMatch: Dense binary feature matching for real-time optical flow estimation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10269 LNCS, pp. 221–233). Springer Verlag. https://doi.org/10.1007/978-3-319-59126-1_19
Mendeley helps you to discover research relevant for your work.