<!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>Pollution with Purpose: The Role of Data Quality in Trustworthy AI</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Leonie Louisa Etzold</string-name>
          <email>leonie.etzold@dlr.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tim Robin Kosack</string-name>
          <email>tim.kosack@dlr.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oscar Hernán Ramírez-Agudelo</string-name>
          <email>oscar.ramirezagudelo@dlr.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Clemens Danda</string-name>
          <email>clemens.danda@dlr.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael Karl</string-name>
          <email>michael.karl@dlr.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>German Aerospace Center, Institute for AI Safety and Security</institution>
          ,
          <addr-line>Rathausallee 12, 53757 Sankt Augustin</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>This paper contributes to the practical implementation of the third pillar of trustworthy AI: technical and social robustness. We enhance the robustness and reproducibility of an AI model through the integration of polluted data into the AI training process. To do so, the YOLO11n model backbone is fine-tuned with a subset of the PASCAL VOC12 benchmark data using diferent shares and intensities of a horizontal blur polluter in the training data. Through this approach we are able to reach a significant increase in robustness on similarly polluted test data. Hereby, the training of AI systems becomes better aligned with context- and environment-specific conditions. This approach does not only contribute to the technical robustness of AI systems but poses the opportunity to also boost their social robustness, by increasing their adaptability to diverse and dynamic real-world settings.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;robust AI</kwd>
        <kwd>data quality</kwd>
        <kwd>trustworthy AI</kwd>
        <kwd>data corruption</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Background and Related Work</title>
      <sec id="sec-2-1">
        <title>2.1. Data Quality</title>
        <p>
          While both the Ethics Guidelines for Trustworthy AI as well as the ALTAI are more focused on ethics
