Image interpolation via graph cut

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter introduces a novel variational method for image interpolation via graph cut. Image interpolation can be seen as a special case of image inpainting when the inpainting mask is chosen as the pixels which will be interpolated. In this paper, an energy variational function is proposed, and the optimization problem is regarded as a labeling problem via solving a minimum cut of a certain graph. Experimental results show that the algorithm can save the computer time and improve the staircase effect occurred in some classical interpolation methods. © 2012 Springer Science+Business Media B.V.

Cite

CITATION STYLE

APA

Li, B., Gong, D., & Zhang, Q. (2012). Image interpolation via graph cut. In Lecture Notes in Electrical Engineering (Vol. 113 LNEE, pp. 263–268). https://doi.org/10.1007/978-94-007-2169-2_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free