<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A NLP and YOLOv8-Integrated Approach for Enabling Visually Impaired Individuals to Interpret Their Environment</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Roberta Avanzato</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lorenzo Mandelli</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cristian Randieri</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer, Control and Management Engineering, Sapienza University of Rome</institution>
          ,
          <addr-line>Via Ariosto 25, Roma, 00185</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Electrical, Electronic and Computer Engineering University of Catania</institution>
          ,
          <addr-line>Catania</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>e-Campus University</institution>
          ,
          <addr-line>Via Isimbardi, 10, 22060 Novedrate (CO)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>ifconTEC Service GmbH</institution>
          ,
          <addr-line>Im Finigen 3, 28832 Achim</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>25</fpage>
      <lpage>33</lpage>
      <abstract>
        <p>Image captioning represents a significant challenge within the field of Computer Vision. This task involves processing an image as input, identifying objects within it, comprehending the relationships between these objects, including their implicit characteristics, and generating a concise description as output. Given the vast number of potential interactions, acquiring suficient training examples is a formidable task. Prior research has demonstrated that objects and predicates, when involved in less common relationships, occur more frequently when considered independently. Consequently, the proposed solution involves training two distinct visual models for objects and predicates, which are subsequently combined to capture as many relationships as possible. This study aims to leverage the information obtained regarding detected objects and their relationships to generate a comprehensive description of the image. By facilitating user interaction through Visual Question Answering, a task that bridges Computer Vision and Natural Language Processing, we can create an interactive approach to image captioning. Given a question and an image, the system is designed to reason based on both the image content and general knowledge, and generate an accurate answer. We believe that such a system provides an efective method for visually impaired individuals to understand the content of an image.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;NLP</kwd>
        <kwd>YOLOv8</kwd>
        <kwd>Support Systems</kwd>
        <kwd>Automatic Classification</kwd>
        <kwd>Convolutional Neural Networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Assistive technologies strive to enhance the quality of life
