# Multicategory Image Recognition Based on Image Semantic Features and Transformer

Authors: Hewei Chen; Chen Xiang; Dong Qiu; Xuxiang Huang
Journal: Mobile Information Systems
 (2022)

---

## Abstract

In the field of computer vision research, generative adversarial networks (GAN) are used for general object recognition. In recent years, however, GAN have learned only from image data without using label information. In recent years, however, unsupervised learning, which learns GAN only from image data without using label information, where GAN are learned from image data alone without using label information, has been introduced. In this paper, we describe research on unsupervised learning of GAN since the introduction of transformer, reviewing trends in computer vision/artificial intelligence-related research since the introduction of transformer from a visual neuroscience perspective.


---

## Body

## 1. Introduction

With the widespread use of the Internet, it has become possible to use crowdsourcing to collect large amounts of image data and build a large-scale database of tagging information [1]. This database was provided as a benchmark for the ImageNet Large Scale Visual Recognition Challenge (ILSVRC) [2]. In the context of this proliferation of large-scale image data for training purposes, a new type of computer vision system has emerged whose basic architecture is based on GAN. In most conventional approaches, one designs image features that are effective for general object recognition and learns to recognise them. Transformer, on the other hand, uses classical convolutional algorithms. In contrast, transformer is a classical convolutional neural network, which is only multilayered.The architecture of GAN with hierarchical convolutional processing was originally inspired by the way information is processed in the visual cortex of the brain. GAN trained from scratch using large amounts of image data for general object recognition have been reported to show a layered representation of information homologous to the ventral visual pathways of the brain. That is, the convolutional weights of neurons in the first layer of the GAN exhibit a Gabor filter-like weight distribution consisting of various orientations and spatial frequencies, like neurons in area V1, while neurons at higher levels exhibit object class selectivity, like neurons in the inferior temporal lobe [3].Although GAN have received much attention for their similarity and homology to visual information processing and human cognitive abilities in the brain, their differences have also been pointed out. In supervised learning of GAN based on labelled information, discrimination criteria are learned based on the training data. As a result, discrimination errors (generalisation problems) can occur with untrained data, even for images in which humans do not make mistakes [4, 5].Supervised GAN are fragile because they are unable to learn a properly informative representation of natural images of natural images. If the representation is inappropriate, it is possible that images that should be easily distinguishable are represented near the boundaries because the distinctions there are too subtle. Therefore, using a larger image database, it is possible to reflect the statistical properties of natural images without relying on labelling information [6]. If GAN can obtain internal representations that reflect the statistical properties of natural images, GAN can be highly resistant to adversarial attacks. In addition to being robust to adversarial attacks, GAN can be adapted to a variety of vision tasks other than object recognition. If GAN can obtain internal representations that reflect the statistical properties of natural images without relying on labelling information, they are not only robust to adversarial attacks but also more adaptable to a variety of vision tasks other than object recognition [7].A topic related to the generalisation problem is the use of teacher-trained GAN with low discrimination accuracy on new datasets or new tasks. In addition, GAN have been reported to fail to maintain high recognition performance without directly learning such changes, even though image changes are easily processed by humans. It has also been reported that GAN do not maintain high discrimination performance without directly learning changes.


## 2. Related Work

Although the improvement of GAN objective function improves the generation effect, the improvement of generation quality alone is not enough to meet the demand of generated data in practical applications. The emergence of Conditional GAN (CGAN) [8] addresses how to generate samples with specified labels based on multilabel data. Info GAN (mutual information) [9] is a method to split the structured implicit encoding from the input noise on the generator based on CGAN, which makes the generation process with a certain degree of controllability and the generation results with a certain degree of interpretability. Pix2Pix (map pixels to pixels), i.e., pixel-to-pixel mapping [10], based on CGAN is used to solve numerous problems in the field of image translation. However, the drawback of this model is that the training of Pix2Pix requires mutually paired images, yet such data is extremely scarce [11]. Using CycleGAN requires one-to-one training one by one, which is obviously inefficient. StarGAN [12], as a further extension of CycleGAN, emanates the mapping relationship between one-to-one into a mapping between multiple domains [13].In summary, generative adversarial networks are widely used and have the potential and value for continued research.


