<!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>
      <journal-title-group>
        <journal-title>Speculum</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1086/693968</article-id>
      <title-group>
        <article-title>Enhancement of Scribal Hands Identification Via Self-Supervised Learning (Extended Abstract)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lorenzo Lastilla</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer, Control and Management Engineering Antonio Ruberti, Sapienza University of Rome</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>92</volume>
      <issue>2017</issue>
      <fpage>24</fpage>
      <lpage>25</lpage>
      <abstract>
        <p>In this paper, the first successful application of the recent framework of self-supervised learning to the problem of handwriting identification for medieval and modern manuscripts is presented. To this end, a novel dataset consisting of both labeled and unlabeled manuscripts extracted from the Vatican Apostolic Library was produced. Moreover, this contribution shows that pretraining a convolutional neural network by leveraging large amounts of unlabeled manuscripts and fine-tuning this model to the task of interest significantly outperforms other baselines, including the common setup of initializing the network from general-domain features, or training the model from scratch, also in terms of generalization power. Overall, these results reveal the strong potential of self-supervised techniques in the field of digital paleography, where unlabeled data is nowadays available, while labeled data is scarcer.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Self-Supervised Learning</kwd>
        <kwd>Medieval and Modern Manuscripts</kwd>
        <kwd>Handwriting Identification</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction and related works</title>
      <p>
        In recent years, the long-standing issue of automatic handwriting identification (HI) – the
subdivision of the texts into parts belonging to distinct scribes on the basis of the respective
handwriting style – has been discussed both from a theoretical perspective [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ] and an
application point of view. Despite the increasing use of deep learning techniques to address this
problem [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7">4, 5, 6, 7</xref>
        ], HI continues to be carried out with traditional methods by paleographers,
due to the costs, time and expertise required for data labeling.
      </p>
      <p>
        This work highlights the benefits of using a self-supervised learning (SSL) approach for the
HI task on medieval and modern manuscripts (more precisely, a set of 24 digitized manuscripts
selected from the Vatican Apostolic Library [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]), the vastness of which is considerable, even
if most of the manuscript pages are not annotated with the information of the copyist who
physically wrote them. SSL, indeed, is gradually taking hold to address the problem of learning
good image representations from a few labeled examples while making best use of many
unlabeled instances [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ], which would minimize the dependence on potentially costly corpora
of manually annotated data [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], and makes this strategy ideal for the HI task. In particular,
SSL methods try to solve a “pretext task” (which is not of genuine interest) to learn – from
unlabeled data – representations that can be transferred to other tasks of actual interest (the
“downstream tasks”), which often have only a few labeled instances [
        <xref ref-type="bibr" rid="ref12 ref13 ref14 ref15">12, 13, 14, 15, 16, 17</xref>
        ].
      </p>
      <p>
        In practice, the proposed methodology consists of two main stages. First, all the pages
contained in the manuscripts undergo the Online Bag-of-Visual-Words (OBoW)
reconstructionbased SSL approach described in [
        <xref ref-type="bibr" rid="ref15">15, 18</xref>
        ]. Then, the available copyists are split into a background
set and an evaluation set (whose samples are never seen during training nor validation), and a
linear layer is trained on top of the frozen base encoder, with the aim of minimizing a triplet
margin loss [19, 20]. The results obtained show that the visual representations learned in a
self-supervised fashion outperform the ImageNet [21] ones with respect to the HI task, as
well as the features learned after training the backbone model from scratch, also in terms of
generalization power.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Case study</title>
      <p>
        24 high-resolution digital manuscripts, included among the tables for Latin paleography exercises
published by the Vatican Apostolic Library in 2004 [22], which collect very recognizable graphic
types [23, 24], were selected from [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], obtaining a final corpus of 8745 pages and 27 scribes
(identified in 9 manuscripts only – Vatt. latt. 4220 and 4221 share the same set of 8 copyists).
The selected manuscripts, together with the number of available copyists and the century of
realization, are recalled in Table 1.
      </p>
      <p>Starting from the overall group of selected pages, two diferent datasets were created: as to
