logo
banner

Journals & Publications

Journals Publications Papers

Papers

Dynamic Graph Cuts in Parallel
Jul 13, 2017Author:
PrintText Size A A

Title: Dynamic Graph Cuts in Parallel

 Authors: Yu, M; Shen, SH; Hu, ZY

 Author Full Names: Yu, Miao; Shen, Shuhan; Hu, Zhanyi

 Source: IEEE TRANSACTIONS ON IMAGE PROCESSING, 26 (8):3775-3788; 10.1109/TIP.2017.2704431 AUG 2017

 Language: English

 Abstract: This paper aims at bridging the two important trends in efficient graph cuts in the literature, the one is to decompose a graph into several smaller subgraphs to take the advantage of parallel computation, the other is to reuse the solution of the max-flow problem on a residual graph to boost the efficiency on another similar graph. Our proposed parallel dynamic graph cuts algorithm takes the advantages of both, and is extremely efficient for certain dynamically changing MRF models in computer vision. The performance of our proposed algorithm is validated on two typical dynamic graph cuts problems: the foreground-background segmentation in video, where similar graph cuts problems need to be solved in sequential and GrabCut, where graph cuts are used iteratively.

 ISSN: 1057-7149

 eISSN: 1941-0042

 IDS Number: EY2SC

 Unique ID: WOS:000403819200010

 PubMed ID: 28534771

 

*Click Here to View Full Record