节点文献

基于质量图的相位展开方法研究

Research of Phase Unwrapping Based on Quality Map

【作者】 张晓秋

【导师】 刘树田;

【作者基本信息】 哈尔滨工业大学 , 光学, 2010, 硕士

【摘要】 相位展开是光学干涉面形测量、干涉合成孔径雷达、医学磁共振成像等研究领域数据处理的一个关键步骤,在一定程度上决定了测量结果的精确性和可靠性。多年来,人们对相位展开技术做了大量研究,但仍有许多问题值得深入地探讨和研究。本文在参照国内外相位展开方法的基础上,对相位展开方法进行了深入地研究,主要工作如下:本文首先介绍了相位展开在光学三维面形测量技术中的应用,讨论了两种主要的三维传感技术,重点介绍了傅里叶变换轮廓术的原理。阐述相位展开的原理,残差点和质量图等基本概念,及相位展开算法的数学框架。二维相位展开问题的范数优化框架根据p值的不同可以分为路径积分法和最小范数法等。介绍传统路径积分法的原理,模拟用其展开时出现的问题。Lp然后在传统路径积分法的基础上通过一个表征包裹相位质量的质量图来导引相位展开。通过识别质量图数据,从相位图中质量值最高像素点开始,按相位质量高低的顺序对相位图进行路径积分,最后展开质量值较低的不可靠区域,这样可以把不可避免的误差局限在最小范围内。论文在研究相结合的传统质量图基础上,对最大相位梯度质量图进行改进,并提出一种结合边缘检测信息的改进质量图。并针对几种典型的相位不连续问题,如噪声、阴影和剪切图,用这几种不同的质量图进行了相位展开的数值模拟,获得较为理想的相位展开结果,由此证明新提出的这几种质量图具有很强的可靠性和抗噪声能力。最后,相位展开的最小二乘算法可看作在纽曼边界条件下求解泊松方程,深入研究了不加权的的最小范数法——基于离散余弦变换求解泊松方程的相位展开方法,以及以它的结果作为初始迭代条件的加权的最小范数法——预处理共轭梯度法。利用质量图、像素掩膜等作为权重,如前面提出的新质量图及二值掩膜,它们可以有效区分残差点和非残差点,从而得到较好的相位展开结果。模拟了这两种方法针对不同包裹相位图的展开结果,可以看出基于离散余弦变换的方法速度快,对某些情况展开结果不够理想;预处理共轭梯度法由于涉及大型矩阵运算速度很慢,但是利用质量图、像素掩膜等作为权重,通过迭代可以获得较理想的结果。最后补充了Hunt关于相位展开最小范数法的矩阵理论的相关推导,作为前面理论及算法的基础。

【Abstract】 Phase unwrapping is one of the key steps of data processing in the field of the shape measurement of optical interference, interferometric synthetic aperture radar (INSAR) and medical magnetic resonance imaging, which determines the accuracy and reliability of measurement results to some extent. Over the years, people made a lot of research on phase unwrapping techniques, but the phase unwrapping problem has many issues worthy of in-depth study and discussion. Based on the literatures of phase unwrapping from home and abroad, the in-depth researches on the phase unwrapping method are carried out in this thesis. The main work of the thesis are as follows:First of all, we introduce the application of phase unwrapping in the optical shape measurement technology, discuss two main three-dimensional sensor technology, and highlight the principle of Fourier transform profilometry. Then we expound the principle of phase unwrapping, the basic concept of residues and quality map, and the mathematical framework for phase unwrapping algorithm. Two dimensional phase unwrapping problem is essentially a constrained optimization problem. Its norm optimization framework can be divided into path integral method and the minimum-norm method. We introduce the principle of path integral method, and simulate the disadvantage of the method. LpA quality map which characterizes the quality of the phase can guide phase unwrapping based on the traditional method of phase wrapping. By identifying datas of quality map , the phase path integral begins from the highest quality value, in order of the phase quality value. The unreliable regions which have low quality value are unwrapped at last so that the inevitable errors can be limited to minimum. We improve the maximum phase gradient quality map and propose a new quality map combined edge detection in the study of traditional quality map. For several typical phase discontinuities, such as noises, shadow and sheared plane, the simulations show the relatively optimal phase unwrapping results with several different quality maps. Therefore the quality maps we proposed have strong reliability and noise resistance.The least squares phase unwrapping algorithm can be seen as solving the Poisson equation with Neumann boundary conditions. The non-weighted minimum norm method is based on discrete cosine transform, and with its results as the initial conditions the weighted iterative minimum norm method is represented by Preconditioned Conjugate Gradient Method. Quality map and pixel mask can be the weight, such as previously proposed new quality map and the binary mask. They can distinguish non-residues and residues, and thus get a better phase unwrapping results. The simulations of the two methods for different wrapping phase show discrete cosine transform method is faster, but sometimes the results are not ideal, and preconditioned conjugate gradient method is slow as it involves a large number of matrix computation, but with quality map and pixel mask as the weight, can get a better result through iteration. At last the matrix theory of the minimum norm method about phase unwrapping from Hunt is derived and added as the basis of previous theory and algorithm.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络