for individuals with visual impairments by facilitating
access to various forms of content. This paper concentrates
on the development of a system capable of interpreting
photographs. Determining the most efective method for
describing an image is a complex task, even when performed
by humans. There are no universal guidelines for deciding
which critical information should be emphasized,
particularly when the objective is to render an image accessible to
a visually impaired person. Often, in an attempt to provide
a more detailed understanding, one might resort to drawing
parallels closely related to personal experiences or
preferences. This approach not only results in a highly subjective
description but also risks creating divergent perceptions
between the describer and the listener, efectively
transforming a single image into two distinct interpretations.
The implementation of a system to achieve this objective
would undoubtedly necessitate the provision of a more
objective description. The only experiential basis we can rely
on is the frequency with which our network identifies a pair
of subject and object linked by a specific predicate. Machine
learning has revolutionized the field of scientific research
in recent years. It has enabled researchers to process and
analyze large datasets, leading to new discoveries and
insights. Machine learning algorithms can identify patterns
and correlations in data that may not be immediately
apparent [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This has been particularly impactful in fields such
as neuroscience, climate science [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and human machine
interaction [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], where the volume of data can be
overwhelming [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ], as well to support people with impairments, as
well asl physical or mental ilnesses or dificulties of various
kind [
        <xref ref-type="bibr" rid="ref6 ref7 ref8 ref9">6, 7, 8, 9</xref>
        ]. Additionally, machine learning is being used
to predict outcomes and trends, aiding in hypothesis
generation and testing. However, the use of machine learning
in scientific research also presents challenges, particularly
in terms of ensuring the transparency and reproducibility
of results. Upon receiving an image as input, we propose
a visual modeling approach aimed at discerning the visual
relationships between depicted objects. These relationships
are elucidated through a scene graph (depicted in Figure 1), a
graph-based data structure wherein nodes represent objects
and edges denote predicates. This structured representation
of the scene is subsequently stored in a Knowledge Base,
formatted as ⟨ −  − ⟩. Subsequently,
user interaction is facilitated, ofering brief descriptions of
the depicted image and enabling further inquiry through
Visual Question Answering tasks. The initial phase involves
developing a model capable of discerning object
relationships within an image. This entails separate training for
both object and predicate recognition, followed by their
integration to infer relationships [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Prior studies have
demonstrated the eficacy of learning these components
individually due to their frequent occurrence in isolation.
Consequently, the model can infer specific relationships
not explicitly encountered by leveraging the semantics of
more commonly observed relationships. In our approach, we
employ YOLO (You Only Look Once) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] for object
recognition, while constructing a dedicated training model solely
for relationship predictio YOLO represents a cutting-edge
real-time object detection system acclaimed for its
exceptional speed and accuracy. However, it occasionally presents
a discrepancy in the number and labels of detected objects.
This challenge is addressed by aligning YOLO classes with
the most analogous ones anticipated by our network. Our
experimentation began with a baseline model trained solely
on visual and spatial features, which was subsequently
augmented by integrating a language model [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] leveraging
word embeddings. The subsequent phase involves training
a model capable of responding to questions based on the
visual content of an image. However, it is conceivable that
the sought-after answer may be independent of the image
and necessitate information not present within it.
Consequently, it is imperative to construct a Knowledge Base. This
serves the dual purpose of preserving extracted information
in an accessible format and integrating diverse sources of
knowledge. As previously noted, Visual Question
Answering (VQA) has garnered attention from both the Computer
Vision and Natural Language Processing domains. Tasked
with providing correct answers given an image and a
question, the VQA module’s experimentation commenced with
a baseline model trained solely on image feature extraction
and question encoding. Subsequently, we incorporated a
parallel co-attention model [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] to identify image regions
pertinent to answer prediction. In addressing questions, we
adhere to established protocols for text data handling,
including contraction resolution, tokenization, padding for
uniform sentence lengths, and word embedding for
semantic representation, whereby words closer in the vector space
denote similar meanings. Upon answer generation,
typically in written format for this task, the final step entails
integrating a text-to-speech module to facilitate auditory
communication of the obtained information to the user. The
system exhibits favorable performance when presented with
images of moderate complexity.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Utilizing neural networks for generating image descriptions
represents an intriguing intersection of image
understanding methodologies and natural language processing
techniques. A seminal study by Lu et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] presents a model
that trains separate visual models for objects and predicates.
Specifically, a Convolutional Neural Network (CNN), such
as VGG net, is employed to classify objects, while a second
VGG net is utilized to identify predicates based on the union
of bounding boxes of the interacting objects. These
models are then integrated to predict a diverse range of visual
relationships within each image. The rationale behind this
approach is rooted in the semantic relatedness of
relationships: by integrating a language module, the model is primed
to select the appropriate relationship more accurately. As
relationships that occur frequently in the training data are
more likely to recur, they are easier to infer. However, even
if a relationship has not been previously encountered, if it
shares semantic similarities with known relationships, the
model should still be able to comprehend it. To facilitate this,
the two objects involved in a relationship are projected into
a word embedding space using a pre-trained word vector
(e.g., word2vec) and concatenated to form the relationship
vector space. The projection function is then optimized to
ensure that similar relationships are situated close together;
the distance between relationships is proportional to the
word2vec distance between their constituent objects and
predicate. Furthermore, Lu et al. introduced a Visual
Relationship Detection (VRD) dataset, comprising 5000 images
featuring 100 object categories and 70 predicates categorized
into four types: verbs, prepositions, spatial relations, and
comparatives. This dataset serves as the foundation for our
experimental endeavors. Jung et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] further refined the
previously described model by training the language
module using softmax loss instead of the Kullback-Leibler (K, L)
loss. They observed that the Kullback-Leibler loss function
encourages similar visual relationships to converge while
pushing dissimilar relationships apart. However, even in
the absence of this loss function, word vectors naturally
25–33
tend to cluster similar visual relationships together.
Additionally, the L loss function assigns higher likelihood to
high-frequency data and lower likelihood to low-frequency
data, leading to a more natural distribution of likelihoods
for predicates based on their frequency. Furthermore, the
integration of the language and visual modules was
modified to include a point-wise multiplication between them.
Subsequently, the image, presumed to contain all
necessary information, along with a textual question, serves as
the starting point for Visual Question Answering (VQA)
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Typically, the sought-after answer in VQA tasks is a
brief phrase or a few words. In some approaches, Recurrent
Neural Networks (RNNs) with Long Short-Term Memory
(LSTM) cells are employed. RNNs are adept at processing
both questions and answers of variable lengths. The
question and image features, the latter derived from a pre-trained
Convolutional Neural Network (CNN) for object
recognition, are jointly input to an encoder LSTM. The resulting
ifxed-size feature vector is then passed to a decoder LSTM
for answer generation. This process can be framed as a
sequence generation task or treated as a classification problem
in some instances. Alternatively, bidirectional LSTMs are
utilized to capture relationships between distant words in
the question more efectively. Alternatively, CNNs are
employed to process questions, with features from both the
image and text embedded in a shared space. In contrast to
approaches that simply concatenate image and question
vectors, Lu et al. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] proposed an Attentional Network aimed
at generating a more informative query vector. This
network comprises three key steps: employing a VGG net to
extract image representations, utilizing LSTMs and CNNs
to capture the semantic nuances of textual input, and
incorporating a parallel co-attention layer for answer prediction.
Specifically, in the final step, image features are combined
with a three-level question representation to compute the
attention distribution over diferent regions of the image. The
dataset employed in their study is COCO-QA, which
comprises 123,287 images, along with 78,736 training questions
and 38,948 test questions categorized into four types: object,
number, color, and location. Answers to these questions are
all single-word responses, consistent with the format used
in our experiments. However, the structure of the questions
varies, and extracting ⟨subject - predicate - object⟩ triplets
from a sentence is typically achieved [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] using a parser
that constructs a tree rooted in the subject (S) and with
three children: a noun phrase (NP), a verbal phrase (VP),
and punctuation. The subject of the sentence is typically
found within the NP subtree, while the predicate is
identiifed as the deepest verb descendant within the VP subtree.
Objects are typically located within prepositional phrase
(PP), noun phrase (NP), or adjective phrase (ADJP) subtrees,
specifically as the first noun or adjective encountered.
Leveraging this parsing mechanism facilitates the establishment
of a connection between the VQA model and the knowledge
base.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. The proposed method</title>
      <p>In Figure 2, we present the architectural overview of our
interactive image captioning system. Specifically, the
relationship detection module is responsible for extracting
comprehensive information from the image, while the
knowledge base, serves as a repository for storing this information.
Subsequently, users engage with the system through an
interactive module, allowing them to receive explanations or
pose questions. Responses to these inquiries are provided
either by querying the knowledge base or through the Visual
Question Answering module. Subsequent sections ofer a
detailed exposition of each of these modules.</p>
      <p>
        As previously mentioned, the relationship detection