## 3. Transformer

Transformer is an 8-layer neural network consisting of 5 convolutional and 3 fully combinatorial layers, while the later emergence of VGGNet is a 16-19 layer network. As a result, the state-of-the-art models approach human visual function in terms of object recognition performance. In this paper, we present a new brain model based on brain scores, which is a predictive performance on neural activity data. In this study, we quantitatively assessed the effectiveness of the brain model based on the brain score, which is the predictive performance of neural activity data [14]. It has been proposed to quantitatively assess the validity of brain models based on brain scores, which are predictive performance on neural activity data, rather than simply based on object recognition performance.We refer to factors that explain large changes in the external world as “meaningful” factors. And in a narrow sense, disentanglement means that “each dimension of the underlying variable z is independent or uncorrelated.”(1)Ix;z=∑x,zpx,zlogpxzpx.Unsupervised learning methods differ in the way they design the loss function or objective function for learning. Unsupervised learning methods can be classified as predictive or control methods. The generate/predictive model as shown in Figure1. On the contrary, when data x0 and x1 are input, their relationship in the output is between z0 and z1 as a loss function/objective function.Figure 1
Classification of learning methods: (a) generative/predictive methods; (b) contrastive methods.
(a)(b)


### 3.1. Programme Improvements

Another learning method known as instance learning, in which each training image is identified as a separate class, has also attracted attention. This method is implemented as a contrastive learning and achieves robust learning of the internal representations of natural images, although it has the limitation that the index of each training image and its internal representation must be stored in memory. It is implemented as a form of contrastive learning [15]. It is implemented as a contrastive learning and achieves a robust internal representation of natural images. It has also been pointed out that it has a better correspondence with brain information representations than traditional supervised GAN.


### 3.2. General Object Recognition

From 2019, contrast learning unsupervised learning models were used. Unsupervised learning models can achieve highly accurate general object recognition comparable to GAN. From 2019 onwards, unsupervised learning models using contrastive learning have been reported to achieve high accuracy in general object recognition comparable to supervised GAN [16]. As of January 2021, the best performing model is SimCLR35, and other methods have been implemented based on very similar ideas. In this paper, we will focus on the implementation of SimCLR and describe contrast learning as a representation learning method that can be effective in improving the accuracy of object recognition in general [17, 18].Contrast learning is the process of determining how an image is in the latent variable space. As a loss function/objective function, in the latent variable space. In contrast, in general object recognition tasks, an object is considered to have a very different appearance in an image, depending on the viewing conditions [19].In the general object recognition task, an object can be judged to be the same object even if it looks very different in the image due to different observation conditions. In a general object recognition task, it is required to be able to judge an object as the same object and distinguish it from different in a general object recognition task; it is required to be able to judge an object as the same object and distinguish it from different images of objects, even if they look very different in different images due to different observation conditions. It is therefore necessary in this paper that we describe how to create a positive sample from the original image using various image processing methods (different views). (1) Creating a frontal sample from the original image using various image processing (different views), samples created by image processing of different images are called negative samples. Positivesamples=similar images are close to each other, negative samples=similar images are close to each other, and dissimilar images are far from each other. The procedure for mapping the internal representation space is shown in Figure 2.Figure 2
SimCLR framework.


### 3.3. Data Enhancement

