Iterative Quadratic Programming Method for Occlusion Recovery

PENG Ya-li; LIU Shi-gang; SUN Zeng-guo; HONG Ling; CAO Han

doi:10.3969/j.issn.0372-2112.2018.11.021

您当前的位置：

首页 >

文章列表页 >

Iterative Quadratic Programming Method for Occlusion Recovery

更新时间：2025-07-16

- Iterative Quadratic Programming Method for Occlusion Recovery
- Acta Electronica Sinica Vol. 46, Issue 11, Pages: 2733-2737(2018)
- 作者机构：
  
  1. 现代教学技术教育部重点实验室,陕西,西安,710062
  2. 陕西省教学信息技术工程实验室,陕西,西安,710119
  3. 陕西师范大学计算机科学学院,陕西,西安,710119
  4. 现代教学技术教育部重点实验室,陕西,西安,710062
  5. 陕西省教学信息技术工程实验室,陕西,西安,710119
  6. 陕西师范大学计算机科学学院,陕西,西安,710119
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61672333, No.61873155, No.61701290);Industrial Science and Technology Research and Development Project of Shaanxi Province (No.2016GY-081);Natural Science Basic Research Program of Shaanxi Province (No.2018JM6050);Key Science and Technology Innovation Team of Shaanxi Province (No.2014KTS-18);Supported by the Learning Science Interdisciplinary Program for Key Laboratory of Modern Teaching Technology of Ministry of Education of China;Program of Fundamental Research Funds for the Central Universities of Shaanxi Normal University (No.GK201803088, No.GK201803059)
- DOI：10.3969/j.issn.0372-2112.2018.11.021
  CLC： TP391.41P232
- Published Online：25 November 2018，
  
  Published：2018
- 稿件说明：
移动端阅览
PENG Ya-li, LIU Shi-gang, SUN Zeng-guo, et al. Iterative Quadratic Programming Method for Occlusion Recovery[J]. Acta Electronica Sinica, 2018, 46(11): 2733-2737.
DOI：

PENG Ya-li, LIU Shi-gang, SUN Zeng-guo, et al. Iterative Quadratic Programming Method for Occlusion Recovery[J]. Acta Electronica Sinica, 2018, 46(11): 2733-2737. DOI： 10.3969/j.issn.0372-2112.2018.11.021.

摘要

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

Abstract

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.

关键词

Keywords

references

Views

164

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Open-MUSIC: An Open Set Recognition Algorithm of Electromagnetic Target Based on Metric Learning and Feature Subspace Projection

Super-Resolution Frequency Estimation of the Sinusoidal Signals with Unknown Lowpass Envelopes Based on Eigenanalysis and Quadratic Programming

Timing-Driven Placement Algorithm for Very Large Integrated Circuits

High Efficiency Clustering Algorithm for Standard Cell Placement

An Augmented Neural Network for Solving Linear and Quadratic Programming Problems

Related Author

YANG Liu

LI Qiang

SHAO Huai-zong

PENG Ying-ning

LIU Shen-jian

WAN Qun

GE Feng-xiang

GU Jun

Related Institution

School of Information and Communication Engineering, University of Electronic Science and Technology of China

Dept.of Electronic Engineering,Tsinghua University

香港科技大学计算机科学系香港

清华大学计算机科学与技术系北京

香港科技大学计算机科学系

⁰