module encompasses the fusion of two distinct systems: one
dedicated to object detection and the other to relationship
identification. YOLO (You Only Look Once) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] represents
a neural network architecture designed to predict
bounding boxes and class probabilities across entire images,
implicitly incorporating contextual information. Renowned
for its exceptional speed, YOLO surpasses other real-time
systems by achieving more than twice the mean average
precision. Additionally, YOLO demonstrates a capacity to
learn generalizable object representations, enhancing its
resilience when applied to novel domains. In the context
of our discussion, bounding boxes denote regions within
images encompassing potential objects, specified by
coordinates in the format: [, , ℎ, ℎℎ]. We
leverage YOLOv3 to extract objects from images, subsequently
utilizing its output to establish relationships between them,
as elaborated upon in the subsequent module description.
Initially, employing YOLO for object detection inevitably
introduces a discrepancy in class labels between YOLO’s 80
classes and the 100 classes expected by our network.
Consequently, it becomes imperative to establish associations
between the most similar labels to mitigate this discrepancy.
Subsequently, we turn our attention to the computation of
spatial features within an image. Instead of utilizing a
spatial vector solely encoding the normalized location and size
of each object’s bounding box within an image, we adopt
a methodology proposed by Jung et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. This method
incorporates the Intersection Over Union (IOU) and
normalized relative location (x, y) based on the subject box center,
as well as normalized subject and object sizes. Additionally,
it includes a containment flag for both the subject and object,
where the subject flag equals 1 if the subject box contains
the object box, and 0 otherwise. Here, bounding boxes are
represented as [, , , ]. Computing the
IOU involves dividing the area of overlap between bounding
boxes by the area of their union. In the baseline
configuration, visual features from the sub-image are extracted using
a VGG16 model pre-trained on ImageNet and concatenated
with spatial features. The sub-image is crafted to encompass
both the subject and object. Original images are rescaled
to dimensions of 256 × 256 pixels, followed by extraction
of a 512 × 7 × 7 feature map using the VGG net. This
feature map is then flattened into a one-dimensional vector
and transformed into a 1 × 1024 vector through a series
of fully connected layers. Subsequently, this feature
vector is combined with the spatial features and utilized as
input for a classifier to generate the final prediction. Upon
integration of a language module, relationships are
projected into an embedding space to facilitate recognition of
similar relationships. Utilizing the simplified FastText
opensource library, word embedding and text classification are
achieved. Specifically, only the 100 objects present in the
dataset are considered, as the entire FastText vocabulary
is excessively large for memory constraints. Subsequently,
another VGG16 model is employed to extract a 512 × 7 × 7
feature map, which is then resized into a 1 × 2048 vector
through fully connected layers. These features are
concatenated with spatial features and transformed into a 1 × 1024
vector. Following this, word embedding is extracted and
element-wise multiplication is performed between
concatenated word features and spatial/image features. The
resultant features are utilized for relation prediction through
a linear classifier. The comprehensive model architecture
is depicted in Figure 3. To prevent duplicate relationships
involving the same pair of objects, the scene graph is
postprocessed. Specifically, for each pair of relationships, if the
subject of one pair matches the object of the next pair and
vice versa, only the more relevant relationship is retained.
Relevance is determined by computing the probability of
encountering the subject-object pair in the training set. The
relationship with the higher occurrence probability is selected,
ensuring inclusion of the relationship on which the model
has more training data and thus greater confidence. For
example, if the relationships ⟨_0 −  − ℎ_1⟩
and ⟨ℎ_1 − _ − _0⟩ are encountered,
the probabilities of the subject-object pairs "person-horse"
and "horse-person" are computed based on their occurrences
in the training set. The more relevant relationship, such as
"person-horse" in this scenario, is retained, resulting in the
inclusion of only the ⟨_0, , ℎ_1⟩ relation in
the scene graph. This approach ensures that relationships
with greater training data support are prioritized, enhancing
the model’s confidence in its predictions.
      </p>
      <p>
        Another problem faced with the scene graph, is the choice
of which objects couple in the image is good to be taken
in consideration to compute the relation. If all the objects
couple are taken, the number of generated relationship is
exponential in terms of elements in the scene. For this reason,
it is useful to filter out some couple. We approach this issue
by computing the normalized (with respect to the image
size) distance between the centers of the bounding boxes
for each pair of them. If the normalized distance is lower
than a threshold (that we choose to be 0.12, with empirical
tests), then the couple is considered to be valid, otherwise
it is discarded. In this way, only near enough objects are
considered to be in relation, and we avoid the explosion
of relations with complex images. The Visual Relationship
Detection (VRD) dataset consists of 5000 images featuring
100 distinct object categories and 70 predicates. Specifically,
the dataset comprises 37,993 relationships spanning 6,672
unique relationship types, with an average of 24.25
predicates associated with each object category. The training
set comprises 4000 images, while the remaining 1000
images constitute the test set. Notably, 1,877 relationships are
unique to the test set and are absent from the training set. To
optimize training eficiency, we adopt a selective approach
in predicate selection. Among the 70 predicates provided by
the dataset, we prioritize those exhibiting a higher frequency
of occurrence, specifically selecting predicates that appear
more than 75 times in the training set. This strategy aims to
foster focused learning within the network, enhancing its
capacity to discern and generalize patterns from the
training data. In the Table 1, the improvement obtained with the
addition of the language is highlighted with respect to the
baseline, by the clear increase in accuracy value achieved.
As observed, the accuracy metric, while not egregiously low,
does not elicit enthusiasm. This observation aligns with
findings in the literature [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], which underscore the challenging
nature of Visual Relationship Detection, despite its relative
simplicity for humans. Nonetheless, the modest accuracy
warrants a comprehensive investigation. Upon
scrutinizing the dataset, it becomes apparent that certain classes
are underrepresented, with limited occurrences of some
relationships. Consequently, the overall accuracy sufers,
reflecting the challenges posed by data sparsity. However,
an examination of the macro-precision score (refer to Table
2) reveals promising results for larger classes, indicating
satisfactory performance in these instances. One potential
VRD
baseline
65.30%
with language
81.90%
approach to address the observed low performance is the
adoption of more complex network configurations, such
as Graph Neural Networks, along with leveraging larger
datasets. However, due to constraints imposed by limited
computational resources, these approaches are not feasible
within the scope of this study.
      </p>
      <p>Subsequently, the performance of the other component