than engineering, some requirements allow the derivation of technical approaches for ethical problems
[
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Furthermore, most ethical requirements of the ALTAI are in some way connected to the technical
aspect of the quality of data being used during the AI life cycle: DQ is not only connected to robustness
and reproducibility, but also to key-issues of discrimination [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], privacy [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], and sustainability [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. The
EU Artificial Intelligence Act (‘AIA’) mandates that data quality and robustness be ensured in high-risk
AI systems (Art. 10 and 15 AIA). This specifically concerns the application of AI systems in contexts
such as social categorization or critical infrastructure – domains identified as carrying significant risks
of human rights infringement (Annex III). Specifically, the AI Act mandates that training, validation, and
testing datasets used in high-risk AI systems be relevant, representative, and to the best extent possible
free of errors. During the legislative process, the wording was somewhat relaxed, limiting responsibility
for residual risks that cannot reasonably be controlled (‘best extent possible’). Regarding robustness,
Art. 15 AIA requires that high-risk AI systems are ‘as resilient as possible’ achieved through technical
means such as redundancy solutions. This paper highlights specific technical aspects to strengthen
robustness by developing ’appropriate technical solutions to prevent or minimise harmful or otherwise
undesirable behaviour’ (Rec. 75 AIA).
        </p>
        <p>
          This paper is concerned with the impact of deteriorating DQ on the robustness of AI perception
models. ISO 5259:2024 [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] defines DQ as a characteristic which describes whether the data are in
compliance with the requirements set for a specified context. In the context of AI development, the
quality requirement can be defined as a prerequisite which needs to be met for the AI model to achieve
pre-defined quality properties (such as levels of performance). Inherent to these definitions is the
assumption that the quality of data afects the performance of AI models, which has been investigated
and afirmed thoroughly over the previous years [
          <xref ref-type="bibr" rid="ref7 ref8 ref9">7, 8, 9</xref>
          ]. As a result, the paradigm of data-centric AI
emerged postulating an intensified focus on the quality of data used for machine learning purposes
[
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ].
        </p>
        <p>
          It is to be diferentiated between data used during AI development and the new and unlabelled
inference data , the model is met with during usage. The larger the gap between these types of data is,
the more the performance of AI models sufers. However, for the development data to be completely
representative of every possible manifestation of inference data is hardly feasible due to the complexity
of real-world events. Besides diferences in distribution between data sets or temporal evolution due to
the non-stationarity of data [
          <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
          ], diferences between the quality of development and inference data
challenge the performance of AI models in application.
        </p>
        <p>As a method to mitigate this, corruption-based data augmentation is increasingly used as a standard
for safety-critical applications by training models with (partially) polluted data. Hereby, the model can
achieve increased robustness towards the type(s) of pollution it was trained with.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Robustness</title>
        <p>
          Social robustness of AI systems can be understood as their robustness to (unpredictable) social changes.
This may include erroneous or unseen data (e.g., incorrect data collection in marginalized groups) [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]
and shifted perspectives or goals (e.g., political goals or social perception). In this regard, acceptance
of AI systems and social robustness are interdependent: AI systems which are unable to adapt to new
(social) circumstances will most likely not be accepted. While this broad definition is highly dependent
on the respective context, the technical notion of robustness provides measures which reflect this
adaptation.
        </p>
        <p>
          Technical robustness provides a measure on the resilience of AI models towards sub-optimal
application environments. In this regard, AI robustness "refers to the ability of a system to maintain consistent
performance when exposed to diverse, unexpected or even adversarial inputs" [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Thus, robust AI
systems are resilient to noise, can perform with a variety of datasets, resist to adversarial attacks and
are both interpretable and explainable [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. In this paper, we focus on the resilience to noise.
        </p>
        <p>
          Formally, Zhang et al. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] define the technical robustness of an AI model as a measurement of
the diference between the correctness of the output of the model under optimal versus perturbed
conditions. When AI is applied in use cases which are time-critical, such as automated driving or disaster
management, the inference data is more prone to issues in data quality since the time available for data
collection and processing is limited during the usage phase. AI models which were developed under
optimal conditions with regard to data quality will lack robustness towards deteriorating inference data
quality [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. To investigate the robustness of AI models towards deteriorating data quality in inference
data, test data is polluted to imitate potentially occurring issues in inference data.
        </p>
        <p>
          We adapt Zhang et al.’s quantification of robustness [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] for our experiments as
with ( ) as the level of correctness of AI model  and ( ) signifying the AI model with
perturbations on inference data. To allow for a standardization of the interpretation of , we redesign
the formula as follows
        </p>
        <p>= ( ) − (( ))
 = 1 − (( ) − (( )).</p>
        <p>
          As a measure of the correctness  of the AI model, we choose the mean Average Precision (mAP),
i.e. the mean value of average precision over all classes. More specifically, the mAP averaged over
intersection over union (IoU) thresholds from 0.50 to 0.95 in steps of 0.05 (mAP50:95) is chosen which
was first introduced within the COCO documentation. It allows for a broad assessment of the model’s
performance balancing recall and precision. [
          <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
          ]
        </p>
        <p>Therefore, we define robustness as
 = 1 − ( @0.50 : 0.95  −  @0.50 : 0.95 )
(3)
with  @0.50 : 0.95 displaying the mean average precision on clean inference data and
 @0.50 : 0.95 on polluted inference data. Since the mAP@0.50:0.95 is limited to values
between 0 and 1, 1 signifying the highest possible precision, our measure of robustness  signals low
robustness to increased DQ issues in inference data when approaching 0 and high robustness if it
approaches 1. Once  exceeds 1, this signifies a better performance on polluted data compared to
optimal conditions with the gap in performance increasing with  approaching 2. Depending on the
model type and context of application, this equation works with any other performance indicator that
can be normalized to values between 0 and 1 with convergence to 1 indicating high performance. We
developed this notion of robustness to specifically consider machine learning models and it can be
adapted to other metrics of performance which can be normalized to values between 0 and 1, increasing
with performance. An in-depth comparison to other notions of robustness will be investigated in future
work.</p>
        <p>Since we are assessing the performance of each model on a multitude of pollution intensities,
robustness towards multiple intensities of pollution will be estimated by the application of an average
over the performance of the models on the diferent test intensities. In this case, the correctness of the
model with decreased quality of diferent intensities is defined as
(1)
(2)
(4)
(5)
∑︀=1  @0.50 : 0.95

with  signifying the number of diferent pollution intensities. For completion, the final formalization
for average robustness is
 = 1 − ( @0.50 : 0.95

−</p>
        <p>=1  @0.50 : 0.95
∑︀

)
or
 =
1 − ( @0.50 : 0.95  −</p>
        <p>=1  @0.50 : 0.95)
∑︀</p>
        <p>However, it is not possible to draw conclusions from neither  nor  on the level of performance
of the investigated models. Therefore, for a complete assessment, both  @0.50 : 0.95 and
 @0.50 : 0.95 or  @0.50 : 0.95  should be taken into account, respectively.</p>
        <p>
          The empirical work conducted in this paper adds to the previously published literature [
          <xref ref-type="bibr" rid="ref19 ref20 ref21">19, 20, 21</xref>
          ] as
it provides evidence that the robustness of an AI system can be enhanced by integrating deliberately
perturbed (or “polluted”) data into the training process.
.
        </p>
        <p>(6)</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>3.1. Data
The benchmark data set chosen for analysis is the PASCAL VOC12 data set [22]. It consists of 11,530
images containing 27,450 annotated objects from 20 classes from the categories Person, Animal, Vehicle,
and Indoor. PASCAL VOC12 was chosen due to its similarity to COCO which is the foundation for the
YOLO object detection models as described in Section 3.2. It is widely used for AI assessment within the
literature [23, 24]. The objects within PASCAL VOC12 are marked as dificult, truncated, or occluded, if
applicable. For the means of this analysis, the data set was subset to only include images that display
ground-based vehicles, i.e. bicycles, busses, cars, motorbikes, and trains. While the data set was subset
by the previously stated classes, the class Person was included additionally for training and inference.
Furthermore, objects that were marked as dificult were excluded, while objects marked as truncated
and occluded remain in the data set.</p>
      <p>The final data set consists of 2,055 images, including 7,504 objects from six classes. 1 A direct
comparison between the original and subset data set is displayed in Table 1 and class distribution is
displayed in Table 2. The images in the data set were resized such that the longest image side measures
416 pixels to obtain comparable pollution intensities across all images.
1Our code including the creation of the data set and all experiments will be made available online pending institute permission.
To get access to the repository, please contact the authors.
3.2. Model
We chose Ultralytics YOLO11 [25] as a state-of-the-art framework which is highly utilized for real-time
object detection across various domains [26, 27]. YOLO is widely used in the literature in research on
object detection and transfer learning [23, 28, 29]. Specifically, we are using YOLO11n as a pre-trained
model to fine-tune with our data set. YOLO11n is trained with the COCO data [ 30] set consisting of 80
classes, including ground-based vehicles and persons, rendering it fitting for the observed fictitious
use-case.</p>
      <sec id="sec-3-1">
        <title>3.3. Data Pollution</title>
        <p>As a polluter to test our hypotheses with, we choose a horizontal blur to mimic motion blur pollution,
which may occur when data collection includes either moving cameras or moving targets. We apply a
square convolutional kernel which averages over the horizontally neighbouring pixels. Following [31],
it can be formalized as
, [, ] =
{︃ 1

0
if −  ≤  ≤  and  = 0
otherwise
with  as the kernel width 2 + 1 and for  in the range of 1 to 22 in steps of 3, resulting in the
kernel width  ranging from 3 to 45 pixels in steps of 6. For kernel width , a pixel of input image  at
position ,  is convoluted to output pixel ′(, ) as follows</p>
        <p>′(, ) = 1 ∑︁ ( + , ).</p>
        <p>=−</p>
        <p>Following, the blur intensities will be expressed as the percentage of kernel width to maximum
image side length of 416 pixels, i.e. as /416%. This leads to a range of intensities of 0.72 to 10.82% in
steps of 1.5%. Figure 1 displays an example image with no blur as well as intensities of 0.72, 6.49, and
10.82%. While the image with low the lowest blur intensity is only marginally perturbed, the higher
blur intensities display a high level of pollution.
(7)
(8)</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.4. Model Training and Testing</title>
        <p>Transfer learning is used to train the model, i.e. the fine-tuning process with the data set described
in Section 3.1 is conducted using the back-bone of YOLO11n. For each experiment, the model set up
is held constant using the parameters in Table 3. For testing, the best model is chosen for each of the
experiments.</p>
        <p>A split ratio of 70% (1,439 images) for training and both 15% (308) for validation and test data was
applied and implemented using multi-label stratified split to ensure similar distribution across all
data sets. Each experiment including the splitting process was repeated over 10 seeds to mitigate the
possibility of randomly occurring bias in the distribution.
Training &amp; validation pollution shares 0%, 10% 20%, 40%, 60%, 80%, 100%
Test pollution shares 0%, 100%
Training &amp; validation pollution intensities 0.72%, 2.16%, 3.61%, 5.05%, 6.49%
Test pollution intensities 0.72%, 2.16%, 3.61%, 5.05%, 6.49%, 7.93%, 9.36%, 10.82%
Seeds 1, 2, 3, 4, 5, 6, 7, 8, 9, 10</p>
        <p>Within one seed, the model was trained using the same training and validation splits which were
varied in (1) the share of polluted data, and (2) the intensity of pollution. For each split, a baseline
model was trained on clean training and validation data. Table 4 displays the full list of experimental
parameters and values. The additional models were trained using shares between 10 and 100% of
polluted training and validation data and blur intensities between 0.72 and 6.49%. Each model was then
tested on a clean test set as well as test sets fully polluted with blur intensities of 7.93, 9.36, and 10.82%
additionally to those used for training.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.5. Ongoing Experiments on Additional Pollution Types</title>
        <p>To validate the experiments conducted in this paper, we are currently working on additional experiments
investigating further pollution types. While first results on experiments on Gaussian noise appear to
corroborate the results reported in the following section, the current status of the experiments is not
advanced enough to report on them.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>Figure 2 displays the performance of the diferent models on increasingly polluted test data for each
share of training pollution. The grey line corresponding to a training blur of 0% is trained on clean
data. It therefore acts as the baseline model and does not vary across the diferent shares (a) to (f). For
clean test data, the baseline model reaches a mAP of 0.92, indicating a good model performance under
unperturbed conditions. However, its decreases rapidly with increasing test pollution. While its mAP
comes within 0.5 for the first time at a blur intensity of 3.6%, it falls to 0.042 at the maximum pollution of
10.8%. The models with the smallest intensity of blur in the data mirrors the decline of the clean model,
however the performance is slightly better for polluted test blur, with the performance on polluted
test blur increasing with the share of polluted training data. Models with training intensities of 2.2 to
6.5% show more pronounced diferences compared to baseline, even at a low share of polluted training
data of 10%. In Figures 2 (a) to (e), the decrease in performance is much lower with increasing test
blur intensities than it is for baseline, with both higher shares and intensities of polluted training data
reducing the overall decrease in performance. While higher shares and intensities of polluted training
data decrease the performance on clean data slightly, the advantage polluted models have on polluted
test data is distinctly higher. For the model with 80% of training data polluted at the highest level of
6.5%, the decrease in mAP amounts to 0.048 compared to baseline on clean data, while it is by 0.648
higher than baseline at a test blur intensity of 10.8%. An interesting observation to be made is that even
though each model displayed in Figures 2 (a) to (e) is only familiar with clean data and data polluted
with the respective training intensity, the performance of the model also improves significantly on test
data of pollution intensities which are unfamiliar to the model. All models perform as well or better on
test data which is polluted in a lesser intensity than the model is trained with. This changes for Figure
2 (f) which displays the performance of models trained on fully polluted data. These models were not
made familiar with clean data during the fine-tuning process and generalize poorly to clean test data
while they also do not perform as well towards data with a lesser pollution intensity, resulting in them
peaking in performance on the pollution level their training data was polluted with. This underscores
an observation which holds true for all graphs in this figure: For each test intensity, the model trained
with the same pollution intensity reaches the highest performance within one training share. This
efect increases in pronunciation with increasing training share.</p>
      <p>To allow for the integration of these levels of performance into the concept of robustness as previously
defined in Section 2.2, Figure 3 displays the average robustness and their components. Figure 3 (a) shows
the components of Equation (3) for each of the models. At a share of 0%, the models were trained on clean
data showing the performance of the baseline model. The mAP on clean data ( @0.50 : 0.95)
indicates the performance of the trained models on clean test data. The models trained with the lowest
blur intensity of 0.7% remain almost constant in performance over the diferent shares of polluted
training data. It even increases performance slightly when introduced at lower levels. For higher train
blur intensities, increasing shares in polluted training data lead to a monotonous decline in performance
up to a share of 80%. The decline increases with the severity of pollution intensity and ranges from
a minimal decline of 0.003 for a training blur pollution of 0.7% to 0.048 for 6.5% compared to the
baseline performance of 0.92. The decrease is rather small, suggesting that generalization to clean
data can still be obtained to a large degree. However, at 100% polluted training data, average precision
decreases significantly for pollution exceeding the intensity of 0.7%. While the lightest pollution
intensity experiences only a small decline of 0.019, the higher training intensities increasingly plummet
with the 6.5% intensity dropping the maximum amount of 0.813. The average mAP over polluted data
( @0.50 : 0.95 ) show an average of the model performance on the diferent test pollution
intensities as expressed in Equation (4). For intensities above 0.7%, the highest increase in average
performance can be observed between clean training data and the lowest share of polluted training data
of 10%. From there on, average performance keeps on increasing moderately up to a training share of
80%. For shares up to 80% of polluted training data, all models perform better on clean data compared
to the models’ average performance on polluted data. However, at 100% polluted test data, performance
on clean test data drops below that on polluted data for all intensities but 0.7%.</p>
      <p>Figure 3 (b) displays the full measures of robustness as defined in Equations (5) and 6. It is apparent
that the average robustness increases both with intensity of training blur and share of polluted training
data, while the measures for average robustness converge with higher intensities. This increase is,
again, least pronounced for the lowest training blur intensity. At fully polluted training data, all models
from training intensity 2.2% and up exceed the mark of 1, indicating that the performance of these
models are worse on clean than on polluted data. We can observe the least robust model to be the
baseline model with an average robustness of 0.405. This indicates a gap between performance on
clean data and average performance on polluted data of 0.595. The highest level of average robustness
without reversing can be observed at training with a share of 80% of polluted training data at the highest
intensity of 6.5%. Here, the average robustness amounts to 0.939, indicating a gap between performance
on clean and polluted data of 0.061. However, this does not only come from the increase in performance
on polluted data, but also on a decrease on clean data of 0.042 compared to baseline.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion</title>
      <p>This paper’s results indicate a significant increase in robustness towards DQ deterioration in inference
data when models are trained with data that was perturbed with the corresponding pollution, in this
case horizontal blur. This adds to previous findings indicating that data which the model is made
familiar with during training is more easily identified during testing, even if the data undergoes a loss
of information. Our findings indicate that robustness increases with the share and intensity of polluted
training data. However, the trade-of between decrease of performance on clean data and increase on
polluted data increases with the same parameters. Therefore, it appears to be advised to balance both
the share and intensity of polluted training data based on observed or expected pollution in real-world
inference data to prevent a potentially unnecessary decrease in model performance on clean data. Thus,
the added value is highly dependent on the specific use case.</p>
      <p>An in-depth evaluation of both development and inference data is further advised to truly increase
trustworthiness through robustness from both a technical and social perspective. To do so, potential
quality issues within data must be identified dependent on the use case to subsequently introduce
relevant data corruptions in the training data.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion and Future Work</title>
      <p>
        This paper examined the interrelation between data quality, robustness, and the trustworthiness of
AI systems. We demonstrated that the robustness of an AI system can be enhanced by integrating
deliberately perturbed data into the training process. Hereby, the training of AI systems becomes better
aligned with context- and environment-specific conditions. This approach does not only contribute to
the technical robustness of AI systems but poses the opportunity to also boost their social robustness,
by increasing their adaptability to diverse and dynamic real-world settings. Incorporating new or
previously underrepresented features into data sets ofers the opportunity to better capture complex
social nuances, contributing to more context-aware and socially responsive AI systems. Enhancing
both technical and social robustness is closely linked to the third pillar of Trustworthy AI [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. While
improving the trustworthiness of AI systems is generally advantageous, it is particularly critical in
unpredictable high-risk scenarios such as floods, pandemics, or wildfires.
      </p>
      <p>There are some limitations to this work at this point in time which we want to address. First of all, the
results discussed correspond to the YOLO11n object detection model and need to be contextualised with
further research on additional model specifications. Furthermore, the perturbation type is limited both
in scope and transferability to real world blur. Future work may therefore focus on the identification
and as close as possible imitation of perturbations observed in real-world data and be tested on data that
displays real-world blur for validation purposes. Investigating whether this approach also facilitates
increased robustness to diferent types of pollution within one model is promising.</p>
      <p>Also, the applicability of this approach highly depends on the context within which the AI model is
used. Choosing suitable pollution types as well as intensities requires use-case specific investigation of
the sensors, expected environments and comparable data. Future research should interest itself with the
formalization of this process, whereas we expect a combination of both ex-ante and iterative approaches
to yield most promising results. Therefore, an in-depth focus on the use-case specific application is
essential.</p>
      <p>Finally, while we see this paper as a contribution to the third pillar of trustworthy AI, DQ is always
connected to ethical (e.g., data acquisition, completeness) and legal (e.g., data protection, AI Act) aspects.
Especially, if we want to have technical and social robustness as trust-enablers, it might be necessary
to add additional safeguards like (trained) human operators. Further exploration of this relation is
essential to deepen our understanding and move closer to realizing the vision of trustworthy AI.</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used GPT-4o in order to: Generate Literature Review
and Aid Programming. After using this tool/service, the authors reviewed and edited the content as
needed and take full responsibility for the publication’s content.
[22] M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, A. Zisserman,
The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results,
http://host.robots.ox.ac.uk/pascal/VOC/voc2012/index.html, 2012.
[23] N. Zhao, Enhancing object detection with yolov8 transfer learning: A voc2012 dataset study,
in: Proceedings of the 1st International Conference on Engineering Management, Information
Technology and Intelligence, SCITEPRESS - Science and Technology Publications, 2024, pp. 429–
434. doi:10.5220/0012939600004508.
[24] Q. Zhou, C. Yu, Z. Wang, Q. Qian, H. Li, Instant-teaching: An end-to-end semi-supervised object
detection framework, 2021. doi:10.48550/arXiv.2103.11402.
[25] G. Jocher, J. Qiu, Ultralytics YOLO11 (Version 11.0.0, License AGPL-3.0) [software], 2024. URL:
https://github.com/ultralytics/ultralytics.
[26] L. HRIC, J. A. BACIK, D. PERDUKOVA, Real-time object detection of simple drawings using
yolo11 on constrained datasets, MM Science Journal 2025 (2025). doi:10.17973/mmsj.2025_
03_2024118.
[27] M. Mao, M. Hong, Yolo object detection for real-time fabric defect inspection in the textile industry:</p>
      <p>A review of yolov1 to yolov11, Sensors (Basel, Switzerland) 25 (2025). doi:10.3390/s25072270.
[28] L.-H. He, Y.-Z. Zhou, L. Liu, W. Cao, J.-H. Ma, Research on object detection and recognition
in remote sensing images based on yolov11, Scientific reports 15 (2025) 14032. doi: 10.1038/
s41598-025-96314-x.
[29] M. A. R. Alif, Yolov11 for vehicle detection: Advancements, performance, and applications in
intelligent transportation systems, 2024. doi:10.48550/arXiv.2410.22898.
[30] T. Lin, M. Maire, S. J. Belongie, L. D. Bourdev, R. B. Girshick, J. Hays, P. Perona, D. Ramanan,
P. Dollár, C. L. Zitnick, Microsoft COCO: common objects in context, CoRR abs/1405.0312 (2014).</p>
      <p>URL: http://arxiv.org/abs/1405.0312. arXiv:1405.0312.
[31] A. Torralba, P. Isola, W. T. Freeman, Foundations of Computer Vision, Adaptive Computation
and Machine Learning series, MIT Press, 2024. URL: https://mitpress.mit.edu/9780262048972/
foundations-of-computer-vision/.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>European</given-names>
            <surname>Commission</surname>
          </string-name>
          and
          <article-title>Directorate-General for Communications Networks, Content and Technology, Ethics guidelines for trustworthy AI</article-title>
          ,
          <string-name>
            <surname>Publications</surname>
            <given-names>Ofice</given-names>
          </string-name>
          ,
          <year>2019</year>
          . doi: doi/10.2759/ 346720.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Stefani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Deligiannaki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Berro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jameel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hunger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bruder</surname>
          </string-name>
          , T. Krüger,
          <article-title>Applying the assessment list for trustworthy artificial intelligence on the development of ai supported air trafic controller operations</article-title>
          ,
          <source>in: 2023 IEEE/AIAA 42nd Digital Avionics Systems Conference (DASC)</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . doi:
          <volume>10</volume>
          .1109/DASC58513.
          <year>2023</year>
          .
          <volume>10311323</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Moussawi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. N.</given-names>
            <surname>Deng</surname>
          </string-name>
          , K. D. Joshi,
          <source>AI and Discrimination: Sources of Algorithmic Biases, SIGMIS Database 55</source>
          (
          <year>2024</year>
          )
          <fpage>6</fpage>
          -
          <lpage>11</lpage>
          . URL: https://doi.org/10.1145/3701613.3701615. doi:
          <volume>10</volume>
          .1145/ 3701613.3701615.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Giufrè</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Shung</surname>
          </string-name>
          ,
          <article-title>Harnessing the power of synthetic data in healthcare: innovation, application, and privacy</article-title>
          ,
          <source>NPJ digital medicine 6</source>
          (
          <year>2023</year>
          )
          <fpage>186</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chao</surname>
          </string-name>
          ,
          <article-title>Toward sustainability: Trade-of between data quality and quantity in crop pest recognition</article-title>
          ,
          <source>Frontiers in Plant Science</source>
          Volume
          <volume>12</volume>
          -
          <fpage>2021</fpage>
          (
          <year>2021</year>
          ). URL: https://www.frontiersin.org/ journals/plant-science/articles/10.3389/fpls.
          <year>2021</year>
          .
          <volume>811241</volume>
          . doi:
          <volume>10</volume>
          .3389/fpls.
          <year>2021</year>
          .
          <volume>811241</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>International</given-names>
            <surname>Organization for</surname>
          </string-name>
          <article-title>Standardization (ISO)</article-title>
          ,
          <source>ISO/IEC 5259-1</source>
          :2024:
          <article-title>Artificial intelligence - Data quality for analytics and machine learning (ML) - Part 1: Overview, terminology</article-title>
          , and examples ,
          <year>2024</year>
          . URL: https://www.iso.org/standard/81088.html.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>From data quality to model quality: an exploratory study on deep learning</article-title>
          ,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1906</year>
          .
          <volume>11882</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          , W. Ma,
          <article-title>Navigating data corruption in machine learning: Balancing quality, quantity</article-title>
          , and imputation strategies,
          <year>2024</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2412.18296.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>G.</given-names>
            <surname>Fenza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gallo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Loia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Orciuoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Herrera-Viedma</surname>
          </string-name>
          ,
          <article-title>Data set quality in machine learning: Consistency measure based on group decision making</article-title>
          ,
          <source>Applied Soft Computing</source>
          <volume>106</volume>
          (
          <year>2021</year>
          )
          <article-title>107366</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.asoc.
          <year>2021</year>
          .
          <volume>107366</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Jakubik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Vössing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kühl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Walk</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Satzger, Data-centric artificial intelligence</article-title>
          ,
          <source>Business &amp; Information Systems Engineering</source>
          (
          <year>2024</year>
          ).
          <source>doi:10.1007/s12599-024-00857-8.</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Jarrahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Memariani</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Guha,</surname>
          </string-name>
          <article-title>The principles of data-centric ai</article-title>
          ,
          <source>Communications of the ACM</source>
          <volume>66</volume>
          (
          <year>2023</year>
          )
          <fpage>84</fpage>
          -
          <lpage>92</lpage>
          . doi:
          <volume>10</volume>
          .1145/3571724.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>E.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Model assessment and selection under temporal distribution shift</article-title>
          ,
          <year>2024</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2402.08672.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>W.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <article-title>Dish-ts: A general paradigm for alleviating distribution shift in time series forecasting</article-title>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2302.14829.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>B.</given-names>
            <surname>chander</surname>
          </string-name>
          , C. John, L. Warrier,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gopalakrishnan</surname>
          </string-name>
          ,
          <article-title>Toward trustworthy artificial intelligence (tai) in the context of explainability and robustness</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>57</volume>
          (
          <year>2025</year>
          ). URL: https: //doi.org/10.1145/3675392. doi:
          <volume>10</volume>
          .1145/3675392.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>P.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <article-title>Enhancing real-world robustness in ai: Challenges and solutions</article-title>
          ,
          <source>JOURNAL OF RECENT TRENDS IN COMPUTER SCIENCE AND ENGINEERING 12</source>
          (
          <year>2024</year>
          )
          <fpage>34</fpage>
          -
          <lpage>49</lpage>
          . doi:
          <volume>10</volume>
          .70589/JRTCSE.
          <year>2024</year>
          .
          <volume>1</volume>
          .6.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Harman</surname>
          </string-name>
          , L. Ma, Y. Liu,
          <article-title>Machine learning testing: Survey, landscapes</article-title>
          and horizons,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1906</year>
          .
          <volume>10742</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>COCO</given-names>
            <surname>Consortium</surname>
          </string-name>
          , Coco api,
          <year>2015</year>
          . URL: https://github.com/cocodataset/cocoapi.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Ultralytics</surname>
          </string-name>
          ,
          <article-title>Ultralytics yolo documentation: Performance metrics deep dive</article-title>
          ,
          <year>2023</year>
          . URL: https: //docs.ultralytics.com/guides/yolo-performance-metrics/.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <surname>O. Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Eisenstein</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Ghazvininejad, Training on synthetic noise improves robustness to natural noise in machine translation</article-title>
          ,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1902</year>
          .
          <volume>01509</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>I.</given-names>
            <surname>Vasiljevic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chakrabarti</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Shakhnarovich, Examining the impact of blur on recognition by convolutional networks</article-title>
          ,
          <year>2016</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.1611.05760.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hendrycks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Dietterich</surname>
          </string-name>
          ,
          <article-title>Benchmarking neural network robustness to common corruptions</article-title>
          and perturbations,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1903</year>
          .
          <volume>12261</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>