<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">53938</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2024.053938</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Multi-Label Image Classification Based on Object Detection and Dynamic Graph Convolutional Networks</article-title>
<alt-title alt-title-type="left-running-head">Multi-Label Image Classification Based on Object Detection and Dynamic Graph Convolutional Networks</alt-title>
<alt-title alt-title-type="right-running-head">Multi-Label Image Classification Based on Object Detection and Dynamic Graph Convolutional Networks</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Liu</surname><given-names>Xiaoyu</given-names></name></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Hu</surname><given-names>Yong</given-names></name><email>huyong@scu.edn.cn</email></contrib>
<aff><institution>School of Cyber Science and Engineering, Sichuan University</institution>, <addr-line>Chengdu, 610207</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Yong Hu. Email: <email>huyong@scu.edn.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2024</year></pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>12</day>
<month>9</month>
<year>2024</year></pub-date>
<volume>80</volume>
<issue>3</issue>
<fpage>4413</fpage>
<lpage>4432</lpage>
<history>
<date date-type="received">
<day>14</day>
<month>5</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>01</day>
<month>8</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 The Authors.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_53938.pdf"></self-uri>
<abstract>
<p>Multi-label image classification is recognized as an important task within the field of computer vision, a discipline that has experienced a significant escalation in research endeavors in recent years. The widespread adoption of convolutional neural networks (CNNs) has catalyzed the remarkable success of architectures such as ResNet-101 within the domain of image classification. However, in multi-label image classification tasks, it is crucial to consider the correlation between labels. In order to improve the accuracy and performance of multi-label classification and fully combine visual and semantic features, many existing studies use graph convolutional networks (GCN) for modeling. Object detection and multi-label image classification exhibit a degree of conceptual overlap; however, the integration of these two tasks within a unified framework has been relatively underexplored in the existing literature. In this paper, we come up with Object-GCN framework, a model combining object detection network YOLOv5 and graph convolutional network, and we carry out a thorough experimental analysis using a range of well-established public datasets. The designed framework Object-GCN achieves significantly better performance than existing studies in public datasets COCO2014, VOC2007, VOC2012. The final results achieved are 86.9%, 96.7%, and 96.3% mean Average Precision (mAP) across the three datasets.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Deep learning</kwd>
<kwd>multi-label image recognition</kwd>
<kwd>object detection</kwd>
<kwd>graph convolution networks</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>With the continuous and vigorous evolution of deep learning networks, the accuracy of single-label image classification has been significantly improved. However, in reality, the great mass of images often includes multiple objects, and the richness of semantic information and the coexistence of higher-order labels make the classification of multi-label images more necessary [<xref ref-type="bibr" rid="ref-1">1</xref>]. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates some images with multiple categories.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Images with multiple labels</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-1.tif"/>
</fig>
<p>Understanding the interdependencies among labels is crucial in the context of multi-label classification. Recognizing the relationships between labels can significantly enhance the predictive accuracy of classification models. Certain labels exhibit semantic relatedness, as exemplified by the likelihood that an image labeled with both &#x201C;beach&#x201D; and &#x201C;summer&#x201D; would depict a summer beach scene. Incorporating this semantic association can aid models in discerning the underlying relationships within images. Conversely, there are instances of mutual exclusivity between labels, such as the impossibility of an image being simultaneously labeled as &#x201C;cow&#x201D; and &#x201C;horse&#x201D;. Accounting for such exclusivity can prevent the model from generating erroneous classifications. Collectively, these aspects of label correlation can profoundly impact the classification accuracy of the employed framework.</p>
<p>Multi-label image recognition is a fundamental work in the sphere of computer vision, which can help humans have a more comprehensive understanding of the content of images, and plays a crucial role in many applications such as human attribute recognition [<xref ref-type="bibr" rid="ref-2">2</xref>], medical image recognition [<xref ref-type="bibr" rid="ref-3">3</xref>], and recommendation systems [<xref ref-type="bibr" rid="ref-4">4</xref>]. In contrast to single-label image classification, which assigns a single class to each image, multi-label image classification requires the assignment of multiple labels to a single image. This approach necessitates a comprehensive consideration of the interrelationships among labels to refine the accuracy of the classification process.</p>
<p>The original framework transformed the multi-label classification issue into a binary classification problem. Reference [<xref ref-type="bibr" rid="ref-5">5</xref>] approaches binary classification by training individual classifiers for each label, allowing for predictions to be made for every label separately. However, this strategy ignores dependencies between individual labels, since then, many studies have proposed a series of improvements to the dependence between labels. The studies cited in References [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-7">7</xref>] conceptualize the label prediction challenge as a pairwise prediction issue, whereas the works presented in References [<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-9">9</xref>] propose an embedding of label vectors into a latent space to explore and learn the inherent correlations among them. With the development of recurrent neural networks, RNN (Recurrent Neural Network) is also widely used to learn correlations between labels. As a result, an array of RNN-based models has been introduced to the field, each designed to enhance the classification process by leveraging these learned correlations. Reference [<xref ref-type="bibr" rid="ref-10">10</xref>] proposes a CNN-RNN framework to learn the image-label joint embedding vector, so as to learn the dependency of semantic labels and the correlation of multiple labels in an image. Building upon the foundational work presented in Reference [<xref ref-type="bibr" rid="ref-10">10</xref>], the study in Reference [<xref ref-type="bibr" rid="ref-11">11</xref>] has enhanced the model by integrating a dynamic attention mechanism. This innovation is designed to direct the model&#x2019;s focus towards salient regions within the image. However, the methods used in these papers do not adequately incorporate spatial and contextual information of objects.</p>
<p>Graph Convolutional Network (GCN) has a powerful ability to model the nodes of a graph [<xref ref-type="bibr" rid="ref-12">12</xref>], so it has been diffusely used in the sphere of multi-label image recognition since it was proposed. In the multi-label image recognition process based on GCN, formally, we represent the topological graph as <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>G</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>,</mml:mo><mml:mi>E</mml:mi><mml:mo>,</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mi>v</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mi>c</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> represents all label nodes, <italic>E</italic> represents the edges of label nodes, and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>A</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> represents the adjacency matrix of the constructed graph. To mine the global dependencies between labels, we need to construct a topological graph adjacency matrix <italic>A</italic> between label nodes.</p>
<p>Assume that there are two labels <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>l</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula>. <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>l</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> represents the probability of the label <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>l</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula> appearing when the label <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:math></inline-formula> appears. And <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>l</mml:mi><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> represents the probability of the label <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:math></inline-formula> appearing when the label <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>l</mml:mi><mml:mi>j</mml:mi></mml:math></inline-formula> appears. In <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the probability of a horse co-occurring when a person is present is much higher than the probability of a horse co-occurring when a person is present.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Description of label co-occurrence probability</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-2.tif"/>
</fig>
<p>In recent years, the field of multi-label image classification has witnessed a proliferation of research utilizing Graph Convolutional Network (GCN). Reference [<xref ref-type="bibr" rid="ref-13">13</xref>] introduces an innovative multi-label classification framework grounded in a Graph Convolutional Network (GCN), adept at discerning and modeling the nuanced relationships and interdependencies among label sets. In nearly the same time period, in response to the issue that current methods are unable to accurately pinpoint semantic regions, Reference [<xref ref-type="bibr" rid="ref-14">14</xref>] has proposed the SSGRL framework. Chen et al. make an improvement in the research [<xref ref-type="bibr" rid="ref-13">13</xref>] by introducing a new dynamic graph for multi-label recognition [<xref ref-type="bibr" rid="ref-15">15</xref>]. Reference [<xref ref-type="bibr" rid="ref-16">16</xref>] designs a novel deep learning framework that introduces a graph matching (GM) learning mechanism to explicitly mine the relationship between instances and labels.</p>
<p>Object detection networks are capable of identifying and localizing a diverse array of objects within an image, delineating their respective positions and dimensions. Despite occasional omissions due to factors such as inadequate lighting or the diminutive size of targets, these networks offer valuable contributions as auxiliary tasks in multi-label classification endeavors, thereby enhancing the overall performance of the classification system. Nonetheless, the integration of object detection with multi-label classification remains an underexplored area within the literature, with scant studies having addressed this combination to date.</p>
<p>Building upon the aforementioned considerations, we have developed an Object-GCN framework that integrates a dynamic graph convolutional network with an object detection network. Furthermore, we have incorporated word vector embeddings within the dynamic GCN to enhance the establishment of associations between visual features and semantic information.</p>
<p>In the present study, the key contributions we have made can be encapsulated in the following points:
<list list-type="bullet">
<list-item>
<p>We firstly combine object detection network YOLOv5 and graph convolutional networks (GCN) for multi-label image classification tasks;</p></list-item>
<list-item>
<p>We introduce a dynamic graph convolutional network (GCN) into the model and fuse the features of both image and text modalities when constructing graph nodes;</p></list-item>
<list-item>
<p>We conduct a large number of comparative experiments on the datasets COCO and VOC, and obtain 86.9%, 96.7%, and 96.3% mAPs, respectively. These results are superior to the best model. We also performed ablation experiments to prove that both the object detection network we added and the proposed scheme for constructing graph nodes are effective.</p></list-item>
</list></p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>Nowadays, with the improvement of deep learning, CNN has been frequently used in image feature extraction, and it has shown good performance in public datasets for instance MSCOCO [<xref ref-type="bibr" rid="ref-17">17</xref>], VOC [<xref ref-type="bibr" rid="ref-18">18</xref>] and ImageNet [<xref ref-type="bibr" rid="ref-19">19</xref>]. Consequently, an extensive body of literature has introduced numerous frameworks predicated on Convolutional Neural Networks (CNNs) to tackle the multi-label image recognition challenge. Initially, within the research domain, the multi-label classification task has commonly been decomposed into multiple binary classification sub-tasks, where the model prognosticates one label per iteration [<xref ref-type="bibr" rid="ref-5">5</xref>]. Nonetheless, this methodological approach often overlooks the inter-label dependencies, a critical factor that necessitates consideration in the multi-label classification problem. In the context of zero-shot learning, Reference [<xref ref-type="bibr" rid="ref-6">6</xref>] presented a methodology for the simultaneous prediction of multiple image labels. Ji et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] have introduced a versatile framework that encompasses two pivotal components: Visual Semantic Embedding and Zero-Shot Multilabel Prediction. This framework aims to gain a deep understanding of image content through the Visual Semantic Embedding module and to perform multilabel classification without direct samples using a zero-shot learning strategy, thereby enhancing the model&#x2019;s generalization ability and predictive accuracy. Reference [<xref ref-type="bibr" rid="ref-7">7</xref>] identified that the hinge loss function, commonly utilized in prior models, exhibits non-smooth characteristics, posing challenges for optimization. Consequently, Li et al. [<xref ref-type="bibr" rid="ref-7">7</xref>] have devised a novel pairwise ranking classification loss function, which is endowed with smoothness across its entire domain. The aforementioned methodologies transform the multi-label classification problem into a series of pairwise classification predictions.</p>
<p>Deep learning models have become prevalent for their efficacy in identifying and delineating interconnections among disparate labels. Given the proficient performance of Recurrent Neural Networks (RNNs) in textual data processing, numerous scholarly investigations have incorporated RNNs to characterize the interdependencies inherent within label sets. Wang et al. have developed a CNN-RNN hybrid framework [<xref ref-type="bibr" rid="ref-10">10</xref>], which integrates the complementary strengths of Convolutional Neural Networks (CNNs) and Recurrent Neural Networks (RNNs). Specifically, the RNN component within this framework is strategically employed to discern and model the inter-label relationships. Subsequently, Reference [<xref ref-type="bibr" rid="ref-11">11</xref>] enhanced this CNN-RNN framework by incorporating a dynamic attention mechanism. This innovation enables the network to selectively focus on interest regions within the image, thereby improving the overall classification performance. Yazici et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] have introduced methods for dynamically arranging the ground truth labels in accordance with the sequence of predicted labels, which speeds up and optimizes the LSTM training. Wang et al. have devised a two-component framework that employs a spatial converter layer to identify key attention areas within convolutional feature maps. Subsequently, an LSTM subnetwork is integrated to comprehend the overarching interdependencies among these regions [<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
<p>With the popularity of graph convolutional networks, a substantial body of research has emerged that harnesses these networks to elucidate the relationships among categorical labels. Chen et al. pioneered a graph convolutional network modeled by graph nodes to predict multiple labels in an image [<xref ref-type="bibr" rid="ref-13">13</xref>]. They use the word vectors of each category word as the vertices of the graph in the graph convolutional network, and finally achieve better experimental results than other methods [<xref ref-type="bibr" rid="ref-13">13</xref>]. To thoroughly investigate the interactions within semantic regions, Chen et al. have introduced a novel framework for Signed Semantic Graph Reasoning Learning (SSGRL) that leverages graph theory [<xref ref-type="bibr" rid="ref-14">14</xref>]. This framework is composed of two integral modules: a semantic decoupling module designed to isolate individual semantic components, and a semantic interaction module that facilitates the analysis of interplays among these components. The ADD-GCN framework [<xref ref-type="bibr" rid="ref-15">15</xref>] introduces a significant enhancement over the ML-GCN model [<xref ref-type="bibr" rid="ref-13">13</xref>] by employing a dynamic Graph Convolutional Network (GCN) to supersede the traditional static graph convolutional approach. Wu et al. introduced a graph matching (GM) scheme to better establish the relationship between instances and labels [<xref ref-type="bibr" rid="ref-16">16</xref>]. In an effort to advance the ADD-GCN [<xref ref-type="bibr" rid="ref-15">15</xref>] framework, Cao et al. have introduced the 2S-DGCN model, presenting a novel iteration that builds upon the foundational strengths of its predecessor [<xref ref-type="bibr" rid="ref-22">22</xref>]. Zheng et al. have innovatively put forward the CGML framework, which leverages a Labels Adaptive Graph Convolutional Network (LAGCN) to effectively model the interdependencies between labels [<xref ref-type="bibr" rid="ref-23">23</xref>]. In order to explore the relationship between different images, Zhou et al. proposed a dual relational graph network framework, which uses a dual-branch structure to mine semantic information from both intra-image and inter-image simultaneously [<xref ref-type="bibr" rid="ref-24">24</xref>]. It is pointed out in Reference [<xref ref-type="bibr" rid="ref-25">25</xref>] that the collaborative relationship between labels in multi-label classification is closely related to the scene of an image. This paper introduce a novel graph learning framework designed to comprehensively discern the co-occurrence relationships among labels within varied imaging contexts.</p>
<p>Recently, transformer is also latterly used in multi-label image recognition. Lanchantin et al. have introduced acomprehensive framework grounded in the Transformer architecture to delineate the connections between visual features and their corresponding labels [<xref ref-type="bibr" rid="ref-26">26</xref>]. Furthermore, many studies have combined CNN and graph convolutional networks with transformers to study multi-label image classification. Zhao et al. combine graph and Transformer to propose a dual relations learning framework [<xref ref-type="bibr" rid="ref-27">27</xref>]. Zhao et al. deeply combine CNN and Transformer, and propose M3TR framework, a transformer model capable of learning intermodal relations and intra-modal triadic relations [<xref ref-type="bibr" rid="ref-28">28</xref>]. In recent years, there has been a significant trend in the literature to incorporate cross-modal features into classification frameworks. Specifically, Reference [<xref ref-type="bibr" rid="ref-29">29</xref>] has presented a pioneering Hierarchical Scale-Aware Vision-Language Transformer (HSVLT) framework. This framework is predicated on the Transformer model and introduces a novel attention mechanism module, which seamlessly integrates cross-modal interactions to enhance feature representation. Zhou et al. pointed out that many current transformer-based models do not mine various potentially useful features hidden by the most salient features in an image, and proposed a FL-Tran framework to solve the problem of difficult recognition of small-scale objects [<xref ref-type="bibr" rid="ref-30">30</xref>].</p>
<p>Despite the advancements, no studies have been conducted that integrate object detection tasks associated with multi-label image classification and the application of dynamic graph convolutional networks. Drawing inspiration from object detection methodologies, our study merges the well-established YOLOv5 deep learning model for object detection with the dynamic graph convolutional network to enhance multi-label image classification. Following extensive experimental analysis, our findings indicate that the YOLOv5 network is effective in increasing the precision of multi-label image classification.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Method</title>
<sec id="s3_1">
<label>3.1</label>
<title>Overview of Object-GCN</title>
<p>To capture relationships between objects, the related studies of graph convolutional networks often use label co-occurrence. It can model relationships between labels. We use the visual feature <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mi>v</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mi>c</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> extracted by the object detection network to represent the labels, and the association matrix <italic>A</italic> to represent the relationship between the labels (edges in the graph). <xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the entire framework Object-GCN we design.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The overall framework of Object-GCN</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-3.tif"/>
</fig>
<p>In Reference [<xref ref-type="bibr" rid="ref-13">13</xref>], the authors boost the effectiveness of multi-label image classification through the creation of a convolutional network that leverages static graph models, but static graph cannot make full use of specific input images. So Reference [<xref ref-type="bibr" rid="ref-15">15</xref>] proposed a dynamic graph convolutional network to improve this problem, but the Class Activation Mapping they use is still less accurate, which will make the extracted features of a particular class mixed with features of other categories, which will have an impact on multi-label classification accuracy. The team led by Cao et al. has introduced a two-stream dynamic graph Convolutional network (2S-DGCN) to advance the accuracy of identifying images that possess multiple labels [<xref ref-type="bibr" rid="ref-22">22</xref>]. However, due to the influence of Class Active Map (CAM) [<xref ref-type="bibr" rid="ref-31">31</xref>], the performance improvement is very limited. Therefore, we use a combination of dynamic convolutional networks and YOLOv5 network to solve this problem.</p>
<p>The framework consists of three modules: the Convolutional network classification prediction module, Object Detection Category Feature Extraction module and the Dynamic GCN. The first module uses ResNet101 to extract the complicated image features and predict the probability of each category. The object detection module YOLOv5 is used to detect the object and extract the content-aware representation of each category <italic>c</italic>. <italic>V</italic> is fed into the Dynamic GCN for the final classification. To reinforce the correlation between semantic and visual features, this work integrates category-specific word vector embeddings into the dynamic graph convolutional network, thereby enhancing the network&#x2019;s capability to capture the underlying associations.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Image Feature Extraction and Classification</title>
<p>In this subsection, we plan to use ResNet101 [<xref ref-type="bibr" rid="ref-32">32</xref>] to extract the complicated features of the image. We adjusted the resolution of the image to 448 &#x00D7; 448, and then input it into the convolutional network. We remove the linear layer of ResNet101 and obtain the output of &#x201C;conv5_x&#x201D;, generating 2048 &#x00D7; 14 &#x00D7; 14 feature maps. Then we choose global max pooling (GMP) to generate 2048 dimensional feature vector <italic>F</italic> for each train image.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mi>G</mml:mi><mml:mi>M</mml:mi><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>I</mml:mi><mml:mo>;</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>f</mml:mi><mml:mi>G</mml:mi><mml:mi>M</mml:mi><mml:mi>P</mml:mi></mml:math></inline-formula> denotes the GMP operation, <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>f</mml:mi><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi></mml:math></inline-formula> denotes ResNet101, <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>&#x03B8;</mml:mi><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi></mml:math></inline-formula> denotes the model parameters, and D &#x003D; 2048. Then we use a fully connected layer to convert the 2048 dimensional vector into a C-dimensions vector, and eventually use the <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mi>t</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> to obtain a set of predicted scores <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>S</mml:mi><mml:mi>I</mml:mi></mml:math></inline-formula>.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Object Detection Process Module</title>
<p>The Object Detection Process Module (ODPM) is designed to acquire content-aware representation for each category. Unlike ADD-GCN [<xref ref-type="bibr" rid="ref-15">15</xref>] which uses CAM [<xref ref-type="bibr" rid="ref-31">31</xref>], we directly use the object detection network YOLOv5 to extract the area of each object. We then compute a content-aware representation <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for each category based on the confidence of each bounding box for each category. Assume that there are n bounding boxes each category, each bounding box is defined as <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:math></inline-formula> the confidence of each bounding box is <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:math></inline-formula> and the feature of the image obtained by cropping each bounding box is <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>.</p>
<p>Specifically, <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is computed as:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Then <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> for each category can be computed as follows:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo>&#x220F;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>f</mml:mi><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:math></inline-formula> represents the confidence of each bounding box in that category. YOLOv5 is a one-step object detection framework. It adds some new ideas for improvement on YOLOv4 [<xref ref-type="bibr" rid="ref-33">33</xref>], which gives it high speed and high accuracy. Different from the anchor-based Faster-RCNN [<xref ref-type="bibr" rid="ref-34">34</xref>], YOLOv5 directly predicts the center point and bounding box size of the object by transforming the object detection task into a regression problem, so as to achieve faster detection speed and higher accuracy. In comparison with the recently introduced YOLOv7 [<xref ref-type="bibr" rid="ref-35">35</xref>], YOLOv5 exhibits a modest reduction in accuracy. However, it offers superior training and inference velocities. Owing to these advantages, YOLOv5 has been selected as the foundational network for the object detection image processing module.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Dynamic GCN</title>
<p>Numerous recent studies have demonstrated the effectiveness of graph convolutional Networks (GCN) in computer vision tasks [<xref ref-type="bibr" rid="ref-12">12</xref>]. The static graph convolutional network proposed by [<xref ref-type="bibr" rid="ref-13">13</xref>] uses word vector embedding as the nodes of the graph, and the dynamic graph convolutional network proposed by [<xref ref-type="bibr" rid="ref-15">15</xref>] uses content-aware representation vectors as the nodes of the graph. Different from previous studies, we use a combination of word vector embedding and content-aware representation to represent graph nodes. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> illustrates the formation of graph nodes. Given the distinct nature of image and text modalities, the concatenated feature vectors derived from both sources undergo a transformation through the Sigmoid function to ensure compatibility. Subsequently, the resultant fusion vector is refined by a fully connected layer to produce the final feature representation. We leverage a pre-trained GloVe model to procure 300-dimensional word vectors for each categorical term. These word vectors are concatenated with the 1024-dimensional categorical feature vectors, culminating in a comprehensive 1324-dimensional vector. Each dimension of this vector is then scaled to a range between 0 and 1 by the Sigmoid function, facilitating the normalization of feature values. Ultimately, this processed feature vector is conveyed through a fully connected layer, yielding the node features for the graph convolutional network.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The generation process of graph nodes</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-4.tif"/>
</fig>
<p>Reference [<xref ref-type="bibr" rid="ref-13">13</xref>] compares several diverse word vector embedding methods such as GloVe [<xref ref-type="bibr" rid="ref-36">36</xref>], GoogleNews [<xref ref-type="bibr" rid="ref-37">37</xref>], FastText [<xref ref-type="bibr" rid="ref-38">38</xref>] and the one-hot word vector embedding, and finds that the capability of several algorithms is very approximate. But the capability of GloVe is still slightly higher than other methods. Therefore, we choose GloVe for word vector embedding in this paper.</p>
<p>In a static graph convolutional network, the correlation matrix is shared for all image samples, so the correlation matrix <italic>A</italic><sub><italic>s</italic></sub> is fixed for each sample. However, in order to improve the classification accuracy, we prefer that the graph convolutional network can capture the global coarse classification dependency of the image. After the static graph convolutional network, we get the output <italic>H</italic>. We successively input <italic>H</italic> into the global average pooling layer and the convolution layer to obtain <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>h</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>. This is done in order to fuse the feature vectors corresponding to each label category to obtain the feature vector of the global relationship. Then <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is obtained by concatenated fusion using <italic>H</italic> and the global eigenvector representation <italic>h</italic><sub><italic>g</italic></sub>. By doing this, we concatenate the global feature vectors to the feature vectors of each original category label. Finally, we compute the dynamic correlation matrix <italic>A</italic><sub><italic>d</italic></sub> by <italic>H</italic><italic>&#x2032;</italic>. Different from the static correlation matrix <italic>A</italic><sub><italic>s</italic></sub>, the dynamic correlation matrix <italic>A</italic><sub><italic>d</italic></sub> is calculated according to the adaptive estimation of the input feature <italic>H</italic>, and different sample images have different <italic>A</italic><sub><italic>d</italic></sub>, which changes according to the input. It is also for this reason that the model has a higher representative power.</p>
<p>Thus <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> can be expressed as:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msup><mml:mi>V</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mrow><mml:mo>[</mml:mo> <mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mn>1</mml:mn><mml:mo>;</mml:mo><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mn>2</mml:mn><mml:mo>;</mml:mo><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow> <mml:mo>]</mml:mo></mml:mrow><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>D</mml:mi></mml:mrow></mml:msup>
</mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> stands for category content-aware representation and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> stands for word vector embedding. <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is fed into the static GCN and the D-GCN in turn, and the resulting <italic>H</italic> is defined as follows:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mi>L</mml:mi><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>where <italic>A</italic><sub><italic>s</italic></sub> represents the correlation matrix of the static graph convolutional network, and <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the weight matrix. LReLU is LeakyReLU [<xref ref-type="bibr" rid="ref-39">39</xref>] in the experiment. The nodes are updated as follows:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mi>W</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where <italic>H</italic><sup><italic>l</italic></sup> denotes the node features of lth, and <italic>H</italic><sup><italic>l &#x002B; 1</italic></sup> denotes the node features of <italic>(l &#x002B; 1)th</italic>. The <italic>A</italic> matrix is generally predefined, the <italic>W</italic> matrix is obtained during training, and <italic>f</italic>(&#x00B7;) is the activation function, which is LeakyReLU in this paper. After obtaining <italic>H</italic>, we concatenate it with the <italic>hg</italic> obtained by the global average pooling layer(GAP) and the convolutional layer to obtain <italic>H</italic><sup><italic>&#x2032;</italic></sup>. <italic>H</italic><sup><italic>&#x2032;</italic></sup> is represented as follows:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mn>1</mml:mn><mml:mo>;</mml:mo><mml:mi>h</mml:mi><mml:mi>g</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mn>2</mml:mn><mml:mo>;</mml:mo><mml:mi>h</mml:mi><mml:mi>g</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mi>c</mml:mi><mml:mo>;</mml:mo><mml:mi>h</mml:mi><mml:mi>g</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>After that <italic>H</italic> will be input into the dynamic graph convolutional network, and the correlation matrix <italic>A</italic><sub><italic>d</italic></sub> of the dynamic graph convolutional network is defined as follows:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>W</mml:mi><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the weight of the convolutional layer constructing the dynamic correlation matrix <italic>A</italic><sub><italic>d</italic></sub>. After <italic>H</italic> is fed into the dynamic graph convolutional network, the update of the nodes is represented as follows:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>Z</mml:mi><mml:mo>=</mml:mo><mml:mi>L</mml:mi><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mi>H</mml:mi><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where LReLU is LeakyReLU [<xref ref-type="bibr" rid="ref-39">39</xref>] and <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msubsup></mml:math></inline-formula> is the weight of the dynamic graph convolutional network. Different from static graph convolutional networks, dynamic graph convolutional networks have different <italic>A</italic><sub><italic>d</italic></sub> for each image. Different from those in [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>], we fuse the content-aware representation and word vector in series and then input it into the graph convolutional network to better fuse the visual features and semantic features.</p>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Loss and Classification</title>
<p>We end up with a category representation <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>Z</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>z</mml:mi><mml:mi>c</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> from the dynamic neural network, each vector <italic>z</italic><sub><italic>i</italic></sub> contained in <italic>Z</italic> has complicated semantic relationships with other vectors and it is aligned with a specific category. Putting each vector <italic>z</italic><sub><italic>i</italic></sub> into it by a binary classifier yields a prediction score for each class. Where the confidence score vector <italic>s</italic><sub><italic>i</italic></sub> for each category is represented as follows:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>], the Class Activation Map (CAM) is used to calculate the score of each category to obtain another credibility score <italic>s</italic><sub><italic>m</italic></sub>. We apply the method of object detection when extracting the content-aware representation, so the score <italic>s</italic><sub><italic>obj</italic></sub> we get from the object detection module is represented as follows:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the confidence in object detection for category <italic>i</italic>. In the image feature extraction module, the score <italic>s</italic><sub><italic>I</italic></sub> obtained through the ResNet101 classifier is defined as follows:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>We take the average of these three vectors and we get our final vector <italic>s</italic>. The vector <italic>s</italic> is defined as follows:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow><mml:mn>3</mml:mn></mml:mfrac><mml:mo>,</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow><mml:mn>3</mml:mn></mml:mfrac><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mn>3</mml:mn></mml:mfrac><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Finally, we train the whole Object-GCN model using the traditional multi-label classification training loss function, which is defined as follows:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experiment</title>
<sec id="s4_1">
<label>4.1</label>
<title>Datasets</title>
<p>MSOCO 2014 [<xref ref-type="bibr" rid="ref-17">17</xref>] is a versatile dataset that is often used for computer vision tasks. It has also been generally used for image recognition task in recent years. The public dataset includes a total of 122,218 images, of which the training part includes 82,081 images and the validation part includes 40,137 images. The images in the dataset were classified into 80 daily categories. And each image contains an average of 2.9 categories.</p>
<p>VOC 2007 [<xref ref-type="bibr" rid="ref-18">18</xref>] is similarly generally used for multi-label classification tasks. The researchers classified all images in the dataset into 20 common categories, including people, vehicles, animals, and more. Among them, the training and validation sets have 5011 images, and the test set contains 4952 images.</p>
<p>VOC 2012 [<xref ref-type="bibr" rid="ref-18">18</xref>] is an extension of Pascal VOC 2007. The dataset is also divided into 20 common categories. Among them, 11,540 images are the training part and 10,991 images are the test part. There are a lot of new images compared to the previous version.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Metrics</title>
<p>To facilitate a rigorous comparison with existing baseline models, this study meticulously conducts an extensive experimental evaluation on the aforementioned trio of datasets, adhering to the established metrics and methodologies of prior research. Among them, the evaluation metrics are OP, CP, OR, CR, OF1, CF1 and the mean Average Precision (mAP). In addition, because the COCO2014 dataset is so diverse, we also provide the top-3 data for each metric.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Baselines</title>
<p>This paper mainly uses graph convolutional networks, so in addition to comparing with classical methods such as CNN-RNN [<xref ref-type="bibr" rid="ref-10">10</xref>], ResNet101 [<xref ref-type="bibr" rid="ref-32">32</xref>], RNN-Attention [<xref ref-type="bibr" rid="ref-21">21</xref>], Multi-evidence [<xref ref-type="bibr" rid="ref-40">40</xref>], this paper focuses on comparing with methods based on graph convolutional networks. These include ML-GCN [<xref ref-type="bibr" rid="ref-13">13</xref>], ADD-GCN [<xref ref-type="bibr" rid="ref-15">15</xref>] and many more. Since Transformers have shown good performance in establishing the relationship between images and labels in recent years, we similarly select the transformer-based models C-Train [<xref ref-type="bibr" rid="ref-26">26</xref>], TDRG [<xref ref-type="bibr" rid="ref-27">27</xref>] and M3TR [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Experiment Detail</title>
<p>The deep learning framework selected in this paper is PyTorch [<xref ref-type="bibr" rid="ref-41">41</xref>], and the code is written based on Python 3.8. The GPU configuration we used was RTX 4090, PyTorch version 1.8.1, and Cuda version 11.1. We use ResNet101 as the backbone network to extract the content-aware representation of each class, and the 300-dimensional GloVe pre-trained model to obtain the word vector representation. In the object detection module, we select the YOLOv5-x pre-trained weight parameter with the highest accuracy for training.</p>
<p>SGD is chosen as the optimizer, reducing momentum by 0.9 and weight by 10<sup>&#x2212;4</sup>. The learning rate of dynamic convolution graph network is 0.5, and the learning rate of ResNet101 used for image feature extraction is 0.05. Because in the early stage of deep learning network training, we want our network to converge quickly with a large learning rate. In the later stage of training, we want the learning rate to be small, so that the network can avoid oscillating back and forth when converging to the optimal point, so as to better converge to the optimal solution. We set the training round as 50 and reduced the learning rate of ResNet101 by 0.1 at 30 and 40 epochs, respectively. The GPU has a batch size of 16.</p>
<p>We applied a series of preprocessing to the images. The image is resized to 448 &#x00D7; 448 and 576 &#x00D7; 576, random horizontal flipping and multi-scale cropping are performed, and the image is normalized so that the image data has a similar distribution on each channel. The implemented preprocessing techniques serve to standardize the image data, thereby enhancing its quality and, consequentially, augmenting the model&#x2019;s performance and enhancing its generalization capabilities to a significant extent.</p>
</sec>
<sec id="s4_5">
<label>4.5</label>
<title>Results</title>
<sec id="s4_5_1">
<label>4.5.1</label>
<title>Results on COCO2014</title>
<p>We contrast the metrics of Object-GCN model with recent methods on COCO dataset, and the data of the baseline model comes from the respective papers. <xref ref-type="table" rid="table-1">Table 1</xref> illustrates the results of comparison, from which we can see that the mAP of our model is 7.5% higher than ResNet101 [<xref ref-type="bibr" rid="ref-32">32</xref>], and has a significant improvement over ADD-GCN [<xref ref-type="bibr" rid="ref-15">15</xref>] and 2S-DGCN [<xref ref-type="bibr" rid="ref-17">17</xref>], which are also based on dynamic graph convolutional networks. In order to make a fair comparison, we selected the experimental results with two imageSize Settings of 448 and 576, and compared with other models. Finally, the experimental results show that our framework has advantages in both Settings Concurrently, it is observed that the dimensions of the image exert a notable influence on the experimental outcomes. Generally, an increase in image size correlates with an enhancement in the performance of the resultant model.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of Object-GCN and other frameworks on the COCO2014</title>
</caption>
<table frame="hsides">
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Method</th>
<th rowspan="2">Resolution</th>
<th align="center" colspan="7">All</th>
<th align="center" colspan="6">Top-3</th>
</tr>
<tr>
<th>mAP</th>
<th>CP</th>
<th>CR</th>
<th>CF<sub>1</sub></th>
<th>OP</th>
<th>OR</th>
<th>OF<sub>1</sub></th>
<th>CP</th>
<th>CR</th>
<th>CF<sub>1</sub></th>
<th>OP</th>
<th>OR</th>
<th>OF<sub>1</sub></th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-10">10</xref>] CNN-RNN</td>
<td>&#x2013;</td>
<td>61.2</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>66.0</td>
<td>55.6</td>
<td>60.4</td>
<td>69.2</td>
<td>66.4</td>
<td>67.8</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-21">21</xref>] RNN-attention</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>79.1</td>
<td>58.7</td>
<td>67.4</td>
<td>84.0</td>
<td>63.0</td>
<td>72.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-32">32</xref>] ResNet101</td>
<td>448 &#x00D7; 448</td>
<td>79.7</td>
<td>82.7</td>
<td>67.4</td>
<td>74.3</td>
<td>86.4</td>
<td>71.8</td>
<td>78.4</td>
<td>85.9</td>
<td>60.5</td>
<td>71.0</td>
<td>90.2</td>
<td>64.2</td>
<td>75.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-40">40</xref>] Multi-evidence</td>
<td>448 &#x00D7; 448</td>
<td>&#x2013;</td>
<td>80.4</td>
<td>70.2</td>
<td>74.9</td>
<td>85.2</td>
<td>72.5</td>
<td>78.4</td>
<td>84.5</td>
<td>62.2</td>
<td>70.6</td>
<td>89.1</td>
<td>64.3</td>
<td>74.7</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-13">13</xref>] ML-GCN</td>
<td>448 &#x00D7; 448</td>
<td>83.0</td>
<td>85.1</td>
<td>72.0</td>
<td>78.0</td>
<td>85.8</td>
<td>75.4</td>
<td>80.3</td>
<td>89.2</td>
<td>64.1</td>
<td>74.6</td>
<td>90.5</td>
<td>66.5</td>
<td>76.7</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-14">14</xref>] SSGRL</td>
<td>448 &#x00D7; 448</td>
<td>81.9</td>
<td>84.2</td>
<td>70.3</td>
<td>76.6</td>
<td>85.8</td>
<td>72.4</td>
<td>78.6</td>
<td>88.0</td>
<td>63.1</td>
<td>73.5</td>
<td>90.2</td>
<td>64.5</td>
<td>75.2</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-15">15</xref>] ADD-GCN</td>
<td>448 &#x00D7; 448</td>
<td>85.2</td>
<td>84.7</td>
<td>75.9</td>
<td>80.1</td>
<td>84.9</td>
<td>79.4</td>
<td>82.0</td>
<td>88.8</td>
<td>66.2</td>
<td>75.8</td>
<td>90.3</td>
<td>68.5</td>
<td>77.9</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-22">22</xref>] 2S-DCN</td>
<td>448 &#x00D7; 448</td>
<td>85.6</td>
<td>84.9</td>
<td>75.7</td>
<td>80.0</td>
<td>86.8</td>
<td>78.0</td>
<td>82.2</td>
<td>88.9</td>
<td>66.7</td>
<td>76.3</td>
<td>91.1</td>
<td>68.1</td>
<td>77.9</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>] DRGN</td>
<td>448 &#x00D7; 448</td>
<td>84.9</td>
<td>86.3</td>
<td>73.8</td>
<td>79.6</td>
<td>87.4</td>
<td>76.6</td>
<td>81.6</td>
<td>89.5</td>
<td>65.7</td>
<td>75.8</td>
<td>91.3</td>
<td>67.4</td>
<td>77.6</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-25">25</xref>] SALGL</td>
<td>448 &#x00D7; 448</td>
<td>85.8</td>
<td>87.2</td>
<td>74.5</td>
<td>80.4</td>
<td>87.8</td>
<td>77.6</td>
<td>82.4</td>
<td>90.4</td>
<td>65.7</td>
<td>76.1</td>
<td>91.8</td>
<td>67.9</td>
<td>78.1</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-27">27</xref>] TDRG</td>
<td>448 &#x00D7; 448</td>
<td>86.0</td>
<td>87.0</td>
<td>74.7</td>
<td>80.4</td>
<td>87.5</td>
<td>77.9</td>
<td>82.4</td>
<td>90.7</td>
<td>65.6</td>
<td>76.2</td>
<td>91.9</td>
<td>68.0</td>
<td>78.1</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-25">25</xref>] SALGL</td>
<td>576 &#x00D7; 576</td>
<td>87.3</td>
<td>87.8</td>
<td>76.8</td>
<td>81.9</td>
<td>88.1</td>
<td>79.5</td>
<td>83.6</td>
<td>91.1</td>
<td>66.9</td>
<td>77.2</td>
<td>92.4</td>
<td>69.0</td>
<td>79.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>] DRGN</td>
<td>576 &#x00D7; 576</td>
<td>86.4</td>
<td>87.4</td>
<td>75.6</td>
<td>81.1</td>
<td>88.1</td>
<td>78.3</td>
<td>82.9</td>
<td>90.6</td>
<td>66.7</td>
<td>76.8</td>
<td>92.1</td>
<td>68.3</td>
<td>78.5</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-26">26</xref>] C-Train</td>
<td>576 &#x00D7; 576</td>
<td>85.1</td>
<td>86.3</td>
<td>74.3</td>
<td>79.9</td>
<td>87.7</td>
<td>76.5</td>
<td>81.7</td>
<td>90.1</td>
<td>65.7</td>
<td>76.0</td>
<td>92.1</td>
<td><bold>71.4</bold></td>
<td>77.6</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-28">28</xref>] M3TR</td>
<td>576 &#x00D7; 576</td>
<td><bold>87.5</bold></td>
<td>88.4</td>
<td><bold>77.2</bold></td>
<td><bold>82.5</bold></td>
<td>88.3</td>
<td>79.8</td>
<td>83.8</td>
<td><bold>91.9</bold></td>
<td>68.1</td>
<td>78.2</td>
<td>92.6</td>
<td>69.6</td>
<td>79.4</td>
</tr>
<tr>
<td>Object-GCN</td>
<td>448 &#x00D7; 448</td>
<td>86.2</td>
<td>87.4</td>
<td>73.9</td>
<td>80.1</td>
<td>87.6</td>
<td>78.0</td>
<td>82.5</td>
<td>90.5</td>
<td>65.8</td>
<td>76.2</td>
<td>92.0</td>
<td>67.9</td>
<td>78.1</td>
</tr>
<tr>
<td>Object-GCN</td>
<td>576 &#x00D7; 576</td>
<td>86.9</td>
<td><bold>88.7</bold></td>
<td>76.8</td>
<td>82.3</td>
<td><bold>88.5</bold></td>
<td><bold>80.1</bold></td>
<td><bold>84.1</bold></td>
<td>91.4</td>
<td><bold>68.5</bold></td>
<td><bold>78.3</bold></td>
<td><bold>92.8</bold></td>
<td>69.4</td>
<td><bold>79.5</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Although our model does not use transformer, it still has certain advantages over the recent transformer-based models C-Train [<xref ref-type="bibr" rid="ref-26">26</xref>],TDRG [<xref ref-type="bibr" rid="ref-27">27</xref>] and M3TR [<xref ref-type="bibr" rid="ref-28">28</xref>]. Among the fully GCN-based frameworks, our framework obtains the best metrics. The experiment results demonstrate that the object detection module we introduced greatly improves the metrics. It can be discovered from the table that after the introduction of the object detection module, the CP has been significantly improved, and it should be that the object detection module makes some small targets that are not easy to be identified.</p>
</sec>
<sec id="s4_5_2">
<label>4.5.2</label>
<title>Results on VOC</title>
<p>In this paper, the performance of our framework is contrasted with the baseline framework on VOC2007 dataset, and the detection accuracy of 20 categories is obtained. <xref ref-type="table" rid="table-2">Table 2</xref> demonstrates the experimental results we obtained.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparison of Object-GCN and other models on the VOC2007 dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Resolution</th>
<th>Aero</th>
<th>Bike</th>
<th>Bird</th>
<th>Boat</th>
<th>Bottle</th>
<th>Bus</th>
<th>Car</th>
<th>Cat</th>
<th>Chair</th>
<th>Cow</th>
<th>Table</th>
<th>Dog</th>
<th>Horse</th>
<th>Motor</th>
<th>Person</th>
<th>Plant</th>
<th>Sheep</th>
<th>Sofa</th>
<th>Train</th>
<th>Tv</th>
<th>mAP</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-10">10</xref>]</td>
<td>&#x2013;</td>
<td>96.7</td>
<td>83.1</td>
<td>94.2</td>
<td>92.8</td>
<td>61.2</td>
<td>82.1</td>
<td>89.1</td>
<td>94.2</td>
<td>64.2</td>
<td>83.6</td>
<td>70.0</td>
<td>92.4</td>
<td>91.7</td>
<td>84.2</td>
<td>93.7</td>
<td>59.8</td>
<td>93.2</td>
<td>75.3</td>
<td>99.7</td>
<td>78.6</td>
<td>84.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-21">21</xref>]</td>
<td>&#x2013;</td>
<td>98.6</td>
<td>97.4</td>
<td>96.3</td>
<td>96.2</td>
<td>75.2</td>
<td>92.4</td>
<td>96.5</td>
<td>97.1</td>
<td>76.5</td>
<td>92.0</td>
<td>87.7</td>
<td>96.8</td>
<td>97.5</td>
<td>93.8</td>
<td>98.5</td>
<td>81.6</td>
<td>93.7</td>
<td>82.8</td>
<td>98.6</td>
<td>89.3</td>
<td>91.9</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-32">32</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.1</td>
<td>97.3</td>
<td>96.2</td>
<td>94.7</td>
<td>68.3</td>
<td>92.9</td>
<td>95.9</td>
<td>94.6</td>
<td>77.9</td>
<td>89.9</td>
<td>85.1</td>
<td>94.7</td>
<td>96.8</td>
<td>94.3</td>
<td>98.1</td>
<td>80.8</td>
<td>93.1</td>
<td>79.1</td>
<td>98.2</td>
<td>91.1</td>
<td>90.8</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-13">13</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.5</td>
<td>98.5</td>
<td>98.6</td>
<td>98.1</td>
<td>80.8</td>
<td>94.6</td>
<td>97.2</td>
<td>98.2</td>
<td>82.3</td>
<td>95.7</td>
<td>86.4</td>
<td>98.2</td>
<td>98.4</td>
<td>96.7</td>
<td>99.0</td>
<td>84.7</td>
<td>96.7</td>
<td>84.3</td>
<td>98.9</td>
<td>93.7</td>
<td>94.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-14">14</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.7</td>
<td>98.4</td>
<td>98.0</td>
<td>97.6</td>
<td>85.7</td>
<td>96.2</td>
<td>98.2</td>
<td>98.8</td>
<td>82.0</td>
<td>98.1</td>
<td>89.7</td>
<td>98.8</td>
<td>98.7</td>
<td>97.0</td>
<td>99.0</td>
<td>86.9</td>
<td>98.1</td>
<td>85.8</td>
<td>99.0</td>
<td>93.7</td>
<td>95.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.8</td>
<td>98.6</td>
<td>98.3</td>
<td>98.6</td>
<td>81.8</td>
<td>95.5</td>
<td>97.6</td>
<td>98.0</td>
<td>83.9</td>
<td>94.9</td>
<td>87.5</td>
<td>98.4</td>
<td>97.8</td>
<td>97.4</td>
<td>98.8</td>
<td>86.6</td>
<td>96.2</td>
<td>85.6</td>
<td>99.4</td>
<td>94.9</td>
<td>94.5</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.9</td>
<td>98.8</td>
<td>98.3</td>
<td>98.2</td>
<td>81.6</td>
<td>96.5</td>
<td>98.1</td>
<td>97.8</td>
<td>85.2</td>
<td>97.0</td>
<td>89.6</td>
<td>98.5</td>
<td>98.7</td>
<td>97.1</td>
<td>99.2</td>
<td>86.9</td>
<td>96.4</td>
<td>89.9</td>
<td>99.5</td>
<td>95.2</td>
<td>95.1</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-27">27</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.9</td>
<td>98.9</td>
<td>98.4</td>
<td>98.7</td>
<td>81.9</td>
<td>95.8</td>
<td>97.8</td>
<td>98.0</td>
<td>85.2</td>
<td>95.6</td>
<td>89.5</td>
<td>98.8</td>
<td>98.6</td>
<td>97.1</td>
<td>99.1</td>
<td>86.2</td>
<td>97.7</td>
<td>87.2</td>
<td>99.1</td>
<td>95.3</td>
<td>95.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-15">15</xref>]</td>
<td>576 &#x00D7; 576</td>
<td>99.8</td>
<td>99.0</td>
<td>98.4</td>
<td>99.0</td>
<td>86.7</td>
<td>98.1</td>
<td>98.5</td>
<td>98.3</td>
<td>85.8</td>
<td>98.3</td>
<td>88.9</td>
<td>98.8</td>
<td>99.0</td>
<td>97.4</td>
<td>99.2</td>
<td>88.3</td>
<td>98.7</td>
<td>90.7</td>
<td>99.5</td>
<td>97.0</td>
<td>96.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td>576 &#x00D7; 576</td>
<td>99.9</td>
<td>99.3</td>
<td>99.1</td>
<td>99.1</td>
<td>84.0</td>
<td>97.6</td>
<td>98.0</td>
<td>99.0</td>
<td>85.9</td>
<td>99.4</td>
<td><bold>93.9</bold></td>
<td>99.5</td>
<td>99.4</td>
<td>98.5</td>
<td>99.2</td>
<td>90.3</td>
<td>99.7</td>
<td>91.6</td>
<td>99.8</td>
<td>96.0</td>
<td>96.5</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td>576 &#x00D7; 576</td>
<td><bold>100.0</bold></td>
<td>99.2</td>
<td>98.8</td>
<td>98.6</td>
<td><bold>87.1</bold></td>
<td>98.1</td>
<td><bold>99.0</bold></td>
<td><bold>99.2</bold></td>
<td><bold>87.9</bold></td>
<td>98.9</td>
<td>92.3</td>
<td>98.8</td>
<td>99.1</td>
<td><bold>98.9</bold></td>
<td>99.4</td>
<td>89.5</td>
<td>99.0</td>
<td><bold>93.7</bold></td>
<td>99.8</td>
<td>97.1</td>
<td>96.7</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>576 &#x00D7; 576</td>
<td>99.9</td>
<td>99.1</td>
<td>98.8</td>
<td>98.5</td>
<td>90.0</td>
<td>97.9</td>
<td>98.9</td>
<td>98.8</td>
<td>85.9</td>
<td>98.6</td>
<td>90.6</td>
<td>99.0</td>
<td>99.0</td>
<td>97.8</td>
<td>99.3</td>
<td>90.3</td>
<td>99.6</td>
<td>89.0</td>
<td>99.4</td>
<td>96.8</td>
<td>96.4</td>
</tr>
<tr>
<td>Ours</td>
<td>448 &#x00D7; 448</td>
<td>99.9</td>
<td>99.2</td>
<td>98.6</td>
<td>98.8</td>
<td>85.6</td>
<td>97.9</td>
<td>98.4</td>
<td>98.4</td>
<td>85.2</td>
<td>98.2</td>
<td>89.3</td>
<td>99.1</td>
<td>99.3</td>
<td>97.7</td>
<td>98.9</td>
<td>88.5</td>
<td>98.6</td>
<td>91.5</td>
<td>99.5</td>
<td>96.9</td>
<td>96.0</td>
</tr>
<tr>
<td>Ours</td>
<td>576 &#x00D7;576</td>
<td>99.9</td>
<td><bold>99.5</bold></td>
<td><bold>99.2</bold></td>
<td><bold>99.2</bold></td>
<td>87.0</td>
<td><bold>98.2</bold></td>
<td>98.7</td>
<td>98.9</td>
<td>86.0</td>
<td><bold>99.5</bold></td>
<td>90.1</td>
<td><bold>99.6</bold></td>
<td><bold>99.6</bold></td>
<td>98.3</td>
<td><bold>99.4</bold></td>
<td><bold>91.1</bold></td>
<td>99.5</td>
<td>92.6</td>
<td><bold>99.9</bold></td>
<td><bold>97.3</bold></td>
<td><bold>96.7</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From the information in the table, it can be seen that the mAP of our model is increased by 5.2% on the basis of ResNet101 [<xref ref-type="bibr" rid="ref-32">32</xref>]. Among the frameworks predicated on graph convolutional networks, our Object-GCN framework demonstrates superior performance. Specifically, in the majority of categories, Object-GCN surpasses the Transformer-based TDRG [<xref ref-type="bibr" rid="ref-27">27</xref>] and M3TR [<xref ref-type="bibr" rid="ref-28">28</xref>], showcasing its efficacy in comparative evaluations.</p>
<p>VOC2012 is an extension of VOC2007 dataset, so this paper also conducts experiments on VOC2012 dataset. The VOC2012 dataset also has 20 categories and <xref ref-type="table" rid="table-3">Table 3</xref> shows the results of the experiments. We choose RMIC [<xref ref-type="bibr" rid="ref-42">42</xref>], VeryDeep [<xref ref-type="bibr" rid="ref-43">43</xref>], HCP [<xref ref-type="bibr" rid="ref-44">44</xref>], SSGRL [<xref ref-type="bibr" rid="ref-14">14</xref>], ADD-GCN [<xref ref-type="bibr" rid="ref-15">15</xref>] as our baseline models.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparison of Object-GCN and other models on the VOC2012 dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Resolution</th>
<th>Aero</th>
<th>Bike</th>
<th>Bird</th>
<th>Boat</th>
<th>Bottle</th>
<th>Bus</th>
<th>Car</th>
<th>Cat</th>
<th>Chair</th>
<th>Cow</th>
<th>Table</th>
<th>Dog</th>
<th>Horse</th>
<th>Motor</th>
<th>Person</th>
<th>Plant</th>
<th>Sheep</th>
<th>Sofa</th>
<th>Train</th>
<th>Tv</th>
<th>mAP</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>&#x2013;</td>
<td>98.0</td>
<td>85.5</td>
<td>92.6</td>
<td>88.7</td>
<td>64.0</td>
<td>86.8</td>
<td>82.0</td>
<td>94.9</td>
<td>72.7</td>
<td>83.1</td>
<td>73.4</td>
<td>95.2</td>
<td>91.7</td>
<td>90.8</td>
<td>95.5</td>
<td>58.3</td>
<td>87.6</td>
<td>70.6</td>
<td>93.8</td>
<td>83.0</td>
<td>84.4</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-43">43</xref>]</td>
<td>&#x2013;</td>
<td>99.1</td>
<td>88.7</td>
<td>95.7</td>
<td>93.9</td>
<td>73.1</td>
<td>92.1</td>
<td>84.8</td>
<td>97.7</td>
<td>79.1</td>
<td>90.7</td>
<td>83.2</td>
<td>97.3</td>
<td>96.2</td>
<td>94.3</td>
<td>96.9</td>
<td>63.4</td>
<td>93.2</td>
<td>74.6</td>
<td>97.3</td>
<td>87.9</td>
<td>89.0</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td>&#x2013;</td>
<td>99.1</td>
<td>92.8</td>
<td>97.4</td>
<td>94.4</td>
<td>79.9</td>
<td>93.6</td>
<td>89.8</td>
<td>98.2</td>
<td>78.2</td>
<td>94.9</td>
<td>79.8</td>
<td>97.8</td>
<td>97.0</td>
<td>93.8</td>
<td>96.4</td>
<td>74.3</td>
<td>94.7</td>
<td>71.9</td>
<td>96.7</td>
<td>88.6</td>
<td>90.5</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-14">14</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.7</td>
<td>96.1</td>
<td>97.7</td>
<td>96.5</td>
<td>86.9</td>
<td>95.8</td>
<td>95.0</td>
<td>98.9</td>
<td>88.3</td>
<td>97.6</td>
<td>87.4</td>
<td>99.1</td>
<td>99.2</td>
<td>97.3</td>
<td>99.0</td>
<td>84.8</td>
<td>98.3</td>
<td>85.8</td>
<td>99.2</td>
<td>94.1</td>
<td>94.8</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-15">15</xref>]</td>
<td>448 &#x00D7; 448</td>
<td>99.8</td>
<td>97.1</td>
<td>98.6</td>
<td>96.8</td>
<td>89.4</td>
<td>97.1</td>
<td>96.5</td>
<td>99.3</td>
<td>89.0</td>
<td>97.7</td>
<td>87.5</td>
<td>99.2</td>
<td>99.1</td>
<td>97.7</td>
<td>99.1</td>
<td>86.3</td>
<td>98.8</td>
<td>87.0</td>
<td>99.3</td>
<td>95.4</td>
<td>95.5</td>
</tr>
<tr>
<td>Ours</td>
<td>448 &#x00D7; 448</td>
<td>99.8</td>
<td>97.0</td>
<td>98.7</td>
<td>97.5</td>
<td>88.6</td>
<td>97.7</td>
<td>96.8</td>
<td>99.3</td>
<td>89.2</td>
<td>97.8</td>
<td>88.2</td>
<td>99.0</td>
<td>98.7</td>
<td>98.0</td>
<td>99.3</td>
<td>87.4</td>
<td>98.5</td>
<td>88.1</td>
<td>98.9</td>
<td>95.8</td>
<td>95.7</td>
</tr>
<tr>
<td>Ours</td>
<td>576 &#x00D7; 576</td>
<td>99.8</td>
<td><bold>97.4</bold></td>
<td><bold>99.0</bold></td>
<td><bold>98.2</bold></td>
<td>89.1</td>
<td><bold>98.4</bold></td>
<td><bold>97.5</bold></td>
<td><bold>99.6</bold></td>
<td><bold>89.8</bold></td>
<td><bold>98.3</bold></td>
<td><bold>88.9</bold></td>
<td><bold>99.5</bold></td>
<td>99.2</td>
<td><bold>98.1</bold></td>
<td><bold>99.5</bold></td>
<td><bold>88.3</bold></td>
<td><bold>99.2</bold></td>
<td><bold>89.0</bold></td>
<td><bold>99.6</bold></td>
<td><bold>96.7</bold></td>
<td><bold>96.3</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From the data in the table, we can see that our Object-GCN achieves the best results. Specifically, it exhibits a relative enhancement of 0.2% in mean Average Precision (mAP) compared to the baseline ADD-GCN model [<xref ref-type="bibr" rid="ref-15">15</xref>], and a more pronounced improvement of 0.9% over the SSGRL [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
</sec>
<sec id="s4_5_3">
<label>4.5.3</label>
<title>Limited Annotations Studies</title>
<p>Our experiment uses an object detector to extract the category features in the image, but in reality many images lack complete annotations, so we conduct more experiments to solve this problem. Our experiment uses an object detector to extract the category features in the image, but in reality many images lack complete annotations, so we conduct more experiments to solve this problem. The VOC2007 dataset contains 9963 labeled images with 24,640 labeled objects. We randomly select 10%&#x2013;90% of the number of annotations to train our object detector. We separately calculate the mAP of the Object-GCN framework in the case of different Object detectors for comparison. When training the YOLOv5 object detector, we set the confidence <italic>conf</italic> to 0.25. <xref ref-type="table" rid="table-4">Table 4</xref> shows the performance of the model when the ratio of annotations is different. And we set the image size to 448 &#x00D7; 448.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>mAP of different annotation ratios in the VOC2007 dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Dataset</th>
<th>10%</th>
<th>20%</th>
<th>30%</th>
<th>40%</th>
<th>50%</th>
<th>60%</th>
<th>70%</th>
<th>80%</th>
<th>90%</th>
<th>Ave. mAP</th>
</tr>
</thead>
<tbody>
<tr>
<td>VOC2007</td>
<td>84.3</td>
<td>87.5</td>
<td>89.8</td>
<td>93.9</td>
<td>94.6</td>
<td>95.0</td>
<td>95.4</td>
<td>95.8</td>
<td>95.8</td>
<td>92.5</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> illustrates the trend of the model mAP when the ratio of annotations is different. It can be seen from the figure that when the number of annotation boxes is small, the performance of the model is significantly improved with the increase of the number of annotations. The possible reason is that the improved accuracy of the object detector makes the prediction of the whole model more accurate. When the number of comment boxes increases, the performance of the model improves slowly. The performance of Object-GCN is even worse than ResNet101 [<xref ref-type="bibr" rid="ref-32">32</xref>] when there are fewer annotation boxes, and we guess the reason may be that the poor performance of the object detector at this time has a negative impact on the model. When the proportion of annotated boxes reaches more than 30%, the performance of our framework exceeds the baseline model.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Model performance with different annotation ratios</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-5.tif"/>
</fig>
</sec>
<sec id="s4_5_4">
<label>4.5.4</label>
<title>Results Conclusions</title>
<p>From the data in the above table, we can see that our proposed model shows good performance on the three datasets. Compared with ResNet101, our model uses a dynamic graph convolutional network to take into account the dependency between labels, so it has a large improvement over the baseline model. Compared with other frameworks that use graph convolutional networks, our proposed framework uses an object detector instead of CAM to extract image features of each category, and the image features extracted by the object detector are more accurate than the category activator. Moreover, we also fuse the word vectors and image features generated by GloVe. Therefore, our model has a large performance improvement over the baseline model ResNet101 and the graph convolution framework ADD-GCN.</p>
</sec>
</sec>
<sec id="s4_6">
<label>4.6</label>
<title>Ablation Studies</title>
<p>In this subsection, we conduct ablation studies in order to explore the contributions of the Object detection module and Dynamic GCN in Object-GCN to the whole model, respectively. We remove the Object detection module and the Dynamic GCN, respectively, and compare with the baseline model and the Object-GCN framework. To evaluate the effect of the object detection module, we delete the object detection module when performing ablation studies. <xref ref-type="fig" rid="fig-6">Fig. 6</xref> presents the results of our ablation studies. <xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows that compared with the baseline model ResNet101 [<xref ref-type="bibr" rid="ref-32">32</xref>], the Dynamic GCN and object detection modules we add can improve the performance of the framework. However, compared with the Dynamic GCN, the object detection module has less improvement in performance. The best results can be obtained by adding both the object detection module and the Dynamic GCN. In the MS COCO dataset, the improvements of mAP, OF1 and CF1 are 7.2%, 5.7% and 8.0%, respectively. On the VOC2007 dataset, the performance improvement of the three metrics is 5.9%, 9.3%, 8.3%. Compared with the ablation experimental data in Reference [<xref ref-type="bibr" rid="ref-15">15</xref>], the effect of object detection and category feature extraction module proposed by us is more significant than that of SAM module proposed in [<xref ref-type="bibr" rid="ref-15">15</xref>]. At the same time, our dynamic graph convolutional network also performs better than [<xref ref-type="bibr" rid="ref-15">15</xref>] because we fuse the vectors of both image and text modalities when generating the graph vertices.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Dynamic-GCN and Obj-Module on MS-COCO and VOC2007 ((a): Comparisons on MS-COCO, (b): Comparisons on VOC2007)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-6.tif"/>
</fig>
</sec>
<sec id="s4_7">
<label>4.7</label>
<title>Visualization</title>
<p>In this section, we visualize the object detection module and the dynamic graph convolutional network introduced in this paper.</p>
<sec id="s4_7_1">
<label>4.7.1</label>
<title>Visualization of the Object Detection Module</title>
<p>We input the original image into the YOLOv5 network for object detection, which shows that YOLOv5 has the capacity to detect objects in the picture. Some examples are shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, where the first column represents the input image, the second column represents the image after YOLOv5 object detection, and the last column shows the prediction scores for each category resulting from the whole framework.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Visualization of the object detection module</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-7.tif"/>
</fig>
<p>As can be seen from the figure, our framework is able to recognize the various types of objects in the image and get their location in the image. When a category does not exist in the image, the YOLOv5 network cannot recognize it. In the fourth example, when the scene in the picture is dimly lit, it is easy to ignore the object in the picture using convolutional neural network, but this shortcoming can be well compensated by using YOLOv5.</p>
</sec>
<sec id="s4_7_2">
<label>4.7.2</label>
<title>Visualization of the Dynamic Graph Convolutional Networks</title>
<p>In our paper, the input of our dynamic graph convolutional network is converted, so the correlation matrix of the dynamic graph convolutional network <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> changed accordingly. We can look at the correlation matrix of the dynamic GCN to observe the contribution of the object detection module and word vector embedding we use.</p>
<p>It can be seen from <xref ref-type="fig" rid="fig-8">Fig. 8</xref> that the truth values of the input original image are &#x201C;person&#x201D;, &#x201C;dog&#x201D; and &#x201C;sofa&#x201D;. Comparing <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msubsup><mml:mi>A</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msubsup><mml:mi>A</mml:mi><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> in (a) and (b) in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, it can be seen that &#x201C;sofa&#x201D; and &#x201C;dog&#x201D; have enhanced correlation with people. Similar consequence can be seen for the two rows &#x201C;sofa&#x201D; and &#x201C;dog&#x201D;. From the visualization of dynamic graph convolutional networks, we can see that our approach has good capability in establishing and capturing label semantic relationships.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Visualization of the dynamic graph convolutional networks ((a): No change, (b): Object detection module and word embedding)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_53938-fig-8.tif"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>In this work, we introduce a groundbreaking approach by integrating the YOLOv5 object detection model with dynamic graph convolutional networks for multi-label image classification. We present the Object-GCN framework, leveraging the YOLOv5 and ResNet101 architectures to extract visual features, which serve as the content-aware representation for each category. Within the dynamic graph convolutional network, we concatenate GloVe pre-trained word vectors with content-aware vectors to form the vertices of the GCN, thereby enhancing the integration of semantic and visual features. We have conducted rigorous experiments on public datasets and devised ablation studies to validate our methodology. The results of these experiments substantiate the significant contributions of our proposed enhancements.</p>
<p>Our proposed Object-GCN demonstrates commendable performance in the domain of multi-label image classification. However, there remains ample scope for further refinement and advancement. In our proposed model, the trained object detector is used to extract the visual features of each category, which requires additional labeling boxes and a certain training cost. Secondly, we use a concatenation method to fuse text and image features. In the future, we will use a multimodal low-rank bilinear method to fuse visual features and semantic features to generate the nodes of the graph, so that the graph convolutional network can better learn the relationship between vision and semantics. In the following work, we will explore how the combination of category word vectors and content-aware representation vectors can achieve the best results (concatenate or add). Then, we will explore how to combine our research with Transformers to achieve better results.</p>
</sec>
</body>
<back>
<ack>
<p>The authors would like to thank the editors and reviewers.</p>
</ack>
<sec><title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec><title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: Study conception and design: Xiaoyu Liu; data collection: Xiaoyu Liu; analysis and interpretation of results: Yong Hu; draft manuscript preparation: Xiaoyu Liu, Yong Hu. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The datasets used to support the findings of this study are publicly available on <ext-link ext-link-type="uri" xlink:href="http://cocodataset.org">http://cocodataset.org</ext-link> (accessed on 21 July 2023) and <ext-link ext-link-type="uri" xlink:href="http://host.robots.ox.ac.uk/pascal/VOC/">http://host.robots.ox.ac.uk/pascal/VOC/</ext-link> (accessed on 24 July 2023).</p>
</sec>
<sec><title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Ji</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Bai</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Guo</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Zuo</surname></string-name></person-group>, &#x201C;<article-title>Texts as images in prompt tuning for multi-label image recognition</article-title>,&#x201D; in <conf-name>Proc. IEEE Int. Conf. Comput. Vis.</conf-name>, <publisher-loc>Paris, France</publisher-loc>, <year>2023</year>, pp. <fpage>2808</fpage>&#x2013;<lpage>2817</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Fan</surname></string-name>, and <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Visual attention consistency for human attribute recognition</article-title>,&#x201D; <source>Int. J. Comput. Vis.</source>, vol. <volume>130</volume>, no. <issue>4</issue>, pp. <fpage>1088</fpage>&#x2013;<lpage>1106</lpage>, <year>2022</year>. doi: <pub-id pub-id-type="doi">10.1007/s11263-022-01591-y</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>D. Z.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>GCL: Gradient-guided contrastive learning for medical image segmentation with multi-perspective meta labels</article-title>,&#x201D; in <conf-name>Proc. 31st ACM Int. Conf. Multimed.</conf-name>, <publisher-loc>Ottawa, ON, Canada</publisher-loc>, <year>2023</year>, pp. <fpage>463</fpage>&#x2013;<lpage>471</lpage>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. V.</given-names> <surname>Demochkin</surname></string-name> and <string-name><given-names>A. V.</given-names> <surname>Savchenko</surname></string-name></person-group>, &#x201C;<article-title>Multi-label image set recognition in visually-aware recommender systems</article-title>,&#x201D; <source>Anal. Images, Social Netw. Texts: 8th Int. Conf.</source>, Kazan, Russia, 2019, pp. <fpage>291</fpage>&#x2013;<lpage>297</lpage>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Monta&#x00F1;&#x00E9;s</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Senge</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Barranquero</surname></string-name>, <string-name><given-names>J. R.</given-names> <surname>Quevedo</surname></string-name>, <string-name><given-names>J. J.</given-names> <surname>del Coz</surname></string-name> and <string-name><given-names>E.</given-names> <surname>H&#x00FC;llermeier</surname></string-name></person-group>, &#x201C;<article-title>Dependent binary relevance models for multi-label classification</article-title>,&#x201D; <source>Pattern Recognit.</source>, vol. <volume>47</volume>, no. <issue>3</issue>, pp. <fpage>1494</fpage>&#x2013;<lpage>1508</lpage>, <year>2014</year>. doi: <pub-id pub-id-type="doi">10.1016/j.patcog.2013.09.029</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Ji</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Deep ranking for image zero-shot multi-label classification</article-title>,&#x201D; <source>IEEE Trans. Image Process.</source>, vol. <volume>29</volume>, pp. <fpage>6549</fpage>&#x2013;<lpage>6560</lpage>, <year>2020</year>. doi: <pub-id pub-id-type="doi">10.1109/TIP.2020.2991527</pub-id>; <pub-id pub-id-type="pmid">32406834</pub-id></mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Song</surname></string-name>, and <string-name><given-names>J.</given-names> <surname>Luo</surname></string-name></person-group>, &#x201C;<article-title>Improving pairwise ranking for multi-label image classification</article-title>,&#x201D; in <conf-name>Proc. IEEE Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Hawaii, HI, USA</publisher-loc>, <year>2017</year>, pp. <fpage>1837</fpage>&#x2013;<lpage>1845</lpage>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C. -K.</given-names> <surname>Yeh</surname></string-name>, <string-name><given-names>W. -C.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>W. -J.</given-names> <surname>Ko</surname></string-name>, and <string-name><given-names>Y. -C. F.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Learning deep latent space for multi-label classification</article-title>,&#x201D; in <conf-name>Proc. AAAI Conf. Artif. Intell.</conf-name>, <publisher-loc>San Francisco, CA, USA</publisher-loc>, <year>2017</year>, pp. <fpage>2838</fpage>&#x2013;<lpage>2844</lpage>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Wen</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Multilabel image classification via feature/label co-projection</article-title>,&#x201D; <source>IEEE Trans. Syst. Man Cybern. Syst.</source>, vol. <volume>51</volume>, no. <issue>11</issue>, pp. <fpage>7250</fpage>&#x2013;<lpage>7259</lpage>, <year>2021</year>. doi: <pub-id pub-id-type="doi">10.1109/TSMC.2020.2967071</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Mao</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<article-title>CNN-RNN: A unified framework for multi-label image classification</article-title>,&#x201D; in <conf-name>Proc. IEEE Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Las Vegas, NV, USA</publisher-loc>, <year>2016</year>, pp. <fpage>2285</fpage>&#x2013;<lpage>2294</lpage>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Lyu</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Wu</surname></string-name>, and <string-name><given-names>M.</given-names> <surname>Tan</surname></string-name></person-group>, &#x201C;<article-title>Attend and imagine: Multi-label image classification with visual attention and recurrent neural networks</article-title>,&#x201D; <source>IEEE Trans. Multim.</source>, vol. <volume>21</volume>, no. <issue>8</issue>, pp. <fpage>1971</fpage>&#x2013;<lpage>1981</lpage>, <year>2019</year>. doi: <pub-id pub-id-type="doi">10.1109/TMM.2019.2894964</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>T. N.</given-names> <surname>Kipf</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Welling</surname></string-name></person-group>, &#x201C;<article-title>Semi-supervised classification with graph convolutional networks</article-title>,&#x201D; <year>2017</year>, <comment><italic>arXiv:1609.02907</italic></comment>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z. -M.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>X. -S.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Wang</surname></string-name>, and <string-name><given-names>Y.</given-names> <surname>Guo</surname></string-name></person-group>, &#x201C;<article-title>Multi-label image recognition with graph convolutional networks</article-title>,&#x201D; in <conf-name>Proc. IEEE/CVF Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Los Angeles, CA, USA</publisher-loc>, <year>2019</year>, pp. <fpage>5177</fpage>&#x2013;<lpage>5186</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Hui</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Wu</surname></string-name>, and <string-name><given-names>L.</given-names> <surname>Lin</surname></string-name></person-group>, &#x201C;<article-title>Learning semantic-specific graph representation for multi-label image recognition</article-title>,&#x201D; in <conf-name>Proc. IEEE/CVF Int. Conf. Comput. Vis.</conf-name>, <publisher-loc>Seoul, Republic of Korea</publisher-loc>, <year>2019</year>, pp. <fpage>522</fpage>&#x2013;<lpage>531</lpage>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Ye</surname></string-name>, <string-name><given-names>J.</given-names> <surname>He</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Wu</surname></string-name>, and <string-name><given-names>Y.</given-names> <surname>Qiao</surname></string-name></person-group>, &#x201C;<article-title>Attention-driven dynamic graph convolutional network for multi-label image recognition</article-title>,&#x201D; in <conf-name>Comput. Vis. ECCV 2020: 16th European Conf.</conf-name>, <publisher-loc>Glasgow, UK</publisher-loc>, <year>2020</year>, pp. <fpage>649</fpage>&#x2013;<lpage>665</lpage>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Feng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Jin</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Lyu</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>GM-MLIC: Graph matching based multi-label image classification</article-title>,&#x201D; <year>2021</year>, <italic>arXiv:2104.14762</italic>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T. -Y.</given-names> <surname>Lin</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Common objects in context</article-title>,&#x201D; in <conf-name>Comput. Vis. ECCV 2014: 13th European Conf.</conf-name>, <publisher-loc>Zurich, Switzerland</publisher-loc>, <year>2014</year>, pp. <fpage>740</fpage>&#x2013;<lpage>755</lpage>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Everingham</surname></string-name>, <string-name><given-names>L. V.</given-names> <surname>Gool</surname></string-name>, <string-name><given-names>C. K. I.</given-names> <surname>Williams</surname></string-name>, <string-name><given-names>J. M.</given-names> <surname>Winn</surname></string-name>, and <string-name><given-names>A.</given-names> <surname>Zisserman</surname></string-name></person-group>, &#x201C;<article-title>The pascal visual object classes (VOC) challenge</article-title>,&#x201D; <source>Int. J. Comput. Vis.</source>, vol. <volume>88</volume>, no. <issue>2</issue>, pp. <fpage>303</fpage>&#x2013;<lpage>338</lpage>, <year>2010</year>. doi: <pub-id pub-id-type="doi">10.1007/s11263-009-0275-4</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Deng</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Socher</surname></string-name>, <string-name><given-names>L. J.</given-names> <surname>Li</surname></string-name>, and <string-name><given-names>F. F.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>ImageNet: A large-scale hierarchical image database</article-title>,&#x201D; in <conf-name>2009 IEEE Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Miami, FL, USA</publisher-loc>, <year>2009</year>, pp. <fpage>248</fpage>&#x2013;<lpage>255</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>V. O.</given-names> <surname>Yazici</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Gonzalez-Garcia</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ramisa</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Twardowski</surname></string-name>, and <string-name><given-names>J. V. D.</given-names> <surname>Weijer</surname></string-name></person-group>, &#x201C;<article-title>Orderless recurrent models for multi-label classification</article-title>,&#x201D; in <conf-name>Proc. IEEE/CVF Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Seattle, USA</publisher-loc>, <year>2020</year>, pp. <fpage>13437</fpage>&#x2013;<lpage>13446</lpage>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Xu</surname></string-name>, and <string-name><given-names>L.</given-names> <surname>Lin</surname></string-name></person-group>, &#x201C;<article-title>Multi-label image recognition by recurrently discovering attentional regions</article-title>,&#x201D; in <conf-name>Proc. IEEE Int. Conf. Comput. Vis.</conf-name>, <publisher-loc>Venice, Italy</publisher-loc>, <year>2017</year>, pp. <fpage>464</fpage>&#x2013;<lpage>472</lpage>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Cao</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Chen</surname></string-name>, and <string-name><given-names>Q.</given-names> <surname>Niu</surname></string-name></person-group>, &#x201C;<article-title>Multi-label image recognition with two-stream dynamic graph convolution networks</article-title>,&#x201D; <source>Image Vis. Comput.</source>, vol. <volume>113</volume>, <year>2021</year>, Art. no. <fpage>104238</fpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Liang</surname></string-name>, and <string-name><given-names>B.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>Capsule graph neural network for multi-label image recognition (Student Abstract)</article-title>,&#x201D; in <conf-name>Proc. AAAI Conf. Artif. Intell.</conf-name>, <publisher-loc>Vancouver, BC, Canada</publisher-loc>, <year>2022</year>, vol. <volume>36</volume>, pp. <fpage>13117</fpage>&#x2013;<lpage>13118</lpage>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hu</surname></string-name>, and <string-name><given-names>T.</given-names> <surname>Su</surname></string-name></person-group>, &#x201C;<article-title>Mining semantic information with dual relation graph network for multi-label image classification</article-title>,&#x201D; <source>IEEE Trans. Multim.</source>, vol. <volume>26</volume>, pp. <fpage>1143</fpage>&#x2013;<lpage>1157</lpage>, <year>2024</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ge</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Cao</surname></string-name></person-group>, &#x201C;<article-title>Scene-aware label graph learning for multi-label image classification</article-title>,&#x201D; in <conf-name>Proc. IEEE/CVF Int. Conf. Comput. Vis.</conf-name>, <publisher-loc>Paris, France</publisher-loc>, <year>2023</year>, pp. <fpage>1473</fpage>&#x2013;<lpage>1482</lpage>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Lanchantin</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Ordonez</surname></string-name>, and <string-name><given-names>Y.</given-names> <surname>Qi</surname></string-name></person-group>, &#x201C;<article-title>General multi-label image classification with transformers</article-title>,&#x201D; in <conf-name>Proc. IEEE/CVF Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Nashville, TN, USA</publisher-loc>, <year>2021</year>, pp. <fpage>16478</fpage>&#x2013;<lpage>16488</lpage>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Transformer-based dual relation graph for multi-label image recognition</article-title>,&#x201D; in <conf-name>Proc. IEEE/CVF Int. Conf. Comput. Vis.</conf-name>, <publisher-loc>Montreal, QC, Canada</publisher-loc>, <year>2021</year>, pp. <fpage>163</fpage>&#x2013;<lpage>172</lpage>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhao</surname></string-name>, and <string-name><given-names>J.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>M3TR: Multi-modal multi-label recognition with transformer</article-title>,&#x201D; in <conf-name>Proc. 29th ACM Int. Conf. Multimed.</conf-name>, <publisher-loc>Chengdu, China</publisher-loc>, <year>2021</year>, pp. <fpage>469</fpage>&#x2013;<lpage>477</lpage>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Ouyang</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>HSVLT: Hierarchical scale-aware vision-language transformer for multi-label image classification</article-title>,&#x201D; in <conf-name>Proc. 31st ACM Int. Conf. Multimed.</conf-name>, <publisher-loc>Ottawa, ON, Canada</publisher-loc>, <year>2023</year>, pp. <fpage>4768</fpage>&#x2013;<lpage>4777</lpage>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Dou</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hu</surname></string-name>, and <string-name><given-names>Z.</given-names> <surname>Zheng</surname></string-name></person-group>, &#x201C;<article-title>Feature learning network with transformer for multi-label image classification</article-title>,&#x201D; <source>Pattern Recognit.</source>, vol. <volume>136</volume>, <year>2023</year>, Art. no. <fpage>109203</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.patcog.2022.109203</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Khosla</surname></string-name>, <string-name><given-names>&#x00C0;.</given-names> <surname>Lapedriza</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Oliva</surname></string-name>, and <string-name><given-names>A.</given-names> <surname>Torralba</surname></string-name></person-group>, &#x201C;<article-title>Learning deep features for discriminative localizaion</article-title>,&#x201D; in <conf-name>Proc. IEEE Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Las Vegas, NV, USA</publisher-loc>, <year>2016</year>, pp. <fpage>2921</fpage>&#x2013;<lpage>2929</lpage>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>He</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ren</surname></string-name>, and <string-name><given-names>J.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Deep residual learning for image recognition</article-title>,&#x201D; in <conf-name>Proc. IEEE Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Las Vegas, NV, USA</publisher-loc>, <year>2016</year>, pp. <fpage>770</fpage>&#x2013;<lpage>778</lpage>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Bochkovskiy</surname></string-name>, <string-name><given-names>C. -Y.</given-names> <surname>Wang</surname></string-name>, and <string-name><given-names>H. -Y. M.</given-names> <surname>Liao</surname></string-name></person-group>, &#x201C;<article-title>YOLOv4: Optimal speed and accuracy of object detection</article-title>,&#x201D; <year>2020</year>, <italic>arXiv:2004.10934</italic>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Ren</surname></string-name>, <string-name><given-names>K.</given-names> <surname>He</surname></string-name>, <string-name><given-names>R. B.</given-names> <surname>Girshick</surname></string-name>, and <string-name><given-names>J.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Faster R-CNN: Towards real-time object detection with region proposal networks</article-title>,&#x201D; <source>IEEE Trans. Pattern Anal. Mach. Intell.</source>, vol. <volume>39</volume>, no. <issue>6</issue>, pp. <fpage>1137</fpage>&#x2013;<lpage>1149</lpage>, <year>2017</year>. doi: <pub-id pub-id-type="doi">10.1109/TPAMI.2016.2577031</pub-id>; <pub-id pub-id-type="pmid">27295650</pub-id></mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>C. -Y.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Bochkovskiy</surname></string-name>, and <string-name><given-names>H. -Y. M.</given-names> <surname>Liao</surname></string-name></person-group>, &#x201C;<article-title>YOLOv7: Trainable bag-of-freebies sets new state-of-the-art for real-time object detectors</article-title>,&#x201D; <year>2023</year>, <italic>arXiv:2207.02696</italic>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Pennington</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Socher</surname></string-name>, and <string-name><given-names>C. D.</given-names> <surname>Manning</surname></string-name></person-group>, &#x201C;<article-title>GloVe: Global vectors for word representation</article-title>,&#x201D; in <conf-name>Proc. 2014 Conf. Empirical Methods Natural Lang. Process. (EMNLP)</conf-name>, <publisher-loc>Doha, Qatar</publisher-loc>, <year>2014</year>, pp. <fpage>1532</fpage>&#x2013;<lpage>1543</lpage>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Mikolov</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Corrado</surname></string-name>, and <string-name><given-names>J.</given-names> <surname>Dean</surname></string-name></person-group>, &#x201C;<article-title>Efficient estimation of word representations in vector space</article-title>,&#x201D; <year>2013</year>, <italic>arXiv:1301.3781</italic>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Joulin</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Grave</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Bojanowski</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Douze</surname></string-name>, <string-name><given-names>H.</given-names> <surname>J&#x00E9;gou</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Mikolov</surname></string-name></person-group>, &#x201C;<article-title>FastText.zip: Compressing text classification models</article-title>,&#x201D; <year>2016</year>, <italic>arXiv:1612.03651</italic>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. L.</given-names> <surname>Maas</surname></string-name>, <string-name><given-names>A. Y.</given-names> <surname>Hannun</surname></string-name>, and <string-name><given-names>A. Y.</given-names> <surname>Ng</surname></string-name></person-group>, &#x201C;<article-title>Rectifier nonlinearities improve neural network acoustic models</article-title>,&#x201D; in <conf-name>ICML Workshop Deep Learn. Audio Speech Lang. Process.</conf-name>, <publisher-loc>Atlanta, GA, USA</publisher-loc>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Ge</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Yang</surname></string-name>, and <string-name><given-names>Y.</given-names> <surname>Yu</surname></string-name></person-group>, &#x201C;<article-title>Multi-evidence filtering and fusion for multi-label classification, object detection and semantic segmentation based on weakly supervised learning</article-title>,&#x201D; in <conf-name>Proc. IEEE Conf. Comput. Vis. Pattern Recognit.</conf-name>, <publisher-loc>Salt Lake City, UT, USA</publisher-loc>, <year>2018</year>, pp. <fpage>1277</fpage>&#x2013;<lpage>1286</lpage>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Paszke</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Automatic differentiation in PyTorch</article-title>,&#x201D; in <source>31st Conference on Neural Information Processing Systems (NIPS 2017)</source>, <publisher-loc>Long Beach, CA, USA</publisher-loc>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>He</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Xu</surname></string-name>, and <string-name><given-names>D.</given-names> <surname>Tao</surname></string-name></person-group>, &#x201C;<article-title>Reinforced multi-label image classification by exploring curriculum</article-title>,&#x201D; in <conf-name>Proc. AAAI Conf. Artif. Intell.</conf-name>, <publisher-loc>New Orleans, LA, USA</publisher-loc>, <year>2018</year>, vol. <volume>32</volume>, pp. <fpage>3183</fpage>&#x2013;<lpage>3190</lpage>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Simonyan</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Zisserman</surname></string-name></person-group>, &#x201C;<article-title>Very deep convolutional networks for large-scale image recognition</article-title>,&#x201D; <year>2015</year>, <italic>arXiv:1409.1556</italic>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wei</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>HCP: A flexible CNN framework for multi-label image classification</article-title>,&#x201D; <source>IEEE Trans. Pattern Anal. Mach. Intell.</source>, vol. <volume>38</volume>, no. <issue>9</issue>, pp. <fpage>1901</fpage>&#x2013;<lpage>1907</lpage>, <year>2016</year>. doi: <pub-id pub-id-type="doi">10.1109/TPAMI.2015.2491929</pub-id>; <pub-id pub-id-type="pmid">26513778</pub-id></mixed-citation></ref>
</ref-list>
</back></article>