Publications

2019

• On approximating mathematical morphology operators via deep learning techniques
  
  • Velasco-Forero Santiago
  • Ponchon Bastien
  • Blusseau Samy
  • Angulo Jesus
  • Bloch Isabelle
  , 2019, pp.51. Mathematical Morphology (MM) is a well-established discipline whose aim is mainly to provide tools to characterise complex object via their shape/size features. This study addresses the problem of robust approximation of mathematical morphology (MM) operators by deep learning methods. We present two cases, (a) Asymmetric autoencoders for part-based approximations of classical MM in the sense of [1] and, (b) image-to-image translation networks [2] to produce robust MM operators in presence of noise.
• Trace codes over Z 4 , and Boolean functions
  
  • Shi Minjia
  • Liu Yan
  • Randriambololona Hugues
  • Sok Lin
  • Sole Patrick
  Designs, Codes and Cryptography, Springer Verlag, 2019, 87, pp.1447 - 1455. We construct trace codes over Z 4 based on Boolean functions and their support. The Lee weight distribution of these codes is studied by using the Walsh-Hadamard transform of the Boolean functions, and exponential character sums. We obtain few weights codes. In particular, bent and semi-bent functions give three-weight codes. (10.1007/s10623-018-0542-x)
  DOI : 10.1007/s10623-018-0542-x
• Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier
  
  • Chan T-H Hubert
  • Sozio Mauro
  • Sun Bintao
  , 2019. We design distributed algorithms to compute approximate solutions for several related graph optimization problems. All our algorithms have round complexity being logarithmic in the number of nodes of the underlying graph and in particular independent of the graph diameter. By using a primal-dual approach, we develop a 2(1 +)-approximation algorithm for computing the coreness values of the nodes in the underlying graph, as well as a 2(1 +)-approximation algorithm for the min-max edge orientation problem, where the goal is to orient the edges so as to minimize the maximum weighted in-degree. We provide lower bounds showing that the aforementioned algorithms are tight both in terms of the approximation guarantee and the round complexity. Finally, motivated by the fact that the densest subset problem has an inherent dependency on the diameter of the graph, we study a weaker version that does not suffer from the same limitation. (10.1109/IPDPS.2019.00044)
  DOI : 10.1109/IPDPS.2019.00044
• On Plateaued Functions, Linear Structures, and Permutation Polynomials
  
  • Mesnager Sihem
  • Kaytannci K.
  • Ozbudak Ferruh
  , 2019.
• On the Optimal Input of the Nondispersive Optical Fiber
  
  • Fahs Jihad
  • Tchamkerten Aslan
  • Yousefi Mansoor
  , 2019.
• Game Theory for Networks: 8th International EAI Conference, GameNets 2019, Proceedings
  
  • Avrachenkov Konstantin
  • Huang Longbo
  • Marden Jason R.
  • Coupechoux Marceau
  • Giovanidis Anastasios
  , 2019. This book constitutes the refereed proceedings of the 8th EAI International Conference on Game Theory for Networks, GameNets 2019, held in Paris, France, in April 2019. The 8 full and 3 short papers presented were carefully reviewed and selected from 17 submissions. They are organized in the following topical sections: Game Theory for Wireless Networks; Games for Economy and Resource Allocation; and Game Theory for Social Networks. (10.1007/978-3-030-16989-3)
  DOI : 10.1007/978-3-030-16989-3
• Fast computation of Tukey trimmed regions and median in dimension p > 2
  
  • Liu Xiaohui
  • Mosler Karl
  • Mozharovskyi Pavlo
  Journal of Computational and Graphical Statistics, Taylor & Francis, 2019. (10.1080/10618600.2018.1546595)
  DOI : 10.1080/10618600.2018.1546595
• Early Detection of User Engagement Breakdown in Spontaneous Human-Humanoid Interaction
  
  • Ben Youssef Atef
  • Clavel Chloé
  • Essid Slim
  IEEE Transactions on Affective Computing, Institute of Electrical and Electronics Engineers, 2019. This paper presents a supervised classification system for forecasting a potential user engagement breakdown in human-robot interaction. We define engagement breakdown as a failure to successfully complete a predefined interaction scenario, where the user leaves before the expected end. The goal is thus to detect as early as possible such a potential engagement breakdown during the interaction between a human and a humanoid robot. To this end, we exploit a dataset that we have collected in real-world conditions where a set of participants were left to spontaneously engage in an interaction with the robot. The dataset is labeled according to the presence/absence of engagement breakdown. This study investigates the use of a multimodal approach to this problem, where a set of non-verbal features is considered to characterize the users' behavior. The use of combined multimodal features is found to effectively improve the performance of the system. The optimal set of data streams useful for this task is the combination of the distance to the robot, gaze and head motion, as well as facial expressions and speech. We study the time extent over which a user's departure can be anticipated. We find that this ability to anticipate the departure depends on the window during which we observe the user behavior.
