基于傅里叶变换的哈特曼波前重构算法比较  

Comparison of Hartmann wavefront reconstruction algorithm based on Fourier transform

作　　者：孙琳 巫玲[1] 陈念年[1] SUN Lin;WU Ling;CHEN Niannian(School of Computer Science and Technology,Southwest University of Science and Technology, Mianyang Siehuan 621010,China)

机构地区：[1]西南科技大学计算机科学与技术院,四川绵阳621010

出　　处：《激光杂志》2019年第1期52-57,共6页Laser Journal

基　　金：四川省教育厅科技成果转化重大培育项目(No.14zd1102);四川省科技创新苗子工程(No.2018140);西南科技大学龙山学术人才科研支持计划(No.17LZX425);西南科技大学研究生创新基金资助(No.17ycx053)

摘　　要：为了快速准确的对含有噪声和倾斜误差的斜率数据进行重建,采用理论分析、仿真模拟及实验验证相结合的方法,对哈特曼波前重构中基于傅里叶变换的三种常用重建算法——傅里叶级数展开法(FFT)、反对称偏导积分法(ASDI)、离散余弦级数展开法(DCT)的正确性和适用性作了对比研究。结果表明:FFT算法运行速度最快,DCT算法次之,ASDI算法速度最慢;其中ASDI算法效果相对较好,但该种算法会受倾斜误差影响,导致重建精度降低甚至重建失败; FFT算法抗噪性最强,但重建时要求边界符合周期性延拓条件,当不满足条件时边缘误差较大; DCT算法不适合处理小型数据集。In order to rebuild the slope data with the noise and tilt error rapidly and accurately,three common reconstruction algorithms of Fourier series expansion method( FFT),the anti-symmetric partial derivative integral method( ASDI),discrete cosine series expansion method( DCT),based on Fourier transform in Hartmann wavefront reconstruction,are compared with the method of theoretical analysis,computer simulation and experimental to validated the correctness and applicability. The results show that FFT algorithm is the fastest,followed by DCT algorithm and ASDI algorithm. Among them,the ASDI algorithm has relatively good effect,but this algorithm will be affected by the tilt error,resulting in the reduction of the reconstruction precision and even the reconstruction failure. FFT algorithm has the strongest noise resistance,but the boundary is required to meet the periodic extension condition when reconstruction is performed. DCT algorithm is not suitable for tiny size data set.

关 键 词：哈特曼波前传感器 傅里叶波前重建 噪声 倾斜误差 

分 类 号：TN247[电子电信—物理电子学]