SimpleFlow: A Non-iterative, Sublinear Optical Flow Algorithm
dc.contributor.author | Tao, Michael | en_US |
dc.contributor.author | Bai, Jiamin | en_US |
dc.contributor.author | Kohli, Pushmeet | en_US |
dc.contributor.author | Paris, Sylvain | en_US |
dc.contributor.editor | P. Cignoni and T. Ertl | en_US |
dc.date.accessioned | 2015-02-28T06:52:25Z | |
dc.date.available | 2015-02-28T06:52:25Z | |
dc.date.issued | 2012 | en_US |
dc.description.abstract | Optical flow is a critical component of video editing applications, e.g. for tasks such as object tracking, segmentation, and selection. In this paper, we propose an optical flow algorithm called SimpleFlow whose running times increase sublinearly in the number of pixels. Central to our approach is a probabilistic representation of the motion flow that is computed using only local evidence and without resorting to global optimization. To estimate the flow in image regions where the motion is smooth, we use a sparse set of samples only, thereby avoiding the expensive computation inherent in traditional dense algorithms. We show that our results can be used as is for a variety of video editing tasks. For applications where accuracy is paramount, we use our result to bootstrap a global optimization. This significantly reduces the running times of such methods without sacrificing accuracy. We also demonstrate that the SimpleFlow algorithm can process HD and 4K footage in reasonable times. | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 31 | |
dc.identifier.doi | 10.1111/j.1467-8659.2012.03013.x | |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2012.03013.x | en_US |
dc.publisher | The Eurographics Association and John Wiley and Sons Ltd. | en_US |
dc.title | SimpleFlow: A Non-iterative, Sublinear Optical Flow Algorithm | en_US |