A fast edge-directed interpolation algorithm

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

Abstract

Image interpolation is a method of obtaining a high resolution image from a low resolution image, which is applied to many image processing procedures. In order to make the interpolated image having smooth edges and make the interpolation processing fast, we propose a fast edge-directed interpolation algorithm in this paper. The proposed method consists of three steps, the determination of nonedge pixels and edge pixels, the bilinear interpolation for nonedge pixels, and the edge-adaptive interpolation for edge pixels. The experimental results show that it outperforms some existing interpolation algorithms in terms of image quality and processing speed. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Tian, Q., Wen, H., Zhou, C., & Chen, W. (2012). A fast edge-directed interpolation algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7665 LNCS, pp. 398–405). https://doi.org/10.1007/978-3-642-34487-9_49

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