Subscribe to the the LRDE announcement list:

News

Noteworthy LRDE events (publications, releases, seminars, graduation and so forth).

2010

• Two new online demos related to the Scribo project - June 22
  Parts of the work done in Scribo can be tested online: a multi-scale binarization based on Sauvola's algorithm and a text detector in natural pictures.

• CSI Seminar on LISP, Olena, SPOT and Vaucanson - June 9
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues:

• Publication « Why and How to Design a Generic and Efficient Image Processing Framework: The Case of the Milena Library » accepted to the 2010 International Conference on Image Processing (ICIP) - May 26

• LRDE bulletin « L'air de rien 19 » is published - May 11

• Publication « Writing Reusable Digital Geometry Algorithms in a Generic Image Processing Framework » accepted to the Workshop on Applications of Digital Geometry and Mathematical Morphology (WADGMM) - May 11

• LRDE Seminar on Performance and Genericity - April 28
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topic:
  Diagrammes de Décision à la Demande (DDoD) - Alban Linard (Université de Genève)
  Architecture logicielle pour des outils génériques en traitement d'images - Roland Levillain (LRDE)

• Spot 0.6 is released - April 16
  Spot is a model-checking library developed collaboratively by LRDE and LIP6. It provides algorithms and data structures to implement the automata-theoretic approach to LTL model checking. This release adds support for W (weak until) and M (strong release) LTL operators, it also improves LTL rewriting rules as well as the degeneralization algorithm.

• Publication « CloX : Common Lisp Objects for XEmacs » accepted to the 3rd European Lisp Symposium (ELS 2010) - March 9

• Publication « Classes, Styles, Conflicts : the Biological Realm of LaTeX  » accepted to 2^5th birthday of TeX (TUG 2010) - March 9

• LRDE Seminar on Performance and Genericity - March 31
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topic:
  Généricité en traitement d'images : niveau algorithmique et logiciel. - Jean-Baptiste Fasquel (Université d'Angers)
  Généricité et héritage en Eiffel. - Bertrand Meyer (ETH Zurich).

• LRDE Seminar on Performance and Genericity - March 3
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topic:
  Yayi : Bibliothèque générique de traitement morphologique d?images - Raffi Enficiaud (INRIA Paris-Rocquencourt)

• Olivier Ricou gives conference on Internet governance at ESPCI - February 19
  On the occasion of the Seminar of the PMMH laboratory at ESPCI, Olivier Ricou has given a general knowledge conference on Internet governance on February 19. You can download the slides at www.lrde.epita.fr/~ricou/espci.pdf

• Spot 0.5 is released - February 1st.
  Spot is a model-checking library developed collaboratively by LRDE and LIP6. It provides algorithms and data structures to implement the automata-theoretic approach to LTL model checking. This release includes more than two years of work with new algorithms for LTL translation, Büchi complementation, and several improvements.

• Didier Verna invited to Vrije University of Brussels - January 26-27
  Didier Verna will be at the Vrije University of Brussels on January 26th and 27th 2010. He is invited by the Software Languages Laboratory to give a talk about his recent research on the behavior and performance of Lisp, and also to plan some collaboration with the team working on ContextL, a Common Lisp library for context-oriented programming.

• Alexandre Duret-Lutz invited to ETHZ Zurich - January 25-27
  Alexandre Duret-Lutz is invited by the "Information Security" group of the Swiss Federal Institute of Technology Zurich (ETHZ) on 25-27 January. He will present the Spot model checking library and the various techniques used in Spot to translate linear-time temporal logic (LTL) formulae into Büchi automata. In Zurich, Alexandre is looking forward to meet Christian Dax and Felix Klaedtke, who use alternating automata to translate PSL formulae (PSL is a superset of LTL).

• CSI Seminar on Vaucanson, Spot, Transformers and Tiger - January 6
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Adapter les structures de données de Vaucanson au concept de kind et à une interface rénovée -- Jérôme Galtier ; Adaptation d'algorithmes de Vaucanson à une interface plus simple -- Florent D'Halluin ; Nouvelle traduction de LTL en TGBA dans Spot -- Damien Lefortier ; La complémentation d'automates de Büchi à travers des automates alternants -- Guillaume Sadegh ; Étude et analyse de l'écriture d'extensions du C++ grâce à Transformers -- Vincent Ordy ; Intégration de techniques de parallélisation dans le compilateur Tiger -- Warren Seine.

2009

• PhD student Alexandre Hamez defends his Thesis at LIP6 - December 8
  Title :
  Efficient generation of large state spaces.
  Abstract :
  Ensuring the reliability of computer systems requires the usage of rigorous verification. Model checking is a technique of verification whose major advantage is automation, and therefore the ease of use for engineers. The recent attribution of the Turing Award to the creators of this technique proves its viability.
  Model checking exhaustively explores the models analyzed. This causes a major problem : combinatorial explosion due to the state spaces of large systems. For over twenty years, many solutions have been proposed to push the limit of size to be able to handle spaces states increasingly large sizes which can reach very quickly 10⁴⁰⁰ elements.
  The work presented here offer two types of solutions to address more effectively larger spaces of states. The first relies on resources parallel computing machines with multiple CPUs, ubiquitous today, and cluster computing. The second proposed deal more effectively with decision diagrams by automating technique called saturation, whose effectiveness empirically shown is very difficult to achieve manually.

• LRDE Seminar on Performance and Genericity - December 2
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topic:
  Le processeur CELL : architecture et programmation - Jean-Luc Lamotte (LIP6); and
  La méthode multipôle rapide sur le processeur Cell : calcul du champ proche Pierre Fortin (LIP6).

• LRDE bulletin « L'air de rien 18 » is published - October 27

• LRDE Seminar on Performance and Genericity - October 21
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topic:
  CImg et G'MIC : Boites à outils libres pour le traitement d'images à différents niveaux. - David Tschumperlé (GREYC Uni Caen).
  

• LRDE Seminar on Performance and Genericity - September 30
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topic:
  GpuCV: Accélération par processeur graphique pour le traitement d'image et la vision artificielle. - Yannick Allusse (Consultant, Freelance) and Patrick Horain (TELECOM SudParis).
  

• PhD student Alban Linard defends his Thesis at LIP6 - September 29
  Title :
  Parameterized Semantics for Decision Diagrams: a step towards their Unification
  Abstract :
  Decision Diagrams are compact data structures. They represent efficiently huge data sets as graphs, where common parts are shared. Gains in efficiency occur on both memory and time used for computations using these structures. However, it depends on the data represented, and varies from almost no gain to an exponential one. With modern techniques, state spaces containing more than 10^2500 different states have been generated in one minute, using only 1 Gbyte of memory.
  A great number of Decision Diagrams, deriving from Binary Decision Diagrams (BDDs), have been defined during the last 20 years. Their differences vary from cover optimizations of the structure to its hierarchical extension. Nowadays, dozens of Decision Diagram kinds exist. They are used in many domains, but each one is a different data structure, that evolves unrelated to the others. No unified theory exists. Its lack helped creating a lot of new Decision Diagrams, but prevents reuse of results in this domain.
  We propose a unifying framework, that covers most of existing Decision Diagrams. However, we do not cover all the variations, beause of their great number. We show that this generalization does not imply a loss in efficiency, by extending the structural optimizations of the Decision Diagrams. This generalization brings these optimizations to kinds that did not define them. Moreover, the unified framework enables mixing several disjoint kinds of Decision Diagrams in one structure.

• Vaucanson 1.3.2 is released - September 22
  Vaucanson is a platform for manipulating weighted finite state automata. It includes a C++ generic library and a command-line interface (TAF-Kit). This maintenance release contains minor adjustments to the build infrastructure, and a couple of bug fixes for TAF-Kit.

• DoX 2.0 is released - September 21
  DoX is an extension to LaTeX2e's Doc package for LaTeX developers.

• LRDE bulletin « L'air de rien 17 » is published - September 14

• DoX 1.0 is released - September 11
  DoX is an extension to LaTeX2e's Doc package for LaTeX developers.

• Olena 1.0 is integrated into Mandriva Linux - September 9
  The Olena team is pleased to announce that Milena, the core C++ image processing library of the Olena 1.0 platform, has been integrated into the Mandriva Linux distribution. Milena will be shipped with the next version of the distribution, named Mandriva 2010.0, and planned for November 2009. RPM packages are already available here: http://doc4.mandriva.org/bin/view/d4/search?name=olena&opc=component

• FiXme 3.4 is released - July 16
  FiXme is a LaTeX2e package for managing meta-comments in your documents.

• Olena 1.0 is released - July 14
  Olena is LRDE's platform dedicated to image processing and pattern recognition. Its core component is a generic and efficient C++ library called Milena. Milena provides a framework to implement simple, fast, safe, reusable and extensible image processing tool chains. The library provides many ready-to-use image data structures (regular 1D, 2D, 3D images, graph-based images, etc.) and algorithms. Milena's algorithms are built upon classical entities from the image processing field (images, points/sites, domains, neighborhoods, etc.). This design allows image processing developers and practitioners to easily understand, modify, develop and extend new algorithms while retaining the core traits of Milena: genericity and efficiency.

• The Olena project hosts a new member: Yann Jacquelet - July 9
  Yann Jacquelet, graduate of the EPITA (SCIA, 1999), has completed a Master in Signal Processing at the University of Rennes and obtained his PhD degree in 2005 for his work at the LTSI. The thesis subject was to investigate the links between Distributed Artificial Intelligence and Control in Image Processing Field. Then he has worked as a teacher in Supinfo and as a web developer. He is now working with us on Olena as a Research Engineer on the SCRIBO project.

• Vaucanson 1.3.1 is released - July 8

