<?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-01266033</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-20T10:25:53+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Adaptive Tangential Cover for Noisy Digital Contours</title>
            <author role="aut">
              <persName>
                <forename type="first">Phuc</forename>
                <surname>Ngo</surname>
              </persName>
              <email type="md5">cc79c05fd12619c6aa402249a004a8f2</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">phuc-ngo</idno>
              <idno type="idhal" notation="numeric">744803</idno>
              <idno type="halauthorid" notation="string">27368-744803</idno>
              <idno type="IDREF">https://www.idref.fr/187826676</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-7423-5932</idno>
              <affiliation ref="#struct-206036"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hayat</forename>
                <surname>Nasser</surname>
              </persName>
              <idno type="halauthorid">958603-0</idno>
              <affiliation ref="#struct-206036"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Isabelle</forename>
                <surname>Debled-Rennesson</surname>
              </persName>
              <email type="md5">ef01ede102c347ae67ebd6411ac6d7c6</email>
              <email type="domain">loria.fr</email>
              <idno type="idhal" notation="numeric">830145</idno>
              <idno type="halauthorid" notation="string">106151-830145</idno>
              <affiliation ref="#struct-206036"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Bertrand</forename>
                <surname>Kerautret</surname>
              </persName>
              <email type="md5">579821af1396d5478ad603f01a634d1d</email>
              <email type="domain">univ-lyon2.fr</email>
              <idno type="idhal" notation="string">bertrand-kerautret</idno>
              <idno type="idhal" notation="numeric">176679</idno>
              <idno type="halauthorid" notation="string">9757-176679</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8418-2558</idno>
              <idno type="IDREF">https://www.idref.fr/111088771</idno>
              <affiliation ref="#struct-206036"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Phuc</forename>
                <surname>Ngo</surname>
              </persName>
              <email type="md5">cc79c05fd12619c6aa402249a004a8f2</email>
              <email type="domain">gmail.com</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-02-01 23:01:35</date>
              <date type="whenModified">2025-11-04 11:58:52</date>
              <date type="whenReleased">2016-02-02 11:06:56</date>
              <date type="whenProduced">2016-04-18</date>
              <date type="whenEndEmbargoed">2016-02-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01266033v1/document">
                <date notBefore="2016-02-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01266033v1/file/DGCI_2016.pdf" id="file-1266035-1346508">
                <date notBefore="2016-02-01"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-01266033/file/DGCI_2016.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="167086">
                <persName>
                  <forename>Phuc</forename>
                  <surname>Ngo</surname>
                </persName>
                <email type="md5">cc79c05fd12619c6aa402249a004a8f2</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01266033</idno>
            <idno type="halUri">https://inria.hal.science/hal-01266033</idno>
            <idno type="halBibtex">ngo:hal-01266033</idno>
            <idno type="halRefHtml">&lt;i&gt;DGCI 2016 - 19th international conference on Discrete Geometry for Computer Imagery&lt;/i&gt;, Apr 2016, Nantes, France. pp.439-451, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-32360-2_34"&gt;&amp;#x27E8;10.1007/978-3-319-32360-2_34&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">DGCI 2016 - 19th international conference on Discrete Geometry for Computer Imagery, Apr 2016, Nantes, France. pp.439-451, &amp;#x27E8;10.1007/978-3-319-32360-2_34&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1266035-1346508"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="LORIA-ALGO-TEST5">LORIA-ALGO-TEST5  </idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="LORIA-ALGO" corresp="LORIA">Department of Algorithms, Computation, Image and Geometry</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="CENTRALESUPELEC-SACLAY" corresp="UNIV-PARIS-SACLAY">CENTRALESUPELEC-SACLAY</idno>
            <idno type="stamp" n="INRIA-AUT">Inria autres</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Adaptive Tangential Cover for Noisy Digital Contours</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Phuc</forename>
                    <surname>Ngo</surname>
                  </persName>
                  <email type="md5">cc79c05fd12619c6aa402249a004a8f2</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">phuc-ngo</idno>
                  <idno type="idhal" notation="numeric">744803</idno>
                  <idno type="halauthorid" notation="string">27368-744803</idno>
                  <idno type="IDREF">https://www.idref.fr/187826676</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-7423-5932</idno>
                  <affiliation ref="#struct-206036"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hayat</forename>
                    <surname>Nasser</surname>
                  </persName>
                  <idno type="halauthorid">958603-0</idno>
                  <affiliation ref="#struct-206036"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Isabelle</forename>
                    <surname>Debled-Rennesson</surname>
                  </persName>
                  <email type="md5">ef01ede102c347ae67ebd6411ac6d7c6</email>
                  <email type="domain">loria.fr</email>
                  <idno type="idhal" notation="numeric">830145</idno>
                  <idno type="halauthorid" notation="string">106151-830145</idno>
                  <affiliation ref="#struct-206036"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Bertrand</forename>
                    <surname>Kerautret</surname>
                  </persName>
                  <email type="md5">579821af1396d5478ad603f01a634d1d</email>
                  <email type="domain">univ-lyon2.fr</email>
                  <idno type="idhal" notation="string">bertrand-kerautret</idno>
                  <idno type="idhal" notation="numeric">176679</idno>
                  <idno type="halauthorid" notation="string">9757-176679</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8418-2558</idno>
                  <idno type="IDREF">https://www.idref.fr/111088771</idno>
                  <affiliation ref="#struct-206036"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>DGCI 2016 - 19th international conference on Discrete Geometry for Computer Imagery</title>
                  <date type="start">2016-04-18</date>
                  <date type="end">2016-04-20</date>
                  <settlement>Nantes</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <biblScope unit="serie">DGCI 2016: Discrete Geometry for Computer Imagery</biblScope>
                  <biblScope unit="volume">LNCS 9647</biblScope>
                  <biblScope unit="pp">439-451</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-32360-2_34</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en"> dominant point</term>
                <term xml:lang="en"> digital contour</term>
                <term xml:lang="en"> noise level</term>
                <term xml:lang="en"> tangential cover</term>
                <term xml:lang="en">maximal blurred segment</term>
              </keywords>
              <classCode scheme="halDomain" n="scco.comp">Cognitive science/Computer science</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The notion of tangential cover, based on maximal segments, is a well-known tool to study the geometrical characteristics of a discrete curve. However, it is not adapted to noisy digital contours. In this paper, we propose a new notion, named Adaptive Tangential Cover, to study noisy digital contours. It relies on the meaningful thickness, calculated at each point of the contour, which permits to locally estimate the noise level. The Adaptive Tangential Cover is then composed of maximal blurred segments with appropriate widths, deduced from the noise level estimation. We present a parameter-free algorithm for computing the Adaptive Tangential Cover. Moreover an application to dominant point detection is proposed. The experimental results demonstrate the efficiency of this new notion.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-206036" status="VALID">
          <orgName>Applying Discrete Algorithms to Genomics and Imagery</orgName>
          <orgName type="acronym">ADAGIO</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/la-recherche/equipes/adagio</ref>
          </desc>
          <listRelation>
            <relation active="#struct-423083" type="direct"/>
            <relation active="#struct-206040" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="department" xml:id="struct-423083" status="VALID">
          <orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
          <orgName type="acronym">LORIA - ALGO</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/en/research/departments/algorithms-computation-image-and-geometry/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-206040" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-206040" status="VALID">
          <idno type="IdRef">067077927</idno>
          <idno type="ISNI">0000000121795429</idno>
          <idno type="RNSR">198912571S</idno>
          <idno type="IdUnivLorraine">[UL]RSI--</idno>
          <idno type="ROR">https://ror.org/02vnf0c38</idno>
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-413289" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>