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
• On σ-LCD codes
  
  • Mesnager Sihem
  • Carlet C.
  • Tang C.
  • Qi Y.
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019.
• Game Theory for Networking Applications
  
  • Song Ju Bin
  • Li Husheng
  • Coupechoux Marceau
  , 2019, pp.229.
• Model-Based Programming for Multi-Processor Platforms with TTool/DIPLODOCUS and OMC
  
  • Enrici Andrea
  • Lallet Julien
  • Pacalet Renaud
  • Apvrille Ludovic
  • Desnos Karol
  • Latif Imran
  , 2019, pp.56_81. Abstract. The complexity of today's multi-processor architectures raises the need to increase the level of abstraction of software development paradigms above third-generation programming languages (e.g., C/C++). Code generation from model-based specifications is considered to be more efficient with respect to traditional paradigms where software is mainly developed from code. However, existing model-based approaches typically generate application software in SoC-programming languages (e.g., C/C++, OpenCL, Verilog/VHDL) without considering the optimization of non-functional properties (e.g., memory footprint, scheduling). This paper proposes a novel approach and tools where system-level models are compiled into standard C code while optimizing the systems memory footprint. We show the effectiveness of our approach with the model-based programming of UML/SysML diagrams for a 5G decoder. From the compiled C code, we generate both a software implementation for a Digital Signal Processor platform and a hardware-software implementation for a platform based on hardware Intellectual Property (IP) blocks. Overall, our optimizations achieve a memory footprint reduction of 80.07% in the first case and 88.93% in the second case. (10.1007/978-3-030-11030-7_4)
  DOI : 10.1007/978-3-030-11030-7_4
• Mathematical Morphology on a Few Discrete Structures
  
  • Bloch Isabelle
  , 2019.
• From Pairwise Comparisons and Rating to a Unified Quality Scale
  
  • Perez-Ortiz Maria
  • Mikhailiuk Aliaksei
  • Zerman Emin
  • Hulusic Vedad
  • Valenzise Giuseppe
  • Mantiuk Rafal
  IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2019, 29, pp.1139-1151. The goal of psychometric scaling is the quantifi-cation of perceptual experiences, understanding the relationship between an external stimulus, the internal representation and the response. In this paper, we propose a probabilistic framework to fuse the outcome of different psychophysical experimental protocols , namely rating and pairwise comparisons experiments. Such a method can be used for merging existing datasets of subjective nature and for experiments in which both measurements are collected. We analyze and compare the outcomes of both types of experimental protocols in terms of time and accuracy in a set of simulations and experiments with benchmark and real-world image quality assessment datasets, showing the necessity of scaling and the advantages of each protocol and mixing. Although most of our examples focus on image quality assessment, our findings generalize to any other subjective quality-of-experience task. (10.1109/TIP.2019.2936103)
  DOI : 10.1109/TIP.2019.2936103
• Construction of Efficient Codes for High-Order Direct Sum Masking
  
  • Mesnager Sihem
  • Carlet Claude
  • Guilley Sylvain
  • Guneri Cem
  • Özbudak Ferruh
  , 2019, 27, pp.108-128.
• Improving Deep Learning Parkinson’s Disease Detection Through Data Augmentation Training
  
  • Taleb Catherine
  • Likforman-Sulem Laurence
  • Mokbel Chafic
  , 2020, 1144, pp.79-93. Deep learning has been successfully applied to different classification applications where large data are available. However, the lack of data makes it more difficult to predict Parkinson’s disease (PD) with the deep models, which requires enough number of training data. Online handwriting dynamic signals can provide more detailed and complex information for PD detection task. In our previous work [1], two different deep models were studied for time series classification; the convolutional neural network (CNN) and the convolutional neural network- bidirectional long short term memory network (CNN-BLSTM). Different approaches were applied to encode pen-based signals into images for the CNN model while the raw time series are used directly with the CNN-BLSTM model. We have showed that both CNN model with spectrogram images as input and CNN-BLSTM model, improve the performance of time series classification applied for early PD stage detection. However, these approaches did not outperform classical support vector machine (SVM) classification applied on pre-engineered features. In this paper we investigate transfer learning and data augmentation approaches in order to train these models for PD detection on large-scale data. Various data augmentation methods for pen-based signals are proposed. Our experimental results show that the CNN-BLSTM model used with the combination of Jittering and Synthetic data augmentation methods provides promising results in the context of early PD detection, with accuracy reaching 97.62%. We have illustrated that deep architecture can surpass the models trained on pre-engineered features even though the available data is small. (10.1007/978-3-030-37548-5_7)
  DOI : 10.1007/978-3-030-37548-5_7
