A High Performance Parallel Graph Cut Optimization for Depth Estimation

Bo Yen Chen; Bo-Cheng Lai

doi:10.1007/ 978-3-642-35473-1_31

A High Performance Parallel Graph Cut Optimization for Depth Estimation

Bo Yen Chen^*, Bo-Cheng Lai

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

1 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Advances in Intelligent Systems and Applications - Volume 2
Subtitle of host publication	Proceedings of the International Computer
Editors	Chang Ruay-Shiung, Peng Sheng-Lung, Lin Chia-Chen
Pages	311-320
Number of pages	10
DOIs	https://doi.org/10.1007/ 978-3-642-35473-1_31
State	Published - 28 Jun 2013

Publication series

Name	Smart Innovation, Systems and Technologies
Volume	21
ISSN (Print)	2190-3018
ISSN (Electronic)	2190-3026

Keywords

Depth estimation
Graph cut
Parallelization
Stereo correspondence

Access to Document

10.1007/ 978-3-642-35473-1_31

Cite this

Chen, B. Y., & Lai, B-C. (2013). A High Performance Parallel Graph Cut Optimization for Depth Estimation. In C. Ruay-Shiung, P. Sheng-Lung, & L. Chia-Chen (Eds.), Advances in Intelligent Systems and Applications - Volume 2: Proceedings of the International Computer (pp. 311-320). (Smart Innovation, Systems and Technologies; Vol. 21). https://doi.org/10.1007/ 978-3-642-35473-1_31

@inbook{5a85fa1fce934892a406df8a78e16342,

title = "A High Performance Parallel Graph Cut Optimization for Depth Estimation",

abstract = "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.",

keywords = "Depth estimation, Graph cut, Parallelization, Stereo correspondence",

author = "Chen, {Bo Yen} and Bo-Cheng Lai",

year = "2013",

month = jun,

day = "28",

doi = "10.1007/ 978-3-642-35473-1_31",

language = "English",

isbn = "9783642354724",

series = "Smart Innovation, Systems and Technologies",

pages = "311--320",

editor = "Chang Ruay-Shiung and Peng Sheng-Lung and Lin Chia-Chen",

booktitle = "Advances in Intelligent Systems and Applications - Volume 2",

}

A High Performance Parallel Graph Cut Optimization for Depth Estimation. / Chen, Bo Yen; Lai, Bo-Cheng.

Advances in Intelligent Systems and Applications - Volume 2: Proceedings of the International Computer. ed. / Chang Ruay-Shiung; Peng Sheng-Lung; Lin Chia-Chen. 2013. p. 311-320 (Smart Innovation, Systems and Technologies; Vol. 21).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - A High Performance Parallel Graph Cut Optimization for Depth Estimation

AU - Chen, Bo Yen

AU - Lai, Bo-Cheng

PY - 2013/6/28

Y1 - 2013/6/28

N2 - 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.

AB - 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.

KW - Depth estimation

KW - Graph cut

KW - Parallelization

KW - Stereo correspondence

UR - http://www.scopus.com/inward/record.url?scp=84879305346&partnerID=8YFLogxK

U2 - 10.1007/ 978-3-642-35473-1_31

DO - 10.1007/ 978-3-642-35473-1_31

M3 - Chapter

AN - SCOPUS:84879305346

SN - 9783642354724

T3 - Smart Innovation, Systems and Technologies

SP - 311

EP - 320

BT - Advances in Intelligent Systems and Applications - Volume 2

A2 - Ruay-Shiung, Chang

A2 - Sheng-Lung, Peng

A2 - Chia-Chen, Lin

ER -

A High Performance Parallel Graph Cut Optimization for Depth Estimation

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this