Semantic MediaWiki
https://www.lrde.epita.fr/wiki/Special:Ask/-3Cq-3E-5B-5BCategory:News-7C-7CLrdeBulletin-5D-5D-20OR-20-5B-5BCategory:Publications-5D-5D-20-5B-5BPublished-20has-20news::true-5D-5D-20OR-20-5B-5BCategory:OlenaNews-5D-5D-20-5B-5BIs-20global-20news::true-5D-5D-3C-2Fq-3E/mainlabel%3D/limit%3D50/order%3D-20descending/sort%3D-20News-20date/offset%3D0/format%3D-20feed/searchlabel%3D-20RSS-20feed/type%3Drss/title%3D-20Semantic-20MediaWiki/description%3DLatest-20news-20from-20semantic-2Dmediawiki.org/page%3D-20full
$1 $2 feedenMediaWiki 1.32.0Mon, 17 May 2021 15:06:00 GMTSeminar/2021-05-12
https://www.lrde.epita.fr/wiki/Seminar/2021-05-12
https://www.lrde.epita.fr/wiki/Seminar/2021-05-12<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminar/2021-05-12</a>
</p></div><div class="mw-parser-output"><h3><span id="Mercredi_12_mai_2021,_11h_-_12h,_Https://meet.jit.si/SeminaireLRDE"></span><span class="mw-headline" id="Mercredi_12_mai_2021.2C_11h_-_12h.2C_Https:.2F.2Fmeet.jit.si.2FSeminaireLRDE"><a class="mw-selflink selflink"> Mercredi 12 mai 2021, 11h - 12h, Https://meet.jit.si/SeminaireLRDE</a></span></h3>
<p><br />
</p>
<h4><span class="mw-headline" id="An_Introduction_to_Topological_Data_Analysis_with_the_Topology_ToolKit">An Introduction to Topological Data Analysis with the Topology ToolKit</span></h4>
<p><i>Julien Tierny, Sorbonne Université</i>
<br/>
<br/>
</p><p>Topological Data Analysis (TDA) is a recent area of computer science that focuses on discovering intrinsic structures hidden in data. Based on solid mathematical tools such as Morse theory and Persistent Homology, TDA enables the robust extraction of the main features of a data set into stable, concise, and multi-scale descriptors that facilitate data analysis and visualization. In this talk, I will give an intuitive overview of the main tools used in TDA (persistence diagrams, Reeb graphs, Morse-Smale complexes, etc.) with applications to concrete use cases in computational fluid dynamics, medical imaging, quantum chemistry, and climate modeling. This talk will be illustrated with results produced with the "Topology ToolKit" (TTK), an open-source library (BSD license) that we develop with collaborators to showcase our research. Tutorials for re-producing these experiments are available on the TTK website.
<br/>
<br/>
</p><p><small>Julien Tierny received his Ph.D. degree in Computer Science from the University of Lille in 2008 and
the Habilitation degree (HDR) from Sorbonne University in 2016. Currently a CNRS permanent
research scientist affiliated with Sorbonne University, his research expertise lies in topological methods
for data analysis and visualization. Author on the topic and award winner for his research, he regularly
serves as an international program committee member for the top venues in data visualization (IEEE VIS,
EuroVis, etc.) and is an associate editor for IEEE Transactions on Visualization and Computer Graphics.
Julien Tierny is also founder and lead developer of the Topology ToolKit (TTK), an open source library for
topological data analysis.</small>
<br/>
<br/>
<a rel="nofollow" class="external text" href="https://topology-tool-kit.github.io/">https://topology-tool-kit.github.io/</a>
</p></div>Wed, 28 Apr 2021 11:35:37 GMTBotA Corpus Processing and Analysis Pipeline for Quickref
https://www.lrde.epita.fr/wiki/Publications/hacquard.21.els
https://www.lrde.epita.fr/wiki/Publications/hacquard.21.els<div class="mw-parser-output"><p><a class="mw-selflink selflink">A Corpus Processing and Analysis Pipeline for Quickref</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Antoine Hacquard, <a href="/wiki/User:Didier" title="User:Didier">Didier Verna</a></dd>
<dt>Where </dt>
<dd>14th European Lisp Symposium</dd>
<dt>Place </dt>
<dd>Online</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Date </dt>
<dd>2021-05-01</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Quicklisp is a library manager working with your existing Common Lisp implementation to download and install around 2000 libraries, from a central archive. Quickref, an application itself written in Common Lisp, generatesautomatically and by introspection, a technical documentation for every library in Quicklisp, and produces a website for this documentation. In this paper, we present a corpus processing and analysis pipeline for Quickref. This pipeline consists of a set of natural language processing blocks allowing us to analyze Quicklisp libraries, based on natural language contents sources such as README filesdocstrings, or symbol names. The ultimate purpose of this pipeline is the generation of a keyword index for Quickrefalthough other applications such as word clouds or topic analysis are also envisioned.
</p><p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ hacquard.21.els,
author = {Antoine Hacquard and Didier Verna},
title = {A Corpus Processing and Analysis Pipeline for Quickref},
booktitle = {14th European Lisp Symposium},
year = 2021,
pages = {27--35},
month = may,
address = {Online},
isbn = 9782955747452,
doi = {10.5281/zenodo.4714443},
abstract = {Quicklisp is a library manager working with your existing
Common Lisp implementation to download and install around
2000 libraries, from a central archive. Quickref, an
application itself written in Common Lisp, generates,
automatically and by introspection, a technical
documentation for every library in Quicklisp, and produces
a website for this documentation. In this paper, we present
a corpus processing and analysis pipeline for Quickref.
This pipeline consists of a set of natural language
processing blocks allowing us to analyze Quicklisp
libraries, based on natural language contents sources such
as README files, docstrings, or symbol names. The ultimate
purpose of this pipeline is the generation of a keyword
index for Quickref, although other applications such as
word clouds or topic analysis are also envisioned.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 04 May 2021 10:02:16 GMTBotA Portable, Simple, Embeddable Type System
https://www.lrde.epita.fr/wiki/Publications/newton.21.els
https://www.lrde.epita.fr/wiki/Publications/newton.21.els<div class="mw-parser-output"><p><a class="mw-selflink selflink">A Portable, Simple, Embeddable Type System</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Jnewton" title="User:Jnewton">Jim Newton</a>, <a href="/wiki/User:Adrien" title="User:Adrien">Adrien Pommellet</a></dd>
<dt>Where </dt>
<dd>European Lisp Symposium</dd>
<dt>Place </dt>
<dd>Online</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Spot" title="Spot">Spot</a></dd>
<dt>Keywords </dt>
<dd>infinite alphabets, type systems, Common Lisp, Clojure, Scala</dd>
<dt>Date </dt>
<dd>2021-04-26</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>We present a simple type system inspired by that of Common Lisp. The type system is intended to be embedded into a host language and accepts certain fundamental types from that language as axiomatically given. The type calculus provided in the type system is capable of expressing union, intersection, and complement types, as well as membershipsubtype, disjoint, and habitation (non-emptiness) checks. We present a theoretical foundation and two sample implementations, one in Clojure and one in Scala.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/newton.21.els.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ newton.21.els,
author = {Jim Newton and Adrien Pommellet},
title = {A Portable, Simple, Embeddable Type System},
booktitle = {European Lisp Symposium},
year = 2021,
lrdestatus = {accepted},
address = {Online},
month = apr,
abstract = { We present a simple type system inspired by that of
Common Lisp. The type system is intended to be embedded
into a host language and accepts certain fundamental types
from that language as axiomatically given. The type
calculus provided in the type system is capable of
expressing union, intersection, and complement types, as
well as membership, subtype, disjoint, and habitation
(non-emptiness) checks. We present a theoretical foundation
and two sample implementations, one in Clojure and one in
Scala.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Sun, 02 May 2021 04:08:16 GMTBotSeminar/2021-03-31
https://www.lrde.epita.fr/wiki/Seminar/2021-03-31
https://www.lrde.epita.fr/wiki/Seminar/2021-03-31<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminar/2021-03-31</a>
</p></div><div class="mw-parser-output"><h3><span id="Mercredi_31_mars_2021,_11h_-_12h,_Https://meet.jit.si/SeminaireLRDE_\&_Amphi_4"></span><span class="mw-headline" id="Mercredi_31_mars_2021.2C_11h_-_12h.2C_Https:.2F.2Fmeet.jit.si.2FSeminaireLRDE_.5C.26_Amphi_4"><a class="mw-selflink selflink"> Mercredi 31 mars 2021, 11h - 12h, Https://meet.jit.si/SeminaireLRDE \& Amphi 4</a></span></h3>
<p><br />
</p>
<h4><span class="mw-headline" id="Contributions_to_Boolean_satisfiability_solving_and_its_application_to_the_analysis_of_discrete_systems">Contributions to Boolean satisfiability solving and its application to the analysis of discrete systems</span></h4>
<p><i>Souheib Baarir, Université Paris VI</i>
<br/>
<br/>
</p><p>Despite its NP-completeness, propositional Boolean satisfiability (SAT) covers a broad spectrum of applications. Nowadays, it is an active research area finding its applications in many contexts like planning decision, cryptology, computational biology, hardware and software analysis. Hence, the development of approaches allowing to handle increasingly challenging SAT problems has become a major focus: during the past eight years, SAT solving has been the main subject of my research work. This talk presents some of the main results we obtained in the field.
<br/>
<br/>
</p><p><small>Souheib Baarir est Docteur en informatique de l'Université de Paris VI depuis 2007 et a obtenu son HDR à Sorbonne Université en 2019. Le thème de ses recherches s'inscrit dans le cadre des méthodes formelles de vérification des systèmes concurrents. En particulier, il s’intéresse aux méthodes permettant d’optimiser la vérification en exploitant le parallélisme et/ou les propriétés de symétries apparaissant dans de tels systèmes.</small>
<br/>
<br/>
<a rel="nofollow" class="external text" href="https://www.lip6.fr/actualite/personnes-fiche.php?ident=P617">https://www.lip6.fr/actualite/personnes-fiche.php?ident=P617</a>
</p></div>Mon, 15 Mar 2021 11:28:02 GMTBotNewsEntry (2021/03/05)
https://www.lrde.epita.fr/wiki/NewsEntry_(2021/03/05)
https://www.lrde.epita.fr/wiki/NewsEntry_(2021/03/05)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2021/03/05)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>Seminar on « Mathematical morphology, AI and astrometry » held at EPITA
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
<p>E. Puybareau and G. Tochon from LRDE invite the <a rel="nofollow" class="external text" href="https://www.imcce.fr/recherche/equipes/pegase/">Pegase team from IMCCE</a> to present the respective themes of the two communities (image processing and AI for the former, astronomy for the latter) and to discuss their possible interactions.
</p>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2021/03/05
</p>
</td></tr></table>
</div>Mon, 08 Mar 2021 11:34:02 GMTDanielaStability of the Tree of Shapes to Additive Noise
https://www.lrde.epita.fr/wiki/Publications/boutry.21.dgmm.3
https://www.lrde.epita.fr/wiki/Publications/boutry.21.dgmm.3<div class="mw-parser-output"><p><a class="mw-selflink selflink">Stability of the Tree of Shapes to Additive Noise</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Gtochon" title="User:Gtochon">Guillaume Tochon</a></dd>
<dt>Where </dt>
<dd>Proceedings of the IAPR International Conference on Discrete Geometry and Mathematical Morphology (DGMM)</dd>
<dt>Place </dt>
<dd>Uppsala, Sweden</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2021-03-02</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>The tree of shapes (ToS) is a famous self-dual hierarchical structure in mathematical morphology, which represents the inclusion relationship of the shapes (i.e. the interior of the level lines with holes filled) in a grayscale image. The ToS has already found numerous applications in image processing tasks, such as grain filtering, contour extraction, image simplification, and so on. Its structure consistency is bound to the cleanliness of the level lines, which are themselves deeply affected by the presence of noise within the image. However, according to our knowledge, no one has measured before how resistant to (additive) noise this hierarchical structure is. In this paper, we propose and compare several measures to evaluate the stability of the ToS structure to noise.
</p><p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ boutry.21.dgmm.3,
author = {Nicolas Boutry and Guillaume Tochon},
title = {Stability of the Tree of Shapes to Additive Noise},
booktitle = {Proceedings of the IAPR International Conference on
Discrete Geometry and Mathematical Morphology (DGMM)},
year = 2021,
month = {May},
address = {Uppsala, Sweden},
abstract = {The tree of shapes (ToS) is a famous self-dual
hierarchical structure in mathematical morphology, which
represents the inclusion relationship of the shapes
(\textit{i.e.} the interior of the level lines with holes
filled) in a grayscale image. The ToS has already found
numerous applications in image processing tasks, such as
grain filtering, contour extraction, image simplification,
and so on. Its structure consistency is bound to the
cleanliness of the level lines, which are themselves deeply
affected by the presence of noise within the image.
However, according to our knowledge, no one has measured
before how resistant to (additive) noise this hierarchical
structure is. In this paper, we propose and compare several
measures to evaluate the stability of the ToS structure to
noise.},
note = {To appear}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Thu, 04 Mar 2021 23:18:21 GMTBotA New Matching Algorithm between Trees of Shapes and its Application to Brain Tumor Segmentation
https://www.lrde.epita.fr/wiki/Publications/boutry.21.dgmm.2
https://www.lrde.epita.fr/wiki/Publications/boutry.21.dgmm.2<div class="mw-parser-output"><p><a class="mw-selflink selflink">A New Matching Algorithm between Trees of Shapes and its Application to Brain Tumor Segmentation</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Where </dt>
<dd>Proceedings of the IAPR International Conference on Discrete Geometry and Mathematical Morphology (DGMM)</dd>
<dt>Place </dt>
<dd>Uppsala, Sweden</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2021-03-02</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Many approaches exist to compute the distance between two trees in pattern recognition. These trees can be structures with or without values on their nodes or edges. However, none of these distances take into account the shapes possibly associated to the nodes of the tree. For this reason, we propose in this paper a new distance between two trees of shapes based on the Hausdorff distance. This distance allows us to make inexact tree matching and to compute what we call residual trees, representing where two trees differ. We will also see that thanks to these residual trees, we can obtain good results in matter of brain tumor segmentation. This segmentation does not provide only a segmentation but also the tree of shapes corresponding to the segmentation and its depth map.
</p><p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ boutry.21.dgmm.2,
author = {Nicolas Boutry and Thierry G\'eraud},
title = {A New Matching Algorithm between Trees of Shapes and its
Application to Brain Tumor Segmentation},
booktitle = {Proceedings of the IAPR International Conference on
Discrete Geometry and Mathematical Morphology (DGMM)},
year = 2021,
month = {May},
address = {Uppsala, Sweden},
abstract = {Many approaches exist to compute the distance between two
trees in pattern recognition. These trees can be structures
with or without values on their nodes or edges. However,
none of these distances take into account the shapes
possibly associated to the nodes of the tree. For this
reason, we propose in this paper a new distance between two
trees of shapes based on the Hausdorff distance. This
distance allows us to make inexact tree matching and to
compute what we call residual trees, representing where two
trees differ. We will also see that thanks to these
residual trees, we can obtain good results in matter of
brain tumor segmentation. This segmentation does not
provide only a segmentation but also the tree of shapes
corresponding to the segmentation and its depth map.},
note = {To appear}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 02 Mar 2021 16:11:49 GMTBotAn Equivalence Relation between Morphological Dynamics and Persistent Homology in n-D
https://www.lrde.epita.fr/wiki/Publications/boutry.21.dgmm.1
https://www.lrde.epita.fr/wiki/Publications/boutry.21.dgmm.1<div class="mw-parser-output"><p><a class="mw-selflink selflink">An Equivalence Relation between Morphological Dynamics and Persistent Homology in n-D</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a>, Laurent Najman</dd>
<dt>Where </dt>
<dd>Proceedings of the IAPR International Conference on Discrete Geometry and Mathematical Morphology (DGMM)</dd>
<dt>Place </dt>
<dd>Uppsala, Sweden</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2021-03-02</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>In Mathematical Morphology (MM), dynamics are used to compute markers to proceed for example to watershed-based image decomposition. At the same time, persistence is a concept coming from Persistent Homology (PH) and Morse Theory (MT) and represents the stability of the extrema of a Morse function. Since these concepts are similar on Morse functions, we studied their relationship and we found, and proved, that they are equal on 1D Morse functions. Here, we propose to extend this proof to <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a601995d55609f2d9f5e233e36fbe9ea26011b3b" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\displaystyle n}"/></span>-D<span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n\geq 2}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
<mo>≥<!-- ≥ --></mo>
<mn>2</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n\geq 2}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/e6bf67f9d06ca3af619657f8d20ee1322da77174" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.505ex; width:5.656ex; height:2.343ex;" alt="{\displaystyle n\geq 2}"/></span>, showing that this equality can be applied to <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a601995d55609f2d9f5e233e36fbe9ea26011b3b" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\displaystyle n}"/></span>-D images and not only to 1D functions. This is a step further to show how much MM and MT are related.
</p><p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ boutry.21.dgmm.1,
author = {Nicolas Boutry and Thierry G\'eraud and Laurent Najman},
title = {An Equivalence Relation between Morphological Dynamics and
Persistent Homology in {$n$-D}},
booktitle = {Proceedings of the IAPR International Conference on
Discrete Geometry and Mathematical Morphology (DGMM)},
year = 2021,
month = {May},
address = {Uppsala, Sweden},
abstract = {In Mathematical Morphology (MM), dynamics are used to
compute markers to proceed for example to watershed-based
image decomposition. At the same time, persistence is a
concept coming from Persistent Homology (PH) and Morse
Theory (MT) and represents the stability of the extrema of
a Morse function. Since these concepts are similar on Morse
functions, we studied their relationship and we found, and
proved, that they are equal on 1D Morse functions. Here, we
propose to extend this proof to $n$-D, $n \geq 2$, showing
that this equality can be applied to $n$-D images and not
only to 1D functions. This is a step further to show how
much MM and MT are related.},
note = {To appear}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 02 Mar 2021 16:11:47 GMTBotDeep Learning for Detection and Segmentation of Artefact and Disease Instances in Gastrointestinal Endoscopy
https://www.lrde.epita.fr/wiki/Publications/boutry.21.media
https://www.lrde.epita.fr/wiki/Publications/boutry.21.media<div class="mw-parser-output"><p><a class="mw-selflink selflink">Deep Learning for Detection and Segmentation of Artefact and Disease Instances in Gastrointestinal Endoscopy</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Sharib Ali, Mariia Dmitrieva, Noha Ghatwary, Sophia Bano, Gorkem Polat, Alptekin Temizel, Adrian Krenzer, Amar Hekalo, Yun Bo Guo, Bogdan Matuszewski, Mourad Gridach, Irina Voiculescu, Vishnusai Yoganand, Arnav Chavan, Aryan Raj, Nhan T Nguyen, Dat Q Tran, Le Duy Huynh, <a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, Shahadate Rezvy, Haijian Chen, Yoon Ho Choi, Anand Subramanian, Velmurugan Balasubramanian, Xiaohong W Gao, Hongyu Hu, Yusheng Liao, Danail Stoyanov, Christian Daul, Stefano Realdon, Renato Cannizzaro, Dominique Lamarque, Terry Tran-Nguyen, Adam Bailey, Barbara Braden, James East, Jens Rittscher</dd>
<dt>Journal </dt>
<dd>Medical Image Analysis</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2021-02-24</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>The Endoscopy Computer Vision Challenge (EndoCV) is a crowd-sourcing initiative to address eminent problems in developing reliable computer aided detection and diagnosis endoscopy systems and suggest a pathway for clinical translation of technologies. Whilst endoscopy is a widely used diagnostic and treatment tool for hollow-organsthere are several core challenges often faced by endoscopists, mainly: 1) presence of multi-class artefacts that hinder their visual interpretation, and 2) difficulty in identifying subtle precancerous precursors and cancer abnormalities. Artefacts often affect the robustness of deep learning methods applied to the gastrointestinal tract organs as they can be confused with tissue of interest. EndoCV2020 challenges are designed to address research questions in these remits. In this paper, we present a summary of methods developed by the top 17 teams and provide an objective comparison of state-of-the-art methods and methods designed by the participants for two sub-challenges: i) artefact detection and segmentation (EAD2020), and ii) disease detection and segmentation (EDD2020). Multi-center, multi-organ, multi-class, and multi-modal clinical endoscopy datasets were compiled for both EAD2020 and EDD2020 sub-challenges. The out-of-sample generalization ability of detection algorithms was also evaluated. Whilst most teams focused on accuracy improvements, only a few methods hold credibility for clinical usability. The best performing teams provided solutions to tackle class imbalance, and variabilities in size, origin, modality and occurrences by exploring data augmentation, data fusion, and optimal class thresholding techniques.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/boutry.21.media.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ boutry.21.media,
author = {Sharib Ali and Mariia Dmitrieva and Noha Ghatwary and
Sophia Bano and Gorkem Polat and Alptekin Temizel and
Adrian Krenzer and Amar Hekalo and Yun Bo Guo and Bogdan
Matuszewski and Mourad Gridach and Irina Voiculescu and
Vishnusai Yoganand and Arnav Chavan and Aryan Raj and Nhan
T. Nguyen and Dat Q. Tran and Le Duy Huynh and Nicolas
Boutry and Shahadate Rezvy and Haijian Chen and Yoon Ho
Choi and Anand Subramanian and Velmurugan Balasubramanian
and Xiaohong W. Gao and Hongyu Hu and Yusheng Liao and
Danail Stoyanov and Christian Daul and Stefano Realdon and
Renato Cannizzaro and Dominique Lamarque and Terry
Tran-Nguyen and Adam Bailey and Barbara Braden and James
East and Jens Rittscher},
title = {Deep Learning for Detection and Segmentation of Artefact
and Disease Instances in Gastrointestinal Endoscopy},
journal = {Medical Image Analysis},
number = {102002},
year = {2021},
doi = {10.1016/j.media.2021.102002},
abstract = {The Endoscopy Computer Vision Challenge (EndoCV) is a
crowd-sourcing initiative to address eminent problems in
developing reliable computer aided detection and diagnosis
endoscopy systems and suggest a pathway for clinical
translation of technologies. Whilst endoscopy is a widely
used diagnostic and treatment tool for hollow-organs, there
are several core challenges often faced by endoscopists,
mainly: 1) presence of multi-class artefacts that hinder
their visual interpretation, and 2) difficulty in
identifying subtle precancerous precursors and cancer
abnormalities. Artefacts often affect the robustness of
deep learning methods applied to the gastrointestinal tract
organs as they can be confused with tissue of interest.
EndoCV2020 challenges are designed to address research
questions in these remits. In this paper, we present a
summary of methods developed by the top 17 teams and
provide an objective comparison of state-of-the-art methods
and methods designed by the participants for two
sub-challenges: i) artefact detection and segmentation
(EAD2020), and ii) disease detection and segmentation
(EDD2020). Multi-center, multi-organ, multi-class, and
multi-modal clinical endoscopy datasets were compiled for
both EAD2020 and EDD2020 sub-challenges. The out-of-sample
generalization ability of detection algorithms was also
evaluated. Whilst most teams focused on accuracy
improvements, only a few methods hold credibility for
clinical usability. The best performing teams provided
solutions to tackle class imbalance, and variabilities in
size, origin, modality and occurrences by exploring data
augmentation, data fusion, and optimal class thresholding
techniques.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 02 Mar 2021 15:30:24 GMTBotCombining Deep Learning and Mathematical Morphology for Historical Map Segmentation
https://www.lrde.epita.fr/wiki/Publications/chen.21.dgmm
https://www.lrde.epita.fr/wiki/Publications/chen.21.dgmm<div class="mw-parser-output"><p><a class="mw-selflink selflink">Combining Deep Learning and Mathematical Morphology for Historical Map Segmentation</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Yizi Chen, <a href="/wiki/User:Carlinet" title="User:Carlinet">Edwin Carlinet</a>, <a href="/wiki/User:Chazalon" title="User:Chazalon">Joseph Chazalon</a>, Clément Mallet, Bertrand Duménieu, Julien Perret</dd>
<dt>Where </dt>
<dd>IAPR International Conference on Discrete Geometry and Mathematical Morphology (DGMM)</dd>
<dt>Place </dt>
<dd>Uppsala, Sweden</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2021-02-16</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>The digitization of historical maps enables the study of ancient, fragile, unique, and hardly accessible information sources. Main map features can be retrieved and tracked through the time for subsequent thematic analysis. The goal of this work is the vectorization stepi.e., the extraction of vector shapes of the objects of interest from raster images of maps. We are particularly interested in closed shape detection such as buildingsbuilding blocks, gardens, rivers, etc. in order to monitor their temporal evolution. Historical map images present significant pattern recognition challenges. The extraction of closed shapes by using traditional Mathematical Morphology (MM) is highly challenging due to the overlapping of multiple map features and texts. Moreoverstate-of-the-art Convolutional Neural Networks (CNN) are perfectly designed for content image filtering but provide no guarantee about closed shape detection. Also, the lack of textural and color information of historical maps makes it hard for CNN to detect shapes that are represented by only their boundaries. Our contribution is a pipeline that combines the strengths of CNN (efficient edge detection and filtering) and MM (guaranteed extraction of closed shapes) in order to achieve such a task. The evaluation of our approach on a public dataset shows its effectiveness for extracting the closed boundaries of objects in historical maps.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/chen.2021.dgmm.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ chen.21.dgmm,
author = {Yizi Chen and Edwin Carlinet and Joseph Chazalon and
Cl\'ement Mallet and Bertrand Dum\'enieu and Julien Perret},
title = {Combining Deep Learning and Mathematical Morphology for
Historical Map Segmentation},
booktitle = {IAPR International Conference on Discrete Geometry and
Mathematical Morphology (DGMM)},
year = {2021},
series = {Lecture Notes in Computer Science},
month = may,
address = {Uppsala, Sweden},
publisher = {Springer},
abstract = {The digitization of historical maps enables the study of
ancient, fragile, unique, and hardly accessible information
sources. Main map features can be retrieved and tracked
through the time for subsequent thematic analysis. The goal
of this work is the vectorization step, i.e., the
extraction of vector shapes of the objects of interest from
raster images of maps. We are particularly interested in
closed shape detection such as buildings, building blocks,
gardens, rivers, etc. in order to monitor their temporal
evolution. Historical map images present significant
pattern recognition challenges. The extraction of closed
shapes by using traditional Mathematical Morphology (MM) is
highly challenging due to the overlapping of multiple map
features and texts. Moreover, state-of-the-art
Convolutional Neural Networks (CNN) are perfectly designed
for content image filtering but provide no guarantee about
closed shape detection. Also, the lack of textural and
color information of historical maps makes it hard for CNN
to detect shapes that are represented by only their
boundaries. Our contribution is a pipeline that combines
the strengths of CNN (efficient edge detection and
filtering) and MM (guaranteed extraction of closed shapes)
in order to achieve such a task. The evaluation of our
approach on a public dataset shows its effectiveness for
extracting the closed boundaries of objects in historical
maps.},
note = {Accepted}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 02 Mar 2021 15:30:34 GMTBotGoing beyond p-convolutions to learn grayscale morphological operators
https://www.lrde.epita.fr/wiki/Publications/kirszenberg.21.dgmm
https://www.lrde.epita.fr/wiki/Publications/kirszenberg.21.dgmm<div class="mw-parser-output"><p><a class="mw-selflink selflink">Going beyond p-convolutions to learn grayscale morphological operators</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Alexandre Kirszenberg, <a href="/wiki/User:Gtochon" title="User:Gtochon">Guillaume Tochon</a>, <a href="/wiki/User:Elodie" title="User:Elodie">Élodie Puybareau</a>, Jesus Angulo</dd>
<dt>Where </dt>
<dd>IAPR International Conference on Discrete Geometry and Mathematical Morphology (DGMM)</dd>
<dt>Place </dt>
<dd>Uppsala, Sweden</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2021-02-16</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Integrating mathematical morphology operations within deep neural networks has been subject to increasing attention lately. However, replacing standard convolution layers with erosions or dilations is particularly challenging because the min and max operations are not differentiable. Relying on the asymptotic behavior of the counter-harmonic mean, p-convolutional layers were proposed as a possible workaround to this issue since they can perform pseudo-dilation or pseudo-erosion operations (depending on the value of their inner parameter p), and very promising results were reported. In this work, we present two new morphological layers based on the same principle as the p-convolutional layer while circumventing its principal drawbacks, and demonstrate their potential interest in further implementations within deep convolutional neural network architectures.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/kirszie.2021.dgmm.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ kirszenberg.21.dgmm,
author = {Alexandre Kirszenberg and Guillaume Tochon and \'{E}lodie
Puybareau and Jesus Angulo},
title = {Going beyond p-convolutions to learn grayscale
morphological operators},
booktitle = {IAPR International Conference on Discrete Geometry and
Mathematical Morphology (DGMM)},
year = {2021},
series = {Lecture Notes in Computer Science},
month = may,
address = {Uppsala, Sweden},
publisher = {Springer},
abstract = {Integrating mathematical morphology operations within deep
neural networks has been subject to increasing attention
lately. However, replacing standard convolution layers with
erosions or dilations is particularly challenging because
the min and max operations are not differentiable. Relying
on the asymptotic behavior of the counter-harmonic mean,
p-convolutional layers were proposed as a possible
workaround to this issue since they can perform
pseudo-dilation or pseudo-erosion operations (depending on
the value of their inner parameter p), and very promising
results were reported. In this work, we present two new
morphological layers based on the same principle as the
p-convolutional layer while circumventing its principal
drawbacks, and demonstrate their potential interest in
further implementations within deep convolutional neural
network architectures.},
note = {Accepted}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 02 Mar 2021 15:26:10 GMTBotSeminar/2021-02-10
https://www.lrde.epita.fr/wiki/Seminar/2021-02-10
https://www.lrde.epita.fr/wiki/Seminar/2021-02-10<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminar/2021-02-10</a>
</p></div><div class="mw-parser-output"><h3><span id="Mercredi_10_février_2021,_11h_-_12h,_{\small_https://meet.jit.si/Seminaire$_$LRDE$_$Uli"></span><span class="mw-headline" id="Mercredi_10_f.C3.A9vrier_2021.2C_11h_-_12h.2C_.7B.5Csmall_https:.2F.2Fmeet.jit.si.2FSeminaire.24_.24LRDE.24_.24Uli"><a class="mw-selflink selflink"> Mercredi 10 février 2021, 11h - 12h, {\small https://meet.jit.si/Seminaire$_$LRDE$_$Uli</a></span></h3>
<p><br />
</p>
<h4><span class="mw-headline" id="Generating_Posets_Beyond_N">Generating Posets Beyond N</span></h4>
<p><i>Uli Fahrenberg, Ecole Polytechnique</i>
<br/>
<br/>
</p><p>We introduce iposets - posets with interfaces - equipped with a novel gluing
composition along interfaces and the standard parallel composition. We study
their basic algebraic properties as well as the hierarchy of gluing-parallel
posets generated from singletons by finitary applications of the two
compositions. We show that not only series-parallel posets, but also
interval orders, which seem more interesting for modeling concurrent and
distributed systems, can be generated, but not all posets. Generating posets
is also important for constructing free algebras for concurrent semi-rings
and Kleene algebras that allow compositional reasoning about such systems.
<br/>
<br/>
</p><p><small>Ulrich (Uli) Fahrenberg holds a PhD in mathematics from Aalborg University, Denmark. He has started his career in computer science as an assistant professor at Aalborg University. Afterwards he has worked as a postdoc at Inria Rennes, France, and since 2016 he is a researcher at the computer science lab at École polytechnique in Palaiseau, France. Uli Fahrenberg works in algebraic topology, concurrency theory, real-time verification, and general quantitative verification. He has published more than 80 papers in computer science and mathematics. He has been a member of numerous program committees, and since 2016 he is a reviewer for AMS Mathematical Reviews.</small>
<br/>
<br/>
<a rel="nofollow" class="external text" href="http://www.lix.polytechnique.fr/~uli/bio.html">http://www.lix.polytechnique.fr/~uli/bio.html</a>
</p></div>Tue, 26 Jan 2021 19:07:08 GMTBotSeminar/2020-12-16
https://www.lrde.epita.fr/wiki/Seminar/2020-12-16
https://www.lrde.epita.fr/wiki/Seminar/2020-12-16<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminar/2020-12-16</a>
</p></div><div class="mw-parser-output"><h3><span id="Mercredi_16_décembre_2020,_11h_-_12h,_{\small_https://eu.bbcollab.com/collab/ui/session/guest/95a72a9dc7b0405c8c281ea3157e9637}"></span><span class="mw-headline" id="Mercredi_16_d.C3.A9cembre_2020.2C_11h_-_12h.2C_.7B.5Csmall_https:.2F.2Feu.bbcollab.com.2Fcollab.2Fui.2Fsession.2Fguest.2F95a72a9dc7b0405c8c281ea3157e9637.7D"><a class="mw-selflink selflink"> Mercredi 16 décembre 2020, 11h - 12h, {\small https://eu.bbcollab.com/collab/ui/session/guest/95a72a9dc7b0405c8c281ea3157e9637}</a></span></h3>
<p><br />
</p>
<h4><span class="mw-headline" id="Diagnosis_and_Opacity_in_Partially_Observable_Systems">Diagnosis and Opacity in Partially Observable Systems</span></h4>
<p><i>Stefan Schwoon, ENS Paris-Saclay</i>
<br/>
<br/>
</p><p>In a partially observable system, diagnosis is the task of detecting certain events, for instance fault occurrences. In the presence of hostile observers, on the other hand, one is interested in rendering a system opaque, i.e. making it impossible to detect certain "secret" events. The talk will present some decidability and complexity results for these two problems
when the system is represented as a finite automaton or a Petri net. We then also consider the problem of active diagnosis, where the observer has some control over the system. In this context, we study problems such as the computational complexity of the synthesis problem, the memory required for the controller, and the delay between a fault occurrence and its detection by the diagnoser. The talk is based on joint work with B. Bérard, S. Haar, S. Haddad, T. Melliti, and S. Schmitz.
<br/>
<br/>
</p><p><small>Stefan Schwoon studied Computer Science at the University of Hildesheim and received a PhD from the Technical University of Munich in 2002. He held the position of Scientific Assistent at the University of Stuttgart from 2002 to 2007, and at the Technical University in Munich from 2007 to 2009. He is currently Associate Professor (Maître de conférences) at Laboratoire Spécification et Vérification (LSV), ENS Paris-Saclay, and a member of the INRIA team Mexico. His research interests include model checking and diagnosis on concurrent and partially-observable systems.</small>
<br/>
<br/>
<a rel="nofollow" class="external text" href="http://www.lsv.fr/~schwoon/">http://www.lsv.fr/~schwoon/</a>
</p></div>Tue, 26 Jan 2021 19:07:07 GMTBotNewsEntry (2020/11/16)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/11/16)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/11/16)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/11/16)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>The LRDE hosts a new member, Baptiste Esteban, who joins the <a href="/wiki/Olena" title="Olena">Olena</a> team for his PhD studies.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
<p>After completing <a rel="nofollow" class="external text" href="https://www.epita.fr/nos-formations/diplome-ingenieur/cycle-ingenieur/les-majeures/">EPITA's IMAGE and RDI double major</a>, Baptiste is back at LRDE for his PhD. Having worked on noise estimation in natural images with mathematical morphology approaches, he will now focus on how to conciliate genericity and performance of image processing algorithms in dynamic contexts, especially noise estimation as a validation framework.
</p>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/11/16
</p>
</td></tr></table>
</div>Wed, 18 Nov 2020 09:45:01 GMTDanielaA global benchmark of algorithms for segmenting the left atrium from late gadolinium-enhanced cardiac magnetic resonance imaging
https://www.lrde.epita.fr/wiki/Publications/xiong.20.media
https://www.lrde.epita.fr/wiki/Publications/xiong.20.media<div class="mw-parser-output"><p><a class="mw-selflink selflink">A global benchmark of algorithms for segmenting the left atrium from late gadolinium-enhanced cardiac magnetic resonance imaging</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Zhaohan Xiong, Qing Xia, Zhiqiang Hu, Ning Huang, Cheng Bian, Yefeng Zheng, Sulaiman Vesal, Nishant Ravikumar, Andreas Maier, Xin Yang, Pheng-Ann Heng, Dong Ni, Caizi Li, Qianqian Tong, Weixin Si, <a href="/wiki/User:Elodie" title="User:Elodie">Elodie Puybareau</a>, Younes Khoudli, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a>, Chen Chen, Wenjia Bai, Daniel Rueckert, Lingchao Xu, Xiahai Zhuang, Xinzhe Luo, Shuman Jia, Maxime Sermesant, Yashu Liu, Kuanquan Wang, Davide Borra, Alessandro Masci, Cristiana Corsi, Coen de Vente, Mitko Veta, Rashed Karim, Chandrakanth Jayachandran Preetha, Sandy Engelhardt, Menyun Qiao, Yuanyuan Wang, Qian Tao, Marta Nunez-Garcia, Oscar Camara, Nicolo Savioli, Pablo Lamata, Jichao Zhao</dd>
<dt>Journal </dt>
<dd>Medical Image Analysis</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Date </dt>
<dd>2020-11-10</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Segmentation of medical images, particularly late gadolinium-enhanced magnetic resonance imaging (LGE-MRI) used for visualizing diseased atrial structures, is a crucial first step for ablation treatment of atrial fibrillation. However, direct segmentation of LGE-MRIs is challenging due to the varying intensities caused by contrast agents. Since most clinical studies have relied on manual, labor-intensive approaches, automatic methods are of high interest, particularly optimized machine learning approaches. To address this, we organized the 2018 Left Atrium Segmentation Challenge using 154 3D LGE-MRIscurrently the world's largest atrial LGE-MRI dataset, and associated labels of the left atrium segmented by three medical experts, ultimately attracting the participation of 27 international teams. In this paper, extensive analysis of the submitted algorithms using technical and biological metrics was performed by undergoing subgroup analysis and conducting hyper-parameter analysis, offering an overall picture of the major design choices of convolutional neural networks (CNNs) and practical considerations for achieving state-of-the-art left atrium segmentation. Results show that the top method achieved a Dice score of 93.2% and a mean surface to surface distance of 0.7 mm, significantly outperforming prior state-of-the-art. Particularly, our analysis demonstrated that double sequentially used CNNsin which a first CNN is used for automatic region-of-interest localization and a subsequent CNN is used for refined regional segmentation, achieved superior results than traditional methods and machine learning approaches containing single CNNs. This large-scale benchmarking study makes a significant step towards much-improved segmentation methods for atrial LGE-MRIs, and will serve as an important benchmark for evaluating and comparing the future works in the field. Furthermore, the findings from this study can potentially be extended to other imaging datasets and modalities, having an impact on the wider medical imaging community.
</p><p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ xiong.20.media,
title = {A global benchmark of algorithms for segmenting the left
atrium from late gadolinium-enhanced cardiac magnetic
resonance imaging},
journal = {Medical Image Analysis},
volume = {67},
pages = {101832},
year = {2021},
issn = {1361-8415},
doi = {10.1016/j.media.2020.101832},
author = {Zhaohan Xiong and Qing Xia and Zhiqiang Hu and Ning Huang
and Cheng Bian and Yefeng Zheng and Sulaiman Vesal and
Nishant Ravikumar and Andreas Maier and Xin Yang and
Pheng-Ann Heng and Dong Ni and Caizi Li and Qianqian Tong
and Weixin Si and Elodie Puybareau and Younes Khoudli and
Thierry G\'{e}raud and Chen Chen and Wenjia Bai and Daniel
Rueckert and Lingchao Xu and Xiahai Zhuang and Xinzhe Luo
and Shuman Jia and Maxime Sermesant and Yashu Liu and
Kuanquan Wang and Davide Borra and Alessandro Masci and
Cristiana Corsi and Coen {de Vente} and Mitko Veta and
Rashed Karim and Chandrakanth Jayachandran Preetha and
Sandy Engelhardt and Menyun Qiao and Yuanyuan Wang and Qian
Tao and Marta Nunez-Garcia and Oscar Camara and Nicolo
Savioli and Pablo Lamata and Jichao Zhao},
keywords = {Left atrium, Convolutional neural networks, Late
gadolinium-enhanced magnetic resonance imaging, Image
segmentation},
abstract = {Segmentation of medical images, particularly late
gadolinium-enhanced magnetic resonance imaging (LGE-MRI)
used for visualizing diseased atrial structures, is a
crucial first step for ablation treatment of atrial
fibrillation. However, direct segmentation of LGE-MRIs is
challenging due to the varying intensities caused by
contrast agents. Since most clinical studies have relied on
manual, labor-intensive approaches, automatic methods are
of high interest, particularly optimized machine learning
approaches. To address this, we organized the 2018 Left
Atrium Segmentation Challenge using 154 3D LGE-MRIs,
currently the world's largest atrial LGE-MRI dataset, and
associated labels of the left atrium segmented by three
medical experts, ultimately attracting the participation of
27 international teams. In this paper, extensive analysis
of the submitted algorithms using technical and biological
metrics was performed by undergoing subgroup analysis and
conducting hyper-parameter analysis, offering an overall
picture of the major design choices of convolutional neural
networks (CNNs) and practical considerations for achieving
state-of-the-art left atrium segmentation. Results show
that the top method achieved a Dice score of 93.2\% and a
mean surface to surface distance of 0.7 mm, significantly
outperforming prior state-of-the-art. Particularly, our
analysis demonstrated that double sequentially used CNNs,
in which a first CNN is used for automatic
region-of-interest localization and a subsequent CNN is
used for refined regional segmentation, achieved superior
results than traditional methods and machine learning
approaches containing single CNNs. This large-scale
benchmarking study makes a significant step towards
much-improved segmentation methods for atrial LGE-MRIs, and
will serve as an important benchmark for evaluating and
comparing the future works in the field. Furthermore, the
findings from this study can potentially be extended to
other imaging datasets and modalities, having an impact on
the wider medical imaging community.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:48:08 GMTBotPAIP 2019: Liver cancer segmentation challenge
https://www.lrde.epita.fr/wiki/Publications/kim.20.media
https://www.lrde.epita.fr/wiki/Publications/kim.20.media<div class="mw-parser-output"><p><a class="mw-selflink selflink">PAIP 2019: Liver cancer segmentation challenge</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Yoo Jung Kim, Hyungjoon Jang, Kyoungbun Lee, Seongkeun Park, Sung-Gyu Min, Choyeon Hong, Jeong Hwan Park, Kanggeun Lee, Jisoo Kim, Wonjae Hong, Hyun Jung, Yanling Liu, Haran Rajkumar, Mahendra Khened, Ganapathy Krishnamurthi, Sen Yang, Xiyue Wang, Chang Hee Han, Jin Tae Kwak, Jianqiang Ma, Zhe Tang, Bahram Marami, Jack Zeineh, Zixu Zhao, Pheng-Ann Heng, Rudiger Schmitz, Frederic Madesta, Thomas Rosch, Rene Werner, Jie Tian, <a href="/wiki/User:Elodie" title="User:Elodie">Elodie Puybareau</a>, Matteo Bovio, Xiufeng Zhang, Yifeng Zhu, Se Young Chun, Won-Ki Jeong, Peom Park, Jinwook Choi</dd>
<dt>Journal </dt>
<dd>Medical Image Analysis</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Date </dt>
<dd>2020-11-10</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Pathology Artificial Intelligence Platform (PAIP) is a free research platform in support of pathological artificial intelligence (AI). The main goal of the platform is to construct a high-quality pathology learning data set that will allow greater accessibility. The PAIP Liver Cancer Segmentation Challenge, organized in conjunction with the Medical Image Computing and Computer Assisted Intervention Society (MICCAI 2019), is the first image analysis challenge to apply PAIP datasets. The goal of the challenge was to evaluate new and existing algorithms for automated detection of liver cancer in whole-slide images (WSIs). Additionally, the PAIP of this year attempted to address potential future problems of AI applicability in clinical settings. In the challenge, participants were asked to use analytical data and statistical metrics to evaluate the performance of automated algorithms in two different tasks. The participants were given the two different tasks: Task 1 involved investigating Liver Cancer Segmentation and Task 2 involved investigating Viable Tumor Burden Estimation. There was a strong correlation between high performance of teams on both tasks, in which teams that performed well on Task 1 also performed well on Task 2. After evaluation, we summarized the top 11 team's algorithms. We then gave pathological implications on the easily predicted images for cancer segmentation and the challenging images for viable tumor burden estimation. Out of the 231 participants of the PAIP challenge datasets, a total of 64 were submitted from 28 team participants. The submitted algorithms predicted the automatic segmentation on the liver cancer with WSIs to an accuracy of a score estimation of 0.78. The PAIP challenge was created in an effort to combat the lack of research that has been done to address Liver cancer using digital pathology. It remains unclear of how the applicability of AI algorithms created during the challenge can affect clinical diagnoses. However, the results of this dataset and evaluation metric provided has the potential to aid the development and benchmarking of cancer diagnosis and segmentation.
</p><p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ kim.20.media,
title = {{PAIP} 2019: {L}iver cancer segmentation challenge},
journal = {Medical Image Analysis},
volume = {67},
pages = {101854},
year = {2021},
issn = {1361-8415},
doi = {10.1016/j.media.2020.101854},
author = {Yoo Jung Kim and Hyungjoon Jang and Kyoungbun Lee and
Seongkeun Park and Sung-Gyu Min and Choyeon Hong and Jeong
Hwan Park and Kanggeun Lee and Jisoo Kim and Wonjae Hong
and Hyun Jung and Yanling Liu and Haran Rajkumar and
Mahendra Khened and Ganapathy Krishnamurthi and Sen Yang
and Xiyue Wang and Chang Hee Han and Jin Tae Kwak and
Jianqiang Ma and Zhe Tang and Bahram Marami and Jack Zeineh
and Zixu Zhao and Pheng-Ann Heng and Rudiger Schmitz and
Frederic Madesta and Thomas Rosch and Rene Werner and Jie
Tian and Elodie Puybareau and Matteo Bovio and Xiufeng
Zhang and Yifeng Zhu and Se Young Chun and Won-Ki Jeong and
Peom Park and Jinwook Choi},
keywords = {Liver cancer, Tumor burden, Digital pathology, Challenge,
Segmentation},
abstract = {Pathology Artificial Intelligence Platform (PAIP) is a
free research platform in support of pathological
artificial intelligence (AI). The main goal of the platform
is to construct a high-quality pathology learning data set
that will allow greater accessibility. The PAIP Liver
Cancer Segmentation Challenge, organized in conjunction
with the Medical Image Computing and Computer Assisted
Intervention Society (MICCAI 2019), is the first image
analysis challenge to apply PAIP datasets. The goal of the
challenge was to evaluate new and existing algorithms for
automated detection of liver cancer in whole-slide images
(WSIs). Additionally, the PAIP of this year attempted to
address potential future problems of AI applicability in
clinical settings. In the challenge, participants were
asked to use analytical data and statistical metrics to
evaluate the performance of automated algorithms in two
different tasks. The participants were given the two
different tasks: Task 1 involved investigating Liver Cancer
Segmentation and Task 2 involved investigating Viable Tumor
Burden Estimation. There was a strong correlation between
high performance of teams on both tasks, in which teams
that performed well on Task 1 also performed well on Task
2. After evaluation, we summarized the top 11 team's
algorithms. We then gave pathological implications on the
easily predicted images for cancer segmentation and the
challenging images for viable tumor burden estimation. Out
of the 231 participants of the PAIP challenge datasets, a
total of 64 were submitted from 28 team participants. The
submitted algorithms predicted the automatic segmentation
on the liver cancer with WSIs to an accuracy of a score
estimation of 0.78. The PAIP challenge was created in an
effort to combat the lack of research that has been done to
address Liver cancer using digital pathology. It remains
unclear of how the applicability of AI algorithms created
during the challenge can affect clinical diagnoses.
However, the results of this dataset and evaluation metric
provided has the potential to aid the development and
benchmarking of cancer diagnosis and segmentation.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:47:30 GMTBotDo not Treat Boundaries and Regions Differently: An Example on Heart Left Atrial Segmentation
https://www.lrde.epita.fr/wiki/Publications/zhao.20.icpr.2
https://www.lrde.epita.fr/wiki/Publications/zhao.20.icpr.2<div class="mw-parser-output"><p><a class="mw-selflink selflink">Do not Treat Boundaries and Regions Differently: An Example on Heart Left Atrial Segmentation</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Zhou Zhao, <a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Elodie" title="User:Elodie">Élodie Puybareau</a>, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Where </dt>
<dd>Proceedings of the 25th International Conference on Pattern Recognition (ICPR)</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-11-02</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Atrial fibrillation is the most common heart rhythm disease. Due to a lack of understanding in matter of underlying atrial structures, current treatments are still not satisfying. Recently, with the popularity of deep learning, many segmentation methods based on fully convolutional networks have been proposed to analyze atrial structures, especially from late gadolinium-enhanced magnetic resonance imaging. However, two problems still occur: 1) segmentation results include the atrial- like background; 2) boundaries are very hard to segment. Most segmentation approaches design a specific network that mainly focuses on the regions, to the detriment of the boundaries. Therefore, this paper proposes an attention full convolutional network framework based on the ResNet-101 architecture, which focuses on boundaries as much as on regions. The additional attention module is added to have the network pay more attention on regions and then to reduce the impact of the misleading similarity of neighboring tissues. We also use a hybrid loss composed of a region loss and a boundary loss to treat boundaries and regions at the same time. We demonstrate the efficiency of the proposed approach on the MICCAI 2018 Atrial Segmentation Challenge public dataset.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/zhao.20.icpr.2.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ zhao.20.icpr.2,
author = {Zhou Zhao and Nicolas Boutry and \'Elodie Puybareau and
Thierry G\'eraud},
title = {Do not Treat Boundaries and Regions Differently: {A}n
Example on Heart Left Atrial Segmentation},
booktitle = {Proceedings of the 25th International Conference on
Pattern Recognition (ICPR)},
year = 2020,
abstract = {Atrial fibrillation is the most common heart rhythm
disease. Due to a lack of understanding in matter of
underlying atrial structures, current treatments are still
not satisfying. Recently, with the popularity of deep
learning, many segmentation methods based on fully
convolutional networks have been proposed to analyze atrial
structures, especially from late gadolinium-enhanced
magnetic resonance imaging. However, two problems still
occur: 1) segmentation results include the atrial- like
background; 2) boundaries are very hard to segment. Most
segmentation approaches design a specific network that
mainly focuses on the regions, to the detriment of the
boundaries. Therefore, this paper proposes an attention
full convolutional network framework based on the
ResNet-101 architecture, which focuses on boundaries as
much as on regions. The additional attention module is
added to have the network pay more attention on regions and
then to reduce the impact of the misleading similarity of
neighboring tissues. We also use a hybrid loss composed of
a region loss and a boundary loss to treat boundaries and
regions at the same time. We demonstrate the efficiency of
the proposed approach on the MICCAI 2018 Atrial
Segmentation Challenge public dataset.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Mon, 09 Nov 2020 16:21:51 GMTBotFOANet: A Focus of Attention Network with Application to Myocardium Segmentation
https://www.lrde.epita.fr/wiki/Publications/zhao.20.icpr.1
https://www.lrde.epita.fr/wiki/Publications/zhao.20.icpr.1<div class="mw-parser-output"><p><a class="mw-selflink selflink">FOANet: A Focus of Attention Network with Application to Myocardium Segmentation</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Zhou Zhao, <a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Elodie" title="User:Elodie">Élodie Puybareau</a>, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Where </dt>
<dd>Proceedings of the 25th International Conference on Pattern Recognition (ICPR)</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-11-02</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>In myocardium segmentation of cardiac magnetic resonance images, ambiguities often appear near the boundaries of the target domains due to tissue similarities. To address this issue, we propose a new architecture, called FOANet, which can be decomposed in three main steps: a localization stepa Gaussian-based contrast enhancement step, and a segmentation step. This architecture is supplied with a hybrid loss function that guides the FOANet to study the transformation relationship between the input image and the corresponding label in a three-level hierarchy (pixel-patch- and map-level), which is helpful to improve segmentation and recovery of the boundaries. We demonstrate the efficiency of our approach on two public datasets in terms of regional and boundary segmentations.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/zhao.20.icpr.1.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ zhao.20.icpr.1,
author = {Zhou Zhao and Nicolas Boutry and \'Elodie Puybareau and
Thierry G\'eraud},
title = {{FOANet}: {A} Focus of Attention Network with Application
to Myocardium Segmentation},
booktitle = {Proceedings of the 25th International Conference on
Pattern Recognition (ICPR)},
year = 2020,
abstract = {In myocardium segmentation of cardiac magnetic resonance
images, ambiguities often appear near the boundaries of the
target domains due to tissue similarities. To address this
issue, we propose a new architecture, called FOANet, which
can be decomposed in three main steps: a localization step,
a Gaussian-based contrast enhancement step, and a
segmentation step. This architecture is supplied with a
hybrid loss function that guides the FOANet to study the
transformation relationship between the input image and the
corresponding label in a three-level hierarchy (pixel-,
patch- and map-level), which is helpful to improve
segmentation and recovery of the boundaries. We demonstrate
the efficiency of our approach on two public datasets in
terms of regional and boundary segmentations.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Mon, 09 Nov 2020 16:21:50 GMTBotNewsEntry (2020/10/21)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/10/21)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/10/21)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/10/21)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>The LRDE is happy to welcome a new member, Caroline Mazini-Rodrigues, who joins the <a href="/wiki/Olena" title="Olena">Olena</a> team for her PhD studies.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
<p>Holding a Master degree in Computer Science from <a rel="nofollow" class="external text" href="https://www.unicamp.br">Universidade Estadual de Campinas</a>, Caroline joins LRDE’s Image team where she will focus on Explainability of Convolutional Neural Networks. Her PhD will be conducted in cooperation with <a rel="nofollow" class="external text" href="http://ligm.u-pem.fr">Laboratoire d’Informatique Gaspard-Monge</a>.
</p>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/10/21
</p>
</td></tr></table>
</div>Mon, 16 Nov 2020 15:50:34 GMTDanielaTwo Stages CNN-Based Segmentation of Gliomas, Uncertainty Quantification and Prediction of Overall Patient Survival
https://www.lrde.epita.fr/wiki/Publications/buatois.19.brainles
https://www.lrde.epita.fr/wiki/Publications/buatois.19.brainles<div class="mw-parser-output"><p><a class="mw-selflink selflink">Two Stages CNN-Based Segmentation of Gliomas, Uncertainty Quantification and Prediction of Overall Patient Survival</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Thibault Buatois, <a href="/wiki/User:Elodie" title="User:Elodie">Élodie Puybareau</a>, TochonGuillaume, <a href="/wiki/User:Chazalon" title="User:Chazalon">Joseph Chazalon</a></dd>
<dt>Where </dt>
<dd>International MICCAI Brainlesion Workshop</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-09-03</dd></dl>
</div>
<p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ buatois.19.brainles,
title = {Two Stages CNN-Based Segmentation of Gliomas, Uncertainty
Quantification and Prediction of Overall Patient Survival},
author = {Buatois, Thibault and Puybareau, {\'E}lodie and Tochon,
Guillaume and Chazalon, Joseph},
booktitle = {International MICCAI Brainlesion Workshop},
year = {2019},
editor = {A. Crimi and S. Bakas},
volume = {11992},
series = {Lecture Notes in Computer Science},
pages = {167--178},
publisher = {Springer}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Mon, 09 Nov 2020 16:20:37 GMTBotEquivalence between Digital Well-Composedness and Well-Composedness in the Sense of Alexandrov on n-D Cubical Grids
https://www.lrde.epita.fr/wiki/Publications/boutry.20.jmiv.2
https://www.lrde.epita.fr/wiki/Publications/boutry.20.jmiv.2<div class="mw-parser-output"><p><a class="mw-selflink selflink">Equivalence between Digital Well-Composedness and Well-Composedness in the Sense of Alexandrov on n-D Cubical Grids</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, Laurent Najman, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Journal </dt>
<dd>Journal of Mathematical Imaging and Vision</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-09-03</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Among the different flavors of well-composednesses on cubical grids, two of them, called respectively Digital Well-Composedness (DWCness) and Well-Composedness in the sens of Alexandrov (AWCness), are known to be equivalent in 2D and in 3D. The former means that a cubical set does not contain critical configurations when the latter means that the boundary of a cubical set is made of a disjoint union of discrete surfaces. In this paper, we prove that this equivalence holds in <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a601995d55609f2d9f5e233e36fbe9ea26011b3b" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\displaystyle n}"/></span>-D, which is of interest because today images are not only 2D or 3D but also 4D and beyond. The main benefit of this proof is that the topological properties available for AWC sets, mainly their separation properties, are also true for DWC sets, and the properties of DWC sets are also true for AWC sets: an Euler number locally computable, equivalent connectivities from a local or global point of view... This result is also true for gray-level images thanks to cross-section topology, which means that the sets of shapes of DWC gray-level images make a tree like the ones of AWC gray-level images.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/boutry.20.jmiv.2.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ boutry.20.jmiv.2,
author = {Nicolas Boutry and Laurent Najman and Thierry G\'eraud},
title = {Equivalence between Digital Well-Composedness and
Well-Composedness in the Sense of {A}lexandrov on {$n$-D}
Cubical Grids},
journal = {Journal of Mathematical Imaging and Vision},
volume = {62},
pages = {1285--1333},
month = sep,
year = {2020},
doi = {10.1007/s10851-020-00988-z},
abstract = {Among the different flavors of well-composednesses on
cubical grids, two of them, called respectively Digital
Well-Composedness (DWCness) and Well-Composedness in the
sens of Alexandrov (AWCness), are known to be equivalent in
2D and in 3D. The former means that a cubical set does not
contain critical configurations when the latter means that
the boundary of a cubical set is made of a disjoint union
of discrete surfaces. In this paper, we prove that this
equivalence holds in $n$-D, which is of interest because
today images are not only 2D or 3D but also 4D and beyond.
The main benefit of this proof is that the topological
properties available for AWC sets, mainly their separation
properties, are also true for DWC sets, and the properties
of DWC sets are also true for AWC sets: an Euler number
locally computable, equivalent connectivities from a local
or global point of view... This result is also true for
gray-level images thanks to cross-section topology, which
means that the sets of shapes of DWC gray-level images make
a tree like the ones of AWC gray-level images. }
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:46:45 GMTBotTopological Properties of the First Non-Local Digitally Well-Composed Interpolation on n-D Cubical Grids
https://www.lrde.epita.fr/wiki/Publications/boutry.20.jmiv.1
https://www.lrde.epita.fr/wiki/Publications/boutry.20.jmiv.1<div class="mw-parser-output"><p><a class="mw-selflink selflink">Topological Properties of the First Non-Local Digitally Well-Composed Interpolation on n-D Cubical Grids</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, Laurent Najman, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Journal </dt>
<dd>Journal of Mathematical Imaging and Vision</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-09-03</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>In discrete topology, we like digitally well-composed (shortly DWC) interpolations because they remove pinches in cubical images. Usual well-composed interpolations are local and sometimes self-dual (they treat in a same way dark and bright components in the image). In our case, we are particularly interested in <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a601995d55609f2d9f5e233e36fbe9ea26011b3b" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\displaystyle n}"/></span>-D self-dual DWC interpolations to obtain a purely self-dual tree of shapes. However, it has been proved that we cannot have an <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a601995d55609f2d9f5e233e36fbe9ea26011b3b" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\displaystyle n}"/></span>-D interpolation which is at the same time local, self-dualand well-composed. By removing the locality constraint, we have obtained an <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>n</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle n}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a601995d55609f2d9f5e233e36fbe9ea26011b3b" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\displaystyle n}"/></span>-D interpolation with many properties in practice: it is self-dual, DWC, and in-between (this last property means that it preserves the contours). Since we did not published the proofs of these results before, we propose to provide in a first time the proofs of the two last properties here (DWCness and in-betweeness) and a sketch of the proof of self-duality (the complete proof of self-duality requires more material and will come later). Some theoretical and practical results are given.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/boutry.20.jmiv.1.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ boutry.20.jmiv.1,
author = {Nicolas Boutry and Laurent Najman and Thierry G\'eraud},
title = {Topological Properties of the First Non-Local Digitally
Well-Composed Interpolation on {$n$-D} Cubical Grids},
journal = {Journal of Mathematical Imaging and Vision},
volume = {62},
pages = {1256--1284},
month = sep,
year = {2020},
doi = {10.1007/s10851-020-00989-y},
abstract = {In discrete topology, we like digitally well-composed
(shortly DWC) interpolations because they remove pinches in
cubical images. Usual well-composed interpolations are
local and sometimes self-dual (they treat in a same way
dark and bright components in the image). In our case, we
are particularly interested in $n$-D self-dual DWC
interpolations to obtain a purely self-dual tree of shapes.
However, it has been proved that we cannot have an $n$-D
interpolation which is at the same time local, self-dual,
and well-composed. By removing the locality constraint, we
have obtained an $n$-D interpolation with many properties
in practice: it is self-dual, DWC, and in-between (this
last property means that it preserves the contours). Since
we did not published the proofs of these results before, we
propose to provide in a first time the proofs of the two
last properties here (DWCness and in-betweeness) and a
sketch of the proof of self-duality (the complete proof of
self-duality requires more material and will come later).
Some theoretical and practical results are given. }
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:46:43 GMTBotA Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers
https://www.lrde.epita.fr/wiki/Publications/nejati.20.cp
https://www.lrde.epita.fr/wiki/Publications/nejati.20.cp<div class="mw-parser-output"><p><a class="mw-selflink selflink">A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Saeed Nejati, <a href="/wiki/User:Ludovic" title="User:Ludovic">Ludovic Le Frioux</a>, Vijay Ganesh</dd>
<dt>Where </dt>
<dd>Proceedings of the 26 th International Conference on Principles and Practice of Constraint Programming (CP'20)</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer,_Cham&action=edit&redlink=1" class="new" title="Springer, Cham (page does not exist)">Springer, Cham</a></dd>
<dt>Keywords </dt>
<dd>Parallel satisfiability, splitting heuristicdivide-and-conquer, machine learning</dd>
<dt>Date </dt>
<dd>2020-09-01</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>In this paper, we present a machine learning based splitting heuristic for divide-and-conquer parallel Boolean SAT solvers. Splitting heuristics, whether they are look-ahead or look-back, are designed using proxy metrics, which when optimized, approximate the true metric of minimizing solver runtime on sub-formulas resulting from a split. The rationale for such metrics is that they have been empirically shown to be excellent proxies for runtime of solvers, in addition to being cheap to compute in an online fashion. However, the design of traditional splitting methods are often ad-hoc and do not leverage the copious amounts of data that solvers generate. To address the above-mentioned issues, we propose a machine learning based splitting heuristic that leverages the features of input formulas and data generated during the run of a divide-and-conquer (DC) parallel solver. More preciselywe reformulate the splitting problem as a ranking problem and develop two machine learning models for pairwise ranking and computing the minimum ranked variable. Our model can compare variables according to their splitting quality, which is based on a set of features extracted from structural properties of the input formula, as well as dynamic probing statisticscollected during the solver's run. We derive the true labels through offline collection of runtimes of a parallel DC solver on sample formulas and variables within them. At each splitting point, we generate a predicted ranking (pairwise or minimum rank) of candidate variables and split the formula on the top variable. We implemented our heuristic in the Painless parallel SAT framework and evaluated our solver on a set of cryptographic instances encoding the SHA-1 preimage as well as SAT competition 2018 and 2019 benchmarks. We solve significantly more instances compared to the baseline Painless solver and outperform top divide-and-conquer solvers from recent SAT competitions, such as Treengeling. Furthermore, we are much faster than these top solvers on cryptographic benchmarks.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/nejati.20.cp.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ nejati.20.cp,
author = {Saeed Nejati and Ludovic {Le Frioux} and Vijay Ganesh},
title = {A Machine Learning Based Splitting Heuristic for
Divide-and-Conquer Solvers},
booktitle = {Proceedings of the 26 th International Conference on
Principles and Practice of Constraint Programming (CP'20)},
year = 2020,
month = sep,
volume = {12333},
pages = {899--916},
series = {Lecture Notes in Computer Science},
publisher = {Springer, Cham},
abstract = {In this paper, we present a machine learning based
splitting heuristic for divide-and-conquer parallel Boolean
SAT solvers. Splitting heuristics, whether they are
look-ahead or look-back, are designed using proxy metrics,
which when optimized, approximate the true metric of
minimizing solver runtime on sub-formulas resulting from a
split. The rationale for such metrics is that they have
been empirically shown to be excellent proxies for runtime
of solvers, in addition to being cheap to compute in an
online fashion. However, the design of traditional
splitting methods are often ad-hoc and do not leverage the
copious amounts of data that solvers generate. To address
the above-mentioned issues, we propose a machine learning
based splitting heuristic that leverages the features of
input formulas and data generated during the run of a
divide-and-conquer (DC) parallel solver. More precisely, we
reformulate the splitting problem as a ranking problem and
develop two machine learning models for pairwise ranking
and computing the minimum ranked variable. Our model can
compare variables according to their splitting quality,
which is based on a set of features extracted from
structural properties of the input formula, as well as
dynamic probing statistics, collected during the solver's
run. We derive the true labels through offline collection
of runtimes of a parallel DC solver on sample formulas and
variables within them. At each splitting point, we generate
a predicted ranking (pairwise or minimum rank) of candidate
variables and split the formula on the top variable. We
implemented our heuristic in the Painless parallel SAT
framework and evaluated our solver on a set of
cryptographic instances encoding the SHA-1 preimage as well
as SAT competition 2018 and 2019 benchmarks. We solve
significantly more instances compared to the baseline
Painless solver and outperform top divide-and-conquer
solvers from recent SAT competitions, such as Treengeling.
Furthermore, we are much faster than these top solvers on
cryptographic benchmarks.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Wed, 10 Mar 2021 08:34:24 GMTBotOn the Usefulness of Clause Strengthening in Parallel SAT Solving
https://www.lrde.epita.fr/wiki/Publications/vallade.20.nfm
https://www.lrde.epita.fr/wiki/Publications/vallade.20.nfm<div class="mw-parser-output"><p><a class="mw-selflink selflink">On the Usefulness of Clause Strengthening in Parallel SAT Solving</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Vincent Vallade, <a href="/wiki/User:Ludovic" title="User:Ludovic">Ludovic Le Frioux</a>, <a href="/wiki/User:Sbaarir" title="User:Sbaarir">Souheib Baarir</a>, Julien Sopena, Fabrice Kordon</dd>
<dt>Where </dt>
<dd>Proceedings of the 12th NASA Formal Methods Symposium (NFM'20)</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer,_Cham&action=edit&redlink=1" class="new" title="Springer, Cham (page does not exist)">Springer, Cham</a></dd>
<dt>Keywords </dt>
<dd>Parallel satisfiability, tool, strengthening, clause sharingportfolio, divide-and-conquer</dd>
<dt>Date </dt>
<dd>2020-08-01</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>In the context of parallel SATisfiability solving, this paper presents an implementation and evaluation of a clause strengthening algorithm. The developed component can be easily combined with (virtually) any CDCL-like SAT solver. Our implementation is integrated as a part of Painless, a generic and modular framework for building parallel SAT solvers.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/vallade.20.nfm.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ vallade.20.nfm,
author = {Vincent Vallade and Ludovic {Le Frioux} and Souheib Baarir
and Julien Sopena and Fabrice Kordon},
title = {On the Usefulness of Clause Strengthening in Parallel
{SAT} Solving},
booktitle = {Proceedings of the 12th NASA Formal Methods Symposium
(NFM'20)},
year = 2020,
month = aug,
volume = {12229},
pages = {222--229},
series = {Lecture Notes in Computer Science},
publisher = {Springer, Cham},
abstract = {In the context of parallel SATisfiability solving, this
paper presents an implementation and evaluation of a clause
strengthening algorithm. The developed component can be
easily combined with (virtually) any CDCL-like SAT solver.
Our implementation is integrated as a part of Painless, a
generic and modular framework for building parallel SAT
solvers.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Wed, 10 Mar 2021 08:34:39 GMTBotEuler Well-Composedness
https://www.lrde.epita.fr/wiki/Publications/boutry.20.iwcia1
https://www.lrde.epita.fr/wiki/Publications/boutry.20.iwcia1<div class="mw-parser-output"><p><a class="mw-selflink selflink">Euler Well-Composedness</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, Rocio Gonzalez-Diaz, Maria-Jose Jimenez, Eduardo Paluzo-Hildago</dd>
<dt>Where </dt>
<dd>Combinatorial Image Analysis: Proceedings of the 20th International Workshop, IWCIA 2020, Novi Sad, Serbia, July 16–18, 2020</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2020-07-21</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>In this paper, we define a new flavour of well-composedness, called Euler well-composedness, in the general setting of regular cell complexes: A regular cell complex is Euler well-composed if the Euler characteristic of the link of each boundary vertex is <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle 1}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mn>1</mn>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle 1}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/92d98b82a3778f043108d4e20960a9193df57cbf" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.162ex; height:2.176ex;" alt="{\displaystyle 1}"/></span>. A cell decomposition of a picture <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle I}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>I</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle I}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/535ea7fc4134a31cbe2251d9d3511374bc41be9f" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.172ex; height:2.176ex;" alt="{\displaystyle I}"/></span> is a pair of regular cell complexes <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\big (}K(I),K({\bar {I}}){\big )}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mo maxsize="1.2em" minsize="1.2em">(</mo>
</mrow>
</mrow>
<mi>K</mi>
<mo stretchy="false">(</mo>
<mi>I</mi>
<mo stretchy="false">)</mo>
<mo>,</mo>
<mi>K</mi>
<mo stretchy="false">(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mover>
<mi>I</mi>
<mo stretchy="false">¯<!-- ¯ --></mo>
</mover>
</mrow>
</mrow>
<mo stretchy="false">)</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mo maxsize="1.2em" minsize="1.2em">)</mo>
</mrow>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\big (}K(I),K({\bar {I}}){\big )}}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/c988b0f7f3156a1955a5d03ac791755a56f8b5fb" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -1.005ex; width:13.608ex; height:3.176ex;" alt="{\displaystyle {\big (}K(I),K({\bar {I}}){\big )}}"/></span> such that <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K(I)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>K</mi>
<mo stretchy="false">(</mo>
<mi>I</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle K(I)}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/729811dcd08c0366b3b912c3b3b29e0996a1923f" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.838ex; width:5.047ex; height:2.843ex;" alt="{\displaystyle K(I)}"/></span> (resp. <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K({\bar {I}})}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>K</mi>
<mo stretchy="false">(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mover>
<mi>I</mi>
<mo stretchy="false">¯<!-- ¯ --></mo>
</mover>
</mrow>
</mrow>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle K({\bar {I}})}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/b8a714060a73ca0285d6d969519e924d15e0f471" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.838ex; width:5.397ex; height:3.009ex;" alt="{\displaystyle K({\bar {I}})}"/></span>) is a topological and geometrical model representing <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle I}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>I</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle I}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/535ea7fc4134a31cbe2251d9d3511374bc41be9f" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.172ex; height:2.176ex;" alt="{\displaystyle I}"/></span> (resp. its complementary, <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\bar {I}}}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mover>
<mi>I</mi>
<mo stretchy="false">¯<!-- ¯ --></mo>
</mover>
</mrow>
</mrow>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle {\bar {I}}}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/ab2ee9e7dd5523b6c8794be941a43f52a3063199" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.522ex; height:2.509ex;" alt="{\displaystyle {\bar {I}}}"/></span>). Then, a cell decomposition of a picture <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle I}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>I</mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle I}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/535ea7fc4134a31cbe2251d9d3511374bc41be9f" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.172ex; height:2.176ex;" alt="{\displaystyle I}"/></span> is self-dual Euler well-composed if both <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K(I)}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>K</mi>
<mo stretchy="false">(</mo>
<mi>I</mi>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle K(I)}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/729811dcd08c0366b3b912c3b3b29e0996a1923f" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.838ex; width:5.047ex; height:2.843ex;" alt="{\displaystyle K(I)}"/></span> and <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle K({\bar {I}})}">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>K</mi>
<mo stretchy="false">(</mo>
<mrow class="MJX-TeXAtom-ORD">
<mrow class="MJX-TeXAtom-ORD">
<mover>
<mi>I</mi>
<mo stretchy="false">¯<!-- ¯ --></mo>
</mover>
</mrow>
</mrow>
<mo stretchy="false">)</mo>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle K({\bar {I}})}</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/b8a714060a73ca0285d6d969519e924d15e0f471" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.838ex; width:5.397ex; height:3.009ex;" alt="{\displaystyle K({\bar {I}})}"/></span> are Euler well-composed. We prove in this paper that, firstself-dual Euler well-composedness is equivalent to digital well-composedness in dimension 2 and 3, and second, in dimension 4, self-dual Euler well-composedness implies digital well-composedness, though the converse is not true.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/boutry.20.iwcia1.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ boutry.20.iwcia1,
author = {Nicolas Boutry and Rocio Gonzalez-Diaz and Maria-Jose
Jimenez and Eduardo Paluzo-Hildago},
title = {Euler Well-Composedness},
booktitle = {Combinatorial Image Analysis: Proceedings of the 20th
International Workshop, IWCIA 2020, Novi Sad, Serbia, July
16--18, 2020},
year = 2020,
editor = {T. Lukic and R. P. Barneva and V. Brimkov and L. Comic and
N. Sladoje},
volume = {12148},
series = {Lecture Notes in Computer Science},
pages = {3--19},
publisher = {Springer},
doi = {10.1007/978-3-030-51002-2_1},
abstract = {In this paper, we define a new flavour of
well-composedness, called Euler well-composedness, in the
general setting of regular cell complexes: A regular cell
complex is Euler well-composed if the Euler characteristic
of the link of each boundary vertex is $1$. A cell
decomposition of a picture $I$ is a pair of regular cell
complexes $\big(K(I),K(\bar{I})\big)$ such that $K(I)$
(resp. $K(\bar{I})$) is a topological and geometrical model
representing $I$ (resp. its complementary, $\bar{I}$).
Then, a cell decomposition of a picture $I$ is self-dual
Euler well-composed if both $K(I)$ and $K(\bar{I})$ are
Euler well-composed. We prove in this paper that, first,
self-dual Euler well-composedness is equivalent to digital
well-composedness in dimension 2 and 3, and second, in
dimension 4, self-dual Euler well-composedness implies
digital well-composedness, though the converse is not true.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Fri, 05 Feb 2021 19:20:31 GMTBotA 4D Counter-Example Showing that DWCness Does Not Imply CWCness in n-D
https://www.lrde.epita.fr/wiki/Publications/boutry.20.iwcia2
https://www.lrde.epita.fr/wiki/Publications/boutry.20.iwcia2<div class="mw-parser-output"><p><a class="mw-selflink selflink">A 4D Counter-Example Showing that DWCness Does Not Imply CWCness in n-D</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, Rocio Gonzalez-Diaz, Laurent Najman, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Where </dt>
<dd>Combinatorial Image Analysis: Proceedings of the 20th International Workshop, IWCIA 2020, Novi Sad, Serbia, July 16–18, 2020</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2020-07-21</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>In this paper, we prove that the two flavours of well-composedness called Continuous Well-Composedness (shortly CWCness), stating that the boundary of the continuous analog of a discrete set is a manifold, and Digital Well-Composedness (shortly DWCness), stating that a discrete set does not contain any critical configurationare not equivalent in dimension 4. To prove this, we exhibit the example of a configuration of 8 tesseracts (4D cubes) sharing a common corner (vertex), which is DWC but not CWC. This result is surprising since we know that CWCness and DWCness are equivalent in 2D and 3D. To reach our goal, we use local homology.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/boutry.20.iwcia2.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ boutry.20.iwcia2,
author = {Nicolas Boutry and Rocio Gonzalez-Diaz and Laurent Najman
and Thierry G\'eraud},
title = {A {4D} Counter-Example Showing that {DWCness} Does Not
Imply {CWCness} in $n$-{D}},
booktitle = {Combinatorial Image Analysis: Proceedings of the 20th
International Workshop, IWCIA 2020, Novi Sad, Serbia, July
16--18, 2020},
year = 2020,
editor = {T. Lukic and R. P. Barneva and V. Brimkov and L. Comic and
N. Sladoje},
volume = {12148},
series = {Lecture Notes in Computer Science},
pages = {73--87},
publisher = {Springer},
doi = {10.1007/978-3-030-51002-2_6},
abstract = {In this paper, we prove that the two flavours of
well-composedness called Continuous Well-Composedness
(shortly CWCness), stating that the boundary of the
continuous analog of a discrete set is a manifold, and
Digital Well-Composedness (shortly DWCness), stating that a
discrete set does not contain any critical configuration,
are not equivalent in dimension 4. To prove this, we
exhibit the example of a configuration of 8 tesseracts (4D
cubes) sharing a common corner (vertex), which is DWC but
not CWC. This result is surprising since we know that
CWCness and DWCness are equivalent in 2D and 3D. To reach
our goal, we use local homology.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:46:41 GMTBotNon-iterative methods for image improvement in digital holography of the retina
https://www.lrde.epita.fr/wiki/Publications/rivet.20.phd
https://www.lrde.epita.fr/wiki/Publications/rivet.20.phd<div class="mw-parser-output"><p><a class="mw-selflink selflink">Non-iterative methods for image improvement in digital holography of the retina</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Jrivet" title="User:Jrivet">Julie Rivet</a></dd>
<dt>Place </dt>
<dd>Paris, France</dd>
<dt>Type </dt>
<dd>phdthesis</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2020-07-17</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>With the increase of the number of people with moderate to severe visual impairment, monitoring and treatment of vision disorders have become major issues in medicine today. At the Quinze-Vingts national ophthalmology hospital in Paris, two optical benches have been settled in recent years to develop two real-time digital holography techniques for the retina: holographic optical coherence tomography (OCT) and laser Doppler holography. The first reconstructs three-dimensional images, while the second allows visualization of blood flow in vessels. Besides problems inherent to the imaging system itself, optical devices are subject to external disturbance, bringing also difficulties in imaging and loss of accuracy. The main obstacles these technologies face are eye motion and eye aberrations. In this thesiswe have introduced several methods for image quality improvement in digital holography, and validated them experimentally. The resolution of holographic images has been improved by robust non-iterative methods: lateral and axial tracking and compensation of translation movementsand measurement and compensation of optical aberrations. This allows us to be optimistic that structures on holographic images of the retina will be more visible and sharper, which could ultimately provide very valuable information to clinicians.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/rivet.20.phd.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@PhDThesis{ rivet.20.phd,
author = {Julie Rivet},
title = {Non-iterative methods for image improvement in digital
holography of the retina},
school = {Sorbonne Universit\'e},
year = 2020,
address = {Paris, France},
month = jul,
abstract = {With the increase of the number of people with moderate to
severe visual impairment, monitoring and treatment of
vision disorders have become major issues in medicine
today. At the Quinze-Vingts national ophthalmology hospital
in Paris, two optical benches have been settled in recent
years to develop two real-time digital holography
techniques for the retina: holographic optical coherence
tomography (OCT) and laser Doppler holography. The first
reconstructs three-dimensional images, while the second
allows visualization of blood flow in vessels. Besides
problems inherent to the imaging system itself, optical
devices are subject to external disturbance, bringing also
difficulties in imaging and loss of accuracy. The main
obstacles these technologies face are eye motion and eye
aberrations. In this thesis, we have introduced several
methods for image quality improvement in digital
holography, and validated them experimentally. The
resolution of holographic images has been improved by
robust non-iterative methods: lateral and axial tracking
and compensation of translation movements, and measurement
and compensation of optical aberrations. This allows us to
be optimistic that structures on holographic images of the
retina will be more visible and sharper, which could
ultimately provide very valuable information to
clinicians.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 13 Apr 2021 07:15:55 GMTBotNewsEntry (2020/07/17)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/07/17)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/07/17)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/07/17)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>Julie Rivet defends her <a href="/wiki/Affiche-these-JR" title="Affiche-these-JR"> PhD thesis</a> "Non-iterative methods for image improvement in digital holography of the retina" at EPITA at 2 pm.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/07/17
</p>
</td></tr></table>
</div>Tue, 30 Jun 2020 09:53:28 GMTDanielaNewsEntry (2020/07/10)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/07/10)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/07/10)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/07/10)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>Didier Verna defends his <a href="/wiki/Affiche-these-HDR-DV" title="Affiche-these-HDR-DV"> Habilitation thesis</a> at EPITA at 2 pm.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/07/10
</p>
</td></tr></table>
</div>Mon, 06 Jul 2020 10:08:06 GMTDaniela(Dynamic (Programming Paradigms)) ;; Performance and Expressivity
https://www.lrde.epita.fr/wiki/Publications/verna.20.hdr
https://www.lrde.epita.fr/wiki/Publications/verna.20.hdr<div class="mw-parser-output"><p><a class="mw-selflink selflink">(Dynamic (Programming Paradigms)) ;; Performance and Expressivity</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Didier" title="User:Didier">Didier Verna</a></dd>
<dt>Type </dt>
<dd>phdthesis</dd>
<dt>Date </dt>
<dd>2020-07-10</dd></dl>
</div>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/verna.20.hdr.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@PhDThesis{ verna.20.hdr,
author = {Didier Verna},
title = {(Dynamic (Programming Paradigms)) ;; Performance and
Expressivity},
school = {Sorbone-Universit\'e},
type = {Habilitation Thesis},
month = jul,
year = 2020,
doi = {10.5281/zenodo.4244393}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Wed, 04 Nov 2020 13:57:46 GMTBotPractical “Paritizing” of Emerson–Lei Automata
https://www.lrde.epita.fr/wiki/Publications/renkin.20.atva
https://www.lrde.epita.fr/wiki/Publications/renkin.20.atva<div class="mw-parser-output"><p><a class="mw-selflink selflink">Practical “Paritizing” of Emerson–Lei Automata</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/~frenkin/">Florian Renkin</a>, <a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/~adl/">Alexandre Duret-Lutz</a>, <a href="/wiki/User:Adrien" title="User:Adrien">Adrien Pommellet</a></dd>
<dt>Where </dt>
<dd>Proceedings of the 18th International Symposium on Automated Technology for Verification and Analysis (ATVA'20)</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Keywords </dt>
<dd>Spot</dd>
<dt>Date </dt>
<dd>2020-07-07</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>We introduce a new algorithm that takes a Transition-based Emerson-Lei Automaton (TELA), that is, an <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \omega }">
<semantics>
<mrow class="MJX-TeXAtom-ORD">
<mstyle displaystyle="true" scriptlevel="0">
<mi>ω<!-- ω --></mi>
</mstyle>
</mrow>
<annotation encoding="application/x-tex">{\displaystyle \omega }</annotation>
</semantics>
</math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/48eff443f9de7a985bb94ca3bde20813ea737be8" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.446ex; height:1.676ex;" alt="{\displaystyle \omega }"/></span>-automaton whose acceptance condition is an arbitrary Boolean formula on sets of transitions to be seen infinitely or finitely often, and converts it into a Transition-based Parity Automaton (TPA). To reduce the size of the output TPA, the algorithm combines and optimizes two procedures based on a emphlatest appearance record principle, and introduces a emphpartial degeneralization. Our motivation is to use this algorithm to improve our LTL synthesis tool, where producing deterministic parity automata is an intermediate step.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/renkin.20.atva.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ renkin.20.atva,
author = {Florian Renkin and Alexandre Duret-Lutz and Adrien
Pommellet},
title = {Practical ``Paritizing'' of {E}merson--{L}ei Automata},
booktitle = {Proceedings of the 18th International Symposium on
Automated Technology for Verification and Analysis
(ATVA'20)},
year = {2020},
volume = {12302},
series = {Lecture Notes in Computer Science},
pages = {127--143},
month = oct,
publisher = {Springer},
abstract = {We introduce a new algorithm that takes a
\emph{Transition-based Emerson-Lei Automaton} (TELA), that
is, an $\omega$-automaton whose acceptance condition is an
arbitrary Boolean formula on sets of transitions to be seen
infinitely or finitely often, and converts it into a
\emph{Transition-based Parity Automaton} (TPA). To reduce
the size of the output TPA, the algorithm combines and
optimizes two procedures based on a \emph{latest appearance
record} principle, and introduces a \emph{partial
degeneralization}. Our motivation is to use this algorithm
to improve our LTL synthesis tool, where producing
deterministic parity automata is an intermediate step.},
doi = {10.1007/978-3-030-59152-6_7}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Thu, 05 Nov 2020 07:58:04 GMTBotImproving swarming using genetic algorithms
https://www.lrde.epita.fr/wiki/Publications/renault.20.isse
https://www.lrde.epita.fr/wiki/Publications/renault.20.isse<div class="mw-parser-output"><p><a class="mw-selflink selflink">Improving swarming using genetic algorithms</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Renault" title="User:Renault">Etienne Renault</a></dd>
<dt>Journal </dt>
<dd>Innovations in Systems and Software Engineering: a NASA journal (ISSE)</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Projects </dt>
<dd><a href="/wiki/Spot" title="Spot">Spot</a></dd>
<dt>Date </dt>
<dd>2020-06-02</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>The verification of temporal properties against a given system may require the exploration of its full state space. In explicit model checking, this exploration uses a depth-first search and can be achieved with multiple randomized threads to increase performance. Nonethelessthe topology of the state space and the exploration order can cap the speedup up to a certain number of threads. This paper proposes a new technique that aims to tackle this limitation by generating artificial initial states, using genetic algorithms. Threads are then launched from these states and thus explore different parts of the state space. Our prototype implementation is 10% faster than state-of-the-art algorithms on a general benchmark and 40% on a specialized benchmark. Even if we expected a decrease in an order of magnitude, these results are still encouraging since they suggest a new way to handle existing limitations. Empirically, our technique seems well suited for "linear topology", i.e., the one we can obtain when combining model checking algorithms with partial-order reduction techniques.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/renault.20.isse.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ renault.20.isse,
author = {Etienne Renault},
title = {Improving swarming using genetic algorithms},
journal = {Innovations in Systems and Software Engineering: a NASA
journal (ISSE)},
year = 2020,
volume = {16},
number = {2},
pages = {143--159},
month = jun,
publisher = {Springer},
abstract = { The verification of temporal properties against a given
system may require the exploration of its full state space.
In explicit model checking, this exploration uses a
depth-first search and can be achieved with multiple
randomized threads to increase performance. Nonetheless,
the topology of the state space and the exploration order
can cap the speedup up to a certain number of threads. This
paper proposes a new technique that aims to tackle this
limitation by generating artificial initial states, using
genetic algorithms. Threads are then launched from these
states and thus explore different parts of the state space.
Our prototype implementation is 10\% faster than
state-of-the-art algorithms on a general benchmark and 40\%
on a specialized benchmark. Even if we expected a decrease
in an order of magnitude, these results are still
encouraging since they suggest a new way to handle existing
limitations. Empirically, our technique seems well suited
for "linear topology", i.e., the one we can obtain when
combining model checking algorithms with partial-order
reduction techniques. },
doi = {10.1007/s11334-020-00362-7}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Wed, 15 Jul 2020 14:48:46 GMTBotA New Minimum Barrier Distance for Multivariate Images with Applications to Salient Object Detection, Shortest Path Finding, and Segmentation
https://www.lrde.epita.fr/wiki/Publications/movn.20.cviu
https://www.lrde.epita.fr/wiki/Publications/movn.20.cviu<div class="mw-parser-output"><p><a class="mw-selflink selflink">A New Minimum Barrier Distance for Multivariate Images with Applications to Salient Object Detection, Shortest Path Finding, and Segmentation</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Movn" title="User:Movn">Minh Ôn Vũ Ngoc</a>, <a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Jonathan" title="User:Jonathan">Jonathan Fabrizio</a>, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Journal </dt>
<dd>Computer Vision and Image Understanding</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-06-02</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Distance transforms and the saliency maps they induce are widely used in image processing, computer vision, and pattern recognition. One of the most commonly used distance transform is the geodesic one. Unfortunately, this distance does not always achieve satisfying results on noisy or blurred images. Recently, a new (pseudo-)distance, called the minimum barrier distance (MBD), more robust to pixel variations, has been introduced. Some years after, Géraud et al. have proposed a good and fast-to compute approximation of this distance: the Dahu pseudo-distance. Since this distance was initially developped for grayscale images, we propose here an extension of this transform to multivariate images; we call it vectorial Dahu pseudo-distance. An efficient way to compute it is provided in this paper. Besides, we provide benchmarks demonstrating how much the vectorial Dahu pseudo-distance is more robust and competitive compared to other MB-based distances, which shows how much this distance is promising for salient object detection, shortest path finding, and object segmentation.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/movn.20.cviu.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ movn.20.cviu,
author = {Minh {\^On V\~{u} Ng\d{o}c} and Nicolas Boutry and
Jonathan Fabrizio and Thierry G\'eraud},
title = {A New Minimum Barrier Distance for Multivariate Images
with Applications to Salient Object Detection, Shortest
Path Finding, and Segmentation},
journal = {Computer Vision and Image Understanding},
year = {2020},
month = aug,
volume = {197--198},
doi = {10.1016/j.cviu.2020.102993},
abstract = {Distance transforms and the saliency maps they induce are
widely used in image processing, computer vision, and
pattern recognition. One of the most commonly used distance
transform is the geodesic one. Unfortunately, this distance
does not always achieve satisfying results on noisy or
blurred images. Recently, a new (pseudo-)distance, called
the minimum barrier distance (MBD), more robust to pixel
variations, has been introduced. Some years after, G\'eraud
et al. have proposed a good and fast-to compute
approximation of this distance: the Dahu pseudo-distance.
Since this distance was initially developped for grayscale
images, we propose here an extension of this transform to
multivariate images; we call it vectorial Dahu
pseudo-distance. An efficient way to compute it is provided
in this paper. Besides, we provide benchmarks demonstrating
how much the vectorial Dahu pseudo-distance is more robust
and competitive compared to other MB-based distances, which
shows how much this distance is promising for salient
object detection, shortest path finding, and object
segmentation.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:47:42 GMTBotNewsEntry (2020/06/02)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/06/02)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/06/02)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/06/02)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>EPITA presents a webinar with Microsoft at <a rel="nofollow" class="external text" href="http://www.impact-ai.fr/education/exploria/">Explor'IA</a> on Artificial Intelligence and Medical Image Analysis.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
<p>In this webinar, Nicolas Boutry from LRDE presents how to segment with Convolutional Neural Networks (CNN's) white and grey matters in multi-modal MRI 3D brain images of 6-months year old children. His demonstration is based on a dataset from the <a rel="nofollow" class="external text" href="http://iseg2017.web.unc.edu/">iSeg2017 challenge</a>.
</p>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/06/02
</p>
</td></tr></table>
</div>Mon, 18 May 2020 16:23:30 GMTDanielaCommunity and LBD-based Clause Sharing Policy for Parallel SAT Solving
https://www.lrde.epita.fr/wiki/Publications/vallade.20.sat
https://www.lrde.epita.fr/wiki/Publications/vallade.20.sat<div class="mw-parser-output"><p><a class="mw-selflink selflink">Community and LBD-based Clause Sharing Policy for Parallel SAT Solving</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Vincent Vallade, <a href="/wiki/User:Ludovic" title="User:Ludovic">Ludovic Le Frioux</a>, <a href="/wiki/User:Sbaarir" title="User:Sbaarir">Souheib Baarir</a>, Julien Sopena, Vijay Ganesh, Fabrice Kordon</dd>
<dt>Where </dt>
<dd>Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT'20)</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer,_Cham&action=edit&redlink=1" class="new" title="Springer, Cham (page does not exist)">Springer, Cham</a></dd>
<dt>Keywords </dt>
<dd>Parallel satisfiability, clause sharing, community structure</dd>
<dt>Date </dt>
<dd>2020-06-01</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Modern parallel SAT solvers rely heavily on effective clause sharing policies for their performance. The core problem being addressed by these policies can be succinctly stated as "the problem of identifying high-quality learnt clauses" that when shared between the worker nodes of parallel solvers results in improved performance than otherwise. The term "high-quality clauses" is often defined in terms of metrics that solver designers have identified over years of empirical study. Some of the more well-known metrics to identify high-quality clauses for sharing include clause lengthliteral block distance (LBD), and clause usage in propagation. In this paper, we propose a new metric aimed at identifying high-quality learnt clauses and a concomitant clause-sharing policy based on a combination of LBD and community structure of Boolean formulas. The concept of community structure has been proposed as a possible explanation for the extraordinary performance of SAT solvers in industrial instances. Hence, it is a natural candidate as a basis for a metric to identify high-quality clauses. To be more precise, our metric identifies clauses that have low LBD and low community number as ones that are high-quality for applications such as verification and testing. The community number of a clause C measures the number of different communities of a formula that the variables in C span. We perform extensive empirical analysis of our metric and clause-sharing policy, and show that our method significantly outperforms state-of-the-art techniques on the benchmark from the parallel track of the last four SAT competitions.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/vallade.20.sat.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ vallade.20.sat,
author = {Vincent Vallade and Ludovic {Le Frioux} and Souheib Baarir
and Julien Sopena and Vijay Ganesh and Fabrice Kordon},
title = {Community and {LBD}-based Clause Sharing Policy for
Parallel {SAT} Solving},
booktitle = {Proceedings of the 23rd International Conference on Theory
and Applications of Satisfiability Testing (SAT'20)},
year = 2020,
month = jun,
volume = {12178},
pages = {11--27},
series = {Lecture Notes in Computer Science},
publisher = {Springer, Cham},
abstract = {Modern parallel SAT solvers rely heavily on effective
clause sharing policies for their performance. The core
problem being addressed by these policies can be succinctly
stated as "the problem of identifying high-quality learnt
clauses" that when shared between the worker nodes of
parallel solvers results in improved performance than
otherwise. The term "high-quality clauses" is often defined
in terms of metrics that solver designers have identified
over years of empirical study. Some of the more well-known
metrics to identify high-quality clauses for sharing
include clause length, literal block distance (LBD), and
clause usage in propagation. In this paper, we propose a
new metric aimed at identifying high-quality learnt clauses
and a concomitant clause-sharing policy based on a
combination of LBD and community structure of Boolean
formulas. The concept of community structure has been
proposed as a possible explanation for the extraordinary
performance of SAT solvers in industrial instances. Hence,
it is a natural candidate as a basis for a metric to
identify high-quality clauses. To be more precise, our
metric identifies clauses that have low LBD and low
community number as ones that are high-quality for
applications such as verification and testing. The
community number of a clause C measures the number of
different communities of a formula that the variables in C
span. We perform extensive empirical analysis of our metric
and clause-sharing policy, and show that our method
significantly outperforms state-of-the-art techniques on
the benchmark from the parallel track of the last four SAT
competitions.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Wed, 10 Mar 2021 08:34:41 GMTBotUsing Separated Inputs for Multimodal Brain Tumor Segmentation with 3D U-Net-like Architectures
https://www.lrde.epita.fr/wiki/Publications/boutry.20.brainles
https://www.lrde.epita.fr/wiki/Publications/boutry.20.brainles<div class="mw-parser-output"><p><a class="mw-selflink selflink">Using Separated Inputs for Multimodal Brain Tumor Segmentation with 3D U-Net-like Architectures</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Chazalon" title="User:Chazalon">Joseph Chazalon</a>, <a href="/wiki/User:Elodie" title="User:Elodie">Élodie Puybareau</a>, <a href="/wiki/User:Gtochon" title="User:Gtochon">Guillaume Tochon</a>, Hugues Talbot, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Where </dt>
<dd>Proceedings of the 4th International Workshop, BrainLes 2019, Held in Conjunction with MICCAI 2019</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2020-06-01</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>The work presented in this paper addresses the MICCAI BraTS 2019 challenge devoted to brain tumor segmentation using mag- netic resonance images. For each task of the challenge, we proposed and submitted for evaluation an original method. For the tumor segmentation task (Task 1)our convolutional neural network is based on a variant of the U-Net architecture of Ronneberger et al. with two modifications: first, we separate the four convolution parts to decorrelate the weights corresponding to each modality, and second, we provide volumes of size 240 * 240 * 3 as inputs in these convolution parts. This way, we profit of the 3D aspect of the input signal, and we do not use the same weights for separate inputs. For the overall survival task (Task 2), we compute explainable features and use a kernel PCA embedding followed by a Random Forest classifier to build a predictor with very few training samples. For the uncertainty estimation task (Task 3), we introduce and compare lightweight methods based on simple principles which can be applied to any segmentation approach. The overall performance of each of our contribution is honorable given the low computational requirements they have both for training and testing.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/boutry.20.brainles.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ boutry.20.brainles,
author = {Nicolas Boutry and Joseph Chazalon and \'Elodie Puybareau
and Guillaume Tochon and Hugues Talbot and Thierry G\'eraud},
title = {Using Separated Inputs for Multimodal Brain Tumor
Segmentation with {3D} {U-Net}-like Architectures},
booktitle = {Proceedings of the 4th International Workshop, BrainLes
2019, Held in Conjunction with MICCAI 2019},
year = 2019,
editor = {A. Crimi and S. Bakas},
volume = {11992},
series = {Lecture Notes in Computer Science},
pages = {187--199},
publisher = {Springer},
doi = {10.1007/978-3-030-46640-4_18},
abstract = {The work presented in this paper addresses the MICCAI
BraTS 2019 challenge devoted to brain tumor segmentation
using mag- netic resonance images. For each task of the
challenge, we proposed and submitted for evaluation an
original method. For the tumor segmentation task (Task 1),
our convolutional neural network is based on a variant of
the U-Net architecture of Ronneberger et al. with two
modifications: first, we separate the four convolution
parts to decorrelate the weights corresponding to each
modality, and second, we provide volumes of size 240 * 240
* 3 as inputs in these convolution parts. This way, we
profit of the 3D aspect of the input signal, and we do not
use the same weights for separate inputs. For the overall
survival task (Task 2), we compute explainable features and
use a kernel PCA embedding followed by a Random Forest
classifier to build a predictor with very few training
samples. For the uncertainty estimation task (Task 3), we
introduce and compare lightweight methods based on simple
principles which can be applied to any segmentation
approach. The overall performance of each of our
contribution is honorable given the low computational
requirements they have both for training and testing.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:46:39 GMTBotLTL Model Checking for Communicating Concurrent Programs
https://www.lrde.epita.fr/wiki/Publications/pommellet.20.isse
https://www.lrde.epita.fr/wiki/Publications/pommellet.20.isse<div class="mw-parser-output"><p><a class="mw-selflink selflink">LTL Model Checking for Communicating Concurrent Programs</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Adrien" title="User:Adrien">Adrien Pommellet</a>, Tayssir Touili</dd>
<dt>Journal </dt>
<dd>Innovations in Systems and Software Engineering: a NASA journal (ISSE)</dd>
<dt>Type </dt>
<dd>article</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Projects </dt>
<dd><a href="/wiki/Spot" title="Spot">Spot</a></dd>
<dt>Date </dt>
<dd>2020-05-15</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>We present in this paper a new approach to the static analysis of concurrent programs with procedures. To this end, we model multi-threaded programs featuring recursive procedure calls and synchronisation by rendez-vous between parallel threads with communicating pushdown systems (from now on CPDSs). The reachability problem for this particular class of automata is unfortunately undecidable. However, it has been shown that an efficient abstraction of the execution traces language can nonetheless be computed. To this end, an algebraic framework to over-approximate context-free languages has been introduced by Bouajjani et al. In this paper, we combine this framework with an automata-theoretic approach in order to approximate an answer to the model checking problem of the linear-time temporal logic (from now on LTL) on CPDSs. We then present an algorithm that, given a single-indexed or stutter-invariant LTL formula, allows us to prove that no run of a CPDS verifies this formula if the procedure ends.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/pommellet.20.isse.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@Article{ pommellet.20.isse,
author = {Adrien Pommellet and Tayssir Touili},
title = {{LTL} Model Checking for Communicating Concurrent
Programs},
journal = {Innovations in Systems and Software Engineering: a NASA
journal (ISSE)},
year = 2020,
volume = {16},
number = {2},
pages = {161--179},
month = jun,
publisher = {Springer},
abstract = {We present in this paper a new approach to the static
analysis of concurrent programs with procedures. To this
end, we model multi-threaded programs featuring recursive
procedure calls and synchronisation by rendez-vous between
parallel threads with communicating pushdown systems (from
now on CPDSs).
The reachability problem for this particular class of
automata is unfortunately undecidable. However, it has been
shown that an efficient abstraction of the execution traces
language can nonetheless be computed. To this end, an
algebraic framework to over-approximate context-free
languages has been introduced by Bouajjani et al.
In this paper, we combine this framework with an
automata-theoretic approach in order to approximate an
answer to the model checking problem of the linear-time
temporal logic (from now on LTL) on CPDSs. We then present
an algorithm that, given a single-indexed or
stutter-invariant LTL formula, allows us to prove that no
run of a CPDS verifies this formula if the procedure
ends.},
doi = {10.1007/s11334-020-00363-6}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Thu, 05 Nov 2020 07:57:57 GMTBotSeminator 2 Can Complement Generalized Büchi Automata via Improved Semi-Determinization
https://www.lrde.epita.fr/wiki/Publications/blahoudek.20.cav
https://www.lrde.epita.fr/wiki/Publications/blahoudek.20.cav<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-Determinization</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>František Blahoudek, <a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/~adl/">Alexandre Duret-Lutz</a>, Jan Strejček</dd>
<dt>Where </dt>
<dd>Proceedings of the 32nd International Conference on Computer-Aided Verification (CAV'20)</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Projects </dt>
<dd><a href="/wiki/Spot" title="Spot">Spot</a></dd>
<dt>Date </dt>
<dd>2020-05-14</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>We present the second generation of the tool Seminator that transforms transition-based generalized Büchi automata (TGBAs) into equivalent semi-deterministic automata. The tool has been extended with numerous optimizations and produces considerably smaller automata than its first version. In connection with the state-of-the-art LTL to TGBAs translator Spot, Seminator 2 produces smaller (on average) semi-deterministic automata than the direct LTL to semi-deterministic automata translator ltl2ldgba of the Owl library. FurtherSeminator 2 has been extended with an improved NCSB complementation procedure for semi-deterministic automataproviding a new way to complement automata that is competitive with state-of-the-art complementation tools.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/blahoudek.20.cav.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ blahoudek.20.cav,
author = {Franti\v{s}ek Blahoudek and Alexandre Duret-Lutz and Jan
Strej\v{c}ek},
title = {{S}eminator~2 Can Complement Generalized {B\"u}chi
Automata via Improved Semi-Determinization},
booktitle = {Proceedings of the 32nd International Conference on
Computer-Aided Verification (CAV'20)},
year = {2020},
publisher = {Springer},
volume = {12225},
series = {Lecture Notes in Computer Science},
pages = {15--27},
month = jul,
abstract = {We present the second generation of the tool Seminator
that transforms transition-based generalized B{\"u}chi
automata (TGBAs) into equivalent semi-deterministic
automata. The tool has been extended with numerous
optimizations and produces considerably smaller automata
than its first version. In connection with the
state-of-the-art LTL to TGBAs translator Spot, Seminator~2
produces smaller (on average) semi-deterministic automata
than the direct LTL to semi-deterministic automata
translator \texttt{ltl2ldgba} of the Owl library. Further,
Seminator~2 has been extended with an improved NCSB
complementation procedure for semi-deterministic automata,
providing a new way to complement automata that is
competitive with state-of-the-art complementation tools.},
doi = {10.1007/978-3-030-53291-8_2}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 21 Jul 2020 10:15:02 GMTBotNewsEntry (2020/04/28)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/04/28)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/04/28)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/04/28)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>The 13th <a rel="nofollow" class="external text" href="https://www.european-lisp-symposium.org">European Lisp Symposium</a>, steered by Didier Verna, held online this year.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
<p>Due to the current pandemic, the conference European Lisp Symposium couldn't be held in Zurich, as originally planned. The event was thus prerecorded and broadcast on Twitch, free and open-access to everyone, resulting in an unprecedented number of virtual attendees. All the videos remain available <a rel="nofollow" class="external text" href="https://www.twitch.tv/elsconf/videos">here</a>.
</p>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/04/28
</p>
</td></tr></table>
</div>Thu, 07 May 2020 13:49:44 GMTDanielaNewsEntry (2020/04/03)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/04/03)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/04/03)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/04/03)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>Winning LRDE team at 2nd <a rel="nofollow" class="external text" href="https://endocv.grand-challenge.org/">EndoCV2020</a> Challenge and Workshop, held online in conjunction with <a rel="nofollow" class="external text" href="http://2020.biomedicalimaging.org/">ISBI</a>.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
<p>Lê Duy Huynh and Nicolas Boutry have won the first prize of the <a rel="nofollow" class="external text" href="https://ead2020.grand-challenge.org/">Endoscopy Artefact Detection and Segmentation Challenge (EAD2020)</a> against 31 other participating teams. This challenge was organized during the 17th <a rel="nofollow" class="external text" href="http://2020.biomedicalimaging.org/">International Symposium on Biomedical Imaging (ISBI)</a>.
</p>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/04/03
</p>
</td></tr></table>
</div>Thu, 07 May 2020 16:50:26 GMTDanielaSeminar/2020-03-18
https://www.lrde.epita.fr/wiki/Seminar/2020-03-18
https://www.lrde.epita.fr/wiki/Seminar/2020-03-18<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminar/2020-03-18</a>
</p></div><div class="mw-parser-output"><h3><span id="Mercredi_18_mars_2020,_11h_-_12h,_Amphi_Masters"></span><span class="mw-headline" id="Mercredi_18_mars_2020.2C_11h_-_12h.2C_Amphi_Masters"><a class="mw-selflink selflink"> Mercredi 18 mars 2020, 11h - 12h, Amphi Masters</a></span></h3>
<p><br />
</p>
<h4><span class="mw-headline" id="Diagnosis_and_Opacity_in_Partially_Observable_Systems">Diagnosis and Opacity in Partially Observable Systems</span></h4>
<p><i>Stefan Schwoon, ENS Paris-Saclay</i>
<br/>
<br/>
</p><p>In a partially observable system, diagnosis is the task of detecting certain events, for instance fault occurrences. In the presence of hostile observers, on the other hand, one is interested in rendering a system opaque, i.e. making it impossible to detect certain "secret" events. The talk will present some decidability and complexity results for these two problems
when the system is represented as a finite automaton or a Petri net. We then also consider the problem of active diagnosis, where the observer has some control over the system. In this context, we study problems such as the computational complexity of the synthesis problem, the memory required for the controller, and the delay between a fault occurrence and its detection by the diagnoser. The talk is based on joint work with B. Bérard, S. Haar, S. Haddad, T. Melliti, and S. Schmitz.
<br/>
<br/>
</p><p><small>Stefan Schwoon studied Computer Science at the University of Hildesheim and received a PhD from the Technical University of Munich in 2002. He held the position of Scientific Assistent at the University of Stuttgart from 2002 to 2007, and at the Technical University in Munich from 2007 to 2009. He is currently Associate Professor (Maître de conférences) at Laboratoire Spécification et Vérification (LSV), ENS Paris-Saclay, and a member of the INRIA team Mexico. His research interests include model checking and diagnosis on concurrent and partially-observable systems.</small>
<br/>
<br/>
<a rel="nofollow" class="external text" href="http://www.lsv.fr/~schwoon/">http://www.lsv.fr/~schwoon/</a>
</p></div>Mon, 09 Mar 2020 11:09:48 GMTBotImprovement of a text detection chain and the proposition of a new evaluation protocol for text detection algorithms
https://www.lrde.epita.fr/wiki/Publications/movn.20.phd
https://www.lrde.epita.fr/wiki/Publications/movn.20.phd<div class="mw-parser-output"><p><a class="mw-selflink selflink">Improvement of a text detection chain and the proposition of a new evaluation protocol for text detection algorithms</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Movn" title="User:Movn">Minh Ôn Vũ Ngoc</a></dd>
<dt>Place </dt>
<dd>Paris, France</dd>
<dt>Type </dt>
<dd>phdthesis</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Date </dt>
<dd>2020-02-18</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Hierarchical image representations are widely used in image processing to model the content of an image in the multi-scale structure. A well-known hierarchical representation is the tree of shapes (ToS) which encodes the inclusion relationship between connected components from different thresholded levels. This kind of tree is self-dual, contrast-change invariant and popular in computer vision community. Typically, in our work, we use this representation to compute the new distance which belongs to the mathematical morphology domain. Distance transforms and the saliency maps they induce are generally used in image processing, computer vision, and pattern recognition. One of the most commonly used distance transforms is the geodesic one. Unfortunately, this distance does not always achieve satisfying results on noisy or blurred images. Recently, a new pseudo-distancecalled the minimum barrier distance (MBD), more robust to pixel fluctuation, has been introduced. Some years afterGéraud et al. have proposed a good and fast-to-compute approximation of this distance: the Dahu pseudo-distance. Since this distance was initially developed for grayscale images, we propose here an extension of this transform to multivariate images; we call it vectorial Dahu pseudo-distance. This new distance is easily and efficiently computed thanks to the multivariate tree of shapes (MToS). We propose an efficient way to compute this distance and its deduced saliency map in this thesis. We also investigate the properties of this distance in dealing with noise and blur in the image. This distance has been proved to be robust for pixel invariant. To validate this new distance, we provide benchmarks demonstrating how the vectorial Dahu pseudo-distance is more robust and competitive compared to other MB-based distances. This distance is promising for salient object detectionshortest path finding, and object segmentation. Moreoverwe apply this distance to detect the document in videos. Our method is a region-based approach which relies on visual saliency deduced from the Dahu pseudo-distance. We show that the performance of our method is competitive with state-of-the-art methods on the ICDAR Smartdoc 2015 Competition dataset.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/movn.20.phd.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@PhDThesis{ movn.20.phd,
author = {Minh {\^On V\~{u} Ng\d{o}c}},
title = {Improvement of a text detection chain and the proposition
of a new evaluation protocol for text detection
algorithms},
school = {Sorbonne Universit\'e},
year = 2020,
address = {Paris, France},
month = feb,
abstract = {Hierarchical image representations are widely used in
image processing to model the content of an image in the
multi-scale structure. A well-known hierarchical
representation is the tree of shapes (ToS) which encodes
the inclusion relationship between connected components
from different thresholded levels. This kind of tree is
self-dual, contrast-change invariant and popular in
computer vision community. Typically, in our work, we use
this representation to compute the new distance which
belongs to the mathematical morphology domain. Distance
transforms and the saliency maps they induce are generally
used in image processing, computer vision, and pattern
recognition. One of the most commonly used distance
transforms is the geodesic one. Unfortunately, this
distance does not always achieve satisfying results on
noisy or blurred images. Recently, a new pseudo-distance,
called the minimum barrier distance (MBD), more robust to
pixel fluctuation, has been introduced. Some years after,
G\'{e}raud et al. have proposed a good and fast-to-compute
approximation of this distance: the Dahu pseudo-distance.
Since this distance was initially developed for grayscale
images, we propose here an extension of this transform to
multivariate images; we call it vectorial Dahu
pseudo-distance. This new distance is easily and
efficiently computed thanks to the multivariate tree of
shapes (MToS). We propose an efficient way to compute this
distance and its deduced saliency map in this thesis. We
also investigate the properties of this distance in dealing
with noise and blur in the image. This distance has been
proved to be robust for pixel invariant. To validate this
new distance, we provide benchmarks demonstrating how the
vectorial Dahu pseudo-distance is more robust and
competitive compared to other MB-based distances. This
distance is promising for salient object detection,
shortest path finding, and object segmentation. Moreover,
we apply this distance to detect the document in videos.
Our method is a region-based approach which relies on
visual saliency deduced from the Dahu pseudo-distance. We
show that the performance of our method is competitive with
state-of-the-art methods on the ICDAR Smartdoc 2015
Competition dataset. }
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Wed, 24 Jun 2020 13:23:45 GMTBotNewsEntry (2020/02/18)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/02/18)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/02/18)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/02/18)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>Minh On Vu Ngoc defends his <a href="/wiki/Affiche-these-MOVN" title="Affiche-these-MOVN"> PhD thesis</a> "A new minimum barrier distance for multivariate images with applications to salient object detection, shortest path finding, and segmentation." at EPITA at 2 pm.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/02/18
</p>
</td></tr></table>
</div>Thu, 13 Feb 2020 15:21:26 GMTDanielaSeminar/2020-02-12
https://www.lrde.epita.fr/wiki/Seminar/2020-02-12
https://www.lrde.epita.fr/wiki/Seminar/2020-02-12<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminar/2020-02-12</a>
</p></div><div class="mw-parser-output"><h3><span id="Mercredi_12_février_2020,_10h_-_11h30,_Amphi_1"></span><span class="mw-headline" id="Mercredi_12_f.C3.A9vrier_2020.2C_10h_-_11h30.2C_Amphi_1"><a class="mw-selflink selflink"> Mercredi 12 février 2020, 10h - 11h30, Amphi 1</a></span></h3>
<p><br />
</p>
<h4><span class="mw-headline" id="Informatique_Quantique">Informatique Quantique</span></h4>
<p><i>Georges Uzbelger, IBM France</i>
<br/>
<br/>
</p><p>Dans ce séminaire, nous parlerons d'une technologie émergente qu'est l'informatique quantique, exploitant les phénomènes quantiques de l'infiniment petit. Nous verrons que, quand dans le monde de l'informatique classique, les données sont représentées par des bits valant chacun 0 ou 1 exclusivement, alors que l'informatique quantique est déroutante dans le sens où les qubits (bits quantiques) peuvent valoir simultanément 0 et 1. Afin de pouvoir appréhender cette technologie, nous rappellerons ce que sont la dualité onde/corpuscule, la superposition d'états, ainsi que intrication quantique. Nous verrons aussi comment IBM a créé le premier processeur quantique (ou QPU) quelques dizaines d'années après l'idée révolutionnaire du père de l'informatique quantique, Richard Feynman, et quels sont les défis technologiques qui en découlent. Nous verrons que l’informatique quantique offre de nouvelles perspectives dans les domaines comme la cryptographie et l'intelligence artificielle pour ne citer qu'eux. Une étude des complexités des différents algorithmes vus durant le séminaire sera évoqué. Durant cette plénière interactive, une démonstration sera réalisée via l’environnement de développement Qiskit avec accès à distance à une machine quantique IBM. Merci donc d'apporter votre ordinateur portable !
<br/>
<br/>
</p><p><small>Diplômé de l’Université Paris IX Dauphine en Mathématiques et Applications Fondamentales, Georges Uzbelger est depuis 2002 ingénieur chez IBM France, en charge actuellement de prestations de consulting et de design de solutions dans le domaine de l’IA, de l’advance analytics et de l’informatique quantique. Il participe au programme IBM Quantum Experience pour le développement de l’informatique quantique et notamment du calcul et de l’algorithmique quantique. Adhérent à la SMF (Société Mathématique de France) entre autre, il enseigne également à l’Ecole Polytechnique, à Sorbonne Université (UPMC) et à l’Université Paris-Dauphine.</small>
<br/>
<br/>
<a rel="nofollow" class="external text" href="http://www.research.ibm.com/quantum/">http://www.research.ibm.com/quantum/</a>
</p></div>Wed, 29 Jan 2020 19:49:15 GMTBotA Two-Stage Temporal-Like Fully Convolutional Network Framework for Left Ventricle Segmentation and Quantification on MR Images
https://www.lrde.epita.fr/wiki/Publications/zhao.19.stacom
https://www.lrde.epita.fr/wiki/Publications/zhao.19.stacom<div class="mw-parser-output"><p><a class="mw-selflink selflink">A Two-Stage Temporal-Like Fully Convolutional Network Framework for Left Ventricle Segmentation and Quantification on MR Images</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Zhou Zhao, <a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Elodie" title="User:Elodie">Élodie Puybareau</a>, <a href="/wiki/User:Theo" title="User:Theo">Thierry Géraud</a></dd>
<dt>Where </dt>
<dd>Statistical Atlases and Computational Models of the Heart. Multi-Sequence CMR Segmentation, CRT-EPiggy and LV Full Quantification Challenges—10th International WorkshopSTACOM 2019, Held in Conjunction with MICCAI 2019Shenzhen, China, October 13, 2019, Revised Selected Papers</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=Springer&action=edit&redlink=1" class="new" title="Springer (page does not exist)">Springer</a></dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-02-07</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Automatic segmentation of the left ventricle (LV) of a living human heart in a magnetic resonance (MR) image (2D+t) allows to measure some clinical significant indices like the regional wall thicknesses (RWT), cavity dimensions, cavity and myocardium areas, and cardiac phase. Here, we propose a novel framework made of a sequence of two fully convolutional networks (FCN). The first is a modified temporal-like VGG16 (the "localization network") and is used to localize roughly the LV (filled-in) epicardium position in each MR volume. The second FCN is a modified temporal-like VGG16 too, but devoted to segment the LV myocardium and cavity (the "segmentation network"). We evaluate the proposed method with 5-fold-cross-validation on the MICCAI 2019 LV Full Quantification Challenge dataset. For the network used to localize the epicardium, we obtain an average dice index of 0.8953 on validation set. For the segmentation network, we obtain an average dice index of 0.8664 on validation set (there, data augmentation is used). The mean absolute error (MAE) of average cavity and myocardium areas, dimensionsRWT are 114.77 mm^2; 0.9220 mm; 0.9185 mm respectively. The computation time of the pipeline is less than 2 s for an entire 3D volume. The error rate of phase classification is 7.6364%, which indicates that the proposed approach has a promising performance to estimate all these parameters.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/zhao.19.stacom.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ zhao.19.stacom,
author = {Zhou Zhao and Nicolas Boutry and \'Elodie Puybareau and
Thierry G\'eraud},
title = {A Two-Stage Temporal-Like Fully Convolutional Network
Framework for Left Ventricle Segmentation and
Quantification on {MR} Images},
booktitle = {Statistical Atlases and Computational Models of the Heart.
Multi-Sequence CMR Segmentation, CRT-EPiggy and LV Full
Quantification Challenges---10th International Workshop,
STACOM 2019, Held in Conjunction with MICCAI 2019,
Shenzhen, China, October 13, 2019, Revised Selected
Papers},
year = 2020,
editor = {Mihaela Pop and Maxime Sermesant and Oscar Camara and
Xiahai Zhuang and Shuo Li and Alistair Young and Tommaso
Mansi and Avan Suinesiaputra},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
volume = {12009},
pages = {405--413},
doi = {10.1007/978-3-030-39074-7_42},
abstract = {Automatic segmentation of the left ventricle (LV) of a
living human heart in a magnetic resonance (MR) image
(2D+t) allows to measure some clinical significant indices
like the regional wall thicknesses (RWT), cavity
dimensions, cavity and myocardium areas, and cardiac phase.
Here, we propose a novel framework made of a sequence of
two fully convolutional networks (FCN). The first is a
modified temporal-like VGG16 (the "localization network")
and is used to localize roughly the LV (filled-in)
epicardium position in each MR volume. The second FCN is a
modified temporal-like VGG16 too, but devoted to segment
the LV myocardium and cavity (the "segmentation network").
We evaluate the proposed method with
5-fold-cross-validation on the MICCAI 2019 LV Full
Quantification Challenge dataset. For the network used to
localize the epicardium, we obtain an average dice index of
0.8953 on validation set. For the segmentation network, we
obtain an average dice index of 0.8664 on validation set
(there, data augmentation is used). The mean absolute error
(MAE) of average cavity and myocardium areas, dimensions,
RWT are 114.77~mm^2; 0.9220~mm; 0.9185~mm respectively. The
computation time of the pipeline is less than 2~s for an
entire 3D volume. The error rate of phase classification is
7.6364\%, which indicates that the proposed approach has a
promising performance to estimate all these parameters.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 24 Nov 2020 10:48:17 GMTBotLearning Endmember Dynamics in Multitemporal Hyperspectral Data using a State-Space Model Formulation
https://www.lrde.epita.fr/wiki/Publications/drumetz.20.icassp
https://www.lrde.epita.fr/wiki/Publications/drumetz.20.icassp<div class="mw-parser-output"><p><a class="mw-selflink selflink">Learning Endmember Dynamics in Multitemporal Hyperspectral Data using a State-Space Model Formulation</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Lucas Drumetz, Mauro Dalla Mura, <a href="/wiki/User:Gtochon" title="User:Gtochon">Guillaume Tochon</a>, Ronan Fablet</dd>
<dt>Where </dt>
<dd>Proceedings of the 45th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)</dd>
<dt>Place </dt>
<dd>Barcelona, Spain</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Projects </dt>
<dd><a href="/wiki/Olena" title="Olena">Olena</a></dd>
<dt>Keywords </dt>
<dd>Image</dd>
<dt>Date </dt>
<dd>2020-01-24</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Hyperspectral image unmixing is an inverse problem aiming at recovering the spectral signatures of pure materials of interest (called endmembers) and estimating their proportions (called abundances) in every pixel of the image. However, in spite of a tremendous applicative potential and the avent of new satellite sensors with high temporal resolution, multitemporal hyperspectral unmixing is still a relatively underexplored research avenue in the community, compared to standard image unmixing. In this paper, we propose a new framework for multitemporal unmixing and endmember extraction based on a state-space model, and present a proof of concept on simulated data to show how this representation can be used to inform multitemporal unmixing with external prior knowledge, or on the contrary to learn the dynamics of the quantities involved from data using neural network architectures adapted to the identification of dynamical systems.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/drumetz.20.icassp.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ drumetz.20.icassp,
author = {Lucas Drumetz and Mauro Dalla Mura and Guillaume Tochon
and Ronan Fablet},
title = {Learning Endmember Dynamics in Multitemporal Hyperspectral
Data using a State-Space Model Formulation},
booktitle = {Proceedings of the 45th IEEE International Conference on
Acoustics, Speech, and Signal Processing (ICASSP)},
year = 2020,
month = may,
address = {Barcelona, Spain},
pages = {2483--2487},
abstract = {Hyperspectral image unmixing is an inverse problem aiming
at recovering the spectral signatures of pure materials of
interest (called endmembers) and estimating their
proportions (called abundances) in every pixel of the
image. However, in spite of a tremendous applicative
potential and the avent of new satellite sensors with high
temporal resolution, multitemporal hyperspectral unmixing
is still a relatively underexplored research avenue in the
community, compared to standard image unmixing. In this
paper, we propose a new framework for multitemporal
unmixing and endmember extraction based on a state-space
model, and present a proof of concept on simulated data to
show how this representation can be used to inform
multitemporal unmixing with external prior knowledge, or on
the contrary to learn the dynamics of the quantities
involved from data using neural network architectures
adapted to the identification of dynamical systems.},
doi = {10.1109/ICASSP40776.2020.9053787}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Tue, 02 Mar 2021 15:26:44 GMTBotNewsEntry (2020/01/20)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/01/20)
https://www.lrde.epita.fr/wiki/NewsEntry_(2020/01/20)<div class="mw-parser-output"><p><a class="mw-selflink selflink">NewsEntry (2020/01/20)</a>
</p></div><div class="mw-parser-output"><table class="wikitable">
<tr>
<th>Title
</th>
<td>LRDE Student Seminar : 2020 students present their work.
</td></tr>
<tr>
<th>Sub-Title
</th>
<td>
<p>You can find the programme <a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/wiki/Student_Seminar_2020-01-20">here</a>. Seminars are free and open to anyone.
</p>
</td></tr>
<tr>
<th>Date
</th>
<td>
<p>2020/01/20
</p>
</td></tr></table>
</div>Thu, 30 Jan 2020 16:16:11 GMTDanielaExperimental digital Gabor hologram rendering of C. elegans worms by a model-trained convolutional neural network (Conference Presentation)
https://www.lrde.epita.fr/wiki/Publications/atlan.20.spie
https://www.lrde.epita.fr/wiki/Publications/atlan.20.spie<div class="mw-parser-output"><p><a class="mw-selflink selflink">Experimental digital Gabor hologram rendering of C. elegans worms by a model-trained convolutional neural network (Conference Presentation)</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd>Michael Atlan, <a href="/wiki/User:Jrivet" title="User:Jrivet">Julie Rivet</a>, Antoine Taliercio, <a href="/wiki/User:Nboutry" title="User:Nboutry">Nicolas Boutry</a>, <a href="/wiki/User:Gtochon" title="User:Gtochon">Guillaume Tochon</a>, HuignardJean-Pierre</dd>
<dt>Where </dt>
<dd>Label-free Biomedical Imaging and Sensing (LBIS) 2020</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Date </dt>
<dd>2020-01-01</dd></dl>
</div>
<p><br />
</p>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ atlan.20.spie,
author = {Atlan, Michael and Rivet, Julie and Taliercio, Antoine and
Boutry, Nicolas and Tochon, Guillaume and Huignard,
Jean-Pierre},
title = {Experimental digital Gabor hologram rendering of {C.}
elegans worms by a model-trained convolutional neural
network (Conference Presentation)},
booktitle = {Label-free Biomedical Imaging and Sensing (LBIS) 2020},
volume = {11251},
doi = {10.1117/12.2545514},
year = {2020},
organization = {International Society for Optics and Photonics}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Sun, 07 Feb 2021 10:28:24 GMTBotSeminar/2019-12-17
https://www.lrde.epita.fr/wiki/Seminar/2019-12-17
https://www.lrde.epita.fr/wiki/Seminar/2019-12-17<div class="mw-parser-output"><p><a class="mw-selflink selflink">Seminar/2019-12-17</a>
</p></div><div class="mw-parser-output"><h3><span id="Mardi_17_décembre_2019,_10h_-_11h,_IP12A"></span><span class="mw-headline" id="Mardi_17_d.C3.A9cembre_2019.2C_10h_-_11h.2C_IP12A"><a class="mw-selflink selflink"> Mardi 17 décembre 2019, 10h - 11h, IP12A</a></span></h3>
<p><br />
</p>
<h4><span class="mw-headline" id="Learning_the_relationship_between_neighboring_pixels_for_some_vision_tasks">Learning the relationship between neighboring pixels for some vision tasks</span></h4>
<p><i>Yongchao Xu, Associate Professor at the School of Electronic Information and Communications, HUST, China</i>
<br/>
<br/>
</p><p>The relationship between neighboring pixels plays an
important role in many vision applications. A typical example of a
relationship between neighboring pixels is the intensity order, which
gives rise to some morphological tree-based image representations
(e.g., Min/Max tree and tree of shapes). These trees have been shown
useful for many applications, ranging from image filtering to object
detection and segmentation. Yet, these intensity order based trees do
not always perform well for analyzing complex natural images. The
success of deep learning in many vision tasks motivates us to resort
to convolutional neural networks (CNNs) for learning such a
relationship instead of relying on the simple intensity order. As a
starting point, we propose the flux or direction field representation
that encodes the relationship between neighboring pixels. We then
leverage CNNs to learn such a representation and develop some
customized post-processings for several vision tasks, such as symmetry
detection, scene text detection, generic image segmentation, and crowd
counting by localization. This talk is based on [1] and [2], as well
as extension of those previous works that are currently under review.
</p><p>[1] Xu, Y., Wang, Y., Zhou, W., Wang, Y., Yang, Z. and Bai, X.,
2019. Textfield: Learning a deep direction field for irregular scene
text detection. IEEE Transactions on Image Processing.
[2] Wang, Y., Xu, Y., Tsogkas, S., Bai, X., Dickinson, S. and Siddiqi,
K., 2019. DeepFlux for Skeletons in the Wild. In Proceedings of the
IEEE Conference on Computer Vision and Pattern Recognition.
<br/>
<br/>
</p><p><small>Yongchao Xu received in 2010 both the engineer degree in electronics & embedded systems at Polytech Paris Sud and the master degree in signal processing & image processing at Université Paris Sud, and the Ph.D. degree in image processing and mathematical morphology at Université Paris Est in 2013. After completing his Ph.D. study at LRDE, EPITA, ESIEE Paris, and LIGM, He worked at LRDE as an assistant professor (Maître de Conférences). He is currently an Associate Professor at the School of Electronic Information and Communications, HUST. His research interests include mathematical morphology, image segmentation, medical image analysis, and deep learning.</small>
<br/>
<br/>
<a rel="nofollow" class="external text" href="http://www.vlrlab.net/~yxu/">http://www.vlrlab.net/~yxu/</a>
</p></div>Wed, 11 Dec 2019 14:40:33 GMTBotQuickref: Common Lisp Reference Documentation as a Stress Test for Texinfo
https://www.lrde.epita.fr/wiki/Publications/verna.19.tug
https://www.lrde.epita.fr/wiki/Publications/verna.19.tug<div class="mw-parser-output"><p><a class="mw-selflink selflink">Quickref: Common Lisp Reference Documentation as a Stress Test for Texinfo</a>
</p></div><div class="mw-parser-output"><div class="sideBox">
<dl><dt>Authors </dt>
<dd><a href="/wiki/User:Didier" title="User:Didier">Didier Verna</a></dd>
<dt>Where </dt>
<dd>TUGboat</dd>
<dt>Type </dt>
<dd>inproceedings</dd>
<dt>Publisher </dt>
<dd><a href="/index.php?title=TeX_Users_Group&action=edit&redlink=1" class="new" title="TeX Users Group (page does not exist)">TeX Users Group</a></dd>
<dt>Projects </dt>
<dd>Typesetting<span class="smw-highlighter" data-type="4" data-state="inline" data-title="Warning" title=""Typesetting" is not in the list (Vaucanson, Spot, URBI, Olena, APMC, Tiger, Climb, Speaker ID, Transformers, Bison, ...) of allowed values for the "Related project" property."><span class="smwtticon warning"></span><span class="smwttcontent">"Typesetting" is not in the list (Vaucanson, Spot, URBI, Olena, APMC, Tiger, Climb, Speaker ID, Transformers, Bison, ...) of <a href="/wiki/Property:Allows_value" title="Property:Allows value">allowed values</a> for the "Related project" property.</span></span></dd>
<dt>Keywords </dt>
<dd>Software Engineering</dd>
<dt>Date </dt>
<dd>2019-11-06</dd></dl>
</div>
<h2><span class="mw-headline" id="Abstract">Abstract</span></h2>
<p>Quickref is a global documentation project for the Common Lisp ecosystem. It creates reference manuals automatically by introspecting libraries and generating corresponding documentation in Texinfo format. The Texinfo files may subsequently be converted into PDF or HTML. Quickref is non-intrusive: software developers do not have anything to do to get their libraries documented by the system.par Quickref may be used to create a local website documenting your current, partial, working environment, but it is also able to document the whole Common Lisp ecosystem at once. The result is a website containing almost two thousand reference manuals. Quickref provides a Docker image for an easy recreation of this website, but a public version is also available and actively maintained.par Quickref constitutes an enormous and successful stress test for Texinfo. In this paper, we give an overview of the design and architecture of the system, describe the challenges and difficulties in generating valid Texinfo code automatically, and put some emphasis on the currently remaining problems and deficiencies.
</p>
<h2><span class="mw-headline" id="Documents">Documents</span></h2>
<ul><li><a rel="nofollow" class="external text" href="http://www.lrde.epita.fr/dload/papers/verna.19.tug.pdf">Paper</a></li></ul>
<h2><span id="Bibtex_(lrde.bib)"></span><span class="mw-headline" id="Bibtex_.28lrde.bib.29">Bibtex (<a rel="nofollow" class="external text" href="https://www.lrde.epita.fr/dload/papers/lrde.bib">lrde.bib</a>)</span></h2>
<p><small>
</p>
<pre>@InProceedings{ verna.19.tug,
author = {Didier Verna},
title = {{Quickref}: {Common} {Lisp} Reference Documentation as a
Stress Test for {Texinfo}},
booktitle = {TUGboat},
volume = 40,
number = {2},
pages = {119--125},
editor = {Barbara Beeton and Karl Berry},
organization = {\TeX{} Users Group},
month = sep,
year = 2019,
publisher = {\TeX{} Users Group},
issn = 0896320,
abstract = {Quickref is a global documentation project for the Common
Lisp ecosystem. It creates reference manuals automatically
by introspecting libraries and generating corresponding
documentation in Texinfo format. The Texinfo files may
subsequently be converted into PDF or HTML. Quickref is
non-intrusive: software developers do not have anything to
do to get their libraries documented by the system.\par
Quickref may be used to create a local website documenting
your current, partial, working environment, but it is also
able to document the whole Common Lisp ecosystem at once.
The result is a website containing almost two thousand
reference manuals. Quickref provides a Docker image for an
easy recreation of this website, but a public version is
also available and actively maintained.\par Quickref
constitutes an enormous and successful stress test for
Texinfo. In this paper, we give an overview of the design
and architecture of the system, describe the challenges and
difficulties in generating valid Texinfo code
automatically, and put some emphasis on the currently
remaining problems and deficiencies.}
}</pre>
<p></small>
</p><p><br />
</p><p><br />
</p><p><br />
</p><p><br />
</p></div>Wed, 24 Jun 2020 13:24:15 GMTBot