<!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>Visualizing and Contextualizing Outliers in Aegean Seal Collections</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bartosz Bogacz</string-name>
          <email>bartosz.bogacz@iwr.uni-heidelberg.de</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sarah Finlayson</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Diamantis Panagiotopolous</string-name>
          <email>diamantis.panagiotopolousg@zaw.uni-heidelberg.de</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hubert Mara</string-name>
          <email>hubert.mara@hs-mainz.de</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Corpus of Minoan and Mycenaean Seals Institut fur Klassische Archaologie und Byzantinische Archaologie Heidelberg University</institution>
        </aff>
      </contrib-group>
      <fpage>65</fpage>
      <lpage>76</lpage>
      <abstract>
        <p>The Corpus of Minoan and Mycenaean Seals (CMS) in Heidelberg contains records of approximately 12:000 ancient seals and seal impressions. The study of the seals, their engraved motifs, and sealing practices gives valuable insights into the social, political and economic organization of Aegean Bronze Age societies. A key research question is whether a seal is always used by a single individual. Current archaeological practice is to manually compare sealings and qualitatively assess their similarity or di erence. With large collections of seal impressions made by the same seal, this process quickly becomes prohibitive if every detail is to be considered. Our dataset consists of rasterized images of structured-light 3D scanned seal impressions on plasticine casts. We improve upon our previous approach to alignment and introduce methods visualizing and summarizing di erences in a collection of highly similar seal impressions. We overlay binarized images of seal impressions to easily detect variations in the motifs. We enrich those with quiver plots displaying only the non-rigid contribution to the deformation between seal impression pairs. By comparing the visualizations of historic seal impressions to our experimentally created modern variants we gather evidence of their authorship.</p>
      </abstract>
      <kwd-group>
        <kwd>Machine Learning</kwd>
        <kwd>3D Computer Vision</kwd>
        <kwd>Aegean Seals</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>are typically made from hard and soft stones, bone or ivory, metal, and
occasionally man-made materials. They display engraved motifs, from simple geometrical
patterns to complex gurative scenes. Beyond their signi cance as prestige
objects, insignia and amulets, their primary purpose is administrative: seals are
impressed on clay sealings to secure objects, and to make statements of
ownership or responsibility, whether corporate or individual. Therefore, it is key for
archaeologists to have certainty that a set of impressions with seemingly
identical motifs originates from the same seal, and then to clarify whether or not each
impression was made by the same person. Current manual approaches focus on
a detailed study of casts, photographs and drawings of similar seal impressions.
The detailed study of minuscule visual di erences in the motifs of 10 or more
seal impressions at once becomes prohibitively time consuming very quickly. We
approach this challenge by computing an automated alignment of seal
impressions, highlighting visual di erences in motifs, and summarizing views to quickly
determine outliers in the depiction of motifs across a large collection of mostly
identical impressions.</p>
      <p>
        This work builds upon and improves on our previous research in seal
impression alignment [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] in two key areas: (i) Our previous two step process of an
initial rigid t with RANSAC [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and a subsequent ne-tuning of residuals with
TPS-RPM [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], both requiring optimization till convergence, are now replaced
by a single direct estimation of the alignment with a SVR [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], requiring only a
single parameter to control its smoothness. However, the dense visual descriptor
sampling with DAISY [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] remains, making the quality of our alignments
comparable to our previous work. (ii) We introduce visualization and summarization
techniques developed in interdisciplinary collaboration to maximize their
legibility and trustworthiness. We focus on disentangling and thus enabling the
investigation of impression motifs and their deformations in separation.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>Keypoint registration methods are typically used for matching images from
different viewpoints, e.g. stereo vision and 3D reconstruction, or for matching a
template in a target image. In any case, a set of keypoints from the source and
target are extracted and correspondences between them are established to t an
underlaying model.</p>
      <p>
        The quality of the matching can be improved by using better image
descriptors [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], or by optimizing image descriptors for a speci c task. In their work [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]
Verdie et al. train a regressor to predict optimal locations for keypoints of
handcrafted image descriptors. The authors use a set of images taken with identical
camera position and parameters but with changing illuminations due to weather
conditions. The resulting regressor focuses on unchanging large structures, e.g.
buildings, while ignoring foliage and changing weather. Papadaki et al. in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
propose to reduce the amount of outliers in the correspondence computation by
training a random forest (RF) classi er to reject keypoint not contributing to a
successful match. The classi er is trained on a representative set of images for
a speci c task. For this task, the matching performance in computational speed
and robustness is increased.
      </p>
      <p>
        Keypoint registration is also used for non-rigid matching of images. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]
