<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "https://jats.nlm.nih.gov/nlm-dtd/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="3.0" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">ISPRS-Annals</journal-id>
<journal-title-group>
<journal-title>ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences</journal-title>
<abbrev-journal-title abbrev-type="publisher">ISPRS-Annals</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2194-9050</issn>
<publisher><publisher-name>Copernicus Publications</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5194/isprs-annals-V-2-2020-805-2020</article-id>
<title-group>
<article-title>DECOMPOSING IMAGES INTO TRIANGLES BY DELAUNAY POINT PROCESSES</article-title>
</title-group>
<contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Chai</surname>
<given-names>D.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group><aff id="aff1">
<label>1</label>
<addr-line>Key Laboratory of Geoscience Big Data and Deep Resource of Zhejiang Province, School of Earth Sciences, Zhejiang University, China</addr-line>
</aff>
<pub-date pub-type="epub">
<day>03</day>
<month>08</month>
<year>2020</year>
</pub-date>
<volume>V-2-2020</volume>
<fpage>805</fpage>
<lpage>812</lpage>
<permissions>
<copyright-statement>Copyright: © 2020 D. Chai</copyright-statement>
<copyright-year>2020</copyright-year>
<license license-type="open-access">
<license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p>
</license>
</permissions>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/isprs-annals-V-2-2020-805-2020.html">This article is available from https://isprs-annals.copernicus.org/articles/isprs-annals-V-2-2020-805-2020.html</self-uri>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/isprs-annals-V-2-2020-805-2020.pdf">The full text article is available as a PDF file from https://isprs-annals.copernicus.org/articles/isprs-annals-V-2-2020-805-2020.pdf</self-uri>
<abstract>
<p>We propose a method for decomposing images into triangles. Contrary to superpixel methods, our output representation both preserves the geometric information disseminated in input images, and has an attractive storage capacity. Our method relies on the flexibility and efficiency of Delaunay point processes to address the problem. These stochastic models distribute points interacting between each other through Delaunay triangulations. The mechanism for distributing points combines several complementary ingredients including image discontinuity preservation, radiometric homogeneity inside atomic regions as well as priors on the shape of these regions. Said differently, sampled points and induced shapes work in tandem. The potential of our approach is shown through comparisons with existing oversegmentation methods and applications to vision problems.</p>
</abstract>
<counts><page-count count="8"/></counts>
</article-meta>
</front>
<body/>
<back>
</back>
</article>
