Image Interpolation Via Regularized Local Linear Regression

  • Authors:
  • Xianming Liu;Debin Zhao;Ruiqin Xiong;Siwei Ma;Wen Gao;Huifang Sun

  • Affiliations:
  • School of Computer Science and Technology, Harbin Institute of Technology, Harbin, P.R. China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, P.R. China;National Engineering Laboratory for Video Technology, and Key Laboratory of Machine Perception (MoE), School of Electrical Engineering and Computer Science, Peking University, Beijing, China;National Engineering Laboratory for Video Technology, and Key Laboratory of Machine Perception (MoE), School of Electrical Engineering and Computer Science, Peking University, Beijing, China;National Engineering Laboratory for Video Technology, and Key Laboratory of Machine Perception (MoE), School of Electrical Engineering and Computer Science, Peking University, Beijing, China;Mitsubishi Electric Research Laboratories, Cambridge, MA, USA

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

The linear regression model is a very attractive tool to design effective image interpolation schemes. Some regression-based image interpolation algorithms have been proposed in the literature, in which the objective functions are optimized by ordinary least squares (OLS). However, it is shown that interpolation with OLS may have some undesirable properties from a robustness point of view: even small amounts of outliers can dramatically affect the estimates. To address these issues, in this paper we propose a novel image interpolation algorithm based on regularized local linear regression (RLLR). Starting with the linear regression model where we replace the OLS error norm with the moving least squares (MLS) error norm leads to a robust estimator of local image structure. To keep the solution stable and avoid overfitting, we incorporate the $\ell_2$-norm as the estimator complexity penalty. Moreover, motivated by recent progress on manifold-based semi-supervised learning, we explicitly consider the intrinsic manifold structure by making use of both measured and unmeasured data points. Specifically, our framework incorporates the geometric structure of the marginal probability distribution induced by unmeasured samples as an additional local smoothness preserving constraint. The optimal model parameters can be obtained with a closed-form solution by solving a convex optimization problem. Experimental results on benchmark test images demonstrate that the proposed method achieves very competitive performance with the state-of-the-art interpolation algorithms, especially in image edge structure preservation.