• The lab hosts a new member: Jonathan Fabrizio - July 2
  The LRDE is happy to welcome Jonathan Fabrizio. He completed his PhD in 2004 at Pierre and Marie Curie University (Paris 6); his thesis was about collaborative obstacle localization by classical and panoramic vision systems. Then he has worked as a research engineer at the Mathematical Morphology Center (Ecole des Mines de Paris) and at the Department of Databases and Machine Learning (Paris 6 University).
  Jonathan's principal fields of interest are mathematical morphology, movement tracking in videos, image segmentation, and computer vision.

• Publication «  On-the-fly Emptiness Check of Transition-based Streett Automata » accepted to the 7th International Symposium on Automated Technology for Verification and Analysis (ATVA'09) - June 23

• Publication « Support Vector Machines versus Fast Scoring in the Low-Dimensional Total Variability Space for Speaker Verification  » accepted to the 10th Annual Conference of the International Speech Communication Association (INTERSPEECH 2009) - June 22

• Publication « Cepstral and Long-Term Features for Emotion Recognition » accepted to the 10th Annual Conference of the International Speech Communication Association (INTERSPEECH 2009) - June 22

• The Scribo project the lab is involved in now appears on Wikipedia - May 21

• CSI Seminar on Vaucanson, Olena, Spot and LISP - May 20
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Hiérarchie par propriétés du module Algebra de Vaucanson -? Alex Hamelin ; Histogrammes -? Etienne Folio ; Les arbres de composantes dans Milena -? Edwin Carlinet ; Nondéterminisation d?automates alternants dans SPOT -? Samuel Da Mota ; CLIMB : Une approche dynamique du traitement générique d?images ?- Loïc Denuzière.

• CSI Seminar on Vaucanson, Transformers and Spot - May 13
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Analyse de performances pour projets C++ -- Florent D'Halluin ; Traitement curatif pour Vaucanson: un renforcement du concept d'automate -- Jérôme Galtier ; Ajout de la programmation par contrats au C++ avec Transformers -- Vincent Ordy ; Une implémentation des conteneurs C++ avec SCOOL -- Warren Seine ; Traduction d'une LTL étendue en TGBA dans Spot -- Damien Lefortier ; La complémentation d'automates de Büchi -- Guillaume Sadegh.

• Vaucanson 1.3 is released - May 26

• LRDE Seminar on Performance and Genericity - April 22
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Visite guidée de SmartEiffel: le génie logiciel en pratique. - Dominique Colnet. SmartEiffel - LORIA ; and
  TBA - Benoît Sonntag
  

• Publication « Milena: Write Generic Morphological Algorithms Once, Run on Many Kinds of Images » accepted to the 9th International Symposium on Mathematical Morphology (ISMM) - April 9

• LRDE bulletin « L'air de rien 16 » is published - April 08

• Publication « Binary Methods Programming: the CLOS Perspective » published in the Journal of Universal Computer Science (J.UCS), Volume 14, Issue 20, Pages 3389 - 3411. - March 31
  

• LRDE Seminar on Performance and Genericity - March 25
  Attendance to LRDE Seminars is free and open to anyone. This session is dedicated to the following topic:
  Que se cache-t-il derrière ce type ? -- Yann Régis-Gianas, laboratoire PPS (Univ. Paris Diderot), équipe πr² (INRIA)
  

• LRDE Seminar on Performance and Genericity - February 25
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Mise en oeuvre et application des extensions de langages -- Patrick Viry, Ateji ; and
  ReactiveML : une extension d'OCaml pour la programmation de systèmes réactifs synchrones -- Louis Mandel, Université Paris-Sud 11 -- LRI
  

• LRDE Seminar on Performance and Genericity - February 11
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Programmer en JoCaml -- Luc Maranget, Inria ; and
  Programmation par règles : application à la transformation d'arbres en Java -- Pierre-Etienne Moreau - INRIA Nancy - Grand Est
  

• The LRDE and EPITA take part in the organization of the ITiCSE 2009 conference - January 27
  The 14th ACM–SIGCSE Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2009) will take place in Paris, on July 3–8, 2009. The conference is hosted by the Université Pierre et Marie Curie (Paris 6, France), and organized by Patrick Brézillon, from the LIP6. Roland Levillain, Associate-Professor at the EPITA Research and Development Laboratory (LRDE) is member of the organizing committee and administrator of the Web site of the conference (http://iticse09.lrde.org), hosted by the LRDE.

• Publication « Support Vector Machines and Joint Factor Analysis for Speaker Verification » accepted to the IEEE International Conference on Acoustics, Speech, and Signal Processing April 19-24
  This article presents several techniques to combine between Support vector machines (SVM) and Joint Factor Analysis (JFA) model for speaker verification. In this combination, the SVMs are applied on different sources of information produced by the JFA. These informations are the Gaussian Mixture Model supervectors and speakers and Common factors. We found that the use of JFA factors gave the best results especially when within class covariance normalization method is applied in the speaker factors space, in order to compensate for the channel effect. The new combination results are comparable to other classical JFA scoring techniques.

• CSI Seminar on Game Theory and Olena - January 14
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Comparaison entre le Fictitious Play et le Fictitious Play alterné dans le cadre de jeux à somme nulle -- Antoine Leblanc ; Les propriétés dans Milena -- Nicolas Ballas ; L'algorithme union-find de Tarjan et filtres connectés -- Matthieu Garrigues ; Recalage d'images rapide -- Ugo Jardonnet ; Morphologie sur images couleur -- Alexandre Abraham.

• Publication « CLOS Efficiency: Instantiation -- on the behavior and performance of Lisp, part 2.1 --  » accepted to the International Lisp Conference 2009 - January 13
  This article reports the results of an ongoing experimental research on the behavior and performance of CLOS, the Common-Lisp Object System. Our purpose is to evaluate the behavior and performance of the 3 most important characteristics of any dynamic Object Oriented system: class instantiation, slot access and dynamic dispatch. This paper describes the results of our experiments on instantiation. We evaluate the efficiency of the instantiation process in both C++ and Lisp under a combination of parameters such as slot types or classes hierarchy. We show that in a non-optimized configuration where safety is given priority on speed, the behavior of C++ and Lisp instantiation can be quite different, which is also the case amongst different Lisp compilers. On the other hand, we demonstrate that when compilation is tuned for speed, instantiation in Lisp becomes faster than in C++.

• CSI Seminar on Vaucanson and Transformers - January 07
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Réduction d'automates -- Vivien Delmon ; Les automates en traitement automatique des langues naturelles -- Florian Lesaint ; Les relations synchrones dans Vaucanson -- Jimmy Ma ; Transformers : vers la fin du tunnel -- Florian Quèze ; SCOOL : Programmation générique -- Maxime Van Noppen.

2008

• 90' session « Revisiting The Visitor: The 'Just Do It' Pattern » at the next ACCU conference 2009 - December 29
  

• Olena 1.0 beta is available - December 15

• The LRDE at the Open World Forum, Paris - December 1
  

• LRDE Seminar on Performance and Genericity - November 26
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Mesure de Performance et Généricité à EDF R&D -- Laurent Plagne, EDF R&D Clamart; and
  Bibliothèque générique multi-cible d'algèbre linéaire -- Wilfried Kirschenmann, EDF R&D
  

• LRDE Seminar on Performance and Genericity - November 5
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Représentation efficace des données complexes dans un intergiciel schizophrène -- Thomas Quinot, AdaCore; and
  Construire une application robuste sans faire exploser les coûts -- Samuel Tardieu, Telecom ParisTech
  

• LRDE bulletin « L'air de rien 15 » is published - October 20

• Publication « TWEAST: A Simple and Effective Technique to Implement Concrete-Syntax AST Rewriting Using Partial Parsing » accepted to the 24th Annual ACM Symposium on Applied Computing (SAC) - October 11

• The lab hosts a new member : Dalila Benboudjema - October 1
  The LRDE is happy to welcome Dalila Benboudjema. After having successfully completed her PhD under the direction of thesis advisor Prof. W. Pieczynski at Télécom Sud-Paris (ex INT-Evry) she was postdoc at Telecom ParisTech. Then she has worked at Ecole des Mines de Paris as a Research Engineer, before joining EPITA as an Assistant Professor and the LRDE in order to work, among others, on Olena for the Scribo project .
  Thesis subject : Triplets Markov Fields and Unsupervised Bayesien Segmentation.
  Dalila's principal fields of interest are research in Image segmentation, Markovian models, Theory of evidence, mathematical morphology, SAR and biomedical images.

• LRDE Seminar on Performance and Genericity - September 24
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Systèmes, algorithmes et applications : Efficacité et utilité des systèmes parallèles -- Gaétan Hains, LACL, Université de Paris Est, Créteil; and
  Outils pour le parallèlisme : apports de la programmation générative -- Joël Falcou, LRI, Université de Paris-Sud, Orsay.

• The lab has a new head : Olivier Ricou - September 15
  Akim Demaille hands over the responsibilty of the lab to Olivier Ricou after having held the post for 5,5 years.

• Publication « Compiler Construction as an Effective Application to Teach Object-Oriented Programming » accepted to the The seventh "Killer Examples" workshop, Worked Examples for Sound OO Pedagogy - September 15

• The lab hosts a new member : Guillaume Lazzara - September 1
  The LRDE is happy to welcome Guillaume Lazzara. Former CSI 2008 student, he has received his EPITA degree in July 2008. In the past he worked on the lab's Vaucanson Project. Most of his work was related to performance improvement in the low level parts of the library. This year, he joins the LRDE as a permanent member in order to work on Olena for the Scribo project (http://www.scribo.ws).
  During his spare time, he contributes to the Open Source Community by developing a serverless P2P software.

• Publication « An XML format proposal for the description of weighted automata, transducers, and regular expressions » accepted to the 7th International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP'08) - July 28

• CSI Seminar on Transformers and Vaucanson - July 09
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Implémentation d'une extension du C++ dans Transformers : class namespace -- Vincent Ordy ; Centaur : Une infrastructure générique simplifiant les transformations de C++ -- Cédric Raud ; Désambiguïsation des patrons de type C++ avec les Grammaires Attribuées de Transformers -- Warren Seine ; Interface graphique de Vaucanson -- Flrorent D'Halluin ; Amélioration de la composition des transducteurs dans Vaucanson -- Jérôme Galtier.

• CSI Seminar on Olena, Speaker ID and Spot - July 02
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Distance Transform -- Etienne Folio ; Les types de couleur dans Milena -- Caroline Vigouroux ; Systèmes de discriminants linéaires pour la vérification du locuteur -- Antoine Legrand ; Traduction d'une LTL étendue en TGBA dans Spot -- Damien Lefortier ; Front-end Promela dans Spot -- Guillaume Sadegh.

• CSI Seminar on Olena and Game Theory - June 25
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Ligne de partage des eaux topologique -- Alexandre Abraham ; Taxonomie des images de Milena -- Nicolas Ballas ; Transformation des courbes de niveau rapide -- Matthieu Garrigues ; Recalage d'image rapide -- Ugo Jardonnet ; Etude et implémentation du Fictitious Play alterné -- Antoine Leblanc ; Equilibres de Nash approchés dans les jeux multi-joueurs -- Sébastien Hémon et al.

• CSI Seminar on Transformers and Vaucanson - June 18
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: SCOOL : Programmation générique et concepts -- Maxime Van Noppen ; Découpage de programme C++ avec Transformers -- Florian Quèze ; Parser d?expressions rationnelles -- Vivien Delmon ; FSMXML et son utilisation dans Vaucanson -- Florian Lesaint ; Booster les itérateurs de Vaucanson -- Jimmy Ma.

• LRDE bulletin « L'air de rien 14 » is published - May 28

• Publication « Semantics-Driven Genericity: A Sequel to the Static C++ Object-Oriented Programming Paradigm (SCOOP 2) » accepted to the 6th International Workshop on Multiparadigm Programming with Object-Oriented Languages (MPOOL'08) - May 26

• LRDE Seminar on Performance and Genericity - May 28
  Le language BSML -- Frédéric Gava
  Programmation parallèle certifiée -- Frédéric Loulergue.
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Le language BSML -- Frédéric Gava, LACL, Université de Paris Est, Créteil; and
  Programmation parallèle certifiée -- Frédéric Loulergue, LIFO, Université d'Orléans.

• Publication « A survey of French Local e-Democracy » accepted to the 8th European Conference on e-Government (ECEG'08) - May 01

• LRDE Seminar on Performance and Genericity - April 30
  High-Level Abstractions and Optimization -- Anya Helene Bagge
  Mouldable Programming -- Magne Haveraaen.
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  High-Level Abstractions and Optimization -- Anya Helene Bagge, Institutt for Informatikk, Universitetet i Bergen, Norway; and
  Mouldable Programming -- Magne Haveraaen, Institutt for Informatikk, Universitetet i Bergen, Norway.

• The LRDE participates in the NIST-2008 Speaker Recognition Evaluation campaign (April 07 - May 12).

• Publication « Binary Methods: the CLOS Perspective » accepted to the 1st European Lisp Symposium (ELS'08) - April 07

• LRDE bulletin « L'air de rien 13 » is published - March 31

• Publication « A Set of Tools to Teach Compiler Construction » accepted to the 13th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE) - March 29

• LRDE Seminar on Performance and Genericity - March 26
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following topics:
  Aspect-oriented Programming -- Anya Helene Bagge, Institutt for Informatikk, Universitetet i Bergen, Norway; and
  Context-oriented Programming with ContextL -- Pascal Costanza, Vrije Universiteit, Brussel, Belgium.

• Vaucanson 1.2^? is released - March 19

• Publication « Hierarchical Set Decision Diagrams and Automatic Saturation » accepted to the 29th annual international Conference on Petri Nets and Other Models of Concurrency (ICATPN 2008) - March 01

• The lab hosts engineer Géraud Beguin^? - February
  Géraud BEGUIN has obtained his Engineer Degree at ISEP - Graduate school of Engineers in Computer Engineering, Electronics, Telecommunications and Network in 2007. After having specialized in artificial intelligence during one semester in Argentinia at Universidad Tecnologica Nacional (UTN) thanks to an exchange programme, he has completed his final internship of ISEP at Institut Gustave Roussy (IGR), working on different methods for ultrasound image deconvolution. Employed by IGR since last year, Géraud participates in a common project between IGR and LRDE dedicated to method evaluation of functional 3D images. The LRDE contributes with Olena to the part of the project devoted to image processing.

• Patcher 3.10 is released - February 27
  Patcher is an XEmacs package for automating the maintenance of archive-based projects. It is the official tool used by XEmacs developpers.

• FiNK 2.1.1 is released - February 27
  FiNK is a LaTeX2e package for keeping track of files \input'ed or \include'ed in your document.

• CurVe 1.15 is released - February 25
  CurVe is a LaTeX2e package for making curricula vitae.

• LRDE Seminar on Performance and Genericity - February 20
  Attendance to LRDE Seminars is free and open to anyone. This session welcomes the following talk: Performance et Généricité dans Qgar -- Vitor Vasconcelos Araujo Silva, LORIA Nancy.

• Publication « Semantics driven disambiguation: A comparison of different approaches » accepted to the Eighth Workshop on Language Descriptions, Tools and Applications (LDTA'08) - February 08

• LRDE Seminar on Performance and Genericity - January 30
  Attendance to LRDE Seminars is free and open to anyone. This session includes the following issues: Robustesse, efficacité et généricité dans la bibliothèque CGAL -- Sylvain Pion, chargé de recherche, INRIA Sophia Antipolis; Morph-M et généricité en traitement d'images -- Romain Lerallut, ingénieur R&D chez A2iA and Raffi Enficiaud, ingénieur de recherche chez DxO Labs.

• Publication « Towards the World-Wide Quantum Network » accepted to the 4th Information Security Practice and Experience Conference (ISPEC'08) - January 25

• Publication « Approximate Nash Equilibria for multi-players Games » accepted to Symposium on Algorithmic Game theory (SAGT 08) - January 18

• CSI Seminar on Transformers, Speaker ID and Game Theory - January 16
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: revCPP : A reversible C++ preprocessor -- Quentin Hoquet; Run-Time Concrete-Syntax Program-Transformation in General Purpose Languages -- Benoît Sigoure; Automatic Attribute Propagation for Modular Attribute Grammars -- Nicolas Pierron; Semantics driven disambiguation: A comparison of different approaches -- Renaud Durlin; Transfinite Chomp -- Nicolas Neri; SVM Kernel Combining System for Speaker Verfication -- Charles-Alban Deledalle.

• CSI Seminar on Olena, DD, Speaker ID and Vaucanson - January 09
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: An overview of SCOOP, a C++ object-oriented paradigm -- Thomas Moulard; Homolib -- Samuel Charron; SVM-MLLR for multi-system speaker recognition -- Geoffroy Quérol; FIXME -- Jean-Philippe Garcia Ballester; Boosting Vaucanson's genericity -- Guillaume Lazzara; Synchronized Transducers -- Guillaume Leroi.

• LRDE bulletin « L'air de rien 12 » is published - January 4

• Publication « Global Optimization for First Order Markov Random Fields with Submodular Priors » accepted to International Workshop on Combinatorial Image Analysis (IWCIA'08) - January 03

2007

• Vaucanson 1.1.1 is released - December 14
  The Vaucanson Team is proud to announce the release of Vaucanson 1.1.1. This release contains mostly bug fixes.

• FiXme 3.3 is released - November 28
  FiXme is a LaTeX2e package for managing meta-comments in your documents.

• CurVe 1.14 is released - November 27
  CurVe is a LaTeX2e package for making curricula vitae.

• FiNK 2.1 is released - November 14
  FiNK is a LaTeX2e package for keeping track of files \input'ed or \include'ed in your document.

• LRDE bulletin « L'air de rien 11 » is published - September 28

• Publication « Kernel Combination for SVM Speaker Verification » accepted to The Speaker and Language Recognition Workshop (Odyssey 2008) - September 25

• Publication « The Role of Speaker Factors in the NIST Extended Data Task » accepted to The Speaker and Language Recognition Workshop (Odyssey 2008) - September 25

• Publication « Comparison Between Factor Analysis and GMM Support Vector Machines for Speaker Verification » accepted to The Speaker and Language Recognition Workshop (Odyssey 2008) - September 25

• Publication « Web services at TERAPIX » accepted to Astronomical Data Analysis Software & Systems XVII - September 23
  We present an implementation of V.O.-compliant web services built around software tools developed at the TERAPIX centre. These services allow to operate from a remote site several pipeline tasks dedicated to astronomical data processing on the TERAPIX cluster, including the forthcoming EFIGI morphological analysis tool.

• Patcher 3.9 is released - September 17
  Patcher is an XEmacs package for automating the maintenance of archive-based projects. It is the official tool used by XEmacs developpers.

• The lab welcomes a new member : Alexandre Duret-Lutz - September
  The LRDE is happy to welcome Alexandre Duret-Lutz who joins the team after receiving his PhD degree in July 2007. After completing his DEA this former EPITA student (SCIA, year 2001) started his PhD on software verification at the Laboratory of Computer Sciences, Paris 6 under the direction of Fabrice Kordon, with Denis Poitrenaud as co-advisor. Thesis subject : Contributions to the automata theoretic approach to concurrent software verification. (more info)

• Publication « Linear and non linear kernel GMM supervector machines for speaker verification » presented at European Conference on Speech Communication and Technologies (Interspeech'07) - August 27

• CurVe 1.13 is released - August 21
  CurVe is a LaTeX2e package for making curricula vitae.

• Vaucanson 1.1 is released - July 30
  The Vaucanson Team is proud to announce the release of Vaucanson 1.1. This release mainly includes bug fixes, various optimizations (I/O and algorithms) and TAF-Kit improvements.

• LRDE bulletin « L'air de rien 10 » is published - June 20

• Vaucanson 1.0a is released - June 13
  The Vaucanson Team is proud to announce the release of Vaucanson 1.0a. This is an intermediate release which mainly includes bug fixes and various optimizations.

• FiNK 2.0 is released - June 12
  FiNK is a LaTeX2e package for keeping track of files \input'ed or \include'ed in your document.

• Publication « How to make LISP go faster than C -- Tuning LISP for performance. » republished in the IAENG International Journal of Computer Science (volume 32, #4, ISSN 1819-656X, Dec. 2006) - Jun 11

• CSI Seminar on Lisp, Olena and Transformers - June 06
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Étude de problèmes de performances en C et en Common Lisp -- William Caldwell; Olena, comme les autres ? -- Thierry Géraud; Génie logiciel au coeur d'Olena -- Nicolas Ballas; Canevas d'algorithmes morphologiques Ugo Jardonnet; Étude comparative de Concept C++ et perspective d'intégration dans SCOOP -- Alexandre Abraham; SCOOL, orientation objet d'un langage statique -- Maxime Van Noppen; Typage du C++ par grammaires attribuées -- Florian Quèze.

• CSI Seminar on Vaucanson, Game Theory and Parallel Computing - May 23
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Un format universel de description d'automates et son utilisation dans Vaucanson -- Florian Lesaint; Boosting Vaucanson - partie 1 -- Guillaume Lazzara; Boosting Vaucanson - partie 2 -- Jimmy Ma; Algorithmes génériques et performants de suppression des transitions spontanées dans Vaucanson -- Vivien Delmon; Transducteurs synchronisés -- Guillaume Leroi; Méthodes algorithmiques de recherche d'équilibres de Nash -- Antoine Leblanc; Conception d'une bibliothèque générique de parallélisation en C ++ s'appuyant sur l'existant -- Elie Bleton.

• CSI Seminar on Olena, Transformers and DD - May 16
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Une bibliothèque de conteneurs en C++ via SCOOP -- Thomas Moulard; Diagrammes de décision à valeurs supprimées -- Samuel Charron; Préprocesseur C/C++ reversible -- Quentin Hocquet; Définition formelle de la Désambiguïsation avec des Grammaires Attribuées -- Nicolas Pierron; Désambiguïsation guidée par la sémantique -- Renaud Durlin; Centaur : Une infrastructure pour la transformation de C ++ -- Benoit Sigoure.

• Publication « Algorithme de calcul de l'arbre des composantes avec applications à la reconnaissance des formes en imagerie satellitaire » accepted to GRETSI 2007 - May 11

• CSI Seminar on Markov and Speaker Recognition - May 09
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Validation des performances d'un algorithme d'apprentissage -- Johan Oudinet; Génération de texte en langage naturel -- Jean-Philippe Garcia-Ballester; Apprentissage pour la vérification -- Nicolas Neri; LRDE's Speaker Recognition Framework : un nouvel outil -- Julien Ramakichenin et Charles Melin; Vérification du locuteur : approches sélectives -- Geoffroy Querol; Introduction à la compensation de canal -- Charles-Alban Deledalle; Comparaison entre l'utilisation du noyau linéaire et non linéaire pour les systèmes de vérification du locuteur fondés sur les méthodes SVM -- Reda Dehak.

• LRDE bulletin « L'air de rien 9 » is published - May 07

• Publication « Effective Component Tree Computation with Application to Pattern Recognition in Astronomical Imaging » accepted to ICIP 2007 - May 3
  In this paper a new algorithm to compute the component tree is presented. As compared to the state of the art, this algorithm does not use excessive memory and is able to work efficiently on images whose values are highly quantized or even with images having floating values. We also describe how it can be applied to astronomical data to identify relevant objects.

• Publication « libDMC: a library to Operate Efficient Distributed Model Checking » accepted to POHLL 2007 - March 13
  Model checking is a formal verification technique that allows to automatically prove that a system's behavior is correct. However it is often prohibitively expensive in time and memory complexity, due to the so-called state space explosion problem. We present a generic multi-threaded and distributed infrastructure library designed to allow distribution of the model checking procedure over a cluster of machines. This library is generic, and is designed to allow encapsulation of any model checker in order to make it distributed. Performance evaluations are reported and clearly show the advantages of multi-threading to occupy processors while waiting for the network, with linear speedup over the number of processors.

• Publication « On the security of quantum networks: a proposal framework and its capacity » accepted to NTMS 2007 - March 10
  In large Quantum Key Distribution (QKD)-based networks, intermediate nodes are necessary because of the short length of QKD links. They have tendency to be used more than classical networks. A realistic assumption is that there are eavesdropping operations in these nodes without knowledge of legitimate network participants. We develop a QKD-based network framework. We present a percolation-based approach to discuss about conditions of extremely high secret key transmission. We propose also an adaptive stochastic routing algorithm that helps on protecting keys from reasonable eavesdroppers in a dense QKD network. We show that under some assumptions, one could prevent eavesdroppers from sniffing the secrets with an arbitrarily large probability.

• LRDE bulletin « L'air de rien 8 » is published - March 05

• Olena 0.11 is released - February 21
  The Olena Team is proud to announce the release of Olena 0.11. This version is an update of the Olena generic and efficient image processing library developed at the LRDE. This new version brings support for recent versions of the GNU (g++ 4.0 and 4.1) and Intel (icpc 9.1) C++ compilers. Swilena, the set of Python and Ruby wrappers for Olena, has been improved. Finally Olena 0.11 supports Mac OS X (version 10.3) and includes a lot of fixes over the previous version.

• Publication « Local reasoning in fuzzy attributes graphs for optimizing sequential segmentation » accepted to GBR'07 - February 15
  Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics. Graph are well adapted to represent such information.Sequential methods for knowledge-based recognition of structures require to define in which order the structures are to be recognized. We propose to address this problem of order definition by developing algorithms that automatically deduce sequential segmentation paths from fuzzy spatial attribute graphs. As an illustration, these algorithms are applied on brain image understanding.

• Invited talk « CLOS solutions to binary methods » at International MultiConference of Engineers and Computer Scientists - January 22
  Implementing binary methods in traditional object oriented languages is difficult: numerous problems arise, such as typing (covariance vs. contra-variance of the arguments), polymorphism on multiple arguments (lack of multi-methods) etc. The purpose of this paper is to demonstrate how those problems are either solved, or nonexistent in the Common Lisp Object System (CLOS). Several solutions for different levels of binary method support in CLOS are proposed. They mainly consist in re-programming a binary method specific object system through the CLOS meta-object protocol.

2006

• Publication « A Note on The Discrete Binary Mumford-Shah Model » accepted to MIRAGE 2007 - December 29
  This paper is concerned itself with the analysis of the two-phase Mumford-Shah model also known as the active contour without edges model introduced by Chan and Vese. It consists of approximating an observed image by a piecewise constant image which can take only two values. First we show that this model with the $L^1$-norm as data fidelity yields a contrast invariant filter which is a well known property of morphological filters. Then we consider a discrete version of the original problem. We show that an inclusion property holds for the minimizers. The latter is used to design an efficient graph-cut based algorithm which computes an exact minimizer. Some preliminary results are presented.

• Publication « The Biosecure Geometry-based System for Hand Modality » accepted to IEEE ICASSP'07 - December 18
  We present an identification and authentification system based on hand modality which is part of a reference system for all modalities developed within the Biosecure consortium. It relies on simple geometric features extracted from hand boundary. The different steps of this system are detailed, namely: pre-processing, feature extraction and hand matching. This system has been tested on the Biosecure hand database which consists of 4500 hand images of 750 individuals. Results are detailed with respect to different enrolment conditions such as population size, enrolment size, and image resolution.

• CSI Seminar on Game theory, BDD and Parallel Computing - December 08
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Recherche d'un epsilon-Nash de support de taille 2 -- Michaël Cadilhac; BDD distribués, Java, Thread, et optimisations -- Guillaume Guirado; Parallélisme appliqué au traitement d'image -- Alexandre Borghi; Les systèmes de recommandation -- Thomas Largillier.

• CSI Seminar on Vaucanson and Olena - December 07
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Présentation du TAF-Kit -- Robert Bigaignon; Etat des lieux des propositions XML pour les automates -- Florent Terrones; Extraction automatique d'artères à partir d'images médicales 3D -- Nicolas Widynski; Extractions d'objets : l'algorithme Fast Level Lines Transform (FLLT) -- Christophe Berger.

• Publication « Stochastic routing in large grid-shaped quantum networks » accepted to RIVF'07 - December 04
  This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution-based networks. We develop a realistic QKD-based network framework and we show that the key transmission problem on such a framework can be considered as a variant of the classical percolation problem. We also present an adaptive stochastic routing algorithm protect from inevitable eavesdroppers. Simulations were carried out not only to validate our approach, but also to compute critical parameters ensuring security. These results show that large quantum networks with eavesdroppers do provide security.

• The Transformers group presents its results to Seventh Stratego User Days - November 30
  

• LRDE bulletin « L'air de rien 7 » is published - November 29

• LRDE bulletin « L'air de rien 6 » is published - September 29

• Publication « The use of levelable regularization functions for MRF restoration of SAR images while preserving reflectivity » accepted to IS&T/SPIE 19th Annual Symposium Electronic Imaging (2007) - Sept 30
  It is well-known that Total Variation (TV) minimization with L2 data fidelity terms (which corresponds to white Gaussian additive noise) yields a restored image which presents some loss of contrast. The same behavior occurs for TVmodels with non-convex data fidelity terms that represent speckle noise. In this note we propose a new approach to cope with the restoration of Synthetic Aperture Radar images while preserving the contrast.

• Publication « Modeling of Sensor Networks Using XRM » accepted to 2nd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2006) - Sept 14
  Sensor networks are composed of small electronic devices that embed processors, sensors, batteries, memory and communication capabilities. One of the main goals in the design of such systems is the handling of the inherent complexity of the nodes, exarcerbated by the huge number of nodes in the network. For these reasons, it becomes very difficult to model and verify such systems. In this paper, we investigate the main characteristics of sensor nodes, discuss the use of a language derived from Reactive Modules for their modeling, and propose a language (and a tool set) that ease the modeling of this kind of systems.

• Paper « Project EFIGI: Automatic Classification of Galaxies » is published - Sep 2006.
  We propose an automatic system to classify images of galaxies with varying resolution. Morphologically typing galaxies is a difficult task in particular for distant galaxies convolved by a point-spread function and suffering from a poor signal-to-noise ratio. In the context of the first phase of the project EFIGI (extraction of the idealized shapes of galaxies in imagery), we present the three steps of our software: cleaning, dimensionality reduction and supervised learning. We present preliminary results derived from a subset of 774 galaxies from the Principal Galaxies Catalog and compare them to human classifications made by astronomers. We use g-band images from the Sloan Digital Sky Survey. Finally, we discuss future improvements which we intend to implement before releasing our tool to the community.

• Best Paper Award for the article How to make LISP go faster than C -- Tuning LISP for performance. by DidierVerna, at International MultiConference of Engineers and Computer Scientists - Aug 20

• Publication « LaTeX Curricula Vitae with the CurVe Class » accepted for the PracTeX Journal, number 3, August 2006. - Aug 15
  This paper presents CurVe^?, a curriculum vitae class for LaTeX2e^?, in a progressive approach going from a first contact with the class, through concrete examples of customization, and some aspects of advanced usage.

• Publication « An Efficient Algorithm for Connected Attribute Thinnings and Thickenings » accepted to International Symposium on Visual Computing ISVC 2006 - Aug 9
  Connected attribute filters are anti-extensive morphological operators widely used for their ability of simplifying the image without moving its contours. In this paper, we present a fast, versatile and easyto- implement algorithm for grayscale connected attribute thinnings and thickennings, a subclass of connected filters for the wide range of nonincreasing attributes.We show that our algorithm consumes less memory and is computationally more efficient than other available methods on natural images.

• Vaucanson 1.0 is released - July 28
  The Vaucanson team is proud to announce this release, which includes significant improvements of the library, and TAF-Kit support for Boolean Automata, Z-Automata, and Transducers.

• Publication «  Evaluating complex MAC protocols for sensor networks with APMC. » accepted to AVOCS 2006 - July 27

• Publication «  Approximate Probabilistic Model Checking for Programs. » accepted to ICCP 2006 - July 27

• Publication « Attribute Grammars for Modular Disambiguation » accepted to IEEE 2nd International Conference on Intelligent Computer Communication and Processing ICCP 2006 - July 12
  To face the challenges to tomorrow's software engineering tools, powerful language-generic program-transformation components are needed. We propose the use of attribute grammars (AGs) to generate language specific disambiguation filters. In this paper, a complete implementation of a language-independent AGs system is presented. As a full scale experiment, we present an implementation of a flexible C front-end. Its specifications are concise, modular, and the result is efficient. On top of it, transformations such as software renovation, code metrics, domain specific language embedding can be implemented.

• Best Paper Award for the article Beating C in Scientific Computing Applications -- On the Behavior and Performance of LISP, Part 1 by DidierVerna, at ECOOP 2006's Third European LISP Workshop - Jul 11

• Publication «  Beating C in Scientific Computing Applications -- On the Behavior and Performance of LISP, Part 1. » accepted to Third European LISP Workshop at ECOOP - July 3
  This paper presents an ongoing research on the behavior and performance of LISP with respect to C in the context of scientific numerical computing. Several simple image processing algorithms are used to evaluate the performance of pixel access and arithmetic operations in both languages. We demonstrate that the behavior of equivalent LISP and C code is similar with respect to the choice of data structures and types, and also to external parameters such as hardware optimization. We further demonstrate that properly typed and optimized LISP code runs as fast as the equivalent C code, or even faster in some cases.

• Vaucanson 0.8.0 is released - June 15
  This new release comes with the usual set of bug fixes, renamings and cleanup, and with the advant of a new command-line interface: TAF-Kit.

• CSI Seminar on OLENA and TRANSFORMERS - June 14
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Dynamisation de bibliothèques C++ statiques -- Tristan Croiset; Conception d'un langage statique, un aperçu de SCOOP -- Thomas Moulard and Quentin Hocquet; Aperçu des Grammaires Attribuées -- Nicolas Pierron; eXtended Reactive Modules -- Benoît Sigoure.

• CurVe 1.11 is released - June 7
  CurVe is a LaTeX2e package for making curricula vitae.

• CSI Seminar on BDD, ALGO G and MARKOV - June 7
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: BDD distribués et Java -- Guillaume Guirado; Répartition des DDD en Erlang -- Samuel Charron; Programmation génétique & corewar -- Jérémy Marc; Vérification du locuteur -- Charles Deledalle; Model-checking qualitatif approché -- J-Ph Garcia Ballester; Model-checking : Les chaînes de Markov continues en présence d'incertitudes -- Nicolas Neri.

• Publication « ENST-IRCGN System description » accepted to NIST SRE'06 Workshop: speaker recognition evaluation campaign - June

• Publication « LRDE System description » accepted to NIST SRE'06 Workshop: speaker recognition evaluation campaign - June

• Publication «  APMC 3.0: Approximate verification of Discrete and Continuous Time Markov Chains. » accepted to Qest 2006 - May 30

• Publication «  Uniform random sampling of traces in very large models. » accepted to Random Testing 2006 - May 30

• LRDE bulletin « L'air de rien 5.0 » is published - May 24

• CSI Seminar on OLENA, MARKOV and VAUCANSON - May 24
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Classement de pages Web -- Johan Oudinet; Taxonomie des images dans Olena -- Christophe Berger; Segmentation temps réel -- Nicolas Widynski; Automates et performance -- Guillaume Lazzara; Synchronisation des transducteurs -- Guillaume Leroi; Fermeture d\u2019un automate -- Matthieu Varin.

• CSI Seminar on VAUCANSON and TRANSFORMERS - May 17
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Remodélisation du projet Vaucanson -- Robert Bigaignon; On m'a dit que 275 604 541 était premier -- Michaël Cadilhac; Extension du format XML -- Florent Terrones; Preprocessing & Unpreprocessing du C et C++ -- Thomas Largillier; Grammaires hors-contexte et désambiguïsation -- Renaud Durlin; Vectorisation automatique grâce à la transformation de programme -- Alexandre Borghi.

• LRDE bulletin « L'air de rien 4 » is published - May 10

• Publication « How to make LISP go faster than C -- Tuning LISP for performance. » accepted to International MultiConference of Engineers and Computer Scientists - May 2
  Contrary to popular belief, LISP code can be very efficient today: it can run as fast as equivalent C code or even faster in some cases. In this paper, we explain how to tune LISP code for performance by introducing the proper type declarations, using the appropriate data structures and compiler information. We also explain how efficiency is achieved by the compilers. These techniques are applied to simple image processing algorithms in order to demonstrate the announced performance on pixel access and arithmetic operations in both languages.

• Publication «  On a Polynomial Vector Field Model for Shape Representation.. » accepted to International Conference on Image Analysis and Recognition - April 28
  This paper concerns itself with shape representations in two dimensions. We consider the vector distance map to the boundary of the considered shape. Our shape representation consists of considering the polynomial form of the vector field induced . In order to get this polynomial form, we formalize the problem as an optimization problem. This optimization can be performed efficiently. Indeed, we show it reduces to a matrix multiplication where the matrix does not depend on the considered shape. Some preliminary numerical results are presented.

• FiXme 3.2 is released - April 12
  FiXme is a LaTeX2e package for managing meta-comments in your documents.

• LRDE bulletin « L'air de rien 3 » is published - April 13

• Publication « Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases.  » accepted to Journal of Mathematical Imaging and Vision - March 24
  In Part II of this paper we extend the results obtained in Part I for total variation minimization in image restoration towards the following directions: first we investigate the decomposability property of energies on levels, which leads us to introduce the concept of levelable regularization functions (which TV is the paradigm of). We show that convex levelable posterior energies can be minimized exactly using the level-independant cut optimization scheme seen in part I. Next we extend this graph cut scheme optimization scheme to the case of non-convex levelable energies. We present convincing restoration results for images corrupted with impulsive noise. We also provide a minimum-cost based algorithm which computes a global minimizer for Markov Random Field with convex priors. Last we show that non-levelable models with convex local conditional posterior energies such as the class of generalized gaussian models can be exactly minimized with a generalized coupled Simulated Annealing.

• Publication « Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization.  » accepted to Journal of Mathematical Imaging and Vision - March 24
  This paper deals with the total variation minimization problem in image restoration for convex data fidelity functionals. We propose a new and fast algorithm which computes an exact solution in the discrete framework. Our method relies on the decomposition of an image into its level sets. It maps the original problems into independent binary Markov Random Field optimization problems at each level. Exact solutions of these binary problems are found thanks to minimum cost cut techniques in graphs. These binary solutions are proved to be monotone increasing with levels and yield thus an exact solution of the discrete original problem. Furthermore we show that minimization of total variation under $L^1$ data fidelity term yields a self-dual contrast invariant filter. Finally we present some results.

• LRDE bulletin « L'air de rien 2 » is published - March 8

• Publication « Fast and Exact Discrete Image Restoration Based on Total Variation and on Its Extensions to Levelable Potentials.  » accepted to SIAM Conference on Imaging Science 2006 - February 22
  We investigate the decomposition property of posterior restoration energies on level sets in a discrete Markov Random Field framework. This leads us to the concept of 'levelable' potentials (which TV is shown to be the paradigm of). We prove that convex levelable posterior energies can be minimized exactly with level-independant binary graph cuts. We extend this scheme to the case of non-convex levelable energies, and present convincing restoration results for images degraded by impulsive noise.

2005

• LRDE bulletin « L'air de rien 1 » is published - December 6

• Publication « Probabilistic abstraction for model checking: an approach based on property testing » accepted to ACM TOCL - November 21

• CSI Seminar on Vaucanson & Automata and Olena & Image Processing - November 17
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Les transducteurs dans Vaucanson -- Sarah O'Connor; Réflexions sur la modélisation d'une bibliothèque de manipulation d'automates -- Louis-Noël Pouchet; Manipulation et évaluation de types d'images représentés par des arbres statiques -- Simon Odou.

• CSI Seminar on Transformers and Olena & Image Processing - November 16
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: La fabuleuse destinée d'une petite grammaire attribuée -- Olivier Gournet; Outils pour le suivi automatique de performances -- Nicolas Desprès; Dynamisation de bibliothèques C++ statiques -- Damien Thivolle and Nicolas Pouillard.

• Vaucanson 0.7.2 is released - November 9
  This new release comes with the usual set of bug fixes (in the XML system and in demos for most of them), and is mainly motivated by the new compliance of Vaucanson with the latest GNU C++ Compiler (version 4.0) and the latest Intel C++ Compiler (version 9).

• Publication « C-Transformers: A Framework to Write C Program Transformations » accepted to Crossroads on Programming Languages, the Association for Computing Machinery Student Magazine - October 16
  Program transformation techniques have reached a maturity level that allows processing high-level language sources in new ways. Not only do they revolutionize the implementation of compilers and interpreters, but with modularity as a design philosophy, they also permit the seamless extension of the syntax and semantics of existing programming languages. The C-Transformers project provides a transformation environment for C, a language that proves to be hard to transform. We demonstrate the effectiveness of C-Transformers by extending C's instructions and control flow to support Design by Contract. C-Transformers is developed by members of the LRDE: EPITA undergraduate students.

• PhD student Jérôme Darbon^? receives his PhD degree with distinction - October 7
  Jérôme Darbon has studied Computer Science (EPITA, year 2001) and Applied Mathematics (DEA Mathématiques, Vision et Apprentissage, at ENS Cachan, year 2001). He has successfully completed his PhD at ENST and LRDE.
  
  On October 7 Jérôme has defended his PhD thesis with "Très honorable", the highest distinction at ENST. Thesis subject : Software components and Exact Energy Minimization algorithms dedicated to image processing
  
  The dissertation consists of two parts.
  The first part describes a system for writing algorithms in the shape of frameworks. A framework is a design pattern in which some elements are fixed whereas others are variable. Thus each framework represents a class of algorithms. According to the algorithm that is needed, these frameworks are then specialized. This work also proposes a framework for implementing a class of morphological operators : the connected filters. It shows that this algorithm is fast compared to others currently available.
  The second part is a study of Markov Energy Minimization in the fields of image processing and computer vision. Algorithms for Exact Energy Minimization suitable for different energy types are proposed. The advantage of these algorithms is that they yield a global minimizer even if the energy is not convex. This paper further presents some exact samplers for Gibbs distributions associated with these types of energy. Finally it shows links between binary Markov Random Fields and Mathematical Morphology.
  
  Jérôme's principal fields of interest are research in Exact Energy Minimization dedicated to Computer vision and Mathematical Morphology. He also works on biometrical issues.
  During his PhD he also published several papers on diverse topics.

• The lab hosts PhD student Alban Linard - October
  Alban Linard, after having completed a Master in Distributed Systems and Applications at the Pierre & Marie Curie University (Paris 6), starts a PhD under the direction of thesis advisor Fabrice Kordon (LIP6-SRC) and co-advisors Akim Demaille (EPITA-LRDE) and Emmanuel Paviot-Adet (LIP6-SRC).
  
  With its 400 members the Laboratory of Computer Sciences, Paris 6 (Laboratoire d'informatique de Paris 6, LIP6), is today one of the most important centers of Computer Science in France. It is a department of CNRS. Research activities of the Distributed and Co-operative Systems (SRC) team focus on the system aspect of interoperable components.
  
  Thesis subject : Compact data structures based on shared graphs for verification of distributed systems by model-checking
  
  Model-checking is a technique used, among other things, to verify critical distributed applications. It needs to store and access quickly important amounts of information. A concrete representation of all this information in memory is not possible, but can be replaced by compact symbolic representations. This work focuses on one kind: decision diagrams.
  
  Decision diagrams are a family of compact data structures. In some cases, their sharing decreases to a full enumeration of states. A solution to this problem, variable reordering, is usually not a guarantee of success. This work aims at offering new solutions by creating new compact data structures derived from decision diagrams.

• Vcs 0.4 is released - October 3
  Vcs is a wrapper over any Version Control Systems.

• CurVe 1.10 is released - September 14
  CurVe is a LaTeX2e package for making curricula vitae.

• Publication «  A Vectorial Self-Dual Morphological Filter based on Total Variation Minimization » accepted to ISVC'05 - August 20
  We present a vectorial self dual morphological filter. Contrary to many methods, our approach does not require the use of an ordering on vectors. It relies on the minimization of the total variation with $L^1$ norm as data fidelity on each channel. We further constraint this minimization in order not to create new values. It is shown that this minimization yields a self-dual and contrast invariant filter. Although the above minimization is not a convex problem, we propose an algorithm which computes a global minimizer. This algorithm relies on minimum cost cut-based optimizations.

• Patcher 3.8 is released - July 26
  Patcher is an XEmacs package for automating the maintenance of archive-based projects. It is the official tool used by XEmacs developpers.

• CurVe 1.9 is released - July 21
  CurVe is a LaTeX2e package for making curricula vitae.

• CSI Seminar on Markov & Olena - July 13
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Introduction aux réseaux bayesiens -- Thomas Kielbus, Introduction aux modèles de Markov cachés -- Johan Oudinet; Utilisation des opérateurs connectés pour le traitement de composantes d'images -- Christophe Berger and Nicolas Widynski.

• CSI Seminar on APMC & Transformers - July 06
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Un nouveau schéma de distribution pour APMC -- Guillaume Guirado, Modélisation d'un protocole de broadcast atomique en "Reactive Modules" -- Hélène Baraud, Vers un nouveau système d'évaluation des attributs de désambiguïsation -- Alexandre Borghi, Proposition d'un support pour les notions de programmation avancées en C++ -- Thomas Largillier.

• Vaucanson 0.7.1 is released - June 25
  This new release comes with a set of bug fixes in some algorithms on automata and transducers, some new useful algorithms on automata and transducers on direct product of free monoid, and a reorganization of demos. Also, the latest XML proposal was included. The Vaucanson platform will be presented at the CIAA conference, June 27-29 2005.

• CSI Vaucanson Seminar II - June 22
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Des automates de couverture de langages finis -- Michaël Cadilhac, Méthodes de calcul du langage rationnel reconnu par un automate -- Robert Bigaignon, De son expression à l'automate -- Florent Terrones.

• CSI Transformers Seminar I - June 8
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Ecriture de grammaires attribuées en Stratego/XT -- Olivier Gournet, Panorama des techniques pour allier élégance et performances -- Nicolas Pouillard, Environnement d'évaluation automatique des régressions de performance -- Nicolas Desprès.

• Olena & Vaucanson Seminar I - June 1
  Attendance to the CSI seminars is free and open to anyone. This session includes the following issues: Modélisation et taxonomie des images -- Simon Odou, Utilisation de canevas dans Olena -- Damien Thivolle, Composition de transducteurs -- Sarah O'Connor, Vers une nouvelle modélisation pour Vaucanson -- Louis-Noël Pouchet.

• Publication «  Inside Vaucanson  » accepted to CIAA'05 - May 25
  This paper presents some features of the Vaucanson plateform. We describe some original algorithms on weighted automata and transducers (computation of the quotient, conversion of a regular expression into a weighted automaton, and composition). We explain how complex declarations due to the generic programming are masked from the user and finally we present a proposal for an XML format that allows implicit descriptions for simple types of automata.

• Publication «  Distribution, Approximation and Probabilistic Model Checking  » accepted to PDMC'05 - May 23
  APMC is a model checker dedicated to the quantitative verification of fully probabilistic systems against LTL formulas. Using a Monte-Carlo method in order to efficiently approximate the verification of probabilistic specifications, it could be used naturally in a distributed framework. We present here the tool and his distribution scheme, together with extensive performance evaluation, showing the scalability of the method, even on clusters containing 500+ heterogeneous workstations.

• Vaucanson 0.7 is released - May 17
  This new release comes with a full support of transducers over a free monoid product and some new algorithms dedicated to transducers. Also, a new XML system has been implemented, introducing the latest updates of the Vaucanson group's format proposal.

• Publication «  Total Variation Minimization with $L^1$ Data Fidelity as a Contrast Invariant Filter » accepted to ISPA'05 - April 27
  This paper sheds new light on minimization of the total variation under the $L^1$-norm as data fidelity term ($L^1+TV$) and its link with mathematical morphology. It is well known that morphological filters enjoy the property of being invariant with respect to any change of contrast. First, we show that minimization of $L^1+TV$ yields a self-dual and contrast invariant filter. Then, we further constrain the minimization process by only optimizing the grey levels of level sets of the image while keeping their boundaries fixed. This new constraint is maintained thanks to the Fast Level Set Transform which yields a complete representation of the image as a tree. We show that this filter can be expressed as a Markov Random Field on this tree. Finally, we present some results which demonstrate that these new filters can be particularly useful as a preprocessing stage before segmentation.

• Publication «  An Efficient Algorithm for Attribute Openings and Closings » accepted to Eusipco'05 - April 14
  In this paper, we present fast algorithms for area opening and closing on grayscale images. Salembier's max-tree based algorithm is one of the well known methods to perform area opening. It makes use of a special representation where each node in the tree stands for a flat region and the tree itself is oriented towards the maxima of the grayscale image. Pruning the tree with respect to some attribute, e.g., the area, boils down to attribute opening. Following the same approach, we propose an algorithm for area opening (closing) without building the max-tree (min-tree). Our algorithm exhibit considerable performance compared to the state-of-the art in this domain.

• Publication «  Probabilistic verification and approximation » accepted to Wollic'05 - April 11
  Model checking is an algorithmic method allowing to automatically verify if a system which is represented as a Kripke model satisfies a given specification. Specifications are usually expressed by formulas of temporal logic. The first objective of this paper is to give an overview of methods able to verify probabilistic systems. Models of such systems are labelled discrete time Markov chains and specifications are expressed in extensions of temporal logic by probabilistic operators. The second objective is to focus on complexity of these methods and to answer the question: can probabilistic verification be efficiently approximated? In general, the answer is negative. However, in many applications, the specification formulas can be expressed in some positive fragment of linear time temporal logic. In this paper, we show how some simple randomized approximation algorithms can improve the efficiency of the verification of such probabilistic specifications.

• Publication « Making Compiler Construction Projects Relevant to Core Curriculums » accepted to ITICSE'05 - February 6
  Having 300 students a year implement a compiler is very questionable, since the industry will certainly not recruit them for this competence, yet we made that decision five years ago, for reasons not related to compiler construction. We detail these motivations, the resulting compiler design, and how we implemented this. The project meets its goals, since the majority of former students invariably refer to it as the project that taught them the most.

• FiXme 3.1 is released - January 31
  FiXme is a LaTeX2e package for managing meta-comments in your documents.

• Publication «  A Fast and Exact Algorithm for Total Variation Minimization » accepted to IbPria'2005 - January 18
  This paper deals with the minimization of the total variation under a convex data fidelity term. We propose an algorithm which computes an exact minimizer of this problem. The method relies on the decomposition of an image into its level sets. Using these level sets, we map the problem into optimizations of independent binary Markov Random Fields. Binary solutions are found thanks to graph-cut techniques and we show how to derive a fast algorithm. We also study the special case when the fidelity term is the $L^1$-norm. Finally we provide some experiments.

• Publication «  Ruminations on Tarjan's Union-Find Algorithm and Connected Operators » accepted to ISMM'05 - January 5
  This papers presents a comprehensive and general form of the Tarjan\u2019s union- find algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preservation and, as a consequence, we show how we can rely on \u201cunion-find\u201d to obtain algorithms for self-dual filters approaches and levelings with a marker function.

2004

• FiXme 3.0 is released - December 22
  FiXme is a LaTeX2e package for managing meta-comments in your documents.

• Transformers Seminar III - December 1
  Attendance to the CSI seminars is free and open to anyone. This session, includes the following issues: Transformers : transformation de programme en C++ -- Clément Vasseur, Grammaires attribuées adaptées à la désambiguïsation du C++ -- Valentin David, Vérification de type en C++: étude des solutions existantes -- Julien Roussel, Désambiguïsation sémantique : comparaison de plusieurs approches -- Clément Vasseur.

• QCM 2.1 is released - November 27
  QCM is a LaTeX2e class for making Multiple Choice Questionnaires.

• Vaucanson & Olena Seminar III - November 24
  Attendance to the CSI seminars is free and open to anyone. This session, includes the following issues: Présentation de Vaucanson -- Thomas Claveirole, Bibliothèques statiques en environnement interprété -- Loïc Fosse, Comparaison entre les bibliothèques de traitement d'images -- Niels Van Vliet & Giovanni Palma.

• Vaucanson 0.6.1 is released - October 26
  In addition to the usual bug fixes, this release brings full support of G++ 3.* (any subversion) and ICC 8.1 and other improvements to ease the building and installation. Some extras sample programs and demonstrations were added.

• QCM 1.0 is released - October 15
  QCM is a LaTeX2e class for making Multiple Choice Questionnaires.

• Seminar - Une extension de ML : les types algébriques gardés - September 29
  The LRDE is happy to invite one of the lab's alumni, Yann Régis-Gianas^?, currently PhD student and member of the Cristal team at INRIA (responsible team of the development of the CAML language). He will present his work on the extension of the language's powers. Attendance to this Lrde seminar is free and open to anyone.

• A new LRDE permanent member: Sylvain Peyronnet - September 7
  After completing his PhD in the field of probabilistic algorithms and software/protocols verification at the University of Paris XI, he joins our team at EPITA, where he will teach mainly algorithmic. Sylvain participed in several research projects and is working on the APMC (Approximate Probabilistic Model Checker) project.
  For the last two years Sylvain has been giving lectures at EPITA on algorithmic, distributed algorithms, and calculability.

• Publication « Fast Road Network Extraction in Satellite Images using Mathematical Morphology and Markov Random Fields » accepted to EURASIP Journal on Applied Signal Processing - September 5
  This paper presents a fast method for road network extraction in satellite images. It can be seen as a transposition of the segmentation scheme "watershed transform + region adjacency graph + Markov random fields" to the extraction of curvilinear objects. Many road extractors can be found in the literature which are composed of two stages. The first one acts like a filter that can decide from a local analysis, at every image point, if there is a road or not. The second stage aims at obtaining the road network structure. In the method we propose, we rely on a "potential" image, that is, unstructured image data that can be derived from any road extractor filter. In such a potential image, the value assigned to a point is a measure of its likelihood to be located in the middle of a road. A filtering step applied on the potential image relies on the area closing operator followed by the watershed transform to obtain a connected line which encloses the road network. Then a graph describing adjacency relationships between watershed lines is built. Defining Markov random fields upon this graph, associated with an energetic model of road networks, leads to the expression of road network extraction as a global energy minimization problem. This method can easily be adapted to other image processing fields where the recognition of curvilinear structures is involved.

• Publication « Exact Optimization of Discrete Constrained Total Variation Minimization Problems » accepted to IWCIA'04 - September 1
  This paper deals with the total variation minimization problem when the fidelity is either the $L^2$-norm or the $L^1$-norm. We propose an algorithm which computes the exact solution of these two problems after discretization. Our method relies on the decomposition of an image into its level sets. It maps the original problems into independent binary Markov Random Field optimization problems associated to each level set. Exact solutions of these binary problems are found thanks to minimum-cut techniques. We prove that these binary solutions are increasing and thus allow to reconstruct the solution of the original problems.

• Publication « Fast Color Image Segmentation Based on Levellings in Feature Space » accepted to ICCVG'04 - August 11
  This paper presents a morphological classifier with application to color image segmentation. The basic idea of a morphological classifier is to consider that a color histogram is a 3D gray-level image and that morphological operators can be applied to modify this image. The final objective is to extract clusters in color space, that is, identify regions in the 3D image. In this paper, we particularly focus on a powerful class of morphology-based filters called levellings to transform the 3D histogram-image to identify clusters. We also show that our method gives better results than the ones of state-of-the-art methods.

• Transformers 0.2 is released - July 25
  This release introduces a grammar and disambiguation tools for the C language. Moreover, new tools to handle attribute grammars in SDF have been included. The C++ grammar and disambiguation tools did not change much since the 0.1 release.
  

• Thomas Claveirole^? presents Vaucanson XML representation for automata to CIAA 2004 - July 24
  Thomas Claveirole, an LRDE student, will make a presentation at the CIAA 2004 conference in Canada, on July 22-24. The CIAA conference is about implementation and applications of automata.
  Thomas's talk will take place on July 24 at 8:15. This will be a special session which will aim at presenting an XML representation for finite automata. Most of all, attending this conference will be an occasion to present Vaucanson to the community of automata theoreticians.
  Vaucanson is a joint project between the LRDE, the ENST, and the LIAFA dedicated to finite automata manipulation. It has been developed with the collaboration of Jacques Sakarovitch, from the ENST, who will also attend to the conference. Since the 0.5 release, Vaucanson includes an IO system which allows the user to import and export automata using an XML representation.

• Vaucanson 0.6 is released - July 18
  This new release comes with an improved XML I/O system and more pre-defined contexts, especially for transducers. This release has gained a lot in stability and will be presented at the ninth international conference on implementation and application of automata (CIAA) on July 22-24, 2004.

• Publication « Fusion of spatial relationships for guiding recognition » accepted to Pattern Recognition Letters - July 9
  Spatial relations play an important role in recognition of structures embedded in a complex environment and for reasoning under imprecision. Several types of relationships can be modeled in a unified way using fuzzy mathematical morphology. Their combination benefits from the powerful framework of fuzzy set theory for fusion tasks and decision making. This paper presents several methods of fusion of information about spatial relationships and illustrates them on the example of model-based recognition of brain structures in 3D magnetic resonance imaging.

• Seminar - June 30
  Attendance to the LRDE seminars is free and open to anyone. This session, includes the following issues: Introduction à l'approche automate pour la vérification de propriétés LTL -- AlexandreDuretLutz (LIP6, équipe Systèmes Répartis Coopératifs), Segmentation d'images d'histologie par contours actifs sous l'influence de contraintes de formes et de textures -- SylvainBerlemont^? (Institut Pasteur, Laboratoire d'Analyse d'Images Quantitative), Evolution d'un controleur neuronal pour un animat volant ailes battantes -- JeanBaptisteMouret^? (LIP6, AnimatLab).

• Vaucanson & Olena Seminar II - June 23
  Attendance to the CSI seminars is free and open to anyone. This session, Vaucanson & Transformers Seminar II, includes the following issues: Shapelets transforms -- Damien Thivolle, Image restauration using deconvolution -- Simon Odou, Transducers implementation in Vaucanson -- Sarah O'Connor, Shorten the distance between Vaucanson and its users -- Louis-Noël Pouchet.

• A more public development scheme! - June 15
  The LRDE is happy to announce that its development process is now open wider: a public Subversion repository (https://svn.lrde.epita.fr/svn/) replaces our private PRCS repository, and GForge is now used to provide a nice interface to developpers and users (http://gforge.lrde.epita.fr). It should ease the feedback, and provide better traceability of problem reports, feature requests and so forth.
  With the notable exception of Olena, all the noteworthy projects are available: Transformers, Vaucanson, TigerCompiler, Nolimips^?, Havm^?, etc.
  For an exhaustive list, see our ViewCVS Interface to the repository.

• Vaucanson & Transformers Seminar II - June 16
  Attendance to the CSI seminars is free and open to anyone. This session, Vaucanson & Transformers Seminar II, includes the following issues: Dynamic use of static libraries : Compilation On Demand and other solutions -- Loïc Fosse, Extension of the grammars' syntax -- Nicolas Pouillard, Advanced in C++ program source preprocessing -- Olivier Gournet, Overview of C++ program transformations with stratego -- Nicolas Despres.

• Publication « Metagene, a C++ meta-program generation tool » accepted to MPOOL'04 - May 25
  Metagene is a program transformation tool which simplifies the development of C++ meta-programs. Due to the similarities between C++ meta-programming and functional programming, the input language of Metagene is an ML language. Given a functional input program, Metagene outputs the corresponding C++ meta-program expressed using template classes.

• Transformers Seminar I - June 2
  Attendance to the CSI seminars is free and open to anyone. This session, Transformers Seminar I, includes the following issues: Transformers : C++ Program Transformation, by Clément Vasseur; Attribute grammars and StrategoXT to C++ disambiguation in Transformers, by Valentin David; Transformers : C++ Type Checking, by Julien Roussel; Code generator generators, by Clément Vasseur.

• CurVe 1.7 is released - May 19
  CurVe is a LaTeX2e class for making Curricula Vitae.

• Olena and Vaucanson Seminar I - May 26
  Attendance to the CSI seminars is free and open to anyone. This session, Olena and Vaucanson Seminar I, includes the following issues: Color Image Segmentation -- Niels Van Vliet; An Analysis of the Vaucanson Project -- Thomas Claveirole; Dynamic use of static libraries : Compilation On Demand and other solutions -- Loïc Fosse.

• CodeBoost tutorial morning - May 19
  CodeBoost is a framework for C++ source to source transformation. It's developed at the university of Bergen (Norway). This project deals with the same problem of our project: Transformers.

• Publication « Unified texture management for arbitrary meshesl » - May

• Publication « Person Authentication Based on Hand Shape » accepted to EUSIPCO 2004 - April 26
  This paper deals with the problem of person identification based on their hand images. Independent component features of the hand silhouette images are used for recognition. The classification performance is found to be very satisfactory and it is shown that, at least for groups of one hundred subjects, hand-based recognition is a viable secure access control scheme.

• Transformers 0.1 is released - April 19
  This release contains the current C++ parser of the project and some examples of C++ rewriting using Stratego/XT environment.
  

• Olena 0.10 is released - April 16
  This new release of Olena comes with a new documentation system, numerous bug fixes and many new features, some of which are listed here. Morphers are introduced, and allow to apply algorithms to parts of images (e.g., on the red component, or on a 2D slice of a 3D image etc.). Attribute opening/closing were enhanced. The color conversion was completely overhauled. The border behavior can be controlled with the behavior hierarchy.

• Vaucanson 0.5 is released - March 31
  With the Vaucanson Day comes a new release Vaucanson 0.5. This release brings more stability with an improved test suite, and an XML Input/Output system. Furthermore there has been a deep revision of the library, and the API has been clarified.

• VaucansonDay, Vaucanson 0.5 tutorial day - March 31
  The second Vaucanson Day is held at EPITA, (ContactUs), room P 05 and SM 24, March 31st, from 9 AM to 6 PM.
  
  Vaucanson is a finite state machine manipulation library, a joint project of LRDE/ENST/LIAFA (Jussieu). A distinctive feature of it is that it manipulates automata with multiplicity which represent a generalization of standard automata. Thanks to the lab's know-how in generic programming, it is a very flexible library that obtains excellent results.

• The lab hosts PhD student Franck Coppola^? - March 18
  Franck Coppola^?, an EPITA graduate student having completed a Master in signal processing at the University of Rennes, starts a PhD on document image analysis. It is a joint work between the LRDE (represented by Dr Thierry Geraud), SWT (a French software company) and the LUSAC, University of Caen (represented by Dr Abderrahim ELMOATAZ).
  
  SWT is working on snail mail processing software including digitization of inbound mail, dispatching, information extraction and document management. It is mostly used to process forms and documents whose layout is known in advance. However, customers expect solutions that help process heterogeneous flows of documents, of which some may be seen for the first time.
  
  The aim of this joint work is to extract information from unseen documents. We might use domain specific knowledge about the kind of document we are processing (invoices, Bank documents), but the precise location of the field we wish to extract is unknown and can't be learned. The location must be deduced from the document layout (alignements between text, lines, tables), domain specific knowledge and, of course, content.

• CurVe 1.6 is released - March 10
  CurVe is a LaTeX2e class for making Curricula Vitae.

• Publication « Generic Algorithmic Blocks Dedicated to Image Processing » accepted to ECOOP-Ph.D Workshop 2004 - March 10
  This paper deals with the implementation of algorithms in the specific domain of image processing. Although many image processing libraries are available, they generally lack genericity and flexibility. Many image processing algorithms can be expressed as compositions of elementary algorithmic operations referred to as blocks. Implementing these compositions is achieved using generic programming. Our solution is compared to previous ones and we demonstrate it on a class image processing algorithms.

• Fifth Stratego Users Days - March 1
  A part of the Transformers's team went to Utrecht at the beginning of march for the Fifth Stratego Users Days. LRDE student Robert Anisko^? explained our work during his talk. This event contained a special day dedicated to CodeBoost providing us with an opportunity for more in-depth involvement.

• Vampire 0.2 is released - February 19
  Vampire is a remote package testing tool written in Python. It takes an Autotools generated tarball, uploads it on several machines, configures it, runs a check sequence (usually make distcheck) and returns the results. It is designed to be flexible enough to run checks on different systems and environments.

• Initiation Stratego Day - February 11
  
• The Tiger 2006 Project has started - January 12
  The TigerCompiler consists in the implementation of a Tiger compiler in C++. The Tiger language is described by Andrew Appel in his "Modern Compiler Implementation" books, and constitutes an important project in the EPITA curriculum.

2003

• Vaucanson 0.4.2 is released - December 25
  
• Publication « A Static C++ Object-Oriented Programming (SCOOP) Paradigm Mixing Benefits of Traditional OOP and Generic Programming » (MPOOL 2003) - October 29
  
• Vaucanson 0.4 is released - October 29
• Olena 0.9 is released - August 08
• Publication «  Program Templates: Expression Templates applied to program compilation » (DPCOOL 2003) - July 31
• Vaucanson 0.3 is released - July 11
• Mical 0.1 is released - July 10
• Vaucanson 0.2 is released - July 02
• SdfOption 0.1 is released - June 21
• BoxedSdf 0.1^? is released - June 18
• CSI Seminar Vaucanson - June 04
• CSI Seminar Various subjects - May 28
• Publication « On orthogonal specialization in Main.C++: Dealing with efficiency and algebraic abstraction in Vaucanson » (POOSC 2003) - May 26
• CSI Seminar Software Engineering - May 21
• CSI Seminar Image Processing - May 14
• Olena 0.8 is released - May 13
• Publication « Introducing Vaucanson » (CIAA 2003) - May 05
• Publication « Reconnaissance rapide de structures curvilignes par ligne de partage des eaux et champs de Markov » (ICISP 2003) - May 04
• LRDE Seminar VHDL: Un Langage Matériel by Tristan Gingold - April 30
• Publication « Document Type Recognition Using Evidence Theory » (GREC 2003) - April 29

• - Publication « Multi-band segmentation using morphological clustering and fusion application to color image segmentation » (ICIP 2003) - April 10

• LRDE Seminar Conception et réalisation d'un intergiciel schizophrène pour la mise en oeuvre de systèmes répartis interopérables, by Thomas Quinot - March 19
• Publication « Segmentation of Curvilinear Objects using a Watershed-Based Curve Adjacency Graph and MRF » (IbPRIA 2003) - March 10
• AkimDemaille replaces ThierryGeraud at the head of the lab - March 03
• Vaucanson Day: presentation and demonstration of the Vaucanson project - February 21
• Olena Day: presentation and demonstration of the Olena project - February 19
• Olena 0.7 is released - February 10
• Publication « Fast Road Network Extraction in Satellite Images using Mathematical Morphology and MRF » (NSIP 2003) - January 31
• Olena 0.6 is released - January 15

2002

• CSI Seminar Software Engineering and Olena - October 30
• CSI Seminar Software Engineering and Image Processing - September 25
• CSI Seminar Software Engineering - September 18
• Olena 0.5 is released - July 25
• CSI Seminar Software Tools and Programming Paradigms - June 26
• CSI Seminar Software Engineering - June 19
• CSI Seminar Image Processing - May 16
• CSI Seminar Software Engineering and Image Processing - May 15
• CSI Seminar Les exceptions, by Alexandre Duret-Lutz - May 14
• Olena 0.4.1 is released - April 25
• Olena 0.3 is released - January 14

to top