of the system, YOLO-v8, pre-trained on the COCO dataset,
is assessed using the same dataset employed for the
Relationship Detection Model. Evaluation of the YOLO model
for object detection is conducted using the Intersection over
Union (IoU) metric. IoU quantifies the degree of overlap
between two bounding boxes: one representing the ground
truth and the other corresponding to the predicted
bounding box. A IoU value of 1 indicates perfect overlap between
the two bounding boxes.</p>
      <p>To determine the validity of object detection, a threshold
of 0.5 is set for IoU. If the IoU value is greater than or equal
to the threshold, the object detection is classified as True
Positive (TP); otherwise, it is classified as False Positive
(FP) indicating an erroneous detection. Moreover, instances
where a ground truth object is present in the image but
remains undetected by the model are classified as False
Negative (FN).</p>
      <p>Subsequently, the precision metric is computed using the
conventional formula:</p>
      <p>Precision =</p>
      <p>+  
Table 3 presents the precision results for both the VRD model
and the YOLO model, juxtaposing their performances to
underscore the influence of each component on the overall
task performance.</p>
      <p>Notably, the evaluation reveals that YOLO, pre-trained on
the COCO dataset, does not yield satisfactory performance
for this task when applied to a distinct dataset such as the
one used for Visual Relationship Detection.</p>
      <p>VRD with language</p>
      <p>YOLO-v8
precision
81.90%
77.31%</p>
      <p>The foundation of our system lies in a Knowledge Base
(KB), designed to fulfill several key functions: (1)
recording information provided by the Relationship Detection
module; (2) capturing insights gained from user interaction
during the execution of the Visual Question Answering
(VQA) module; and (3) facilitating the VQA Module in
generating responses. The Resource Description Framework
(RDF), proposed by the World Wide Web Consortium (W3C),
serves as the underlying framework for storing and sharing
knowledge across the web. We leverage this framework to
construct our knowledge base. It’s important to note that
we refrain from establishing connections with web URIs of
RDF concepts, opting instead for a fully localized knowledge
base. In this subsection, we elaborate on how RDF triplets
are utilized to fullfil the aforementioned tasks. Upon
extraction of the scene graph from the image by the Relationship
Detection module, all triplets are stored in the knowledge
base. Additionally, the knowledge base is initialized with a
rudimentary, manually crafted prior knowledge structure,
encompassing all YOLO classes. The structure of this prior
knowledge is illustrated in Figure 4, serving as a
demonstration of how a more intricate graph can be constructed to
enhance the system’s performance in specific scenarios.</p>
      <p>Once all objects within the scene are linked to the prior
knowledge graph via an "is_a" relation (for instance, if a dog
is present in the image with an identifier of 1, the triplet
⟨_1 − _ − ⟩ is appended), all object-to-object
relationships inferred by the preceding module are
incorporated into the knowledge base (KB). The primary role
of the RDF triplets is to aid the VQA model. The pipeline
utilized to support the VQA model with the knowledge base
is depicted in Figures 5a and 5b. These figures outline the
algorithmic process employed to leverage the information
stored within the knowledge base for VQA tasks.</p>
      <p>
        For each question in which the subject is implicit,
