Fast and effective interpolation using median filter

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

Abstract

This paper proposes a fast and effective image interpolation algorithm using median filter. The interpolation algorithm is composed of two steps. First, a non-linear iterative procedure is utilized to interpolate the pixel whose direction can be easily determined by local information. Second, according to the introduced assumption that image interpolation can be regarded as a local image filtering process, the remaining pixels are interpolated by the proposed fast median filter method. Experimental results show that the proposed algorithm provides better performance than traditional techniques (e.g. bilinear interpolation, bicubic interpolation) both in subjective quality and objective quality with similar complexity. In particular, the proposed method is comparable to the well-known NEDI algorithm in visual quality, however, with much lower computational complexity. Therefore, the proposed algorithm can be exploited for real-time applications due to the merits of low computational complexity and good image quality. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhang, J., Ma, S., Zhang, Y., & Zhao, D. (2009). Fast and effective interpolation using median filter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5879 LNCS, pp. 1174–1184). https://doi.org/10.1007/978-3-642-10467-1_119

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