Publications

2019

• State-of-the-art on Current Formalisms used in Cyber-Physical Systems Development
  
  • Klikovits Stefan
  • Al-Ali Rima
  • Amrani Moussa
  • Barisic Ankica
  • Barros Fernando
  • Blouin Dominique
  • Borde Etienne
  • Buchs Didier
  • Giese Holger
  • Goulão Miguel
  • Iacono Mauro
  • Leon Florin
  • Navarro Eva
  • Pelliccione Patrizio
  • Vanherpen Ken
  , 2019. (10.5281/zenodo.2533455)
  DOI : 10.5281/zenodo.2533455
• Strongly regular graphs from weakly regular plateaued functions
  
  • Mesnager Sihem
  • Sinak A.
  , 2019.
• 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.
• 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
• 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
• 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
• 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.
• Game Theory for Networking Applications
  
  • Song Ju Bin
  • Li Husheng
  • Coupechoux Marceau
  , 2019, pp.229.
• 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.
• 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
• Further study of 2-to-1 mappings over $F_2^n$
  
  • Mesnager Sihem
  • Li K.
  • Qu L.
  , 2019.
• On σ-LCD codes
  
  • Mesnager Sihem
  • Carlet C.
  • Tang C.
  • Qi Y.
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019.
• 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
• Etude exploratoire du réseau nerveux pelvien par tractographie
  
  • Muller C.
  • Delmonte A.
  • Meignan P.
  • Peyrot Q.
  • Virzi A.
  • Berteloot L.
  • Grevent D.
  • Blanc T.
  • Gori P.
  • Boddaert N.
  • Bloch Isabelle
  • Sarnacki S.
  , 2019.
• Structural information and (hyper)graph matching for MRI piglet brain extraction
  
  • Durandeau Alexandre
  • Fasquel Jean-Baptiste
  • Bloch Isabelle
  • Mazerand Edouard
  • Menei Philippe
  • Montero-Menei Claudia
  • Dinomais Mickaël
  , 2019, pp.76-81. In the context of the study of the maturation process of the infant brain, this paper focuses on postnatal piglet brain, whose structure is similar to the one of an infant. Due to the small size of the piglet brain and the abundance of surrounding fat and muscles, the automatic brain extraction using correctely initialized deformable models is tedious, and the standard approach used for human brain does not apply. The paper proposes an original brain extraction method based on a deformable model, whose initialization is guided by a priori known relationships between some anatomical structures of the head. This concerns a structural model related to a priori known inclusion and photometric relationships between eyes, nose and other internal head entities (fat and muscles). This a priori structural information also involves the relative position of both eyes and nose, assumed to be an anatomical invariant similar to a triangle. Using this structural model, our proposal detects both eyes and nose, from which one deduces the brain center, for finally initializing deformable models. Anatomical structures are retrieved by matching observed relationships with those embedded in the a priori structural model. This involves graph and hypergraph matching, where hypergraph matching concerns relative position of eyes and nose (ternary constraint related to these 3 entities). The method has been implemented and preliminary experiments have been performed on a set of 6 piglets, to evaluate the accuracy of the brain center localization, the one of the final brain extraction using deformable models. The brain center is correctly localized with a mean error of 1.7 mm, underlying the relevance of the approach. The mean similarity index has been measured to be of 0.85 (with a standard deviation of 0.04). More generally, this work illustrates the potential of considering high level a priori known relationships, related to anatomical invariants, managed using graph and hypergraph matching.
• A Simple and Exact Algorithm to Solve Linear Problems with l1 -based Regularizers
  
  • Tendero Yohann
  • Ciril Igor
  • Darbon Jérôme
  , 2019.
