Efficient implementation of Itoh's algorithm in 3D shape measurement using digital fringe projection technique

M. Ashfaq, N. Minallah, K. Yahya, I. Din, A. Ali
{"title":"Efficient implementation of Itoh's algorithm in 3D shape measurement using digital fringe projection technique","authors":"M. Ashfaq, N. Minallah, K. Yahya, I. Din, A. Ali","doi":"10.1109/INNOVATIONS.2013.6544415","DOIUrl":null,"url":null,"abstract":"Phase unwrapping is one of the challenging tasks in 3D shape measurement. Phase unwrapping is the computational intensive process which involves adding or subtracting multiples of 2π. In this paper the basic implementation of Itoh's algorithm[1] is shown which involves a lot of computations and unnecessary iterations to solve the phase unwrapping problem. To reduce the number of computations and iterations we have derived another implementation for Itoh's algorithm. In this implementation computational complexity has been reduced and is directly proportional to the number of pixels traversed.","PeriodicalId":438270,"journal":{"name":"2013 9th International Conference on Innovations in Information Technology (IIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 9th International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INNOVATIONS.2013.6544415","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Phase unwrapping is one of the challenging tasks in 3D shape measurement. Phase unwrapping is the computational intensive process which involves adding or subtracting multiples of 2π. In this paper the basic implementation of Itoh's algorithm[1] is shown which involves a lot of computations and unnecessary iterations to solve the phase unwrapping problem. To reduce the number of computations and iterations we have derived another implementation for Itoh's algorithm. In this implementation computational complexity has been reduced and is directly proportional to the number of pixels traversed.
利用数字条纹投影技术高效实现Itoh算法在三维形状测量中的应用
相位展开是三维形状测量中具有挑战性的任务之一。相位展开是一个计算密集型的过程,它涉及到对2π的倍数进行加减运算。本文给出了Itoh算法[1]的基本实现,该算法涉及大量的计算和不必要的迭代来解决相位展开问题。为了减少计算和迭代的次数,我们推导了Itoh算法的另一种实现。在这种实现中,计算复杂性已经降低,并且与遍历的像素数量成正比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信