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 ...

Super-resolution (SR) is a technique that produces a high resolution (HR) image via employing a number of low resolution (LR) images from the same scene. One of the degradations that attenuates performance of the SR is the blurriness of the input LR images. In many previous works in the SR, the blurriness of the LR images is assumed to be due to the integral effect of the image sensor of the im...

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

in this paper we introduce the root of a fuzzy number, and we present aniterative method to nd it, numerically. we present an algorithm to generatea sequence that can be converged to n-th root of a fuzzy number.

This paper presents a fuzzy clustering algorithm, called the alternative fuzzy c-numbers (AFCN) clustering algorithm, for LR-type fuzzy numbers based on an exponential-type distance function. On the basis of the gross error sensitivity and in7uence function, this exponential-type distance is claimed to be robust with respect to noise and outliers. Hence, the AFCN clustering algorithm is more ro...

We say that A ≤LR B if every B-random number is Arandom. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on γ. In other words, B is at least as good as A for this purpose. We propose a methodology for studying the LR degrees and present a number of recent results of ours, including sketches of their proofs.

Abstract. Let α, β, and γ be partitions describing the isomorphism types of the finite abelian p-groups A, B, and C. From theorems by Green and Klein it is well-known that there is a short exact sequence 0→ A→ B → C → 0 of abelian groups if and only if there is a Littlewood-Richardson sequence of type (α, β, γ). Starting from the observation that a sequence of partitions has the LR property if ...

Machine learning algorithms are commonly employed in landslide susceptibility assessments. Recently, that utilize artificial intelligence have come into prominence. This study attempts to adapt the most fundamental framework of deep and introduces fuzzy theory concepts analyze while updating network parameters with trial-and-error methods. The final analysis results will compare those logistic ...

We present new tools for fuzzy arithmetic with fuzzy numbers, based on the parametric representation of fuzzy numbers and new fuzzy operations, the generalized difference and the generalized division of fuzzy numbers. The new operations are described in terms of the parametric LR and LU representations of fuzzy numbers and the corresponding algorithms are described. An application to the soluti...