For image processing, we use data enhancement methods (cropping, rotation, scaling, Gaussian noise, colour distortion, etc.), and these methods are also used for supervised learning of GAN. A suitable GAN, such as ResNet50, is prepared as a coding model/encoder, and its output is used as the latent variableZ. We use the information noise contrast loss shown in equation (2). The latent variable representation for each image sample is shown in equation (2). The latent variable representation for each image sample is normalized to a criterion and distributed over a multidimensional hypersphere, where the exponent of the distance between positive samples is the exponent of the distance between positive samples in the numerator and negative samples in the numerator.
(2)LN=Ex∈X−logexpsimzi,zj/τ∑k=12N1i!=kexpsimzi,zk/τ.As shown in the schematic diagram in Figure3, similar images are located near each other, while dissimilar images are located far away from each other. Similar images are mapped to the nearest neighbourhood, and dissimilar images are mapped to the furthest neighbourhood. The loss function is designed in such a way that, by this way, the data is augmented, and it is invariant to the predetermined disturbances of the data augmentation.Figure 3
Schematic representation of contrasting losses.The implementation in SimCLR has the advantage of learning object recognition performance efficiently, but it is not as powerful as a purely computational model implementation of the brain, as it requires an implementation in SimCLR that is difficult to implement as a purely computational model of the brain.It turns out that the loss function is best learned by maximising mutual information. As equation (3) shows, the size N of the image samples also needs to be increased for better representation learning, and how to retain a large number of negative samples is a problem for computational models of the brain. It seems to be a challenge for computational models of the brain to retain a large number of negative samples.N is the number of training samples or the batch size during training. τ is a temperature constant. Function 1i!=k is a function that is 0 when i=k. Function 1i!=k is a function that is 0 when i=k and 1 otherwise.
(3)Ix;z≥logN−LN.


### 3.4. Short Textbook Categories

In the field of natural language processing, unsupervised learning models based on the transformer architecture, such as BERT and GPT-n, dominate the research. The input data is a sequence of words used as markers (Figure4). By repeating this process for many layers, we can learn the next sentence based only on cooccurrence relations based on the word order in the sequence. The method is based on unsupervised learning, predicting the next occurrence of a sentence or sentence filler based only on cooccurrence relationships based on the word order in the sequence (see research papers related to natural language processing for details). By scaling up the amount of data used for learning and the size of the network parameters, the method can achieve significant improvements in accuracy and even high performance with only a few samples for tasks where there is no direct training (Few-Shot Learning). It also shows a very high degree of generalisability. The structure of the transformer can also be applied to image processing by transforming images into one-dimensional arrays. In fact, there are many reports on the use of transformers in image processing. For example, if we simply divide an image into patches and assign them directly to the transformer, we can achieve the performance of a traditional supervised learning GAN when trained on a very large database of labelled images [20].Figure 4
Transformer-based natural language processing framework.Images are arranged in one dimension at the pixel level, and unsupervised prediction of the next pixel or missing pixel is learned unsupervised. It has been reported that unsupervised learning of the prediction of the next pixel or missing pixel can lead to an internal representation suitable for image recognition.The unsupervised learning-based image generation frameworks GAN and VAE are two widely used image generation frameworks based on unsupervised learning.In VAE, the basic components are the encoder, which is responsible for the representation transformation from the image datax to the latent variable z, and the decoder, which is responsible for the recovery from the latent variable z to the original image data x′. In VAE, the latent variable z (also known as the bottleneck due to its hourglass structure) is constrained to a normal distribution, and the encoder and decoder are trained to minimise the restoration error between the training/raw image x and the generated/restored image x′. To obtain a generative model distribution pθx that approximates the true data distribution pdatax and to approximate the true data distribution pdatax, the Kullback-Leibler (KL) distance between the two distributions can be calculated. It can be seen from equation (4) that the parameter that maximises the expected value of the log-likelihood function of the model is the parameter that finds the expected value that maximises the model. The first term is a constant term determined by the data sample.
(4)DKLpdataxpθx=Epdataxlogpdataxpθx=Epdataxlogpdatax−Epdataxlogpθx.The objective function of VAE is to maximise the ELBO (Evidence Lower Bound) of the log-likelihood function of the log-likelihood function. The objective function of VAE is to maximise the ELBO (Evidence Lower Bound) of the log-likelihood function. VAE is represented by a reconstruction-related error term, also known as the negative reconstruction error, and a regularisation term. It is represented by a KL distance term, which is a regularisation term and a reconstruction-related error term, also known as the negative reconstruction error (equation (5)).
(5)Lβ=maxφ,θ1N∑n=1NEqqzxnlogpθxnz−βDKLqφzxnpzz.Many studies on the use of VAE to unwind internal representations have theoretical support. One of the most widely used isβ VAE49, which improves the untangling of representations by adjusting the penalty of the KL distance term in the VAE objective function (equation (6)), β>1. By adjusting the penalty of the KL distance term in the VAE objective function (equation (6)), β>1 (in normal VAE, β=1). In this study, we compared the internal representation of the β-VAE with the neural representation of the monkey visual cortex. Since the first term is an error term related to image reconstruction, the penalty for β is somewhat larger. However, the first term is the error term associated with image reconstruction. (β-TCVAE51) further decomposes the KL distance term into the equation; (β-TCVAE51) further decomposes the KL distance term into the equation; (β-TCVAE51) further decomposes the KL distance term into the equation and imposes a penalty only on the total correlation term (β>1) to avoid correlation between the dimensions of the potential variable z. The quality of the generated images and the separation of representatives was improved [21].
(6)Lβ−TC=maxφ,θEqqznpnlogpθnz−Iqφz;n−βDKLqφz∏jqφzj−∑iDKLqφzjpzzj.


