基于并行加速的改进快速相位展开算法

Q3 Engineering
Long Xiao, Bao Hua, Rao Changhui, Gao Guoqing, Zhou Luchun
{"title":"基于并行加速的改进快速相位展开算法","authors":"Long Xiao, Bao Hua, Rao Changhui, Gao Guoqing, Zhou Luchun","doi":"10.12086/OEE.2020.200111","DOIUrl":null,"url":null,"abstract":"Aiming at the shortcoming of low serial operational efficiency in the quality-map-guided phase-unwrapping algorithm proposed by Miguel, an improved algorithm for parallel merging of multiple low-reliability blocks is pro-posed. Under the condition that the original algorithm design idea is satisfied, the unwrapping path is redefined as the largest reliable edge of the block. In addition, based on the non-continuous characteristic of the unwrapping path of the original algorithm, a low-reliability block out-of-order merging strategy is proposed to make multiple merging tasks can be performed simultaneously. The improved algorithm uses a multi-threaded software architecture. The main thread is responsible for looping through the unprocessed blocks to check whether they meet the requirements of merging, and the child threads receive and perform the merge tasks. The experimental results show that the improved method is completely consistent with the processing results of the original algorithm, and the parallel improvement strategy can effectively use the computer's multi-core resources, so that the operational efficiency of the phase unwrapping algorithm is improved by more than 50%.","PeriodicalId":39552,"journal":{"name":"光电工程","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved fast phase unwrapping algorithm based on parallel acceleration\",\"authors\":\"Long Xiao, Bao Hua, Rao Changhui, Gao Guoqing, Zhou Luchun\",\"doi\":\"10.12086/OEE.2020.200111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the shortcoming of low serial operational efficiency in the quality-map-guided phase-unwrapping algorithm proposed by Miguel, an improved algorithm for parallel merging of multiple low-reliability blocks is pro-posed. Under the condition that the original algorithm design idea is satisfied, the unwrapping path is redefined as the largest reliable edge of the block. In addition, based on the non-continuous characteristic of the unwrapping path of the original algorithm, a low-reliability block out-of-order merging strategy is proposed to make multiple merging tasks can be performed simultaneously. The improved algorithm uses a multi-threaded software architecture. The main thread is responsible for looping through the unprocessed blocks to check whether they meet the requirements of merging, and the child threads receive and perform the merge tasks. The experimental results show that the improved method is completely consistent with the processing results of the original algorithm, and the parallel improvement strategy can effectively use the computer's multi-core resources, so that the operational efficiency of the phase unwrapping algorithm is improved by more than 50%.\",\"PeriodicalId\":39552,\"journal\":{\"name\":\"光电工程\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"光电工程\",\"FirstCategoryId\":\"1087\",\"ListUrlMain\":\"https://doi.org/10.12086/OEE.2020.200111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"光电工程","FirstCategoryId":"1087","ListUrlMain":"https://doi.org/10.12086/OEE.2020.200111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

针对Miguel提出的质量映射导向相位展开算法串行运算效率低的缺点,提出了一种改进的多低可靠性块并行合并算法。在满足原算法设计思想的情况下,将解包裹路径重新定义为块的最大可靠边。此外,基于原算法展开路径的不连续特性,提出了一种低可靠性块乱序合并策略,使多个合并任务可以同时执行。改进后的算法采用多线程软件架构。主线程负责遍历未处理的块,检查它们是否满足合并的要求,子线程接收并执行合并任务。实验结果表明,改进后的方法与原算法的处理结果完全一致,并行改进策略可以有效地利用计算机的多核资源,使相位展开算法的运行效率提高50%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved fast phase unwrapping algorithm based on parallel acceleration
Aiming at the shortcoming of low serial operational efficiency in the quality-map-guided phase-unwrapping algorithm proposed by Miguel, an improved algorithm for parallel merging of multiple low-reliability blocks is pro-posed. Under the condition that the original algorithm design idea is satisfied, the unwrapping path is redefined as the largest reliable edge of the block. In addition, based on the non-continuous characteristic of the unwrapping path of the original algorithm, a low-reliability block out-of-order merging strategy is proposed to make multiple merging tasks can be performed simultaneously. The improved algorithm uses a multi-threaded software architecture. The main thread is responsible for looping through the unprocessed blocks to check whether they meet the requirements of merging, and the child threads receive and perform the merge tasks. The experimental results show that the improved method is completely consistent with the processing results of the original algorithm, and the parallel improvement strategy can effectively use the computer's multi-core resources, so that the operational efficiency of the phase unwrapping algorithm is improved by more than 50%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
光电工程
光电工程 Engineering-Electrical and Electronic Engineering
CiteScore
2.00
自引率
0.00%
发文量
6622
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信