Tran et al. show that consensus based model tting such as random sample
consensus (RANSAC) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] can be used to estimate correspondences for a model
without bounding the degrees of freedom. The authors exploit the property
that correspondence four-tuples, from source to target (x; y; x0; y0), form a
twodimensional manifold embedded in four dimensional assignment space. For a
limited amount of deformation the manifold is a hyperplane with inlier
correspondences tightly clustering around it while outliers are further apart. A
different approach to removing outliers is proposed by Li et al. in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The authors
train a support vector regressor (SVR) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] on the assignment space to match the
expected manifold while being robust to outliers. Li et al. repeat the procedure,
each time peeling of an increasing number of outliers.
      </p>
      <p>
        Our approach is also based on manipulating the correspondence manifold.
However, we estimate it with a manifold embedding technique, such as multi
dimensional scaling (MDS) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], and remove outliers with high embedding stress.
A subsequent SVR is used for its regularization capability to smooth the
correspondence manifold.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Dataset and 3D-Acquisition</title>
      <p>The work presented in this article is done within the 3D forensic analysis and
contextualisation of Aegean seals and sealings (ErKon3D) project, which has
already acquired high-resolution 3D-models i.e. triangular meshes of a selection
of sealings. These are modern casts of the original ancient sealings; a sealing
is a piece of clay on which a seal has been impressed. In this work, we use 3D
scans of the modern casts. All the seals and sealings have been published, and
photographs, drawings, textual descriptions and meta-data are available in print
and online resources3. The latter are connected to online databases of metadata
such as ARACHNE 4, the central object database of the German Archaeological
Institute (DAI) and the Archaeological Institute of the University of Cologne.</p>
      <p>
        We focus on renderings of the high-resolution 3D-datasets as those are free
from interpretation as compared to manually created tracings and drawings.
Further, motifs on seals and their impressions only become fully visible under
a changing light-source. A single photograph does not reproduce its full
threedimensional structure and is subject to occlusion e ects. Additionally the color
information of the impressed material is distracting for experts and machine
learning algorithms alike. Therefore, we face a similar challenge as in previous
work on cuneiform tablets and apply Multi-Scale Integral Invariant (MSII) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
ltering to the 3D models. The ltering and rasterization of the seal impression
models was done using the Open Source GigaMesh Software Framework 5.
      </p>
      <p>For the experiments and validation of our methods we chose sets of sealings
from Neopalatial Crete (1750/1700 - 1500/1450 BCE). The 46 sealings form 8
groups, each containing between 3 and 7 sealings impressed by the same seal.
The rst 4 groups all come from the same building at the site of Haghia Triada;
a great deal of administrative activity took place in this building, including the
storage of sealed goods, but we do not understand the complex sealing pattern
there, in which a few seals are impressed frequently and the remainder only
once or twice. The second 4 groups contain sealings of a speci c form, used to
seal folded parchment documents; here, sealings impressed with the same gold
sealing ring are found at di erent sites around Crete. The archaeological research
question is fundamentally the same for both sets - did the same person always
use the same seal? - but the socio-political signi cance of the answers di ers
greatly.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Alignment</title>
      <p>
        We build our approach upon the insights of Tran et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and Li et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] that
describe the alignment process between two images as tting a two-dimensional
manifold onto a four-dimensional set of points. Our main concern is then the
generation, ltering, and smoothing of these correspondences that nally leads
to an alignment manifold used to warp the source image onto the target image.
4.1
      </p>
      <sec id="sec-4-1">
        <title>Descriptor Transform</title>
        <p>
          Our image alignment process depends on determining keypoints in the source
