A High Performance Parallel Graph Cut Optimization for Depth Estimation

Bo Yen Chen*, Bo-Cheng Lai

*此作品的通信作者

    研究成果: Chapter同行評審

    1 引文 斯高帕斯(Scopus)

    摘要

    Graph-cut has been proved to return good quality on the optimization of depth estimation. Leveraging the parallel computation has been proposed as a solution to handle the intensive computation of graph-cut algorithm. This pa-per proposes two parallelization techniques to enhance the execution time of graph-cut optimization. By executing on an Intel 8-core CPU, the proposed scheme can achieve an average of 4.7 times speedup with only 0.01% energy increase.

    原文English
    主出版物標題Advances in Intelligent Systems and Applications - Volume 2
    主出版物子標題Proceedings of the International Computer
    編輯Chang Ruay-Shiung, Peng Sheng-Lung, Lin Chia-Chen
    頁面311-320
    頁數10
    DOIs
    出版狀態Published - 28 6月 2013

    出版系列

    名字Smart Innovation, Systems and Technologies
    21
    ISSN(列印)2190-3018
    ISSN(電子)2190-3026

    指紋

    深入研究「A High Performance Parallel Graph Cut Optimization for Depth Estimation」主題。共同形成了獨特的指紋。

    引用此