Image magnification using interval information

In this paper, a simple and effective image-magnification algorithm based on intervals is proposed. A low-resolution image is magnified to form a high-resolution image using a block-expanding method. Our proposed method associates each pixel with an interval obtained by a weighted aggregation of the pixels in its neighborhood. From the interval and with a linear K_α operator, we obtain the magnified image. Experimental results show that our algorithm provides a magnified image with better quality (peak signal-to-noise ratio) than several existing methods.

Color image magnification with interval-valued fuzzy sets

In this work we present a simple magnification algorithm for color images. It uses Interval-Valued Fuzzy Sets in such a way that every pixel has an interval membership constructed from its original intensity and its neighbourhood's one. Based on that interval membership, a block is created for each pixel, so this is a block expansion method.

A construction method of Atanassov’s intuitionistic fuzzy sets for image processing

In this work we introduce a new construction method of Atanassov's intuitionistic fuzzy sets (A-IFSs) from fuzzy sets. We use A-IFSs in image processing. We propose a new image magnification algorithm using A-IFSs. This algorithm is characterized by its simplicity and its efficiency.

A construction method of interval-valued fuzzy sets for image processing

In this work we present a new construction method of IVFSs from Fuzzy Sets. We use these IVFSs for image processing. Concretely, in this contribution we introduce a new image magnification algorithm using IVFSs. This algorithm is based on block expansion and it is characterized by its simplicity.

Magnification factors for the GTM algorithm

The Generative Topographic Mapping (GTM) algorithm of Bishop et al. (1997) has been introduced as a principled alternative to the Self-Organizing Map (SOM). As well as avoiding a number of deficiencies in the SOM, the GTM algorithm has the key property that the smoothness properties of the model are decoupled from the reference vectors, and are described by a continuous mapping from a lower-dimensional latent space into the data space. Magnification factors, which are approximated by the difference between code-book vectors in SOMs, can therefore be evaluated for the GTM model as continuous functions of the latent variables using the techniques of differential geometry. They play an important role in data visualization by highlighting the boundaries between data clusters, and are illustrated here for both a toy data set, and a problem involving the identification of crab species from morphological data.

Magnification factors for the SOM and GTM algorithms

Magnification factors specify the extent to which the area of a small patch of the latent (or `feature') space of a topographic mapping is magnified on projection to the data space, and are of considerable interest in both neuro-biological and data analysis contexts. Previous attempts to consider magnification factors for the self-organizing map (SOM) algorithm have been hindered because the mapping is only defined at discrete points (given by the reference vectors). In this paper we consider the batch version of SOM, for which a continuous mapping can be defined, as well as the Generative Topographic Mapping (GTM) algorithm of Bishop et al. (1997) which has been introduced as a probabilistic formulation of the SOM. We show how the techniques of differential geometry can be used to determine magnification factors as continuous functions of the latent space coordinates. The results are illustrated here using a problem involving the identification of crab species from morphological data.