• Knowledge Harvesting: Achievements and Challenges
  
  • Weikum Gerhard
  • Hoffart Johannes
  • Suchanek Fabian
  , 2019. This article gives an overview on knowledge harvesting: automatically constructing large high-quality knowledge bases from Internet sources. The first part reviews key principles and best-practice methods. The second part points out open challenges for future research. (10.1007/978-3-319-91908-9_13)
  DOI : 10.1007/978-3-319-91908-9_13
• Les Versions de Bases de Données
  
  • Abdessalem Talel
  • Bauzer-Medeiros Claudia
  • Cellary Wojtech
  • Manouvrier Maud
  • Rukoz Marta
  • Zamfiroiu Michel
  , 2019, pp.44-48. In 1990, W. Cellary and G. Jomier proposed the Database Version (DBV) approach, which allows to manage multiversion databases - those in which several versions of a set of data items coexist. Ever since, its model, theory and algorithms have been adopted in a multitude of research initiatives and publications, and have been applied to a variety of applications, in particular those in which there is a need for keeping track of parallel or (spatio)-temporal evolution of states of the world. This article presents an overview of the DBV approach, and some of the associated research initiatives throughout three decades, pointing out new potential directions. It has been written in tribute to Geneviève Jomier, Prof. Emeritus of The Université Paris-Dauphine, who left us in March 2018.
• The joint weight enumerator of an LCD code and its dual
  
  • Alahmadi Adel
  • Deza Michel
  • Dutour-Sikirić Mathieu
  • Sole Patrick
  Discrete Applied Mathematics, Elsevier, 2019. A binary linear code is called LCD if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on the size of an LCD code of given length and minimum distance. In addition, we show that this polynomial is, in general, an invariant of a matrix group of dimension 4 and order 12. Also, we sketch a Gleason formula for this weight enumerator. (10.1016/j.dam.2018.10.032)
  DOI : 10.1016/j.dam.2018.10.032
• Information, The Hidden Side of Life
  
  • Gaucherel Cedric
  • Gouyon Pierre-Henri
  • Dessalles Jean-Louis
  , 2019, pp.212. This book explores the unity of life. It proposes that the concept of information is the inner essence of what we today call life. The importance of information for our species is obvious. Human beings are highly dependent on information, constantly exchanging with conspecifics. In a less apparent way, we are the product of genetic and epigenetic information which determines our development in a given environment from a fertilized egg to the adult stage. Even less apparent is that information plays a determining role in ecosystems. This observation may include the prebiotic systems in which life emerged. Our claim is that Nature processes information continuously. This means that even beyond living entities, we can see messages and decoding procedures. Nature can be said to send messages to its own future and then to decode them. Nature “talks” to itself! The systematic organization of messages suggests that, in some respects, we should even speak of the “languages” of Nature.
• Distributed Coordinated Transmission with Forward-Backward Training for 5G Radio Access
  
  • Tolli Antti
  • Ghauch Hadi
  • Kaleva Jarkko
  • Komulainen Petri
  • Bengtsson Mats
  • Skoglund Mikael
  • Honig Michael
  • Lahetkangas Eeva
  • Tiirola Esa
  • Pajukoski Kari
  IEEE Communications Magazine, Institute of Electrical and Electronics Engineers, 2019, 57 (1), pp.58-64. (10.1109/MCOM.2018.1700199)
  DOI : 10.1109/MCOM.2018.1700199
• Evaluation of cortical segmentation pipelines on clinical neonatal MRI data
  
  • Tor-Díez Carlos
  • Pham Chi-Hieu
  • Meunier Hélène
  • Faisan Sylvain
  • Bloch Isabelle
  • Bednarek Nathalie
  • Passat Nicolas
  • Rousseau François
  , 2019, pp.6553-6556. Magnetic Resonance Imaging (MRI) can provide 3D morphological information on brain structures. Such information is particularly relevant for carrying out morphometric brain analysis, especially in the newborn and in the case of prematurity. However, 3D neonatal MRI acquired in clinical environments are low-resolution, anisotropic images, making segmentation a challenging task. In this context, preprocessing techniques aim to increase the image resolution. Interpolation techniques were classically used; super-resolution (SR) techniques have recently appeared as an emerging alternative. In this paper, we evaluate the performance of different SR methods against the classical interpolation in the application of neonatal cortex segmentation. Additionally, we assess the robustness of different segmentation methods for each estimation of high resolution MRI input. Results are evaluated both qualitatively and quantitatively with neonatal clinical MRI. (10.1109/EMBC.2019.8856795)
  DOI : 10.1109/EMBC.2019.8856795
• Channel Impulsive Noise Mitigation for Linear Video Coding Schemes
  
  • Zheng Shuo
  • Cagnazzo Marco
  • Kieffer Michel
  IEEE Transactions on Circuits and Systems for Video Technology, Institute of Electrical and Electronics Engineers, 2019. (10.1109/TCSVT.2019.2937451)
  DOI : 10.1109/TCSVT.2019.2937451
