检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:叶爱芬[1] 王环[2] 沈雁[3] Ye Aifen;Wang Huan;Shen Yan(Zhejiang Dongfang Polytechnic, Wenzhou325000, China;National-Local Joint Engineering Laboratory of Electrical Digital Design Technology, Wenzhou University, Wenzhou325035, China;College of Electrical and Information Engineering, Hunan University, Changsha410082, China)
机构地区:[1]浙江东方职业技术学院电气自动化研究室,浙江温州325035 [2]温州大学电气数字化设计技术国家地方联合工程实验室,浙江温州325035 [3]湖南大学电气与信息工程学院,湖南长沙410082
出 处:《计算机测量与控制》2019年第5期155-159,共5页Computer Measurement &Control
基 金:浙江省自然科学基金重点项目(LZ16E050002)
摘 要:针对如光束平差这样的大规模优化问题,实现基于OpenCL的并行化自动微分;采用更有效的反向计算模式,实现对多参数函数的导数计算;在OpenCL框架下,主机端完成C/C++形式的函数构建以及基于拓扑排序的计算序列生成,设备端按照计算序列完成函数值以及导数的并行计算;测试结果表明,将实现的自动微分应用于光束平差的雅可比矩阵计算后,相比于采用OpenMP的Ceres Solver,运行速度提高了约3.6倍。A parallelized implementation of automatic differentiation that derives from the problem of bundle adjustment is proposed,which is based on OpenCL parallel computing framework.Reverse mode of automatic differentiation is more efficient to compute the derivatives of functions with multiple parameters,which is the case of computing the Jacobian matrix in bundle adjustment problem.Under the framework of OpenCL,C/C++style function construction and topological sorting based computational sequence generation are implemented on the host side.On the device side,function values and derivatives are computed in parallel according to computational sequence.Large scale bundle adjustment datasets are used to evaluate the proposed implementation.The result shows that our implementation runs about 3.6 times faster than Ceres Solver which utilizes OpenMP parallel programming model.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229