Show all publications

Massively Parallel Optical Flow Using Distributed Local Search

Download AwardDownload Bibliography in Open DocumentDownload Bibliography in HTMLDownload BibTeXDownload RISDownload Bibliographical Ontology (RDF)
Authors:
Details:
In Proc. of The Tenth International Conference on Pervasive Patterns and Applications PATTERNS 2018. Barcelona, Spain. February 18-22, Best Paper Award, 2018.
ISBN 978-1-61208-612-5
ISSN 2308-3557.
Abstract:
The design of many tasks in computer vision field requires addressing difficult NP-hard energy optimization problems. An example of application is the visual correspondence problem of optical flow, which can be formulated as an elastic pattern matching optimization problem. Pixels of a first image have to be matched to pixels in a second image while preserving elastic smoothness constraint on the first image deformation. In this paper, we present a parallel approach to address optical flow problem following the concept of distributed local search. Distributed local search consists in the parallel execution of many standard local search processes operating on a partition of the data. Each process performs local search on its own part of the data such that the overall energy is minimized. The approach is implemented on graphics processing unit (GPU) platform and evaluated on standard Middlebury benchmarks to gauge the substantial acceleration factors that can be achieved in the task of energy minimization.
Keywords:
Optical flow, Parallel and distributed computing, Variable neighborhood search, Graphics processing unit.
Publication Category:
International conference with proceedings
Copyright 2010-2019 © Laboratoire Connaissance et Intelligence Artificielle Distribu√©es - Université Bourgogne Franche-Comté - Privacy policy