• Pruning neural networks thanks to morphological layers
  
  • Blusseau Samy
  • Zhang Yunxiang
  • Velasco-Forero Santiago
  • Bloch Isabelle
  • Angulo Jesus
  , 2019, pp.17. Motivated by recent advances in morphological neural networks, we further study the properties of morphological units when incorporated in layers of conventional neural networks. We confirm and extend the observation that a Max-plus layer can be used to select relevant filters and reduce redundancy in its previous layer, without incurring performance loss. We present several experiments in image processing, showing that this filter selection property seems efficient and robust. We also point out the close connection between Maxout networks and our pruned Max-plus networks. The code related to our experiments is available online (https://github.com/yunxiangzhang).
• Logical Dual Concepts based on Mathematical Morphology in Stratified Institutions
  
  • Aiguier Marc
  • Bloch Isabelle
  Journal of Applied Non-Classical Logics, Taylor & Francis, 2019, 29 (4), pp.392-429. Several logical operators are defined as dual pairs, in different types of logics. Such dual pairs of operators also occur in other algebraic theories, such as mathematical morphology. Based on this observation, this paper proposes to define, at the abstract level of institutions, a pair of abstract dual and logical operators as morphological erosion and dilation. Standard quantifiers and modalities are then derived from these two abstract logical operators. These operators are studied both on sets of states and sets of models. To cope with the lack of explicit set of states in institutions, the proposed abstract logical dual operators are defined in an extension of institutions, the stratified institutions, which take into account the notion of open sentences, whose satisfaction is parametrised by sets of states. A hint on the potential interest of the proposed framework for spatial reasoning is also provided. (10.1080/11663081.2019.1668678)
  DOI : 10.1080/11663081.2019.1668678
• Robust Segmentation of Corpus Callosum in Multi-Scanner Pediatric T1-w MRI using Transfer Learning
  
  • La Barbera Giammarco
  • Bloch Isabelle
  • Barraza Gonzalo
  • Adamsbaum Catherine
  • Gori Pietro
  , 2019.
• Relay Placement for Reliable Ranging in Cooperative mm-Wave Systems
  
  • Ghatak Gourab
  • de Domenico Antonio
  • Coupechoux Marceau
  IEEE Wireless Communications Letters, IEEE comsoc, 2019, 8 (5), pp.1324-1327. We study millimeter wave based ranging of randomly located terminal nodes (TN) using fixed relay nodes (RN) deployed around a central node (CN). This setting may correspond to a disaster-relief scenario where the rescuers require positioning information in the absence of a global positioning system (GPS). We derive the Bayesian Cramer-Rao lower bound (BCRLB) for the TNs range estimation from the CN as well as from the RNs in this network using a stochastic geometry framework. Contrary to existing studies, we take the effect of link-blockages into account while deriving the BCRLB, and thereby present a more accurate bound on the ranging error. For the special case of no blockages, we formulate a convex problem for obtaining the optimal relay positions. Our results provide the operator a guideline for initial deployment planning, in terms of number and location of RNs to be deployed in order to achieve an accurate ranging. (10.1109/LWC.2019.2915824)
  DOI : 10.1109/LWC.2019.2915824
• Some Results About a Conjecture on Identifying Codes in Complete Suns
  
  • Hudry Olivier
  • Lobstein Antoine
  International Transactions in Operational Research, Wiley, 2019, 26 (2), pp.732-746. Consider a graph G = (V, E) and, for every vertex v ∈ V , denote by B(v) the set {v} ∪ {u : uv ∈ E}. A subset C ⊆ V is an identifying code if the sets B(v) ∩ C, v ∈ V , are all nonempty and distinct. It is a locating-dominating code if the sets B(v) ∩ C, v ∈ V \ C, are all nonempty and distinct. Let S n be the graph whose vertex set can be partitioned into two sets U n and V n , where U n = {u 1 , u 2 ,. .. , u n } induces a clique, and V n = {v 1,2 , v 2,3 ,. .. , v n−1,n , v n,1 } induces an independent set, with edges v i,i+1 u i and v i,i+1 u i+1 , 1 ≤ i ≤ n; computations are carried modulo n. This graph is called a complete sun. We prove the conjecture, stated by Argiroffo, Bianchi and Wagler in 2014, that the smallest identifying code in S n has size equal to n. We also characterize and count all the identifying codes with size n in S n. Finally, we determine the sizes of the smallest locating-dominating codes in S n . (10.1111/itor.12320)
  DOI : 10.1111/itor.12320
• Ratio-Based Multitemporal SAR Images Denoising: RABASAR
  
  • Zhao Weiying
  • Deledalle Charles-Alban
  • Denis Loïc
  • Maître Henri
  • Nicolas Jean-Marie
  • Tupin Florence
  IEEE Transactions on Geoscience and Remote Sensing, Institute of Electrical and Electronics Engineers, 2019. In this paper, we propose a fast and efficient multitemporal despeckling method. The key idea of the proposed approach is the use of the ratio image, provided by the ratio between an image and the temporal mean of the stack. This ratio image is easier to denoise than a single image thanks to its improved stationarity. Besides, temporally stable thin structures are well preserved thanks to the multi-temporal mean. The proposed approach can be divided into three steps: 1) estimation of a “super-image” by temporal averaging and possibly spatial denoising; 2) denoising of the ratio between the noisy image of interest and the “super-image”; 3) computation of the denoised image by re-multiplying the denoised ratio by the “super-image”. Because of the improved spatial stationarity of the ratio images, denoising these ratio images with a speckle-reduction method is more effective than denoising images from the original multi-temporal stack. The amount of data that is jointly processed is also reduced compared to other methods through the use of the “super-image” that sums up the temporal stack. The comparison with several state-of-the-art reference methods shows better results numerically (peak signal-noise-ratio, structure similarity index) as well as visually on simulated and SAR time series. The proposed ratio-based denoising framework successfully extends single-image SAR denoising methods to time series by exploiting the persistence of many geometrical structures. (10.1109/TGRS.2018.2885683)
  DOI : 10.1109/TGRS.2018.2885683
• Minimal Linear codes with few weights and their secret sharing.
  
  • Mesnager Sihem
  • Sinak A.
  • Yayla O.
  International Journal of Information Security Science, 2019.
• On the nonlinearity of Boolean functions with restricted input.
  
  • Mesnager Sihem
  • Zhou Z.
  • Ding C.
  Journal of Cryptography and Communications- Discrete Structures, Boolean Functions, and Sequences, 2019.