and target images that share the same visual patterns. We extract visual patterns
from the images by means of a local visual feature descriptor such DAISY [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
The descriptors are extracted densely, that is, for each location of a regular grid
3 https://www.uni-heidelberg.de/fakultaeten/philosophie/zaw/cms/
4 https://arachne.uni-koeln.de
5 https://gigamesh.eu
de ned on the image pair. For this particular dataset we found that a grid spacing
of 5 pixels with a DAISY kernel size of 30 pixels and 5 rings of 8 histograms
yields the best visualization results. We reduce the count of dimensions from 328
to 16 by a principal component analysis (PCA) to save computational resources.
A higher count of dimensions did not improve the delity of our visualizations.
4.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Descriptor Filtering</title>
        <p>Contrary to typical image registration, we are only interested in aligning the
central motif of a seal impression. The aligning process is required to ignore any
material de cits, damage from weathering, and material deformation that is
unlikely to be equal between impressions. Shared damage between seal impressions,
however, is indicative that the seal itself was already damaged.</p>
        <p>Unique Descriptors that are common on the images do not contribute to a
good alignment. Constructing a correspondence where either source or target is
common leads to ambiguity. There are many good candidates close in feature
space yet far apart in image space. This is especially true for our data, as seal
impressions have large empty areas and material borders that exhibit very similar
visual descriptors yet impair a proper alignment. We compute the prevalence of
speci c descriptors by estimating the kernel density (KDE) of a Gaussian kernel
with bandwidth 0.1 in the joined descriptor space of both images. Then, only
descriptors that are less common then the 50 percentile are kept for further
processing.</p>
        <p>Bidirectional The best target candidate of a source keypoint should also, vice
versa, be the best source candidate of the same target keypoint. We enforce
each correspondence to point to each other as best candidates. We introduce
an acceptable radius of inaccuracy. Correspondences are only kept if the best
candidate points back at an area within a radius of 1 descriptor step, here 5
pixels in image space, of the keypoint.</p>
        <p>
          Inlying We make use of the observation of Tran et al. in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] that for most
physical deformations true positive alignment points are distributed compactly
on a 2D a ne hyperplane in the alignment space. We relax the assumption
further and estimate the embedding of an arbitrary correspondence manifold
with multi-dimensional scaling (MDS) [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. We estimate the embedding stress of
a correspondence as the sum of squared di erences between distances to all other
correspondences in the original space and in the embedded space. We only keep
correspondences that are in the lower 90 percentile of points in terms of stress.
4.3
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>Alignment Manifold Regression</title>
        <p>Even after the previous steps of ltering, the resultant set of correspondences
contains outliers and is irregularly distributed over the image, c.f. the support in
Figure 3. We smooth and interpolate correspondences with a radial basis function
(RBF) support vector regressor (SVR). Two regression tasks are performed.
Target x coordinates and target y coordinates are individually regressed from
source x and y. The amount of desired smoothness and rigidity is controlled
by the regularization penalty C of the regressor. We set the -tube where no
penalty is applied to a small value of 0:0001. The regressed manifold then closely
follows the ltered correspondences. Figure 2 shows correspondance samples and
interpolated samples.
4.4</p>
      </sec>
      <sec id="sec-4-4">
        <title>Image Warping</title>
        <p>
          On the basis of the regressed alignment manifold we deform the source image
to match the target image. The deformation is computed in two stages. First
a ner grid with 30 30 control points resolution is interpolated with
thinplate splines (TPS) [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Then, on the basis of this ner grid a piecewise a ne
function, quadrilaterals spanned between four grid points, is used to interpolate
pixel values of the warped source image.
The purpose of the alignment process is to decompose the images into the
deformation of the material induced by the act of impressing a seal, from the
deformation of the motifs depicted on the seal impressions. This decomposition
enables a detailed study of each aspect while leveling di erences of the other
aspect. The following section details visualization modes used in the study of
di erences between seal impressions. Figure 3 shows one tile for each
visualization mode. Figure 6 shows a complete comparison matrix for a single mode.
5.1
        </p>
      </sec>
      <sec id="sec-4-5">
        <title>Binarized Images</title>
        <p>All comparison modes make use of overlaying a warped source image on the
target image. To increase the legibility of the overlays, we binarize the seal
impression images by a single global threshold. The images are zero-centered by
substracting their mean standardized by dividing by their standard deviation.
Then, a threshold of 0.3 is applied, all pixels below are set to 0 and all above to
1. This binarization results in well-de ned semantics for each pixel value. Pixels
valued 0 and 2 indicate agreement on the MSII curvature while pixels valued 1
denote disagreement. Examples are shown in Figure 3.
5.2</p>
      </sec>
      <sec id="sec-4-6">
        <title>Rigid and Non-rigid Alignment</title>
        <p>Translation and rotation of the seal impression motif images are artifacts of the
acquisition process. These transformations are purely dependent on the position
and orientation of the motif in the mold and on the virtual embedding into
3Dmodel space and orthographically projected raster image space. We are intrested
only in the non-rigid contribution of transformations needed to deform the source
image onto the target image.</p>
        <p>We estimate a rigid transformation model with RANSAC on basis of the
correspondences of the regressed non-rigid manifold. Then, we compute the
movement vectors in the quiver visualization by sampling source image coordinates
and transforming them once using the estimate rigid model and once using the
regressed non-rigid manifold, by means of the estimated SVRs. In the quiver
visualizations this di erence is denoted by arrows pointing from the rigidly
estimated target position to the non-rigidly estimated target positions. If there is
no di erence only a point is shown.
5.3</p>
      </sec>
      <sec id="sec-4-7">
        <title>Support Keypoints</title>
        <p>An alignment not matching expected features can result from two qualitatively
di erent reasons: i) the images under comparison genuinely do not share any
visual features or ii) common visual features have not been properly detected. The
rst case is a valuable result for experts while the second needs to be reanalysed.
Quantifying and visualizing these is crucial to correctly judge the credibility of
our visualizations.</p>
        <p>We display the keypoints used for regressing the correspondence manifold on
