%0 Journal Article %T MPI based parallel computation of matching cube
基于MPI的匹配方体并行计算研究 %A LUO Qiu-ming %A WANG Mei %A LEI Hai-jun %A
罗秋明 %A 王梅 %A 雷海军 %J 计算机应用 %D 2006 %I %X According to PCAM, a parallel algorithm was figured out to accelerate the computation of matching-cube for stereoscopic vision. The computation of matching-cube was divided by vertical coordinate into many sub-computations, which minimized the communication between computing nodes. By assigning these computation jobs of different disparity values to multiple computing nodes and gathering all these DSI to root node, a matching cube was obtained. A relatively accurate computational time complexity modal was built on CPU cycles to analyze the performance on different platforms, which was very important to real-time applications. As the data-dependence during computation was very low, a nearly linear speedup could be obtained on MPI cluster parallel platform. %K matching-cube %K Disparity Space Image(DSI) %K stereoscopic vision %K Message Passing Interface(MPI) %K parallel computing
匹配方体 %K 视差空间图像 %K 立体视觉 %K 消息传递接口 %K 并行计算 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=DB14D8A84E5CAEF3&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=5D311CA918CA9A03&sid=A79289A96CCBCA10&eid=7F4621C62254E923&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=9