## 3.1. Programme Improvements

Another learning method known as instance learning, in which each training image is identified as a separate class, has also attracted attention. This method is implemented as a contrastive learning and achieves robust learning of the internal representations of natural images, although it has the limitation that the index of each training image and its internal representation must be stored in memory. It is implemented as a form of contrastive learning [15]. It is implemented as a contrastive learning and achieves a robust internal representation of natural images. It has also been pointed out that it has a better correspondence with brain information representations than traditional supervised GAN.


## 3.2. General Object Recognition

From 2019, contrast learning unsupervised learning models were used. Unsupervised learning models can achieve highly accurate general object recognition comparable to GAN. From 2019 onwards, unsupervised learning models using contrastive learning have been reported to achieve high accuracy in general object recognition comparable to supervised GAN [16]. As of January 2021, the best performing model is SimCLR35, and other methods have been implemented based on very similar ideas. In this paper, we will focus on the implementation of SimCLR and describe contrast learning as a representation learning method that can be effective in improving the accuracy of object recognition in general [17, 18].Contrast learning is the process of determining how an image is in the latent variable space. As a loss function/objective function, in the latent variable space. In contrast, in general object recognition tasks, an object is considered to have a very different appearance in an image, depending on the viewing conditions [19].In the general object recognition task, an object can be judged to be the same object even if it looks very different in the image due to different observation conditions. In a general object recognition task, it is required to be able to judge an object as the same object and distinguish it from different in a general object recognition task; it is required to be able to judge an object as the same object and distinguish it from different images of objects, even if they look very different in different images due to different observation conditions. It is therefore necessary in this paper that we describe how to create a positive sample from the original image using various image processing methods (different views). (1) Creating a frontal sample from the original image using various image processing (different views), samples created by image processing of different images are called negative samples. Positivesamples=similar images are close to each other, negative samples=similar images are close to each other, and dissimilar images are far from each other. The procedure for mapping the internal representation space is shown in Figure 2.Figure 2
SimCLR framework.


## 3.3. Data Enhancement