the pretext task, the 8745 samples – organized in 24 classes – were randomly split into training,
validation and test sets according to the ratio 0.8-0.15-0.05. For the handwriting identification
task, instead, only the annotated pages were selected. The available copyists were split into
an evaluation set (consisting of the 4 scribes from Vat. lat. 653, excluded from the training and
validation stages of this task) and a background set (including the 23 remaining scribes).</p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology and results</title>
      <p>The SSL strategy adopted in this work can be summarized as follows: a CNN-based feature
extractor (or student network – a ResNet18-based encoder [25]) is trained to predict, with
unlabeled data only, the BoW representation of a 380 × 380 random crop of a manuscript page
given as input a set of perturbed crops of that page [18]. The BoW representation is generated
by a momentum-updated teacher network, which receives as input the 380 × 380 random
crop. The set of perturbed crops, instead, is obtained through several augmentations, including
radiometric perturbations, Gaussian blur, random erasing, and mild geometric distortions.</p>
      <p>Once self-supervised pretraining is completed, the frozen features of the student encoder
are involved in the HI task, based on the minimization of a triplet margin loss, which can be
seen as learning a distance function useful for discriminating instances belonging to diferent
classes in the embedding space. At this stage, a linear layer only, added to backbone model,
is trained to extract more powerful representations with respect to the task of interest. The
triplets are generated through an online batch-hard triplet mining strategy, which is the optimal
configuration for this kind of task [ 26, 27]. As to the pairwise distance function involved in the
loss computation, the 2 norm was chosen. The downstream task was carried out based on
two mutually exclusive data augmentation schemes. Scheme A) is based on the extraction of
a random 380 × 380 crop from the page and the application of a similar set of perturbations
as the pretext task; scheme B), instead, extends the same set of perturbations to the whole
page: consequently, the encoder – which receives as input a page of arbitrary size – operates
as a “fully convolutional” network [28]. In Figure 1, a schematic representation of both the
self-supervised pretraining stage and the handwriting identification task is provided.</p>
      <p>All the experiments were carried out using a Tesla V100 SXM2 32GB GPU, and involved
a ResNet18-based architecture. The source code used for the experiments is available at</p>
      <p>Mode</p>
      <p>OBoW pretraining
ImageNet pretraining
Training from scratch</p>
      <p>OBoW pretraining
ImageNet pretraining
Training from scratch</p>
      <p>B)
B)
B)
A)
A)
A)
https://github.com/L9L4/HI-SSL. As to the BoW reconstruction task, the student encoder was
trained for 100 epochs; the batch size was fixed to 64; finally, Stochastic Gradient Descent (SGD)
was adopted, with learning rate set to 0.03 and progressively adjusted up to the final value of
0.00003 through a cosine scheduler with an initial warmup of 5 epochs.</p>
      <p>As to the HI task, it was faced based on both the augmentation schemes A) and B), considering
