<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-04627406</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T03:00:41+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Deep graph matching meets mixed-integer linear programming: Relax or not ?</title>
            <author role="aut">
              <persName>
                <forename type="first">Zhoubo</forename>
                <surname>Xu</surname>
              </persName>
              <idno type="halauthorid">1070035-0</idno>
              <affiliation ref="#struct-1201913"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Puqing</forename>
                <surname>Chen</surname>
              </persName>
              <idno type="halauthorid">3183778-0</idno>
              <affiliation ref="#struct-1201913"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Romain</forename>
                <surname>Raveaux</surname>
              </persName>
              <email type="md5">36e87faec2a0d4f1e9dca30756337294</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">romain-raveaux</idno>
              <idno type="idhal" notation="numeric">13038</idno>
              <idno type="halauthorid" notation="string">3477-13038</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3149-0498</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=q3ou3o4AAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/150185243</idno>
              <affiliation ref="#struct-204893"/>
              <affiliation ref="#struct-396582"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Xin</forename>
                <surname>Yang</surname>
              </persName>
              <idno type="halauthorid">2533668-0</idno>
              <affiliation ref="#struct-1201913"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Huadong</forename>
                <surname>Liu</surname>
              </persName>
              <idno type="halauthorid">1631150-0</idno>
              <affiliation ref="#struct-1201913"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Romain</forename>
                <surname>Raveaux</surname>
              </persName>
              <email type="md5">36e87faec2a0d4f1e9dca30756337294</email>
              <email type="domain">gmail.com</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2024-06-27 15:12:06</date>
              <date type="whenModified">2025-11-04 17:34:07</date>
              <date type="whenReleased">2024-06-27 15:12:06</date>
              <date type="whenProduced">2024-11</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2108.00394"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="122635">
                <persName>
                  <forename>Romain</forename>
                  <surname>Raveaux</surname>
                </persName>
                <email type="md5">36e87faec2a0d4f1e9dca30756337294</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04627406</idno>
            <idno type="halUri">https://hal.science/hal-04627406</idno>
            <idno type="halBibtex">xu:hal-04627406</idno>
            <idno type="halRefHtml">&lt;i&gt;Pattern Recognition&lt;/i&gt;, 2024, 155, pp.110697. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.patcog.2024.110697"&gt;&amp;#x27E8;10.1016/j.patcog.2024.110697&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Pattern Recognition, 2024, 155, pp.110697. &amp;#x27E8;10.1016/j.patcog.2024.110697&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TOURS">Université François Rabelais</idno>
            <idno type="stamp" n="LIRFAI" corresp="LIFAT">Equipe RFAI du Laboratoire Informatique de Tours</idno>
            <idno type="stamp" n="LIFAT">Laboratoire d'Informatique Fondamentale et Appliquée de Tours</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="INSA-CVL">INSA CENTRE VAL DE LOIRE</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Deep graph matching meets mixed-integer linear programming: Relax or not ?</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Zhoubo</forename>
                    <surname>Xu</surname>
                  </persName>
                  <idno type="halauthorid">1070035-0</idno>
                  <affiliation ref="#struct-1201913"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Puqing</forename>
                    <surname>Chen</surname>
                  </persName>
                  <idno type="halauthorid">3183778-0</idno>
                  <affiliation ref="#struct-1201913"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Romain</forename>
                    <surname>Raveaux</surname>
                  </persName>
                  <email type="md5">36e87faec2a0d4f1e9dca30756337294</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">romain-raveaux</idno>
                  <idno type="idhal" notation="numeric">13038</idno>
                  <idno type="halauthorid" notation="string">3477-13038</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3149-0498</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=q3ou3o4AAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/150185243</idno>
                  <affiliation ref="#struct-204893"/>
                  <affiliation ref="#struct-396582"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Xin</forename>
                    <surname>Yang</surname>
                  </persName>
                  <idno type="halauthorid">2533668-0</idno>
                  <affiliation ref="#struct-1201913"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Huadong</forename>
                    <surname>Liu</surname>
                  </persName>
                  <idno type="halauthorid">1631150-0</idno>
                  <affiliation ref="#struct-1201913"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">17798</idno>
                <idno type="issn">0031-3203</idno>
                <title level="j">Pattern Recognition</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">155</biblScope>
                  <biblScope unit="pp">110697</biblScope>
                  <date type="datePub">2024-11</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2108.00394</idno>
              <idno type="doi">10.1016/j.patcog.2024.110697</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Deep graph matching</term>
                <term xml:lang="en">Feature points correspondence</term>
                <term xml:lang="en">Graph-based representation</term>
                <term xml:lang="en">Combinatorial optimization</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>raph matching is an important problem that has received widespread attention, especially in the field of computer vision. Recently, state-of-the-art methods seek to incorporate graph matching with deep learning. However, there is no research to explain what role the graph matching algorithm plays in the model. Therefore, we propose an approach integrating a MILP formulation of the graph matching problem. This formulation is solved to optimal and it provides inherent baseline. Meanwhile, similar approaches are derived by releasing the optimal guarantee of the graph matching solver and by introducing a quality level. This quality level controls the quality of the solutions provided by the graph matching solver. In addition, several relaxations of the graph matching problem are put to the test. Our experimental evaluation gives several theoretical insights and guides the direction of deep graph matching methods.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-1201913" status="INCOMING">
          <orgName>GUET: Guilin University of Electronic Technology, 1 Jinji Road, Guilin, Guangxi, China</orgName>
          <desc>
            <address>
              <country key="CN"/>
            </address>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-204893" status="VALID">
          <idno type="IdRef">081090722</idno>
          <idno type="RNSR">201220254T</idno>
          <idno type="ROR">https://ror.org/03r938j26</idno>
          <orgName>Laboratoire d'Informatique Fondamentale et Appliquée de Tours</orgName>
          <orgName type="acronym">LIFAT</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>64, Avenue Jean Portalis, 37200 Tours</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://lifat.univ-tours.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR6300" active="#struct-300298" type="direct"/>
            <relation active="#struct-303079" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-396582" status="VALID">
          <orgName>Reconnaissance des formes et analyse d'images</orgName>
          <orgName type="acronym">RFAI</orgName>
          <desc>
            <address>
              <addrLine>64 avenue de Portalis37200 Tours</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-204893" type="direct"/>
            <relation name="UR6300" active="#struct-300298" type="indirect"/>
            <relation active="#struct-303079" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300298" status="VALID">
          <idno type="IdRef">026404478</idno>
          <idno type="ISNI">0000000121608742</idno>
          <idno type="ROR">https://ror.org/02wwzvj46</idno>
          <orgName>Université de Tours</orgName>
          <orgName type="acronym">UT</orgName>
          <date type="start">1970-12-17</date>
          <desc>
            <address>
              <addrLine>60 rue du Plat d'Étain, 37020 Tours cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tours.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303079" status="VALID">
          <idno type="IdRef">203592077</idno>
          <orgName>Institut National des Sciences Appliquées - Centre Val de Loire</orgName>
          <orgName type="acronym">INSA CVL</orgName>
          <date type="start">2014-01-01</date>
          <desc>
            <address>
              <addrLine>88 boulevard Lahitolle, CS 60013, 18022 Bourges cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-centrevaldeloire.fr/fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>