For image processing, we use data enhancement methods (cropping, rotation, scaling, Gaussian noise, colour distortion, etc.), and these methods are also used for supervised learning of GAN. A suitable GAN, such as ResNet50, is prepared as a coding model/encoder, and its output is used as the latent variableZ. We use the information noise contrast loss shown in equation (2). The latent variable representation for each image sample is shown in equation (2). The latent variable representation for each image sample is normalized to a criterion and distributed over a multidimensional hypersphere, where the exponent of the distance between positive samples is the exponent of the distance between positive samples in the numerator and negative samples in the numerator.
(2)LN=Ex∈X−logexpsimzi,zj/τ∑k=12N1i!=kexpsimzi,zk/τ.As shown in the schematic diagram in Figure3, similar images are located near each other, while dissimilar images are located far away from each other. Similar images are mapped to the nearest neighbourhood, and dissimilar images are mapped to the furthest neighbourhood. The loss function is designed in such a way that, by this way, the data is augmented, and it is invariant to the predetermined disturbances of the data augmentation.Figure 3
Schematic representation of contrasting losses.The implementation in SimCLR has the advantage of learning object recognition performance efficiently, but it is not as powerful as a purely computational model implementation of the brain, as it requires an implementation in SimCLR that is difficult to implement as a purely computational model of the brain.It turns out that the loss function is best learned by maximising mutual information. As equation (3) shows, the size N of the image samples also needs to be increased for better representation learning, and how to retain a large number of negative samples is a problem for computational models of the brain. It seems to be a challenge for computational models of the brain to retain a large number of negative samples.N is the number of training samples or the batch size during training. τ is a temperature constant. Function 1i!=k is a function that is 0 when i=k. Function 1i!=k is a function that is 0 when i=k and 1 otherwise.
(3)Ix;z≥logN−LN.


## 3.4. Short Textbook Categories

In the field of natural language processing, unsupervised learning models based on the transformer architecture, such as BERT and GPT-n, dominate the research. The input data is a sequence of words used as markers (Figure4). By repeating this process for many layers, we can learn the next sentence based only on cooccurrence relations based on the word order in the sequence. The method is based on unsupervised learning, predicting the next occurrence of a sentence or sentence filler based only on cooccurrence relationships based on the word order in the sequence (see research papers related to natural language processing for details). By scaling up the amount of data used for learning and the size of the network parameters, the method can achieve significant improvements in accuracy and even high performance with only a few samples for tasks where there is no direct training (Few-Shot Learning). It also shows a very high degree of generalisability. The structure of the transformer can also be applied to image processing by transforming images into one-dimensional arrays. In fact, there are many reports on the use of transformers in image processing. For example, if we simply divide an image into patches and assign them directly to the transformer, we can achieve the performance of a traditional supervised learning GAN when trained on a very large database of labelled images [20].Figure 4
Transformer-based natural language processing framework.Images are arranged in one dimension at the pixel level, and unsupervised prediction of the next pixel or missing pixel is learned unsupervised. It has been reported that unsupervised learning of the prediction of the next pixel or missing pixel can lead to an internal representation suitable for image recognition.The unsupervised learning-based image generation frameworks GAN and VAE are two widely used image generation frameworks based on unsupervised learning.In VAE, the basic components are the encoder, which is responsible for the representation transformation from the image datax to the latent variable z, and the decoder, which is responsible for the recovery from the latent variable z to the original image data x′. In VAE, the latent variable z (also known as the bottleneck due to its hourglass structure) is constrained to a normal distribution, and the encoder and decoder are trained to minimise the restoration error between the training/raw image x and the generated/restored image x′. To obtain a generative model distribution pθx that approximates the true data distribution pdatax and to approximate the true data distribution pdatax, the Kullback-Leibler (KL) distance between the two distributions can be calculated. It can be seen from equation (4) that the parameter that maximises the expected value of the log-likelihood function of the model is the parameter that finds the expected value that maximises the model. The first term is a constant term determined by the data sample.
(4)DKLpdataxpθx=Epdataxlogpdataxpθx=Epdataxlogpdatax−Epdataxlogpθx.The objective function of VAE is to maximise the ELBO (Evidence Lower Bound) of the log-likelihood function of the log-likelihood function. The objective function of VAE is to maximise the ELBO (Evidence Lower Bound) of the log-likelihood function. VAE is represented by a reconstruction-related error term, also known as the negative reconstruction error, and a regularisation term. It is represented by a KL distance term, which is a regularisation term and a reconstruction-related error term, also known as the negative reconstruction error (equation (5)).
(5)Lβ=maxφ,θ1N∑n=1NEqqzxnlogpθxnz−βDKLqφzxnpzz.Many studies on the use of VAE to unwind internal representations have theoretical support. One of the most widely used isβ VAE49, which improves the untangling of representations by adjusting the penalty of the KL distance term in the VAE objective function (equation (6)), β>1. By adjusting the penalty of the KL distance term in the VAE objective function (equation (6)), β>1 (in normal VAE, β=1). In this study, we compared the internal representation of the β-VAE with the neural representation of the monkey visual cortex. Since the first term is an error term related to image reconstruction, the penalty for β is somewhat larger. However, the first term is the error term associated with image reconstruction. (β-TCVAE51) further decomposes the KL distance term into the equation; (β-TCVAE51) further decomposes the KL distance term into the equation; (β-TCVAE51) further decomposes the KL distance term into the equation and imposes a penalty only on the total correlation term (β>1) to avoid correlation between the dimensions of the potential variable z. The quality of the generated images and the separation of representatives was improved [21].
(6)Lβ−TC=maxφ,θEqqznpnlogpθnz−Iqφz;n−βDKLqφz∏jqφzj−∑iDKLqφzjpzzj.


