Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Engineering Journal of Wuhan University》 2010-01
Add to Favorite Get Latest Update

Parallel algorithm of graph cut in Markov random field

WANG Wentao,CHEN Cong,LI Zimao(College of Computer Science,South-Central University for Nationalities,Wuhan 430074,China)  
Recently graph-cut becomes an increasingly useful tool for Markov random field to provide polynomial time complexity rather than the original NP hard problem.This paper explores parallelism of Yuri Boykov's graph cut algorithm and designs a parallel algorithm for Grow and Adopt function.The branch and bound method is used for Breadth First Search in Grow function and extending the cancel thread to improve the run times.The new feature "task" in OpenMP3.0 is used to solve the irregular problem.For p CPUs,the worst case reduces the running time from O(bd/2+a+nr) to O(bd/2/p+a/p+nr/p).Parallel algorithms writing with OpenMP have been run on 1 and N kornels CPU.The experiment proves that this algorithm is precise and efficient.
【Fund】: 国家自然科学基金项目(编号:60603008)
【CateGory Index】: TP391.41
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved