迭代二次规划遮挡点恢复

为了有效地的恢复遮挡点，本文提出一种迭代二次规划遮挡点恢复方法，该方法首先分别利用图像矩阵的行向量和列向量在图像矩阵生成的正交补空间上的投影为0的特性，构造行和列余差函数，同时，对遮挡点分别按行为主序和列为主序进行排列，利用排列后这两者之间存在一个变换关系，将行和列余差函数统一表示为一个二次优化目标函数.该方法同时考虑了遮挡点在行和列两个方向的约束，而且将遮挡点求解转化为迭代求解一个二次规划问题.实验结果表明，本文方法具有收敛速度快，恢复精度高等优点.

Iterative Quadratic Programming Method for Occlusion Recovery

In order to effectively recover the occlusion,this paper presents an iterative quadratic programming method for occlusion recovery.Based on the characteristic that the projections of the row vector and the column vector of image matrix to the orthogonal complementary subspace spanned by image matrix are zero vectors,the row and the column residual objective functions are respectively defined.At the same time,the occlusion positions are respectively sorted according to the row and the column order,whichcan be denoted by a transformation matrix.Based on the transformation matrix,a united residual objective function which is quadratic is obtained from the row and the column ones.The method has the advantages that both the row and the column constraints are simultaneously considered and the solution of occlusion is transformed to iterative solution a quadratic programming.The experimental results show that the method has fast convergence speed and high precision.