## 4. Experimental Analysis

The dataset in this paper is MNIST, and the experimental results are shown in Figures5–8. In recent years, it has been reported that it is not necessary to set up direct data augmentation based on unsupervised learning models as a brain learning model. However, as a brain-based learning model, it seems necessary to devise a method to handle negative samples without directly setting up data augmentation. After learning the decomposed latent variable representations, it is necessary to learn the invariant representations of each factor. It would be interesting to propose a mechanism to learn the invariant representation of each factor, after learning the decomposed latent variable representation.Figure 5
Trend ofd loss real on MNIST.Figure 6
Trend ofd loss fake on MNIST.Figure 7
Trend ofd loss on MNIST.Figure 8
Trend ofg loss on MNIST.From Figures7 and 8, it can be seen that the generator and discriminator are smooth at the beginning of training, but as the number of training increases, the model becomes more stable, and the two network structures fight against each other, showing a large oscillation in the figure. The data is efficient, generalisable, and robust. The reasons for this are high data efficiency, extended generalisability, and improved robustness. This is due to its high data efficiency, extended generalisability, and improved robustness. Labelling required for supervised learning the collection of information requires manual labelling. This is an expensive process, and it does not scale with the size of the database.Figure9 shows the change of the generated samples for the first 64 samples of the dataset as the number of epochs increases.Figure 9
MNIST generated sample.In order to verify the advantages of GAN algorithm for image classification, a separate CNN model is trained as a comparison, which is structurally identical to the GAN discriminator in this paper, and the data is normalized before training. Figure10 shows the comparison of the loss function of the two models with the number of iterations. The cues used by GAN for object recognition also differ from those used by humans. For example, when a method known as image style transfer is used to transform only the texture of an image into another image texture while retaining the shape information contained in the image, most GAN models tend to recognise objects based on the transformed texture.Figure 10
Trend ofc loss on MNIST.


## 5. Conclusions

In this paper, we propose disentanglement in representational learning that is often discussed qualitatively without a clear definition because it is difficult to define truly “meaningful” elements or factors. This is because it is difficult to define elements and factors that are truly “meaningful”. In a broader sense, disentanglement is the presence of separate representations of “meaningful” factors in the space of potential variables. We conclude that, in a narrow sense, it refers to the separate representation of “meaningful” factors for each dimension of the latent variable (i.e., for each axis in the latent variable space).



---

*Source: 4508507-2022-05-09.xml*