The problem of classifying low resolution images is both highly challenging as low resolution images carry very limited information and incredibly important for developing robust, resolution-agnostic classification systems. In the past researchers have attempted to solve the low resolution image classification problem directly, that is, by training classifiers on a dataset of low-res images (e....

A novel semi-fragile watermarking scheme for Image tamper localization and recovery is proposed. The Logistic map is used to encrypt the feature extracted from the original image, then the generated watermark is embedded into the middle-frequency DCT coefficients of each block after being ordered in zigzag manner based on invariance properties of DCT coefficients before and after JPEG compressi...

A set of discrete ideal step edge models have been designed for small windows of pixels. These models consist of pairs of low and high resolution ideal step edge patterns. Based on the assumptions that within a small image region, the underlying edge structure and the average pixel intensity of the low and high resolution image samples should be identical, a small window of low resolution pixel...

In this paper a novel technique for Neighbor embedding single image super resolution (SR) is proposed. Given a low-resolution image, its highresolution image is reconstructed from a set of training images, which are composed of one or more lowresolution and corresponding high-resolution image pairs. In this paper we propose a new approach to a single image super-resolution through neighbor embe...

The problem of generating a superresolution (SR) image from a single low-resolution (LR) input image is addressed via granular computing clustering in the paper. Firstly, and the training images are regarded as SR image and partitioned into some SR patches, which are resized into LS patches, the training set is composed of the SR patches and the corresponding LR patches. Secondly, the granular ...

We study the linear space of C-smooth isogeometric functions defined on a multi-patch domain Ω ⊂ R. We show that the construction of these functions is closely related to the concept of geometric continuity of surfaces, which has originated in geometric design. More precisely, the C-smoothness of isogeometric functions is found to be equivalent to geometric smoothness of the same order (G-smoot...

Abstract. In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreo...

In geometric modeling of curves and surfaces, the overall shape of an individual patch is intuitively governed by the placement of control points, and a patch may be finely tuned by altering the weights of the basis functions—large weights pull the patch towards the corresponding control points. The control points also have a global meaning as the patch lies within the convex hull of the contro...

An efficient numerical scheme based on ray theory is developed for the analysis of elastic waves traveling over a fluid-loaded smooth elastic shell of arbitrary shape. The shell’s surface is first discretized into a number of small patches. The local geometry of each patch is then approximated in a parametric form using bi-cubic spline functions. A local curvilinear coordinate frame is defined ...

We show how to combine, into one unified spline complex, C2 tensorproduct bi-cubic NURBS and G2 bi-cubic rational splines. The G2 splines are capable of exactly representing basic shapes such as (pieces of) quadrics and surfaces of revolution, including tori and cyclides. The main challenge is to bridge the differing continuity. We transform the G2 splines to splines that are C2 in homogeneous ...