Study on a rotary self-check phase unwrapping algorithm
文献类型:会议论文
作者 | Guo-Tian, He1,2![]() |
出版日期 | 2013 |
会议日期 | September 21, 2012 - September 23, 2012 |
会议地点 | Chongqing, China |
DOI | 10.4028/www.scientific.net/AMM.246-247.204 |
页码 | 204-207 |
通讯作者 | Guo-Tian, H. |
英文摘要 | This article presented a rotary self-check phase unwrapping algorithm. The algorithm was mainly to process phase unwrapping for the phase main value got from Interferometer in accurately measuring object surface topography, and then accurately restored the object surface topography. The object surface topography measured by Interferometer generally tended to be smooth, the phase unwrapping was not difficult without noise interference. The algorithm processed phase unwrapping by the path of gradually rotational diffusion from the middle to the around in the wrapped phase map, at the same time the check for the error was carried out. It used the median filter technology to process the phase unwrapping error, and avoided the transmission of phase unwrapping error, had a greater inhibitory effect on the noises. This method did not identify the residuals, had small amount of operations, and Unwrapping velocity was several times faster than the fastest traditional branch blocking algorithm. © (2013) Trans Tech Publications, Switzerland. |
会议录 | 2nd International Conference on Computer-Aided Design, Manufacturing, Modeling and Simulation, CDMMS 2012
![]() |
语种 | 英语 |
电子版国际标准刊号 | 16627482 |
ISSN号 | 16609336 |
源URL | [http://119.78.100.138/handle/2HOD01W0/4805] ![]() |
专题 | 机器人与3D打印技术创新中心 |
作者单位 | 1.Chongqing Institute of Green and Intelligent Technology,Chinese Academy of Sciences, College of Computer and Information Science, Chongqing Normal University, China; 2.Chongqing Normal University Hospital, China |
推荐引用方式 GB/T 7714 | Guo-Tian, He,Ying-Chun, Ran,Li, Song,et al. Study on a rotary self-check phase unwrapping algorithm[C]. 见:. Chongqing, China. September 21, 2012 - September 23, 2012. |
入库方式: OAI收割
来源:重庆绿色智能技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。