facilitated by the "focus mechanism" (refer to section ??), the
predicate is extracted to construct the relationship (for
details on predicate extraction from questions and relationship
construction, see the subsequent subsection). Subsequently,
if a triplet in the form of ⟨ −  − ⟩
already exists in the knowledge base (KB), the object string
is retrieved as the answer. This process enables the system
to respond to questions for which relevant knowledge is
already available in the KB, whether the answer was
pre(a)
(b)
viously provided by the VQA module or included in the
prior knowledge. In the absence of such a triplet, the VQA
module is invoked, and the resultant answer is then stored
in the knowledge base before being presented to the user.
Adding the answer as new information involves
extracting the relationship from the question and utilizing the
answer as the object of the triplet. In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], an algorithm
for extracting triplets from sentences is introduced (refer
to Figure ?? and ??). We leverage this concept to devise an
algorithm for extracting relationships from questions.
Initially, a parse tree of the question is generated using the
BLLIP parser [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Subsequently, we employ the
"EXTRACTPREDICATE" function to obtain the predicate, with slight
modifications: we execute the function on the entire tree
rather than solely the VP_subtree, given that questions may
not consistently contain VP/NP subtrees. Additionally, we
consider the PRT tag, not just the ADVP tag, to capture the
attribute of the verb. Because our goal is to extract a relation,
we also need a support for the predicate, in order to do not
obtain the same relation string for questions with the same
predicate. For example, if we consider the two following
questions: "What is the color of this object?" and "What is
the genre of this book?", we will obtain the same predicate
and so the same relation. This can be a problem, because the
two questions will be considered the same when we try to
answer to the question with the KB module. For this reason,
the actual relation is built with the predicate on which we
append the "reference noun" of the sentence. This "reference
noun" is chosen taking all the NN leafs of the parse tree. In
the figure ??, an example of relation extraction is illustrated.
Given our objective of extracting relationships, it is essential
to consider support for the predicate to avoid generating
identical relation strings for questions sharing the same
predicate. For instance, if we analyze the following
questions: "What is the color of this object?" and "What is the
genre of this book?", both questions share the predicate "is,"
potentially leading to the generation of identical relations.
This situation poses a challenge, as the system may treat
these questions as equivalent when attempting to provide
answers using the KB module. To address this issue, the
constructed relation incorporates the predicate augmented by
the "reference noun" of the sentence. This "reference noun"
is determined by considering all the NN leaf nodes of the
parse tree. For the Visual Question Answering (VQA) model,
we develop both a simple baseline and a model incorporating
co-attention mechanism. This section provides a detailed
explanation of both models, followed by a presentation of
other attempted approaches. Additionally, we demonstrate
the superior performance of the co-attention model over
alternative methods. In the baseline approach, we employ
the most straightforward strategy for VQA, as depicted in
Figure 6. Initially, the image features are extracted using a
pre-trained VGG16 model trained on the ImageNet dataset to
capture the visual semantics of the image. Subsequently, the
question is encoded using a one-hot encoding scheme and
processed through an LSTM network to obtain the features
of the question’s words within the same semantic space
as the image. Next, utilizing the vector representations of
the image and the question, a point-wise multiplication is
conducted to derive a feature vector that encapsulates the
combination of both inputs. Finally, a prediction is made
using a series of fully connected layers to determine the answer
to the question posed. In this approach, while the network
is adept at discerning relevant words for the task based on
the image feature vector, the results are less than
satisfactory. This is primarily due to the network’s incapacity to
pinpoint specific image regions crucial for accurate question
answering. Notably, the model’s performance falters when
tasked with providing precise responses, particularly when
answers depend on nuanced image regions. Consequently,
integrating an attention mechanism becomes imperative. As
previously discussed, efectively answering questions about
an image requires understanding the relevant image regions
containing pertinent information. To tackle this challenge,
we propose employing a co-attention mechanism between
the image and the question. The overarching architecture
of our model, , draws significant inspiration from [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. A
crucial aspect of this methodology is considering not only
"where to look" within the image to address the question
but also "which words to attend to" from the question itself.
By incorporating both aspects, our model aims to achieve a
more comprehensive understanding of the question-image
relationship, thereby enhancing its ability to generate
accurate responses. Following the methodology outlined in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ],
our system comprises three primary components: (1) the
image model, which leverages a pre-trained VGG-16 network
to extract high-level image representations, yielding one
vector for each region; (2) the question model, employing a
Long Short-Term Memory (LSTM) network to derive a
semantic vector from the question, alongside a Convolutional
Neural Network (CNN) to capture information across
various levels; and (3) the co-attention model, responsible for
identifying image regions and words pertinent to the
question for subsequent answer prediction. The image features
are extracted using a VGG-16 network pre-trained on the
ImageNet dataset, subsequently fine-tuned for several epochs.
Specifically, high-level features are extracted to generate a
representation for each region of the image (refer to Figure
7). The images undergo resizing to dimensions of 448 × 448
pixels. Subsequently, the output of the final pooling layer of
the VGG-16 network is obtained, resulting in a structured
output of dimensions 512 × 14 × 14. This process yields
14 × 14 feature vectors, each with a dimensionality of 512,
corresponding to the 196 regions, each spanning 32 × 32
pixels. With this representation, we can efectively compute
attention on regions of interest by combining it with the
question embedding. We construct a question
representation at three levels: (a) word level, (b) phrase level, and (c)
question level. At the word level, mirroring the baseline
approach, the question undergoes one-hot encoding with
a pre-trained FastText embedding layer, yielding a
wordembedded representation of the question:
      </p>
      <p>Q = {q1, ..., q}
At the phrase level, we apply a one-dimensional convolution
on the word embedding vectors. Specifically, at each word
location, we compute the inner product of the word vectors
with filters of three window sizes: unigram, bigram, and
trigram. For the t-th word, the convolution output with
window size s is computed as:</p>
      <p>
        qˆ, = ℎ(Wq:+− 1),  ∈ {1, 2, 3}
where W represents the weight parameters. Subsequently,
we apply max-pooling across diferent n-grams at each word
location to obtain phrase-level features:
qˆ = (qˆ1,, qˆ2,, qˆ3,),  ∈ {1, 2, ...,  }
(3)
At the question level, we pass qˆ through a Long
ShortTerm Memory (LSTM) unit and extract the hidden vector
at time t. This process enables us to capture the
information encompassed in the entire question. The co-attention
model, inspired by the Parallel Co-Attention mechanism
in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], is pivotal in our system. It involves computing the
similarity between image and question features across all
pairs of image-locations and question-locations. Beginning
with an image feature map V ∈ R×  and the question
representation Q ∈ R×  , we calculate the afinity matrix
C ∈ R ×  as follows:
      </p>
      <p>C = tanh(Q WV)
(4)
(1)
(2)
Here, W ∈ R×  represents the weight parameters.
Subsequently, we use this afinity matrix to predict image and
question attention maps:</p>
      <p>H = tanh(WV + (WQ)C)
