Annonce

annonce@lrde.epita.fr

566 discussions

Publication : On making nD images well-composed by a self-dual local interpolation (DGCI'14)

by nboutry

We are pleased to announce that the following paper has been accepted in the 18th international conference on Discrete Geometry for Computer Imagery (DGCI'14). On making nD images well-composed by a self-dual local interpolation Nicolas Boutry Thierry Géraud Laurent Najman EPITA Research and Development Laboratory (LRDE) nicolas.boutry(a)lrde.epita.fr Natural and synthetic discrete images are generally not well-composed, leading to many topological issues: connectivities in binary images are not equivalent, the Jordan Separation theorem is not true anymore, and so on. Conversely, making images well-composed solves those problems and then gives access to many powerful tools already known in mathematical morphology as the Tree of Shapes which is of our principal interest. In this paper, we present two main results: a characterization of 3D well-composed gray-valued images; and a counter-example showing that no local self-dual interpolation with a classical set of properties makes well-composed images with one subdivision in 3D, as soon as we choose the mean operator to interpolate in 1D. Then, we briefly discuss various constraints that could be interesting to change to make the problem solvable in nD.

11 years, 1 month

Publication: A First Parallel Algorithm to Compute the Morphological Tree of Shapes of nD Images (ICIP'14)

by Edwin Carlinet

We are pleased to announce that the following paper has been accepted in the 21st International Conference on Image Processing (ICIP'14). A First Parallel Algorithm to Compute the Morphological Tree of Shapes of nD Images Sebastien Crozet Thierry Géraud EPITA Research and Development Laboratory (LRDE) sebastien.crozet(a)lrde.epita.fr The tree of shapes is a self-dual tree-based image representation belonging to the field of mathematical morphology. This representation is highly interesting since it is invariant to contrast changes and inversion, and allows for numerous and powerful applications. A new algorithm to compute the tree of shapes has been recently presented: it has a quasi-linear complexity; it is the only known algorithm that is also effective for nD images with n > 2; yet it is sequential. With the increasing size of data to process, the need of a parallel algorithm to compute that tree is of prime importance; in this paper, we present such an algorithm. We also give some benchmarks that show that the parallel version is computationally effective. As a consequence, that makes possible to process 3D images with some powerful self-dual morphological tools. -- Edwin Carlinet Doctorant à l'Université Paris-Est / EPITA

11 years, 1 month

Publication: A precise skew estimation algorithm for document images using KNN clustering and Fourier transform (ICIP'14)

by Edwin Carlinet

We are pleased to announce that the following paper has been accepted in the 21st International Conference on Image Processing (ICIP'14). A precise skew estimation algorithm for document images using KNN clustering and Fourier transform Jonathan Fabrizio EPITA Research and Development Laboratory (LRDE) jonathan.fabrizio(a)lrde.epita.fr In this article, we propose a simple and precise skew estimation algorithm for binarized document images. The estimation is performed in the frequency domain. To get a precise result, the Fourier transform is not applied to the document itself but the document is preprocessed: all regions of the document are clustered using a KNN and contours of grouped regions are smoothed using the convex hull to form more regular shapes, with better orientation. No assumption has been made concerning the nature or the content of the document. This method has been shown to be very accurate and was ranked first at the DISEC’13 contest, during the ICDAR competitions. -- Edwin Carlinet Doctorant à l'Université Paris-Est / EPITA

11 years, 1 month

Publication: Meaningful disjoint level lines selection (ICIP'14)

by Edwin Carlinet

We are pleased to announce that the following paper has been accepted in the 21st International Conference on Image Processing (ICIP'14). Meaningful disjoint level lines selection Yongshao Xu¹ Edwin Carlinet¹² Thierry Géraud¹² Laurent Najman² ¹EPITA Research and ²Laboratoire d'Informatique Development Laboratory (LRDE) Gaspard-Monge (LIGM) yongshao.xu(a)lrde.epita.fr Many methods based on the morphological notion of shapes (i.e., connected components of level sets) have been proved to be very efficient in shape recognition and shape analysis. The inclusion relationship of the level lines (boundaries of level sets) forms the tree of shapes, a tree-based image representation with a high potential. Numerous applications using this tree representation have been proposed. In this article, we propose an efficient algorithm that extracts a set of disjoint level lines in the image. These selected level lines yields a simplified image with clean contours, which also provides an intuitive idea about the main structure of the tree of shapes. Besides, we obtain a saliency map without transition problems around the contours by weighting level lines with their significance. Experimental results demonstrate the efficiency and usefulness of our method. -- Edwin Carlinet Doctorant à l'Université Paris-Est / EPITA

11 years, 1 month

Publication: Tree of Shapes of Multivariate Images: Leads and Traps (ICIP'14)

by Edwin Carlinet

We are pleased to announce that the following paper has been accepted in the 21st International Conference on Image Processing (ICIP'14). Tree of Shapes of Multivariate Images: Leads and Traps Edwin Carlinet¹² Thierry Géraud¹² ¹EPITA Research and ²Laboratoire d'Informatique Development Laboratory (LRDE) Gaspard-Monge (LIGM) edwin.carlinet(a)lrde.epita.fr The Tree of Shapes is a morphological tree that provides an high-level hierarchical representation of the image suitable for many image processing tasks. This structure has the desirable properties to be self-dual and contrast-invariant and describes the organization of the objects through level lines inclusion. Yet it is defined on gray-level while many images have multivariate data (color images, multispectral images...) where information are split across channels. In this paper, we propose some leads to extend the tree of shapes on colors with classical approaches based on total orders, more recent approaches based on graphs and also a new distance-based method. Eventually, we compare these approaches through denoising to highlight their strengths and weaknesses and show the strong potential of the new methods compared to classical ones. -- Edwin Carlinet Doctorant à l'Université Paris-Est / EPITA

11 years, 1 month

Publication: A Type System for Weighted Automata and Rational Expressions (CIAA'14)

by Akim Demaille

We are happy to announce that the following paper has been accepted in the 19th International Conference Implementation and Application of Automata (CIAA'14), to be held in Giessen, Germany, on July 30 -- August 2. A Type System for Weighted Automata and Rational Expressions Akim Demaille [1], Alexandre Duret-Lutz [1], Sylvain Lombardy [2], Luca Saiu [1,3] and Jacques Sakarovitch [3] 1 LRDE, EPITA; 2 LaBRI, Institut Polytechnique de Bordeaux; 3 LTCI, CNRS / Télécom-ParisTech https://www.lrde.epita.fr/wiki/Publications/demaille.14.ciaa We present a type system for automata and rational expressions, expressive enough to encompass weighted automata and transducers in a single coherent formalism. The system allows to express useful properties about the applicability of operations including binary heterogeneous functions over automata. We apply the type system to the design of the Vaucanson 2 platform, a library dedicated to the computation with finite weighted automata, in which genericity and high efficiency are obtained at the lowest level through the use of template metaprogramming, by letting the C++ template system play the role of a static type system for automata. Between such a low-level layer and the interactive high-level interface, the type system plays the crucial role of a mediator and allows for a cleanly-structured use of dynamic compilation.

11 years, 1 month

International Lisp Conference deadline extension (May 25)

by Didier Verna

ILC 2014 - International Lisp Conference "Lisp on the Move" August 14-17 2014, Université de Montréal, Montréal, Canada Sponsored by the Association of Lisp Users In cooperation with: ACM SIGPLAN http://www.international-lisp-conference.org Latest News: * The submission deadline has been extended to May 25. You have one more week to write a paper! Scope: Lisp is one of the greatest ideas from computer science and a major influence for almost all programming languages and for all sufficiently complex software applications. The International Lisp Conference is a forum for the discussion of Lisp and, in particular, the design, implementation and application of any of the Lisp dialects. We encourage everyone interested in Lisp to participate. We invite high quality submissions in all areas involving Lisp dialects and any other languages in the Lisp family, including, but not limited to, ACL2, AutoLisp, Clojure, Common Lisp, ECMAScript, Dylan, Emacs Lisp, ISLISP, Racket, Scheme, SKILL, HOP etc. The conference proceedings will be published in the ACM Digital Library. This year's focus will be directed towards integrated solutions, including mobile computing. We especially invite submissions in the following areas: * Pervasive computing Interoperability Portability Implementation * challenges/tradeoffs for embedded/mobile platforms Language * support for mobile toolkits and frameworks Language support for * distribution Language support for reliability, availability, and * serviceability Mobile IDEs Mobile applications Contributions are also welcome in other areas, including but not limited to: * Language design and implementation Language integration, * inter-operation and deployment Applications (especially * commercial) Reflection, meta-object protocols, meta-programming * Domain-specific languages Programming paradigms and environments * Efficient parallel and concurrent computation Language support for * managing both manual and automatic GC Theorem proving Scientific * computing Data mining Semantic web Technical Programme: Original submissions in all areas related to the conference themes are invited for the following categories: Papers: Technical papers of up to 10 pages that describe original results. Demonstrations: Abstracts of up to 2 pages for demonstrations of tools, libraries and applications. Workshops: Abstracts of up to 2 pages for groups of people who intend to work on a focused topic for half a day. Tutorials: Abstracts of up to 2 pages for in-depth presentations about topics of special interest for 1 to 2 hours. Panel discussions: Abstracts of up to 2 pages for discussions about current themes. Panel discussion proposals must mention panel member who are willing to partake in a discussion. The conference will also provide slots for lightning talks, to be registered on-site every day. For inquiries about any other kind of participation (commercial exhibits, advertising, prizes, book signing etc.), please see the contacts below. Important Dates: - May 25, 2014: Submission deadline *** EXTENDED *** - June 09, 2014: Notification of acceptance - June 29, 2014: Final Papers due - August 14, 2014: Conference All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates and http://www.acm.org/about/class/1998. Submissions should be uploaded to Easy Chair, at the following address: https://www.easychair.org/conferences/?conf=ilc14 Organizing Committee: General Chair: Marc Feeley (Université de Montréal, Montréal, Canada) Programme Chair: Didier Verna (EPITA Research lab, Paris, France) Local chair: Marc Feeley (Université de Montréal, Montréal, Canada) Programme Committee: Charlotte Herzeel, IMEC, ExaScience Life Lab, Belgium Damir Cavar, Eastern Michigan University, USA Dave Herman, Mozilla Research, USA Greg Pfeil, Clozure Associates, USA Irène Anne Durand, LaBRI University of Bordeaux, France Jim Newton, Cadence Design Systems, France Kuroda Hisao, Mathematical Systems Inc., Japan Matthew Might, University of Utah, USA Nicolas Neuss, Friedrich Alexander Universitat, Germany Ralf Möller, TUHH, Germany Sam Tobin-Hochstadt, Northeastern University, USA William Byrd, University of Utah, USA Contacts: * General Questions: ilc14-organizing-committee at alu.org * Programme Committee: ilc14 at easychair.org For more information, see http://www.international-lisp-conference.org -- Resistance is futile. You will be jazzimilated. Lisp, Jazz, Aïkido: http://www.didierverna.info

11 years, 1 month

[CfP] International Lisp Conference 2014, Aug. 14-17, Montreal

by Didier Verna

ILC 2014 - International Lisp Conference "Lisp on the Move" August 14-17 2014, Université de Montréal, Montréal, Canada Sponsored by the Association of Lisp Users In cooperation with: ACM SIGPLAN http://www.international-lisp-conference.org Scope: Lisp is one of the greatest ideas from computer science and a major influence for almost all programming languages and for all sufficiently complex software applications. The International Lisp Conference is a forum for the discussion of Lisp and, in particular, the design, implementation and application of any of the Lisp dialects. We encourage everyone interested in Lisp to participate. We invite high quality submissions in all areas involving Lisp dialects and any other languages in the Lisp family, including, but not limited to, ACL2, AutoLisp, Clojure, Common Lisp, ECMAScript, Dylan, Emacs Lisp, ISLISP, Racket, Scheme, SKILL, HOP etc. The conference proceedings will be published in the ACM Digital Library. This year's focus will be directed towards integrated solutions, including mobile computing. We especially invite submissions in the following areas: * Pervasive computing Interoperability Portability Implementation * challenges/tradeoffs for embedded/mobile platforms Language * support for mobile toolkits and frameworks Language support for * distribution Language support for reliability, availability, and * serviceability Mobile IDEs Mobile applications Contributions are also welcome in other areas, including but not limited to: * Language design and implementation Language integration, * inter-operation and deployment Applications (especially * commercial) Reflection, meta-object protocols, meta-programming * Domain-specific languages Programming paradigms and environments * Efficient parallel and concurrent computation Language support for * managing both manual and automatic GC Theorem proving Scientific * computing Data mining Semantic web Technical Programme: Original submissions in all areas related to the conference themes are invited for the following categories: Papers: Technical papers of up to 10 pages that describe original results. Demonstrations: Abstracts of up to 2 pages for demonstrations of tools, libraries and applications. Workshops: Abstracts of up to 2 pages for groups of people who intend to work on a focused topic for half a day. Tutorials: Abstracts of up to 2 pages for in-depth presentations about topics of special interest for 1 to 2 hours. Panel discussions: Abstracts of up to 2 pages for discussions about current themes. Panel discussion proposals must mention panel member who are willing to partake in a discussion. The conference will also provide slots for lightning talks, to be registered on-site every day. For inquiries about any other kind of participation (commercial exhibits, advertising, prizes, book signing etc.), please see the contacts below. Important Dates: - May 18, 2014: Submission deadline - June 09, 2014: Notification of acceptance - June 29, 2014: Final Papers due - August 14, 2014: Conference All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates and http://www.acm.org/about/class/1998. Submissions should be uploaded to Easy Chair, at the following address: https://www.easychair.org/conferences/?conf=ilc14 Organizing Committee: General Chair: Marc Feeley (Université de Montréal, Montréal, Canada) Programme Chair: Didier Verna (EPITA Research lab, Paris, France) Local chair: Marc Feeley (Université de Montréal, Montréal, Canada) Programme Committee: Charlotte Herzeel, IMEC, ExaScience Life Lab, Belgium Damir Cavar, Eastern Michigan University, USA Dave Herman, Mozilla Research, USA Greg Pfeil, Clozure Associates, USA Irène Anne Durand, LaBRI University of Bordeaux, France Jim Newton, Cadence Design Systems, France Kuroda Hisao, Mathematical Systems Inc., Japan Matthew Might, University of Utah, USA Nicolas Neuss, Friedrich Alexander Universitat, Germany Ralf Möller, TUHH, Germany Sam Tobin-Hochstadt, Northeastern University, USA William Byrd, University of Utah, USA Contacts: * General Questions: ilc14-organizing-committee at alu.org * Programme Committee: ilc14 at easychair.org For more information, see http://www.international-lisp-conference.org -- Resistance is futile. You will be jazzimilated. Lisp, Jazz, Aïkido: http://www.didierverna.info

11 years, 1 month

[Seminaire-LRDE] Mercredi 14 mai 2014 : Patrick Foubet, gérant et directeur technique de SERIANE

by Daniela Becker

Chers collègues, La prochaine session du séminaire Performance et Généricité du LRDE (Laboratoire de Recherche et Développement de l'EPITA) aura lieu le Mercredi 14 mai 2014 (11h--12h30), Salle L0, LRDE. Au programme: * 11h: Nife : du Forth pour l'embarqué -- Patrick Foubet, gérant et directeur technique de SERIANE http://www.seriane.fr/nife/ Nife est un langage de programmation ``Forth-like'': basé sur les principes du langage Forth, défini par Charles H. Moore dans les années 1960, il n'en reprend pas la totalité des fonctionnalités. Son ambition est d'offrir aux non-informaticiens qui ont besoin de faire des mesures, de contrôler des appareils distants, de surveiller des processus industriels, de manipuler des grandes collections de données, de faire des calculs, des filtrages, des statistiques, de pouvoir le réaliser facilement, dans un environnement Linux à faible coût. Simple, n'importe qui peut comprendre le fonctionnement de ce langage en quelques minutes, et le maîtriser totalement en quelques heures --- une semaine tout au plus. Il peut aussi être utilisé plus modestement comme une super calculatrice, pour faire ses comptes ou des calculs d'inversion de matrice. Le public concerné est donc très large. Une extension de Nife pour les systèmes embarqués lui permet de pouvoir être directement chargé sur de petites ou moyennes unités de calcul. Pour cela, on lui associe un noyau ``bootable'' et il devient Knife : Kernelable Nife. Dans ce cas, il devient un outil puissant pour coder dans des environnements où la mémoire est denrée rare, et où le côté ``langage dynamique'' va permettre de résoudre des problèmes là où d'autres langages vont échouer. -- Patrick Foubet commence l'informatique en 1978 dans une SSII parisienne. Il y développe des applications de gestion en Cobol et en Fortran sur des main-frames IBM (DOS-VSE) et Bull (Gcos), mais aussi en assembleur sur des mini-ordinateurs Computer Automation et Data General. En 1986 il passe au CNAM un DEA en IA. Il y enseigne ainsi qu'au CEPIA, centre de formation de l'INRIA. En 1988, il crée la société SERIANE et développe des applications industrielles : bancs de tests, acquisition de données, traitement du signal, systèmes temps-réel et embarqués. Ses clients comptent le CEA, Thomson, la RATP, Michelin, PSA, etc. C'est dans cette période qu'il crée son propre système temps-réel sous DPMI et son interface graphique SerView. En 1996, il passe au CNAM un second DEA en ``Construction de Programmes''. Il apprend la Méthode B avec Jean-Raymond Abrial. Entre 2003 et 2012, il est consultant auprès du CEA/DAM dans le cadre du projet Laser MégaJoule. Dans le même temps, il enseigne dans des écoles de la région parisienne: ECE, EFREI, EPSI, ESME-Sudria, ESIGETEL, INGESUP, INSIA, ITIN, etc. Il a libéré une partie du code qu'il a développé lors de ses travaux et qu'il a utilisé pour écrire son langage Nife. Pour plus de renseignements, consultez http://seminaire.lrde.epita.fr/. L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette information le plus largement possible. -- Akim Demaille Akim.Demaille(a)lrde.epita.fr _______________________________________________ Seminaire mailing list Seminaire(a)lrde.epita.fr https://lists.lrde.epita.fr/listinfo/seminaire

11 years, 2 months

publication: Mechanizing the Minimization of Deterministic Generalized Büchi Automata (FORTE'14)

by Alexandre Duret-Lutz

I am happy to announce that the following paper has been accepted in the Conference on Formal Techniques for Distributed Objects, Components and Systems (FORTE'14), to be held in Berlin on June 3–6. Mechanizing the Minimization of Deterministic Generalized Büchi Automata Souheib Baarir (1,2) and Alexandre Duret-Lutz (3) (1) Université Paris Ouest Nanterre la Défense (2) Sorbonne Universités, UPMC Univ. Paris 6, LIP6 (3) EPITA, LRDE https://www.lrde.epita.fr/wiki/Publications/baarir.14.forte Abstract: Deterministic Büchi automata (DBA) are useful to (probabilistic) model checking and synthesis. We survey techniques used to obtain and minimize DBAs for different classes of properties. We extend these techniques to support DBA that have generalized and transition-based acceptance (DTGBA) as they can be even smaller. Our minimization technique—a reduction to a SAT problem—synthesizes a DTGBA equivalent to the input DTGBA for any given number of states and number of acceptance sets (assuming such automaton exists). We present benchmarks using a framework that implements all these techniques. -- Alexandre Duret-Lutz

11 years, 3 months

← Newer
1
...
24
25
26
27
28
29
30
...
57
Older →

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Annonce