User:Nboutry

Contact

• Email: nicolas.boutry-at-lrde.epita.fr
• Tel: +33 6 76 80 10 53

Short bio

Graduated from ESIEE Paris in 2002 in the field of Signal Processing and Telecommunications, Nicolas Boutry has spent over four years in Switzerland at EPFL where he did research on MR images of human brains and on image compression. He joined then a company to work on pattern recognition. He started working with us as a PhD-student in 2014 on the Olena project.

My curriculum vitae is available HERE.

Current status

PhD student:

• Subject: Morphological tree of shapes in tridimensional image processing: topological and algorithmic issues
• Ecole doctorale MSTIC: Université Paris-Est, LIGM, A3SI, ESIEE
• Advisors: Thierry Géraud (LRDE), Laurent Najman (MSTIC)

Teaching:

• Algorithmics (TD / TP for 3rd-year students at EPITA)
• Regular Language Theory (TD / TP for 3rd-year students at EPITA)

Publications

Nicolas Boutry, Thierry Geraud, Laurent Najman, How to Make nD Images Well-Composed Without Interpolation, ICIP 2015 PDF (dedicated page: Publications/boutry.15.icip)

Nicolas Boutry, Thierry Geraud, Laurent Najman, How to Make nD Functions Digitally Well-Composed in a Self-Dual Way, ISMM 2015 PDF (dedicated page: Publications/boutry.15.ismm)

Nicolas Boutry, Thierry Geraud, Laurent Najman, Une généralisation du bien-composé à la dimension n, GTGéoDis 2014 PDF, Poster (dedicated page: Publications/boutry.14.geodis)

Nicolas Boutry, Thierry Geraud, Laurent Najman, On Making nD Images Well-Composed by a Self-Dual Local Interpolation, DGCI 2014 PDF (dedicated page: Publications/boutry.14.dgci)

Table of contents of the PhD report: A Study of Well-composedness in n-D

Lexicon:

• AWCness = Alexandrov Well-Composedness
  
• DWCness = Digital Well-Composedness
  
• CWCness = Continuous Well-Composedness
  

1 Introduction

2 State-of-the-art
2.1 Mathematical basics
2.2 Well-composed sets and images
2.3 Topological repairing and well-composed interpolations
2.4 Topics related to well-composedness

3 Generalization of well-composedness to dimension n
3.1 The different flavours of n-D WCnesses in brief
3.2 Mathematical basics
3.3 n-D EWCness and n-D DWCness
3.4 Relations between AWCness, DWCness, and CWCness

4 Digitally well-composed Interpolations in n-D
4.1 Self-dual Local Interpolations
4.2 A New Self-dual n-D DWC Interpolation

5 Some consequences and applications
5.1 Pure self-duality
5.2 A new representation of digital images
5.3 n-D Marching-Cubes-like Algorithms
5.4 Tree of shapes of the DWC morphological Laplacian

6 Perspectives
6.1 On the equivalence between AWCness and CWCness on cubical grids
6.2 Preservation of digital well-composedness
6.3 A graph-based characterization of AWCness
6.4 n-D segmentation and parameterization

7 Conclusion

Appendices
A Proof that min and max interpolations are DWC
B Topological repairing in n-D
C Axiomatic digital topology
D Towards the proof of AWCness and DWCness equivalence
E Well-composed interpolations on polyhedral complexes

Detailed ToC of the PhD report

available soon...