H = tanh(WQ + (WV)C )
a = softmax(wℎH)
a = softmax(wℎH)
Here, W, W ∈ R× , wℎ, wℎ ∈ R are the weight
parameters, and a ∈ R and a ∈ R represent the
attention probabilities for each image region v and word
q, respectively. The attention-weighted image and question
features are then computed as weighted sums:</p>
      <p>vˆ = ∑︁ v,
=1</p>
      <p>qˆ = ∑︁  q</p>
      <p>
        =1
This parallel co-attention process is conducted at each level
of the hierarchy, resulting in vˆ and qˆ, where  ∈ {, , }.
Finally, the answer is predicted based on the co-attended
image and question features from all three levels, employing
a multi-layer perceptron to recursively encode the attention
features:
h = tanh(W(qˆ + vˆ))
h = tanh(W[(qˆ + vˆ), h])
h = tanh(W[(qˆ + vˆ), h])
p = softmax(Wℎh)
Here, W, W, W and Wℎ are the weight parameters, [· ]
denotes concatenation, and p represents the probability
distribution over all possible answers. Drawing inspiration
from [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], our first approach involves augmenting the word
embedding vector with two additional embeddings: lemma
embedding and POS embedding. The lemma embedding is
generated using a simple embedding layer for the lemmas
of the words in the question, while the POS embedding is
obtained by POS-tagging the words and utilizing the
resulting tags to produce the embedding vector. This integration
allows for the inclusion of both the POS-tag information and
lemma information within the question embedding. In
contrast, the second approach explores the concept of stacked
attention layers [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Here, we utilize the attention map H
to generate an attention-weighted question through
pointwise multiplication:
qˆ = H * qˆ
(14)
Subsequently, we leverage the resulting attention-weighted
question for a second co-attention layer. Despite these
attempts, neither of these methods yield improvements to
the model, as demonstrated in Table ??. Further details are
omitted due to their lack of eficacy.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>
        We assess the proposed models using two datasets: the
VizWiz dataset [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] and the COCO-QA dataset [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. VizWiz
comprises both single-word and multi-word answers. It
consists of 20,523 training image/question pairs, 205,230
training answer/answer confidence pairs, 4,319 validation
image/question pairs, 43,190 validation answer/answer
conifdence pairs, and 8,000 test image/question pairs. Given our
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
25–33
requirement for single-word answers and the ability to use
the accuracy metric to gauge performance, we filter out all
multi-word answers from the dataset. Additionally, since
each question/answer pair includes ten proposed answers,
we select the first word that does not have an
"unanswerable" label with a "yes" or "maybe" confidence score. We
designate "unanswerable" only if all ten proposals carry this
label, aiming to minimize noise in the answers. Despite these
measures, the dataset’s performance remains subpar due to
the presence of numerous "noisy questions" incompatible
with our project’s scope. Consequently, we opt to utilize
weights trained on the COCO-QA dataset for the VQA model
integrated into the final system. COCO-QA is a dataset
exclusively comprising single-word answers, encompassing
78,736 training samples and 38,948 test samples.
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Case study</title>
      <p>
        Before the interaction commences, the system initially
presents the user with a list of all objects in the scene,
followed by an explanation of the relationships between them
(comprising all the triplets extracted from the Relationship
Extraction module). Subsequently, the interaction begins,
and the system enters state 1. Here, the user has the option
to request a repeat of the object list or the interaction
details between them. Additionally, the user can utilize the
"focus mechanism" to choose an object of interest within
the scene. The "focus mechanism" draws inspiration from
the natural exploratory behavior of the eyes when
examining an image. Initially, the eyes survey the entire picture
to gain an overview before focusing on specific objects to
scrutinize details of interest. In this interactive system, users
can autonomously select the object they wish to focus on
and explore specific details through questions. Essentially,
the system awaits a request to focus on a particular object
within the scene. Each object is assigned a unique identifier.
If the chosen object is the only one of its category in the
image, the user can simply state the object’s label.
Otherwise, the user must first specify the label, after which the
system assists in disambiguating the object of interest. For
instance, the user may initially state: "I want to focus on
a person," prompting the system to inquire about the id of
the desired person, listing all available options for selection.
Once the focus is established, the system transitions to state
2, enabling the user to pose questions regarding the subject
of interest (explicitly identified in the creation of triplets
inserted into the Knowledge Base. It is crucial to note that
the sub-image contained within the bounding box of the
subject of interest is utilized as input for the VQA model,
rather than the entire image. Upon request, the focus can
be altered, reverting the system back to state 1. Initially, the
system prompts the user to wait while preliminary image
extractions occur. Subsequently, the system elucidates the
relationships between objects in the image and awaits user
commands. The user selects a focus, transitioning to state
2. Modularity is an important feature of our system and in
this section is presented the way in which the system can
be expanded to extract more information from the image
in order to improve the user experience. In particular, there
are two approaches for modularity: (1) new features can be
extracted from the whole image, in order to better give a
general overview or (2) new modules can be added to
support the VQA model to accommodate the use of the system
in specialized environments. To show how this mechanism
works we have developed two new neural models, one for
each kind of modularity. Below the two networks are
presented, then the way in which the modularity is integrated
in the implementation is illustrated. With this module, our
aim is to determine in which place the image is set, in order
to give a very useful information about the environment
represented in the image to the user. We believe that this
improves considerably the understanding of the image. For
this scope, that is to show how the system can be improved
adding modules, we use a simple and light dataset: 15-Scene
Dataset [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. It contains 4,485 gray-scale images of 15 scene
categories (see Table 4): 5 indoor and 10 outdoor. Each class
contains from 210 to 410 scene images, and the image size is
about 300 × 250. We use 80% of the dataset for train and 20%
for validation (the number of images, per class, is showed
in Table 4).
      </p>
      <p>
        We can afirm that with this simple model, easily
integrated in the modular mechanism adopted by our system,
the user experience can be considered improved and can
encourage to add other module to extract image features useful
for understanding. Modularity serves as a cornerstone of
our system’s design, facilitating its extensibility to extract
additional information from images, thereby enhancing the
user experience. In this section, we explore two avenues for
modularity: (1) the extraction of new features from the
entire image to provide a comprehensive overview, and (2) the
addition of new modules to bolster the VQA model’s
capabilities, catering to specialized environments. To demonstrate
this mechanism, we have developed two new neural models,
each catering to one aspect of modularity. The subsequent
sections detail these networks, followed by an illustration
of how modularity is seamlessly integrated into the
implementation. The first module aims to determine the location
depicted in the image, thereby providing valuable contextual
information about the depicted environment to the user. We
anticipate that this addition significantly enhances image
comprehension. For demonstration purposes, showcasing
the system’s capacity for enhancement through modular
additions, we utilize a lightweight dataset: the 15-Scene
Dataset [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Comprising 4,485 grayscale images spanning
15 scene categories (as delineated in Table 4), the dataset
encompasses a diverse array of indoor and outdoor scenes.
Each class contains between 210 to 410 scene images, with
an average image size of approximately 300 × 250 pixels. We
partition 80% of the dataset for training and reserve 20% for
25–33
validation, as outlined in Table 4. To facilitate the seamless
integration of new modules into the system, we have devised
an extension module. As previously elucidated, there are
two conceivable approaches to extension. The first involves
implementing a module capable of extracting information
from the entire image to furnish new features that pertain to
the scene’s overview (an exemplification of this approach is
provided by the Scenes Classification network). Conversely,
the second approach aims to augment the VQA’s capabilities
to address questions pertaining to specific domains beyond
its intrinsic capacity. In both scenarios, a register file houses
the list of all registered modules, which the system accesses
for reference. Each module must adhere to a predefined
interface for implementation and furnish access to a class
with a designated name. Specifically, image feature modules
must provide a method that, when presented with an
image, returns a class representative of the features extracted
by the module (such as a scene descriptor for our Scenes
Classification Network). On the other hand, VQA support
modules must implement a method to determine if the
module can address a given question. If afirmative, the module
must also furnish a method to generate an answer when
presented with an image.
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>In this study, we introduce a novel image captioning system
designed to facilitate interactive exploration for visually
impaired individuals. We present a framework that combines
visual relation detection with visual question answering,
enabling users to focus on specific points of interest within
an image interactively. Our findings demonstrate that even
with rudimentary images, this system can efectively discern
the image’s key features and cater to user inquiries, thereby
satisfying user curiosity. Moreover, we showcase the
system’s versatility through the integration of a knowledge
base, enabling it to respond to informed inquiries and
incorporate additional feature extraction capabilities through
modularity. We emphasize the significance of modularity
within our system, exemplifying its functionality through
networks dedicated to dog breed classification and scene
classification. These examples elucidate how the system
can be expanded to address specific requirements,
underscoring modularity’s pivotal role. Looking ahead, future
iterations of the system aim to broaden its capabilities by
incorporating additional information extraction methods
from images. Specifically, we plan to implement models for
clothing classification and genre discrimination, enhancing
the system’s versatility and utility. We envision that this
interactive approach to image captioning will catalyze
further exploration in the field, encouraging researchers to
delve into dynamic image exploration methods that mirror
humans’ innate propensity to navigate scenes and focus on
preferred details.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This work has been developed at is.Lab() Intelligent Systems
Laboratory at the Department of Computer, Control, and
Management Engineering, Sapienza University of Rome
(https:// islab.diag.uniroma1.it). Their preliminary studies
have been done with the support of the students Angrisani
and Lo Befaro. The work has also been partially supported
from Italian Ministerial grant PRIN 2022 “ISIDE: Intelligent
Systems for Infrastructural Diagnosis in smart-concretE”, n.
2022S88WAY - CUP B53D2301318, and by the Age-It: Ageing
Well in an ageing society project, task 9.4.1 work package 4
spoke 9, within topic 8 extended partnership 8, under the
National Recovery and Resilience Plan (PNRR), Mission 4
Component 2 Investment 1.3—Call for tender No. 1557 of
11/10/2022 of Italian Ministry of University and Research
funded by the European Union—NextGenerationEU, CUP
B53C22004090006.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Bonanno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Capizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gagliano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>Optimal management of various renewable energy sources by a new forecasting method</article-title>
          ,
          <year>2012</year>
          , pp.
          <fpage>934</fpage>
          -
          <lpage>940</lpage>
          . doi:
          <volume>10</volume>
          .1109/SPEEDAM.
          <year>2012</year>
          .
          <volume>6264603</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>G.</given-names>
            <surname>Capizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Sciuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Tramontana</surname>
          </string-name>
          ,
          <article-title>A multithread nested neural network architecture to model surface plasmon polaritons propagation</article-title>
          ,
          <source>Micromachines</source>
          <volume>7</volume>
          (
          <year>2016</year>
          ). doi:
          <volume>10</volume>
          .3390/mi7070110.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>G.</given-names>
            <surname>Capizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          ,
          <article-title>Lessening stress and anxiety-related behaviors by means of aidriven drones for aromatherapy</article-title>
          , volume
          <volume>2594</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>7</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Alfarano</surname>
          </string-name>
          , G. De Magistris,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mongelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Starczewski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>A novel convmixer transformer based architecture for violent behavior detection 14126 LNAI (</article-title>
          <year>2023</year>
          )
          <fpage>3</fpage>
          -
          <lpage>16</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>031</fpage>
          -42508-
          <issue>0</issue>
          _
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>I. E.</given-names>
            <surname>Tibermacine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tibermacine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Guettala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <article-title>Enhancing sentiment analysis on seed-iv dataset with vision transformers: A comparative study</article-title>
          ,
          <year>2023</year>
          , pp.
          <fpage>238</fpage>
          -
          <lpage>246</lpage>
          . doi:
          <volume>10</volume>
          .1145/ 3638985.3639024.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N. N.</given-names>
            <surname>Dat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ponzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Vincelli</surname>
          </string-name>
          ,
          <article-title>Supporting impaired people with a following robotic assistant by means of end-to-end visual target navigation and reinforcement learning approaches</article-title>
          , volume
          <volume>3118</volume>
          ,
          <year>2021</year>
          , pp.
          <fpage>51</fpage>
          -
          <lpage>63</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Ponzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wajda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Brociek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>Analysis pre and post covid-19 pandemic rorschach test data of using em algorithms and gmm models</article-title>
          , volume
          <volume>3360</volume>
          ,
          <year>2022</year>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>63</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Iacobelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ponzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>Eye-tracking system with low-end hardware: Development and evaluation</article-title>
          ,
          <string-name>
            <surname>Information</surname>
          </string-name>
          (Switzerland)
          <volume>14</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          . 3390/info14120644.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>F.</given-names>
            <surname>Fiani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>An advanced solution based on machine learning for remote emdr therapy</article-title>
          ,
          <source>Technologies</source>
          <volume>11</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .3390/ technologies11060172.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L.</given-names>
            <surname>Cewu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ranjay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Michael</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.-F.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Visual relationship detection with language priors</article-title>
          ,
          <source>European Conference on Computer Vision</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Joseph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Santosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <article-title>You only look once: Unified, real-time object detection</article-title>
          ,
          <source>Conference on Computer Vision</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Jaewon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Jongyoul</surname>
          </string-name>
          ,
          <article-title>Visual relationship detection with language priors and softmax</article-title>
          ,
          <source>European Conference on Computer Vision</source>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Parikh</surname>
          </string-name>
          ,
          <article-title>Hierarchical question-image co-attention for visual question answering 29 (</article-title>
          <year>2016</year>
          ). URL: https://proceedings.neurips.cc/paper/2016/file/ 9dcb88e0137649590b755372b040afad-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>W.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Damien</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chunhua</surname>
          </string-name>
          , D. Anthony, v. d. H. Anton,
          <article-title>Visual question answering: A survey of methods and datasets</article-title>
          ,
          <source>Computer Vision</source>
          and Image
          <string-name>
            <surname>Understanding</surname>
          </string-name>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R.</given-names>
            <surname>Delia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lorand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fortuna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Grobelnik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mladení</surname>
          </string-name>
          ,
          <article-title>Triplet extraction from sentences (</article-title>
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>E.</given-names>
            <surname>Charniak</surname>
          </string-name>
          , M. Johnson,
          <article-title>Coarse-to-fine n-best parsing and MaxEnt discriminative reranking (</article-title>
          <year>2005</year>
          )
          <fpage>173</fpage>
          -
          <lpage>180</lpage>
          . URL: https://www.aclweb.org/anthology/ P05-1022. doi:
          <volume>10</volume>
          .3115/1219840.1219862.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Diego</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Anton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ivan</surname>
          </string-name>
          ,
          <article-title>A simple and accurate syntax-agnostic neural model for dependency-based semantic role labeling</article-title>
          ,
          <source>Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL</source>
          <year>2017</year>
          ), Vancouver, Canada (
          <year>2017</year>
          )
          <fpage>411</fpage>
          -
          <lpage>420</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smola</surname>
          </string-name>
          ,
          <article-title>Stacked attention networks for image question answering (</article-title>
          <year>2016</year>
          )
          <fpage>21</fpage>
          -
          <lpage>29</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2016</year>
          .
          <volume>10</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>G.</given-names>
            <surname>Danna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Qing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yinan</surname>
          </string-name>
          , G. Anhong,
          <string-name>
            <given-names>J.</given-names>
            <surname>Abigale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Stangl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Jefrey</surname>
          </string-name>
          ,
          <article-title>Vizwiz-priv: A dataset for recognizing the presence and purpose of private visual information in images taken by blind people (</article-title>
          <year>2019</year>
          ). URL: https://www.ischool.utexas.edu/~dannag/ publications/CVPR2019_VizWiz-Priv.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>R.</given-names>
            <surname>Mengye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ryan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Richard</surname>
          </string-name>
          ,
          <article-title>Exploring models and data for image question answering (</article-title>
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lazebnik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schmid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ponce</surname>
          </string-name>
          ,
          <article-title>Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories 2 (</article-title>
          <year>2006</year>
          )
          <fpage>2169</fpage>
          -
          <lpage>2178</lpage>
          . doi:
          <volume>10</volume>
          .1109/ CVPR.
          <year>2006</year>
          .
          <volume>68</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>