top of the source image as shown in Figure 3. These keypoints indicate which
image regions were detected in the source that are also present in the target.
Regions with a large count of keypoints denote that the alignment of these visual
features can be trusted.
6</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experiments and Results</title>
      <p>To validate our approach we computed all pairwise alignments within sets of
seal impressions containing the same motif. We used 8 groups with respectively
6, 6, 6, 6, 7, 3, 5 and 7 members in each, for a total of 36 + 36 + 36 + 36 +
49 + 9 + 25 + 49 = 276 comparisons for each visualization mode. For each set
we visualized matrices with pairwise comparisons of: (i) binary overlays of only
rigid alignment, (ii) binary overlays of warped alignment, and (iii) quiver plots
of the warping transformation.</p>
      <p>We review here the archaeological signi cance of the presented visualizations.
Within the 4 groups of sealings from Haghia Triada, we draw attention to the
pairs of sealings CMS II.6 no. 70 HMs 455/10 and 455/15 in Figure 4, and CMS
II.6 no. 11 HMs 441/20 and 441/05 in Figure 4 and Figure 6 which align more
closely than the other pairwise comparisons in each set and are especially good
targets for other impressions to align to, suggesting that these pairs of sealings
could have been impressed by the same person.</p>
      <p>CMS II.6 no. 70</p>
      <p>CMS II.6 no. 11</p>
      <p>The seal impressions in Figure 5, drawn from the 4 groups of sealings
impressed by gold sealing rings, were found at two di erent sites on Crete, namely
Haghia Triadha for CMS II.6 no. 19/HMs 591 and 516 and Sklavokambos for
CMS II.6 no. 260/HMs 632-635. While the seal impressions all depict the same
motif, there are visible small di erences between each sealing, for example the
presence or absence of the chariot reins or the position of the horse's head; the
di culty of explaining the cause of these very small di erences had led, in the
past, to uncertainty as to whether all the impressions in this set were stamped
with the same seal or not.</p>
      <p>We analyze how well the impressions can be aligned to each other, and
expect a high degree of agreement in the binary overlay visualization if they were
stamped by the same seal. Figure 5 shows that the impressions can be aligned
well when using warping transformations. All impressions in the set match CMS
II.6 no. 19 HM 591 and CMS II.6 no. 260 HM 634 particularly well, indicating
that the practice of impressing these seals is similar, which would suggest that
the same person was using this seal each time.</p>
      <p>CMS II.6 no. 19 and CMS II.6 no. 260
In this work, we introduced the use of image registration techniques to
decompose the di erences in pairs of seal impression images into local visual features
and global deformation. We employed a feature transform into an assignment
space with outlier rejection based on visual feature kernel density and
assignment manifold stress. Then, the nal alignment functions are regressed with
radial-basis function (RBF) support vector regressors (SVR). We tailored our
visualizations to meet the needs of archaeological experts: (i) through
binarization to highlight motifs, (ii) pairwise overlays for easy comparison, (iii) sum
overlays to nd representative seal impressions, (iv) and quiver plots to nd
patterns in the sealing practice. The result of our process was concrete ndings
of examples, within sets of sealings impressed by the same seal, of seal
impressions that were probably made by the same person, including a group of sealings
from two di erent archaeological sites.</p>
      <p>
        In future work, our method and visualization approach requires more