3 diferent configurations (and thus ending up with 6 tests in total): a linear layer was trained on
top of the frozen backbone model pretrained with OBoW; a linear layer was trained on top of the
ImageNet frozen features (also in this case, a ResNet18 backbone encoder – but pretrained on
the ImageNet dataset – was used); a model initialized with random weights (but characterized
by the same architecture as the other two cases) was fully trained from scratch directly on the
downstream task. For all the 6 tests, the output dimension of the linear layer (embedding width)
was fixed to 1024, while the margin  of the triplet margin loss was set to 0.2 [20]. The model
was trained for 100 epochs with SGD optimization: the learning rate, starting from 0.15, was
increased up to 0.6 through a linear warmup for the first 10 epochs, and then decayed with
a cosine annealing up to 0.0015. The batch size was set to 256 for the tests carried out under
scheme A), and to 32 for scheme B). To quantitatively assess the performance of the single
tests for the HI task, the Mean Average Precision (MAP) was computed. In Table 2, the results
obtained for each test in terms of MAP are shown. It is immediately evident that the SSL-based
approach is far more efective for the task of interest than the baselines, under both the A) and
B) data augmentation schemes. This is true, indeed, both for the background scribes and for the
evaluation ones, used to test the generalization capacity of the model, achieving a MAP of 74.8%
for the background set, obtained under the B) scheme, and of 79.0% for the evaluation set – A)
scheme. In Figures 2a and 2b, it is possible to visualize the 2D projection of the embeddings of the
manuscript pages for the best results obtained among the 6 tests, both for the background and
the evaluation set (together with the respective cluster centroids), after dimensionality reduction
through the t-SNE technique [29]. Figures 2a and 2b are particularly helpful to appreciate the
capability of the proposed framework of efectively performing the HI task, even for manuscripts
excluded from training. This seems to suggest the possibility of extending the approach to
any non-annotated manuscript, which could be partitioned through zero-shot learning. Figure
2a is also useful, however, to highlight the limitations of the proposed approach, showing the
dificulties in properly clustering some scribes coming from very specific manuscripts (Vatt. latt.
4217 – scribes 5-7 in Figure 2a –, 4220 and 4221 – scribes 8-15), which constitute a particularly
complex subset, since the copyists who realized them aimed for the maximum handwriting
(a) Best result for the background set.</p>
      <p>(b) Best result for the evaluation set.
uniformity. Hence, the representations extracted from the model, generally suficient for the
other manuscripts, might have been unsuitable to grasp the set of discriminating elements valid
for this subgroup.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>In this paper, the task of automatic HI for ancient manuscripts was addressed in the face of the
scarcity of large and annotated datasets, and the first empirical validation of the SSL framework
in the medieval and modern manuscript domain was provided, assessing its capability to learn
efective visual representations from a large amount of raw data and then to build a solid starting
point for the task of interest, which can be performed based on just a few labeled samples, and
with higher precision. The proposed approach was compared with (and outperformed, also
from a generalization point of view) two common setups, namely the network initialization
with general-domain (ImageNet) features, and training the full model from scratch. Regarding
possible future developments, an explainability analysis of the methodology could be carried out
[30]; moreover, the subset of scribes whose identification was most dificult could be analyzed
in order to determine the necessary adjustments to the model to extract useful features even
in complex cases like this; then, a broader experimental setup could be investigated; finally, a
solution to tackle the problem of multigraphism could be included in the methodology [31].</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>The author is very grateful to the Physics Department of Sapienza University for carrying out the
experiments on the INFN NVIDIA DGX-1 server, and to Professors Serena Ammirati, Donatella
Firmani, Nikos Komodakis, Paolo Merialdo, and Simone Scardapane for the supervision.
[16] M. Caron, I. Misra, J. Mairal, P. Goyal, P. Bojanowski, A. Joulin, Unsupervised Learning
of Visual Features by Contrasting Cluster Assignments, in: H. Larochelle, M. Ranzato,
R. Hadsell, M. F. Balcan, H. Lin (Eds.), Advances in Neural Information Processing Systems,
volume 33, Curran Associates, Inc., 2020, pp. 9912–9924. URL: https://proceedings.neurips.
cc/paper/2020/file/70feb62b69f16e0238f741fab228fec2-Paper.pdf.
[17] J. Zbontar, L. Jing, I. Misra, Y. LeCun, S. Deny, Barlow twins: Self-supervised learning via
redundancy reduction, arXiv preprint arXiv:2103.03230 (2021).
[18] S. Gidaris, A. Bursuc, G. Puy, N. Komodakis, M. Cord, P. Pérez, Online bag-of-visual-words
generation for unsupervised representation learning, arXiv preprint arXiv:2012.11552
(2020).
[19] K. Q. Weinberger, L. K. Saul, Distance metric learning for large margin nearest neighbor
classification., Journal of machine learning research 10 (2009).
[20] F. Schrof, D. Kalenichenko, J. Philbin, Facenet: A unified embedding for face recognition
and clustering, in: Proceedings of the IEEE conference on computer vision and pattern
recognition, 2015, pp. 815–823.
[21] O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy,
A. Khosla, M. Bernstein, et al., Imagenet large scale visual recognition challenge,
International journal of computer vision 115 (2015) 211–252.
[22] P. Cherubini, A. Pratesi, Paleografia latina. Tavole, volume 1, Scuola Vaticana di Paleografia,</p>
      <p>Diplomatica e Archivistica, 2004.
