An Image Interpolation Scheme for Repetitive Structures

Journal of the Brazilian Computer Society, 2006

This paper presents a non-iterative regularized inverse solution to the image interpolation problem. This solution is based on the segmentation of the image to be interpolated into overlapping blocks and the interpolation of each block, separately. The purpose of the overlapping blocks is to avoid edge effects. A global regularization parameter is used in interpolating each block. In this solution, a single matrix inversion process of moderate dimensions is required in the whole interpolation process. Thus, it avoids the large computational cost due to the matrices of large dimensions involved in the interpolation process. The performance of this approach is compared to the standard iterative regularized interpolation scheme and to polynomial based interpolation schemes such as the bicubic and cubic spline techniques. A comparison of the suggested approach with some algorithms implemented in the commercial ACDSee software has been performend in the paper. The obtained results reveal that the suggested solution has a better performance as compared to other algorithms from the MSE and the edges preservation points of view. Its computation time is relatively large as compared to traditional algorithms but this is acceptable when image quality is the main concern.

Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)

We consider the problem of image interpolation from an adaptive optimal recovery point of view. Many different standard interpolation approaches may be viewed through the prism of optimal recovery. In this paper we review some standard image interpolation methods and how they relate to optimal recovery as well as introduce a broader, more general and systematic approach to image interpolation using adaptive optimal recovery.

2011 18th IEEE International Conference on Image Processing, 2011

Modeling the nonstationarity of image signals is one of the challenging issues for image interpolation. In this paper, we propose a similarity probability modeling to faithfully characterize the nonstationarity of image signals, and present a novel image interpolation algorithm based on the proposed model. The missing pixels are estimated in groups by weighted block estimation. The weight of each pixel inside the block is defined as the similarity probability between itself and the centered to-be-interpolated pixel. It is demonstrated by the experimental results that the proposed method preserves the edge structures of the interpolated images better than the state-ofthe-art interpolation methods. Annoying artifacts nearby the sharp edges are also greatly reduced.

Procedings of the British Machine Vision Conference 2008, 2008

In this paper we describe a novel general purpose image interpolation method based on the combination of two different procedures. First, an adaptive algorithm is applied interpolating locally pixel values along the direction where second order image derivative is lower. Then interpolated values are modified using an iterative refinement minimizing differences in second order image derivatives, maximizing second order derivative values and smoothing isolevel curves. The first algorithm itself provides edge preserving images that are measurably better than those obtained with similarly fast methods presented in the literature. The full method provides interpolated images with a "natural" appearance that do not present the artifacts affecting linear and nonlinear methods. Objective and subjective tests on a wide series of natural images clearly show the advantages of the proposed technique over existing approaches.

The Visual Computer, 2001

Digital Signal Processing, 2005

This paper presents three computationally efficient solutions for the image interpolation problem which are developed in a general framework. This framework is based on dealing with the problem as an inverse problem. Based on the observation model, our objective is to obtain a high resolution image which is as close as possible to the original high resolution image subject to certain constraints. In the first solution, a linear minimum mean square error (LMMSE) approach is suggested. The necessary assumptions required to reduce the computational complexity of the LMMSE solution are presented. The sensitivity of the LMMSE solution to these assumptions is studied. In the second solution, the concept of entropy maximization of the required high resolution image a priori is used. The implementation of the suggested maximum entropy solution as a single sparse matrix inversion is presented. Finally, the well-known regularization technique used in iterative nature in image interpolation and image restoration is revisited. An efficient sectioned implementation of regularized image interpolation, which avoids the large number of iterations required in the interactive technique, is presented. In our suggested regularized solution, the computational time is linearly proportional to the dimensions of the image to be interpolated and a single matrix inversion of moderate dimensions is required. This property allows its implementation in interpolating images of any dimensions et al. / Digital Signal Processing 15 (2005) [137][138][139][140][141][142][143][144][145][146][147][148][149][150][151][152] which is a great problem in iterative techniques. The effect of the choice of the regularization parameter on the suggested regularized image interpolation solution is studied. The performance of all the above-mentioned solutions is compared to traditional polynomial based interpolation techniques such as cubic O-MOMS and to iterative interpolation as well. The suitability of each solution to interpolating different images is also studied.  2004 Elsevier Inc. All rights reserved.

Acoustics, Speech, and Signal …, 2001

We consider the problem of image interpolation using adaptive optimal recovery. We adaptively estimate the local quadratic signal class of our image pixels. We then use optimal recovery to estimate the missing local samples based on this quadratic signal class. This approach tends preserve edges, interpolating along edges and not across them.

IEEE Transactions on Consumer Electronics, 1998

This paper presents a regularized iterative image interpolation algorithm, which can restore high €requency details in the original high resolution image. In order to apply the regularization approach to the interpolation procedure, we first present a two-dimensional separable image degradation model for a low resolution imaging system. According to the model, we propose a regularization based spatial image sequence interpolation algorithm and apply the proposed algorithm to a spatially scalable coding.

Optoelectronic Imaging and Multimedia Technology V

Unlike traditional linear interpolation algorithms, which compute all kernel pixels locations, a novel image interpolation algorithm that uses the preliminary pixels kernel and extrapolated pixels adjustment has been proposed for interpolation operations. The proposed interpolation algorithm is mainly based on the weighting functions of the preliminary interpolation kernel and linearly extrapolated pixels adjustments. Experimentally, the proposed method demonstrated generally higher performance than state-of-art algorithms mentioned with objective evaluations as well as comparable performances with subjective evaluations. Potential applications may include the ultrasound scan conversion for displaying the sectored image.

IJARCCE, 2016

Image interpolation is the most basic requirement for many image processing task such as computer graphics, gaming, medical image processing, virtualization, camera surveillance and quality control. Image interpolation is a technique used in resizing images. To resize an image, every pixel in the new image must be mapped back to a location in the old image in order to calculate a value of new pixel. There are many algorithms available for determining new value of the pixel, most of which involve some form of interpolation among the nearest pixels in the old image. In this paper, we used Nearest-neighbor, Bilinear, Bicubic, Bicubic B-spline, Catmull-Rom, Mitchell-Netravali and Lanzcos of order three algorithms for image interpolation. Each algorithms generates varies artifact such as aliasing, blurring and moiré. This paper presents, quality and computational time consideration of images while using these interpolation algorithms.