Image interpolation is a common problem in imaging applications. However, most interpolation algorithms in existence suffer visually to some extent the effects of blurred edges and jagged artifacts in the image. This paper presents an adaptive feature preserving bidirectional flow process, where an inverse diffusion is performed to enhance edges along the normal directions to the isophote lines...

Image zooming is the process of enlarging the spatial resolution of a given digital image. We present a novel technique that intelligently modifies the classical pixel replication method for zooming. Our method decomposes a given image into layer of binary images, interpolates them by magnifying the binary patterns preserving their geometric shape and finally aggregates them all to obtain the z...

Slice interpolation is a fast growing field in medical image processing. Intensity-based interpolation and object-based interpolation are two major groups of methods in the literature. In this paper an object based method for slice interpolation using a modified version of curvature registration is proposed. Due to non-linear nature of image registration the results of forward and backward regi...

Image interpolation is a common problem in imaging applications. However, most interpolation algorithms in existence suffer visually the effects of blurred edges and jagged artifacts in the image to some extent. This paper presents an adaptive feature preserving bidirectional flow process, where an inverse diffusion is performed to sharpen edges along the normal directions to the isophote lines...

We introduce some nonlinear positive and negative interpolation operators. The interpolation need to preserve positivity or negativity of a function. In addition, the interpolation must be pointwise below or above the function. Some of the operators also have the pointwise monotone property over refined meshes. It is also desirable that the interpolation have the needed approximation and stabil...

Graph transformations proved useful for many algorithmic problems. In the present paper, we study this tool with respect to the maximum stable set problem. We first review available results on this topic and then propose an approach to uniformly describe and systematically develop graph transformations that do not change the size of a maximum stable set in the graph. The approach is illustrated...

This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods generalize both Runge–Kutta (RK) and linear multistep schemes. They have high stage orders and hence are less susceptible than RK methods to order reduction from source terms or nonhomogeneous boundary conditions. A glo...

when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the Γ function or Euler’s little-known formula ∑ −1/2 ν=1 1 ν = −2 ln 2 . Many classical identities like the geometric series and the binomial theorem nicely extend to this more general setting. Sums with a fractional number of terms are closely...