1 April 2001 Modified cubic convolution scaler with minimum loss of information
Jong-Ki Han, Hyung-Myung Kim
Author Affiliations +
The authors derive an adaptive version of cubic convolution interpolation for the enlargement or reduction of digital images by arbitrary scaling factors. The adaptation is performed in each subblock (typically LxL rectangular) of an image. It consists of three phases: two scaling procedures (i.e., forward and backward interpolation) and an optimization of the interpolation kernel. In the forward interpolation phase, from the sampled data with the original resolution, we generate scaled data with different (higher or lower) resolution. The backward interpolation produces new discrete data by applying another interpolation to the scaled one. The phases are based on a cubic convolution interpolation whose kernel is modified to adapt to local properties of the data. During the optimization phase, we modify the parameter values to decrease the disparity between the original data and those resulting from another interpolation on the different-resolution output of the forward interpolating phase. The overall process is repeated iteratively. We show experimental results that demonstrate the effectiveness of the proposed interpolation method. The algorithm exhibits significant improvement in the minimization of information loss when compared with the conventional interpolation algorithms.
©(2001) Society of Photo-Optical Instrumentation Engineers (SPIE)
Jong-Ki Han and Hyung-Myung Kim "Modified cubic convolution scaler with minimum loss of information," Optical Engineering 40(4), (1 April 2001). https://doi.org/10.1117/1.1355250
Published: 1 April 2001
Lens.org Logo
CITATIONS
Cited by 25 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Convolution

Image processing

Computer simulations

Data conversion

Image quality

Optical engineering

Optimization (mathematics)

RELATED CONTENT


Back to Top