[23] P. Cherubini, A. Pratesi, Paleografia latina. L’avventura grafica del mondo occidentale,
Littera Antiqua, 16, Scuola Vaticana di Paleografia, Diplomatica e Archivistica, Città del
Vaticano, 2010.
[24] F. Coulson, R. Babcock, The Oxford Handbook of Latin Palaeography, Oxford University</p>
      <p>Press, USA, 2020.
[25] K. He, X. Zhang, S. Ren, J. Sun, Deep Residual Learning for Image Recognition, in: 2016
IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 770–778.
doi:10.1109/CVPR.2016.90.
[26] A. Hermans, L. Beyer, B. Leibe, In defense of the triplet loss for person re-identification,
arXiv preprint arXiv:1703.07737 (2017).
[27] Olivier Moindrot, Triplet Loss and Online Triplet Mining in TensorFlow, https://omoindrot.</p>
      <p>github.io/triplet-loss, 2018.
[28] E. Shelhamer, J. Long, T. Darrell, Fully Convolutional Networks for Semantic Segmentation,
IEEE Transactions on Pattern Analysis and Machine Intelligence 39 (2017) 640–651. doi:10.
1109/TPAMI.2016.2572683.
[29] L. Van der Maaten, G. Hinton, Visualizing data using t-SNE., Journal of machine learning
research 9 (2008).
[30] D. Basaj, W. Oleszkiewicz, I. Sieradzki, M. Górszczak, B. Rychalska, T. Trzcinski, B. Zieliński,
Explaining Self-Supervised Image Representations with Visual Probing, in: Z.-H. Zhou
(Ed.), Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence,
IJCAI-21, International Joint Conferences on Artificial Intelligence Organization, 2021,
pp. 592–598. URL: https://doi.org/10.24963/ijcai.2021/82. doi:10.24963/ijcai.2021/82,
main Track.
[31] P. A. Stokes, Scribal Attribution across Multiple Scripts: A Digitally Aided Approach,</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Stokes</surname>
          </string-name>
          , Modeling Medieval Handwriting:
          <article-title>A New Approach to Digital Palaeography</article-title>
          , in: J. C. Meister (Ed.),
          <source>Digital Humanities</source>
          <year>2012</year>
          , University of Hamburg, Hamburg,
          <year>2012</year>
          , pp.
          <fpage>382</fpage>
          -
          <lpage>385</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Stokes</surname>
          </string-name>
          , Digital Approaches to Paleography and Book History: Some Challenges, Present and Future,
          <source>Frontiers in Digital Humanities</source>
          <volume>2</volume>
          (
          <year>2015</year>
          )
          <article-title>5</article-title>
          . URL: https://www. frontiersin.org/article/10.3389/fdigh.
          <year>2015</year>
          .
          <volume>00005</volume>
          . doi:
          <volume>10</volume>
          .3389/fdigh.
          <year>2015</year>
          .
          <volume>00005</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Stutzmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tensmeyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Christlein</surname>
          </string-name>
          ,
          <article-title>Writer identification and script classification: two tasks for a common understanding of cultural heritage</article-title>
          ,
          <source>OpenX for Interdisciplinary Computational Manuscript Research</source>
          (
          <year>2018</year>
          )
          <fpage>12</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Abdalhaleem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. K.</given-names>
            <surname>Barakat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>El-Sana</surname>
          </string-name>
          ,
          <article-title>Case study: Fine writing style classification using siamese neural network</article-title>
          ,
          <source>in: 2018 IEEE 2nd International Workshop on Arabic and Derived Script Analysis and Recognition (ASAR)</source>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>62</fpage>
          -
          <lpage>66</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kassis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nassour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>El-Sana</surname>
          </string-name>
          ,
          <article-title>Writing Style Invariant Deep Learning Model for Historical Manuscripts Alignment</article-title>
          , arXiv preprint arXiv:
          <year>1806</year>
          .
          <volume>03987</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pirrone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. B.</given-names>
            <surname>Aimar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Journet</surname>
          </string-name>
          ,
          <string-name>
            <surname>Papy-S-Net</surname>
          </string-name>
          :
          <article-title>A Siamese Network to match papyrus fragments</article-title>
          ,
          <source>in: Proceedings of the 5th International Workshop on Historical Document Imaging and Processing</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>78</fpage>
          -
          <lpage>83</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Cilia</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. De Stefano</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Fontanella</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Marrocco</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Molinara</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Scotto Di</surname>
            <given-names>Freca</given-names>
          </string-name>
          ,
          <article-title>An end-to-end deep learning system for medieval writer identification</article-title>
          ,
          <source>Pattern Recognition Letters</source>
          <volume>129</volume>
          (
          <year>2020</year>
          )
          <fpage>137</fpage>
          -
          <lpage>143</lpage>
          . URL: https://www.sciencedirect.com/science/article/pii/ S0167865519303460. doi:https://doi.org/10.1016/j.patrec.
          <year>2019</year>
          .
          <volume>11</volume>
          .025.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Biblioteca</given-names>
            <surname>Apostolica</surname>
          </string-name>
          <string-name>
            <surname>Vaticana</surname>
          </string-name>
          ,
          <article-title>Website of the Biblioteca Apostolica Vaticana</article-title>
          , https://www. vaticanlibrary.va/en/,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kornblith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Swersky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Norouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          , Big
          <string-name>
            <surname>Self-Supervised Models are Strong Semi-Supervised</surname>
            <given-names>Learners</given-names>
          </string-name>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>22243</fpage>
          -
          <lpage>22255</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>J.-B. Grill</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Strub</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Altché</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Tallec</surname>
            ,
            <given-names>P. H.</given-names>
          </string-name>
          <string-name>
            <surname>Richemond</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Buchatskaya</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Doersch</surname>
            ,
            <given-names>B. A.</given-names>
          </string-name>
          <string-name>
            <surname>Pires</surname>
            ,
            <given-names>Z. D.</given-names>
          </string-name>
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>M. G.</given-names>
          </string-name>
          <string-name>
            <surname>Azar</surname>
          </string-name>
          , et al.,
          <article-title>Bootstrap your own latent: A new approach to self-supervised learning</article-title>
          , arXiv preprint arXiv:
          <year>2006</year>
          .
          <volume>07733</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bachman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. D.</given-names>
            <surname>Hjelm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Buchwalter</surname>
          </string-name>
          ,
          <article-title>Learning Representations by Maximizing Mutual Information Across Views</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>32</volume>
          (
          <year>2019</year>
          )
          <fpage>15535</fpage>
          -
          <lpage>15545</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>W.</given-names>
            <surname>Falcon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <article-title>A framework for contrastive self-supervised learning and designing a new approach</article-title>
          , arXiv preprint arXiv:
          <year>2009</year>
          .
          <volume>00104</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <article-title>Momentum contrast for unsupervised visual representation learning</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>9729</fpage>
          -
          <lpage>9738</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>A.</surname>
          </string-name>
          v. d. Oord,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          ,
          <article-title>Representation learning with contrastive predictive coding</article-title>
          , arXiv preprint arXiv:
          <year>1807</year>
          .
          <volume>03748</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gidaris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bursuc</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Komodakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pérez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cord</surname>
          </string-name>
          ,
          <article-title>Learning representations by predicting bags of visual words</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>6928</fpage>
          -
          <lpage>6938</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>