• Reconstruction 3D en IRM du pelvis de l'enfant : segmentation des structures osseuses par intelligence artificielle
  
  • Peyrot Q.
  • Muller C.
  • Virzi A.
  • Delmonte A.
  • Meignan P.
  • Berteloot L.
  • Grevent D.
  • Blanc T.
  • Gori P.
  • Boddaert N.
  • Bloch Isabelle
  • Sarnacki S.
  , 2019.
• Diversity and Struggles in Critical Performativity. The Case of French Community-Supported Agriculture
  
  • Ouahab Alban
  • Maclouf Etienne
  M@n@gement, AIMS (Association internationale de management stratégique), 2019, 22 (4), pp.537-558. This article contributes to the debates about critical performativity (CP), a research program aimed at reorienting critical management studies toward affirmative and transformative research. While some scholars explain how CP can be engineered to create alternative organizations, others remain skeptical, exposing its potential for failure. We examine alternative organizations with a particular focus on the struggles in which they are entangled, such as competition with other performative programs and normative agendas. These struggles cause permanent reconfigurations to agencements and make the future effects of performative engines uncertain. To understand these reconfigurations, we look at the transformation of already established alternative organizations. We conducted a case study on French Community-Supported Agriculture (CSA), which is illustrative of CP "in the field," looking at how the CSA network can engineer local organizations. We show how the struggles between competing performative programs produce diversity, in time and space, of organizational settings and goals within the French CSA movement. Our contributions are twofold. Firstly, because of the struggles in which it is entangled, a performative engine can create diverse and potentially competing normative content rather than a single stable agenda. Secondly, deviations from the initial normative content are not neutral and may undermine the subversive potential of those agencements. Ultimately, we call for a research agenda which would look beyond the implementation of subversive practices to question the way subversive agencements develop, and which would acknowledge that CP is also about struggles between competing engines. (10.3917/mana.224.0537)
  DOI : 10.3917/mana.224.0537
• Further study of 2-to-1 mappings over $F_2^n$
  
  • Mesnager Sihem
  • Li K.
  • Qu L.
  , 2019.
• Mixed Delay Constraints on a Fading C-RAN Uplink
  
  • Nikbakht Homa
  • Wigger Michèle
  • Hachem Walid
  • Shamai Shitz Shlomo
  , 2019. A cloud radio access network (C-RAN) is considered where the first hop from the user equipments (UEs) to the basestations (BSs) is modeled by the fading Wyner soft-handoff model. The focus is on mixed-delay constraints where a set of messages (so called "slow" messages) are jointly decoded in the cloud unit (CU), whereas the remaining messages (called "fast" messages) have to be decoded immediately at the BSs. This paper presents inner and outer bounds on the capacity region for such a setup. Moreover, the multiplexing gain region is characterized exactly. The presented results show that for small fronthaul capacity it is beneficial to send both "fast" and "slow" messages. However, when the rate of "fast" messages is already large, then increasing it further, deteriorates the sum-rate of the system. In this regime, the stringent decoding delay on the "fast" messages penalizes the overall performance. Our results indicate that this penalty is larger at moderate SNR than at high SNR and it is also larger for random time-varying fading coefficients than for static ones. (10.1109/itw44776.2019.8989156)
  DOI : 10.1109/itw44776.2019.8989156
• From Structuring Elements to Structuring Neighborhood Systems
  
  • Goy Alexandre
  • Aiguier Marc
  • Bloch Isabelle
  , 2019, LNCS 11564, pp.16-28. In the context of mathematical morphology based on structuring elements to define erosion and dilation, this paper generalizes the notion of a structuring element to a new setting called structuring neighborhood systems. While a structuring element is often defined as a subset of the space, a structuring neighborhood is a subset of the subsets of the space. This yields an extended definition of erosion; dilation can be obtained as well by a duality principle. With respect to the classical framework, this extension is sound in many ways. It is also strictly more expressive, for any structuring element can be represented as a structuring neighborhood but the converse is not true. A direct application of this framework is to generalize modal morpho-logic to a topological setting. (10.1007/978-3-030-20867-7_2)
  DOI : 10.1007/978-3-030-20867-7_2