I am happy to announce that the following paper has been accepted at
the 12th International Symposium on Mathematical Morphology (ISMM'15),
to be held on May 27-29 2015 in Reykjavik, Iceland.
How to Make nD Functions Digitally Well-Composed
in a Self-Dual Way
Nicolas Boutry¹², Thierry Géraud¹, Laurent Najman²
¹ EPITA Research and Development Laboratory (LRDE)
² Université Paris-Est, LIGM, Équipe A3SI, ESIEE Paris
https://www.lrde.epita.fr/wiki/Publications/boutry.15.ismm
Abstract:
Latecki et al. introduced the notion of 2D and 3D well-composed
images, i.e., a class of images free from the ``connectivities pa-
radox'' of digital topology. Unfortunately natural and synthetic
images are not a priori well-composed. In this paper we extend
the notion of ``digital well-composedness'' to nD sets, integer-
valued functions (gray-level images), and interval-valued maps.
We also prove that the digital well-composedness implies the equi-
valence of connectivities of the level set components in nD. Con-
trasting with a previous result stating that it is not possible to
obtain a discrete nD self-dual digitally well-composed function
with a local interpolation, we then propose and prove a self-
dual discrete (non-local) interpolation method whose result is
always a digitally well-composed function. This method is based on
a sub-part of a quasi-linear algorithm that computes the morpholo-
gical tree of shapes.
I am happy to announce that the following paper has been accepted at
the 12th International Symposium on Mathematical Morphology (ISMM'15),
to be held on May 27-29 2015 in Reykjavik, Iceland.
I am happy to announce that the following paper has been accepted at
the 12th International Symposium on Mathematical Morphology (ISMM'15),
to be held on May 27-29 2015 in Reykjavik, Iceland.
Efficient Computation of Attributes and Saliency Maps
on Tree-Based Image Representations
Yongchao Xu¹² and Edwin Carlinet¹² and Thierry Géraud¹
and Laurent Najman²
¹ EPITA Research and Development Laboratory (LRDE)
² Université Paris-Est, LIGM, Équipe A3SI, ESIEE Paris
https://www.lrde.epita.fr/wiki/Publications/xu.15.ismm
Abstract:
Tree-based image representations are popular tools for many
applications in mathematical morphology and image
processing. Classically, one computes an attribute on each node of a
tree and decides whether to preserve or remove some nodes upon the
attribute function. This attribute function plays a key role for the
good performance of tree-based applications. In this paper, we propose
several algorithms to compute efficiently some attribute
information. The first one is incremental computation of information
on region, contour, and context. Then we show how to compute
efficiently extremal information along the contour (e.g., minimal
gradient's magnitude along the contour). Lastly, we depict computation
of extinction-based saliency map using tree-based image
representations. The computation complexity and the memory cost of
these algorithms are analyzed. To the best of our knowledge, except
information on region, none of the other algorithms is presented
explicitly in any state-of-the-art paper.
--
Edwin Carlinet
I am happy to announce that the following paper has been accepted at
the 12th International Symposium on Mathematical Morphology (ISMM'15),
to be held on May 27-29 2015 in Reykjavik, Iceland.
A Color Tree of Shapes with Illustrations on Filtering,
Simplification, and Segmentation
Edwin Carlinet¹², Thierry Géraud¹
¹ EPITA Research and Development Laboratory (LRDE)
² Université Paris-Est, LIGM, Équipe A3SI, ESIEE Paris
https://www.lrde.epita.fr/wiki/Publications/carlinet.15.ismm
Abstract:
The Tree of Shapes is a morphological tree that provides a high-level,
hierarchical, self-dual, and contrast invariant representation of
images, suitable for many image processing tasks. When dealing with
color images, one cannot use the Tree of Shapes because its definition
is ill-formed on multivariate data. Common workarounds such as
marginal processing, or imposing a total order on data are not
satisfactory and yield many problems (color artifacts, loss of
invariances, etc.) In this paper, we highlight the need for a
self-dual and contrast invariant representation of color images and we
provide a method that builds a single Tree of Shapes by merging the
shapes computed marginally, while guarantying the most important
properties of the ToS. This method does not try to impose an arbitrary
total ordering on values but uses only the inclusion relationship
between shapes. Eventually, we show the relevance of our method and
our structure through some illustrations on filtering, image
simplification, and interactive segmentation.
--
Edwin Carlinet
I am happy to announce that the following paper has been accepted at
the 12th International Symposium on Mathematical Morphology (ISMM'15),
to be held on May 27-29 2015 in Reykjavik, Iceland.
Self-Duality and Digital Topology:
Links Between the Morphological Tree of Shapes
and Well-Composed Gray-Level Images
Thierry Géraud¹, Edwin Carlinet¹², Sébastien Crozet¹,
¹ EPITA Research and Development Laboratory (LRDE)
² Université Paris-Est, LIGM, Équipe A3SI, ESIEE Paris
https://www.lrde.epita.fr/wiki/Publications/geraud.15.ismm
Abstract:
In digital topology, the use of a pair of connectivities is re- quired
to avoid topological paradoxes. In mathematical morphology, self-dual
operators and methods also rely on such a pair of connectivities.
There are several major issues: self-duality is impure, the image
graph structure depends on the image values, it impacts the way small
objects and texture are processed, and so on. A sub-class of images
defined on the cubical grid, well-composed images, has been proposed,
where all connectivities are equivalent, thus avoiding many
topological problems. In this paper we unveil the link existing
between the notion of well-composed images and the morphological tree
of shapes. We prove that a well-composed image has a well-defined
tree of shapes. We also prove that the only self-dual well-composed
interpolation of a 2D image is obtained by the median operator. What
follows from our results is that we can have a purely self-dual
representation of images, and consequently, purely self-dual
operators.
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mercredi 13 mai 2015 (11h00--12h30), Salle L0 du LRDE.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] ainsi que le plan d'accès [4].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2015-05-13
[4] http://www.lrde.epita.fr/Contact
Au programme du Mercredi 13 mai 2015 :
* 11h00: Programmation web haute performance avec C++14
-- Matthieu Garrigues, Laboratoire d'informatique et d'ingénierie des systèmes,
ENSTA ParisTech
[1] https://github.com/matt-42/iod
Le C++ est très impopulaire dans la communauté des développeurs web et
ce n'est pas sans raison. Le langage n'offre aucune introspection, ce
qui complique la sérialisation automatique de messages. De plus,
l'injection de dépendances, un design pattern très utile dans les
frameworks web issus d'autres langages, est complexe voire quasi
impossible à implémenter en C++98.
Nous verrons comment l'introspection statique et l'injection de
dépendance ont été implémentés en C++14 grâce à un concept innovant: les
symboles de la bibliothèque IOD [1]. Nous verrons ensuite comment
Silicon[2], un jeune framework web, tire parti de ces abstractions et
aide les développeurs à construire des APIs web aussi simplement qu'ils
le feraient en Go ou JavaScript.
-- Matthieu Garrigues est diplômé de la promotion CSI 2009 de l'EPITA.
Depuis, il s'intéresse au développement et l'implantation d'applications
temps réel de vision par ordinateur. Il est actuellement ingénieur de
recherche et thésard au laboratoire d'informatique et d'ingénierie des
systèmes de l'ENSTA ParisTech. Passionné par le C++ et ses nouveaux
standards, il consacre une partie de son temps libre à étudier comment
le langage peut simplifier la programmation web haute performance.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d’orateurs.
--
Akim Demaille
Akim.Demaille(a)lrde.epita.fr
_______________________________________________
Seminaire mailing list
Seminaire(a)lrde.epita.fr
https://lists.lrde.epita.fr/listinfo/seminaire
I am happy to announce that the following paper has been accepted at
the 27th International Conference on Computer Aided Verification
(CAV'15), to be held on July 18–24, at San Francisco.
The Hanoi Omega-Automata Format
Tomáš Babiak¹, František Blahoudek¹, Alexandre Duret-Lutz²,
Joachim Klein³, Jan Křetínský⁵, David Müller³,
David Parker⁴, and Jan Strejček¹
¹Faculty of Informatics, Masaryk University, Brno, Czech Republic
²LRDE, EPITA, Le Kremlin-Bicêtre, France
³Technische Universität Dresden, Germany
⁴University of Birmingham, UK
⁵IST Austria
https://www.lrde.epita.fr/wiki/Publications/babiak.15.cav
Abstract:
We propose a flexible exchange format for ω-automata, as typically
used in formal verification, and implement support for it in a range
of established tools. Our aim is to simplify the interaction of
tools, helping the research community to build upon other people's
work. A key feature of the format is the use of very generic
acceptance conditions, specified by Boolean combinations of
acceptance primitives, rather than being limited to common cases
such as Büchi, Streett, or Rabin. Such flexibility in the choice of
acceptance conditions can be exploited in applications, for example
in probabilistic model checking, and furthermore encourages the
development of acceptance-agnostic tools for automata
manipulations. The format allows acceptance conditions that are
either state-based or transition-based, and also supports
alternating automata.
--
Alexandre Duret-Lutz
I am happy to announce that the following paper has been accepted in
the Conference on Formal Techniques for Distributed Objects,
Components and Systems (FORTE'15), to be held in Grenoble on June 2-5, 2015.
Extending Testing Automata to All LTL
Ala Eddine Ben Salem
LRDE, EPITA, Le Kremlin-Bicêtre, France, ala(a)lrde.epita.fr
Abstract:
An alternative to the traditional Büchi Automata (BA), called Testing
Automata (TA) was proposed by Hansen et al. to improve the automata
theoretic approach to LTL model checking. In previous work, we proposed
an improvement of this alternative approach called TGTA (Generalized Testing
Automata). TGTA mixes features from both TA and TGBA (Generalized Büchi
Automata), without the disadvantage of TA, which is the second pass of the
emptiness check algorithm. We have shown that TGTA outperform TA, BA and
TGBA for explicit and symbolic LTL model checking. However, TA and TGTA
are less expressive than Büchi Automata since they are able to represent only
stutter-invariant LTL properties (LTL\X). In this paper, we show how to
extend Generalized Testing Automata (TGTA) to represent any LTL property.
This allows to extend the model checking approach based on this new form of
testing automata to check other kinds of properties and also other kinds of models
(such as Timed models). Implementation and experimentation of this extended
TGTA approach show that it is statistically more efficient than the Büchi Automata
approaches (BA and TGBA), for the explicit model checking of LTL properties.
ELS'15 - 8th European Lisp Symposium
Goldsmiths College, London, UK
April 20-21, 2015
http://www.european-lisp-symposium.org/
Sponsored by EPITA, Goldsmiths University of London, Franz Inc.,
Lispworks Ltd., Clozure Associates and Google
Recent news:
- A few seats left, still time to register!
- Programme now online (schedule may still change a little)
- Invited speakers announced: Zach Beane, Bodil Stokke, Martin Cracauer
The purpose of the European Lisp Symposium is to provide a forum for
the discussion and dissemination of all aspects of design,
implementation and application of any of the Lisp and Lisp-inspired
dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP,
Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, Hop and so on. We
encourage everyone interested in Lisp to participate.
The 8th European Lisp Symposium features 3 invited talks, one tutorial,
4 technical sessions and 2 lightning talks slots. The full programme is now
available on the website: http://www.european-lisp-symposium.org/.
Programme chair:
Julian Padget, University of Bath, UK
Local chair:
Christophe Rhodes, Goldsmiths, University of London, UK
Programme committee:
Sacha Chua — Toronto, Canada
Edmund Weitz — University of Applied Scicences, Hamburg, Germany
Rainer Joswig — Hamburg, Germany
Henry Lieberman — MIT, USA
Matthew Flatt — University of Utah, USA
Christian Queinnec — University Pierre et Marie Curie, Paris 6, France
Giuseppe Attardi — University of Pisa, Italy
Marc Feeley — University of Montreal, Canada
Stephen Eglen — University of Cambridge, UK
Robert Strandh — University of Bordeaux, France
Nick Levine — RavenPack, Spain
Search Keywords:
#els2015, ELS 2015, ELS '15, European Lisp Symposium 2015,
European Lisp Symposium '15, 8th ELS, 8th European Lisp Symposium,
European Lisp Conference 2015, European Lisp Conference '15
--
My new Jazz CD entitled "Roots and Leaves" is out!
Check it out: http://didierverna.com/records/roots-and-leaves.php
Lisp, Jazz, Aïkido: http://www.didierverna.info
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mercredi 11 mars 2015 (10h30--12h30), Salle L0 du LRDE.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] ainsi que le plan d'accès [4].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2015-03-11
[4] http://www.lrde.epita.fr/Contact
Au programme du Mercredi 11 mars 2015 :
* 10h30: Généricité et efficacité en algèbre linéaire exacte avec les bibliothèques FFLAS-FFPACK et LinBox
-- Clément Pernet, Univ. Grenoble-Alpes, INRIA, LIP équipe AriC
(1) http://lig-membres.imag.fr/pernet
Motivé par de nombreuses applications, allant de la cryptographie au
calcul mathématique, le calcul formel s'est fortement développé ces
dernières années tant au niveau des algorithmes que des implantations
efficaces. L'efficacité des calculs repose sur celle de bibliothèques
dédiées, pour certaines opérations de base, comme l'algèbre linéaire
dans un corps fini ou avec des entiers multi-précision. Devant la
multiplicité des domaines de calcul et des variantes algorithmiques
disponibles, la conception de ces bibliothèques doit concilier une forte
généricité avec l'efficacité.
Nous allons présenter comment cette problématique est abordée dans les
bibliothèques d'algèbre linéaire exacte FFLAS-FFPACK (2) et LinBox (3).
Après une présentation générale de ces projets, nous focaliserons la
présentation sur trois aspects représentatifs:
- l'exploitation des diverses arithmétiques de base (entière, flottante,
booléenne), de routines numériques optimisées et leur intégration au
sein d'algorithmes génériques haut niveau ;
- l'approche boîte-noire de la bibliothèque LinBox, proposant un modèle
algorithmique spécifique, particulièrement performant pour les matrices
creuses ou structurées ;
- La parallélisation de code dans FFLAS-FFPACK, basée sur un langage
spécifique (DSL) permettant d'utiliser de façon interchangeable
différents langages et moteurs exécutifs, et de tirer parti du
parallélisme de tâche avec dépendance par flot de données.
-- Clément Pernet est maître de conférence en informatique à l'Université
Grenoble-Alpes. Sa recherche en calcul formel porte sur l'algèbre
linéaire exacte tant au niveau algorithmique que logiciel. Dans le
contexte de la fiabilité du calcul exact distribué, il aborde aussi la
tolérance aux erreurs silencieuses via les codes correcteurs d'erreurs.
* 11h30: Multiplication matrice creuse--vecteur dense exacte et efficace.
-- Brice Boyer, UPMC CNRS INRIA, LIP6 équipe POLSYS
(1) http://www-polsys.lip6.fr/~boyer
Tout d'abord, nous présentons un cadre générique et rapide pour les
opérations SIMD (single instruction multiple data), écrit en C++ à
l'intérieur de la bibliothèque d'algèbre linéaire exacte FFLAS-FFPACK
(2).
Nous montrons aussi une technique de conception (modules "helper") basée
sur le patron de conception Strategy, qui permet une sélection efficace
d'algorithmes récursifs, des signatures de fonctions plus simples et
plus uniformes. Ensuite, nous appliquons ces techniques pour accélérer
la multiplication entre matrices creuses et vecteurs denses (SpMV) sur
des anneaux Z/pZ, en utilisant des formats conçus pour les opérations
vectorielles et en combinant diverses représentations.
Finalement, nous généralisons ces techniques aux blocs de vecteurs
(matrices denses, SpMM) et étendons nos algorithmes aux entiers de Z.
Nous appliquons aussi ces briques de base au calcul du rang de grandes
matrices creuses avec l'algorithme bloc-Wiedemann.
-- Brice Boyer (1) a effectué une thèse de doctorat sous la direction de
Jean-Guillaume Dumas intitulée /Multiplication matricielle efficace et
conception logicielle pour la bibliothèque de calcul exact LinBox/. Il a
ensuite effectué un post-doctorat de deux ans à la North Carolina State
University (USA) puis un autre à l'UPMC (Paris). Ses intérêts incluent
l'algèbre linéaire exacte dense et creuse, la conception et le
développement logiciels, le calcul parallèle.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d’orateurs.
--
Akim Demaille
Akim.Demaille(a)lrde.epita.fr
_______________________________________________
Seminaire mailing list
Seminaire(a)lrde.epita.fr
https://lists.lrde.epita.fr/listinfo/seminaire
ELS'15 - 8th European Lisp Symposium
Goldsmiths College, London, UK
April 20-21, 2015
http://www.european-lisp-symposium.org/
Sponsored by EPITA, Franz Inc. and Lispworks Ltd.
Recent news:
- *** Submission deadline extended to March 1st ***
- Invited speakers announced: Zach Beane, Bodil Stokke, Martin Cracauer
- Registration to open early March
The purpose of the European Lisp Symposium is to provide a forum for
the discussion and dissemination of all aspects of design,
implementation and application of any of the Lisp and Lisp-inspired
dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP,
Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, Hop and so on. We
encourage everyone interested in Lisp to participate.
The 8th European Lisp Symposium invites high quality papers about
novel research results, insights and lessons learned from practical
applications and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
Topics include but are not limited to:
- Context-, aspect-, domain-oriented and generative programming
- Macro-, reflective-, meta- and/or rule-based development approaches
- Language design and implementation
- Language integration, inter-operation and deployment
- Development methodologies, support and environments
- Educational approaches and perspectives
- Experience reports and case studies
We invite submissions in the following forms:
Papers: Technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
Demonstrations: Abstracts of up to 2 pages for demonstrations of
tools, libraries, and applications.
Tutorials: Abstracts of up to 4 pages for in-depth presentations
about topics of special interest for at least 90 minutes and up to
180 minutes.
The symposium will also provide slots for lightning talks, to be
registered on-site every day.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM classification categories and terms. For more
information on the submission guidelines and the ACM keywords, see:
http://www.acm.org/sigs/publications/proceedings-templates and
http://www.acm.org/about/class/1998.
Important dates:
- 01 Mar 2015: Submission deadline *** EXTENDED ***
- 15 Mar 2015: Notification of acceptance
- 29 Mar 2015: Early registration deadline
- 05 Apr 2015: Final papers
- 20-21 Apr 2015: Symposium
Programme chair:
Julian Padget, University of Bath, UK
Local chair:
Christophe Rhodes, Goldsmiths, University of London, UK
Programme committee:
Sacha Chua — Toronto, Canada
Edmund Weitz — University of Applied Scicences, Hamburg, Germany
Rainer Joswig — Hamburg, Germany
Henry Lieberman — MIT, USA
Matthew Flatt — University of Utah, USA
Christian Queinnec — University Pierre et Marie Curie, Paris 6, France
Giuseppe Attardi — University of Pisa, Italy
Marc Feeley — University of Montreal, Canada
Stephen Eglen — University of Cambridge, UK
Robert Strandh — University of Bordeaux, France
Nick Levine — RavenPack, Spain
Search Keywords:
#els2015, ELS 2015, ELS '15, European Lisp Symposium 2015,
European Lisp Symposium '15, 8th ELS, 8th European Lisp Symposium,
European Lisp Conference 2015, European Lisp Conference '15
--
My new Jazz CD entitled "Roots and Leaves" is out!
Check it out: http://didierverna.com/records/roots-and-leaves.php
Lisp, Jazz, Aïkido: http://www.didierverna.info