Highly efficient reconfigurable parallel graph cuts for embedded visionHighly efficient reconfigurable parallel graph cuts for embedded vision Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2018-10-162016enGraph cuts are very popular methods for combinatorial optimization mainly utilized, while also being the most computational intensive part, in several vision schemes such as image segmentation and stereo correspondence; their advantage is that they are very efficient as they provide guarantees about the optimality of the reported solution. Moreover, when those vision schemes are executed in mobile devices there is a strong need, not only for real-time processing, but also for low power/energy consumption. In this paper, we present a novel architecture for the implementation, in reconfigurable hardware, of one of the most widely used graph cuts algorithms, which is also the fastest sequential one, called BK. Our novelty comes from the fact that we use a 2-level hierarchical decomposition method to parallelize it in a very modular way allowing it to be efficiently implemented in FPGAs with different number of logic cells and/or memory resources. We fast-prototyped the architecture, using a High level synthesis workflow, in a state-of-the-art FPGA device; our implementation outperforms an optimized reference software solution by more than 6x, while consuming 35 times less energy;. To the best of our knowledge this is the first parallel implementation of this very widely used algorithm in reconfigurable hardware.http://creativecommons.org/licenses/by/4.0/1405-141019th Design, Automation and Test in Europe Conference and ExhibitionProceedings of the 2016 Design, Automation and Test in Europe Conference and Exhibition Nikitakis Antonios Νικητακης Αντωνιος Papaefstathiou Ioannis Παπαευσταθιου Ιωαννης Institute of Electrical and Electronics Engineers Dual decomposition Embedded system FPGA Graph cuts Low power Markov random field