experiments in di ering domains to be validated, e.g. similarity and deformation
analysis on digitalized Old Egyptian cursive handwriting [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In addition, we will
investigate the usage of visual features common to all seal impressions in a set
to aid in the detection of patterns in damaged seals and to automatically
derive a prototypical impression that all seal impressions can be aligned to. Using
such an approach will remove the need to manually inspect the resulting
pairwise visualizations, growing quadratically with count of impressions in a set, to
inspecting how each seal relates to the derived prototype, growing only linearly.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>This work is partially supported by the Federal Ministry of Education and
Research (BMBF) eHeritage II programme, grant no. 01UG1880X for
supporting the 3D forensic analysis and contextualisation of aegean seals and sealings
(ErKon3D) project. Furthermore we thank Dr. Maria Anastasiadou for practical
help with the CMS collection.
Fig. 6. Comparison matrix of a part of the CMS II.6 no 11 seal impression set. Top
row and left column depict the impressions as rasterized MSII images being compared.
The images within depict an additive overlay of the curvature images with a quiver
overlaid to show the warping necessary to align the images. The bottom row depicts
accumulated overlays of all warped source images on the respective target. CMS II.6
no. 11 HM 441/20 and HM 441/05 need only minimal warping to align visually very
well, suggesting that these pairs of sealings could have been impressed by the same
person.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bogacz</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finlayson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Panagiotopoulos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mara</surname>
          </string-name>
          , H.:
          <article-title>Quantifying deformation in aegean sealing practices</article-title>
          .
          <source>Computer Vision</source>
          , Imaging and
          <source>Computer Graphics Theory and Applications</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chui</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rangarajan</surname>
            ,
            <given-names>A.:</given-names>
          </string-name>
          <article-title>A new point matching algorithm for non-rigid registration</article-title>
          .
          <source>Computer Vision</source>
          and Image
          <string-name>
            <surname>Understanding</surname>
          </string-name>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Drucker</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burges</surname>
            ,
            <given-names>C.J.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaufman</surname>
          </string-name>
          , L.,
          <string-name>
            <surname>Smola</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vapnik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Support vector regression machines</article-title>
          .
          <source>Neural Information Processing Systems</source>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fischler</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bolles</surname>
            ,
            <given-names>R.C.</given-names>
          </string-name>
          :
          <article-title>Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography</article-title>
          . SRI International (
          <year>1980</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. Gulden,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Krause</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Verhoeven</surname>
          </string-name>
          ,
          <string-name>
            <surname>U.</surname>
          </string-name>
          :
          <article-title>Digital palaeography of hieratic</article-title>
          .
          <source>The Oxford Handbook of Egyptian Epigraphy and Palaeography</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Rejecting mismatches by correspondence function</article-title>
          .
          <source>International Journal of Computer Vision</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Mara</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <article-title>Kromker, S.: Vectorization of 3D-Characters by Integral Invariant Filtering of High-Resolution Triangular Meshes</article-title>
          .
          <source>International Conference on Document Analysis and Recognition</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Mead</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Review of the development of multidimensional scaling methods</article-title>
          .
          <source>Journal of the Royal Statistical Society</source>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Papadaki</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hansch</surname>
          </string-name>
          , R.:
          <article-title>Match or No Match: Keypoint Filtering based on Matching Probability. Image Matching: Local Features &amp; Beyond</article-title>
          , CVPR Workshop (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Tola</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lepetit</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fua</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : DAISY:
          <article-title>An E cient Dense Descriptor Applied to Wide-Baseline Stereo</article-title>
          .
          <source>Pattern Analysis and Machine Intelligence</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>Q.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chin</surname>
          </string-name>
          , T.J.,
          <string-name>
            <surname>adn</surname>
            <given-names>M. S.</given-names>
          </string-name>
          <string-name>
            <surname>Brown</surname>
          </string-name>
          , G.C.,
          <string-name>
            <surname>Suter</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>: In Defence of RANSAC for Outlier Rejection in Deformable Registration</article-title>
          .
          <source>European Conference on Computer Vision</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Verdie</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yi</surname>
            ,
            <given-names>K.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fua</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lepetit</surname>
          </string-name>
          , V.:
          <article-title>TILDE: A Temporally Invariant Learned DEtector</article-title>
          . Conference on Computer Vision and Pattern
          <string-name>
            <surname>Recognition</surname>
          </string-name>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>