• On q-ary plateaued functions over Fq and their explicit characterizations.
  
  • Mesnager Sihem
  • Özbudak Ferruh
  • Sinak A.
  • Cohen Gerard
  European Journal of Combinatorics, Elsevier, 2019.
• New characterization and parametrization of LCD codes.
  
  • Mesnager Sihem
  • Carlet C.
  • Tang C.
  • Qi Y.
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019.
• Several new classes of self-dual bent functions derived from involutions
  
  • Mesnager Sihem
  • Luo G.
  • Cao X.
  Journal of Cryptography and Communications- Discrete Structures, Boolean Functions, and Sequences, 2019.
• Tree Sampling Divergence: An Information-Theoretic Metric for Hierarchical Graph Clustering
  
  • Charpentier Bertrand
  • Bonald Thomas
  , 2019. We introduce the tree sampling divergence (TSD), an information-theoretic metric for assessing the quality of the hierarchical clustering of a graph. Any hierarchical clustering of a graph can be represented as a tree whose nodes correspond to clusters of the graph. The TSD is the Kullback-Leibler divergence between two probability distributions over the nodes of this tree: those induced respectively by sampling at random edges and node pairs of the graph. A fundamental property of the proposed metric is that it is interpretable in terms of graph reconstruction. Specifically, it quantifies the ability to reconstruct the graph from the tree in terms of information loss. In particular, the TSD is maximum when perfect reconstruction is feasible , i.e., when the graph has a complete hierarchical structure. Another key property of TSD is that it applies to any tree, not necessarily binary. In particular , the TSD can be used to compress a binary tree while minimizing the information loss in terms of graph reconstruction, so as to get a compact representation of the hierarchical structure of a graph. We illustrate the behavior of TSD compared to existing metrics on experiments based on both synthetic and real datasets.
• New Bernstein and Hoeffding type inequalities for regenerative Markov chains
  
  • Bertail Patrice
  • Ciołek Gabriela
  ALEA : Latin American Journal of Probability and Mathematical Statistics, Instituto Nacional de Matemática Pura e Aplicada (Rio de Janeiro, Brasil) [2006-....], 2019, 16 (1), pp.259. (10.30757/ALEA.v16-09)
  DOI : 10.30757/ALEA.v16-09
• Documenting Supermarkets: Contemporary Efforts To Support Intellectually Disturbing Organizations Food Coop (2016) -Tom Boothe Unplugged -Voices
  
  • Ouahab Alban
  M@n@gement, AIMS (Association internationale de management stratégique), 2019, 22, pp.671 - 702.
• Procédé de gestion de contenus multimédia et dispositif pour la mise en œuvre du procédé
  
  • Grégory Lucas
  • Le Feuvre J.
  • Toullec Eric
  , 2019.
• Procédé de gestion de contenus multimédia et dispositif pour la mise en œuvre du procédé
  
  • Lucas Gregory
  • Le Feuvre J.
  • Toullec Eric
  , 2019.
• On the Capacity of MIMO Optical Wireless Channels
  
  • Li Longguang
  • Moser Stefan M
  • Wang Ligong
  • Wigger Michèle
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019. This paper studies the capacity of a general multiple-input multiple-output (MIMO) free-space optical intensity channel under a per-input-antenna peak-power constraint and a total average-power constraint over all input antennas. The main focus is on the scenario with more transmit than receive antennas. In this scenario, different input vectors can yield identical distributions at the output, when they result in the same image vector under multiplication by the channel matrix. We first determine the most energy-efficient input vectors that attain each of these image vectors. Based on this, we derive an equivalent capacity expression in terms of the image vector, and establish new lower and upper bounds on the capacity of this channel. The bounds match when the signal-to-noise ratio (SNR) tends to infinity, establishing the high-SNR asymptotic capacity. We also characterize the low-SNR slope of the capacity of this channel. (10.1109/ITW.2018.8613496)
  DOI : 10.1109/ITW.2018.8613496
• Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes
  
  • Hudry Olivier
  • Lobstein Antoine
  Theoretical Computer Science, Elsevier, 2019, 767, pp.83-102. We investigate the complexity of four decision problems dealing with the uniqueness of a solution in a graph: “Uniqueness of an r-Locating–Dominating Code with bounded size” (U-LDCr), “Uniqueness of an Optimal r-Locating–Dominating Code” (U-OLDCr), “Uniqueness of an r-Identifying Code with bounded size” (U-IdCr), “Uniqueness of an Optimal r-Identifying Code” (U-OIdCr), for any fixed integer r ≥ 1 In particular, we describe a polynomial reduction from “Unique Satisfiability of a Boolean formula” (U-SAT) to U-OLDCr, and from U-SAT to U-OIdCr; for U-LDCr and U-IdCr, we can do even better and prove that their complexity is the same as that of U-SAT, up to polynomials. Consequently, all these problems are NP-hard, and U-LDCr and U-IdCr belong to the class DP. (10.1016/j.tcs.2018.09.034)
  DOI : 10.1016/j.tcs.2018.09.034