Publications

2017

• Parametric models of phase-amplitude coupling in neural time series
  
  • Dupré La Tour Tom
  • Grenier Yves
  • Gramfort Alexandre
  , 2017.
• Physical attacks
  
  • El Mrabet Nadia
  • Goubin Louis
  • Fournier Jacques Jean-Alain
  • Jauvart Damien
  • Guilley Sylvain
  • Moreau Martin
  • Rauzy Pablo
  • Rondepierre Franck
  , 2017.
• Yet another proof of the entropy power inequality
  
  • Rioul Olivier
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2017, 63 (6), pp.3595-3599. Yet another simple proof of the entropy power inequality is given, which avoids both the integration over a path of Gaussian perturbation and the use of Young’s inequality with sharp constant or Rényi entropies. The proof is based on a simple change of variables, is formally identical in one and several dimensions, and easily settles the equality case. (10.1109/TIT.2017.2676093)
  DOI : 10.1109/TIT.2017.2676093
• Quantitative analysis of normal and pathologic adrenal glands with 18F-FDOPA PET/CT
  
  • Moreau Aurélie
  • Giraudet Anne
  • Kryza David
  • Borson-Chazot Françoise
  • Bournaud Claire
  • Mognetti Thomas
  • Lifante Jean-Christophe
  • Combemale Patrick
  • Giammarile Francesco
  • Houzard Claire
  Nuclear Medicine Communications, Lippincott, Williams & Wilkins, 2017, 38 (9), pp.771-779. (10.1097/MNM.0000000000000708)
  DOI : 10.1097/MNM.0000000000000708
• Non-Local Patch-Based Image Inpainting
  
  • Newson Alasdair
  • Almansa Andrés
  • Gousseau Yann
  • Pérez Patrick
  Image Processing On Line, IPOL - Image Processing on Line, 2017, 7, pp.373-385. Image inpainting is the process of filling in missing regions in an image in a plausible way. In this contribution, we propose and describe an implementation of a patch-based image inpainting algorithm. The method is actually a two-dimensional version of our video inpainting algorithm proposed in [A. Newson et al., Video inpainting of complex scenes, SIAM Journal of Imaging Sciences, 7 (2014)]. The algorithm attempts to minimize a highly non-convex functional, first introducted by Wexler et al. in [Wexler et al., Space-time video completion, CCVPR (2004)]. The functional specifies that a good solution to the inpainting problem should be an image where each patch is very similar to its nearest neighbor in the unoccluded area. Iterations are performed in a multi-scale framework which yields globally coherent results. In this manner two of the major goals of image inpainting, the correct reconstruction of textures and structures, are addressed. We address a series of important practical issues which arise when using such an approach. In particular, we reduce execution times by using the PatchMatch [C. Barnes, PatchMatch: a randomized correspondence algorithm for structural image editing, ACM Transactions on Graphics, (2009)] algorithm for nearest neighbor searches, and we propose a modified patch distance which improves the comparison of textured patches. We address the crucial issue of initialization and the choice of the number of pyramid levels, two points which are rarely discussed in such approaches. We provide several examples which illustrate the advantages of our algorithm, and compare our results with those of state-of-the-art methods. (10.5201/ipol.2017.189)
  DOI : 10.5201/ipol.2017.189
• How to Find the Best Rated Items on a Likert Scale and How Many Ratings Are Enough
  
  • Liu Qing
  • Basu Debabrota
  • Goel Shruti
  • Abdessalem Talel
  • Bressan Stéphane
  , 2017, pp.351-359. (10.1007/978-3-319-64471-4_28)
  DOI : 10.1007/978-3-319-64471-4_28
• A Multilingual System for Cyberbullying Detection: Arabic Content Detection using Machine Learning
  
  • Haidar Batoul
  • Chamoun Maroun
  • Serhrouchni Ahmed
  Advances in Science, Technology and Engineering Systems Journal, Advances in Science Technology and Engineering Systems Journal (ASTESJ), 2017, 2 (6), pp.275-284. (10.25046/aj020634)
  DOI : 10.25046/aj020634
• Similarity and Contrast on Conceptual Spaces for Pertinent Description Generation
  
  • Sileno Giovanni
  • Bloch Isabelle
  • Atif Jamal
  • Dessalles Jean-Louis
  , 2017, LNAI 10505, pp.262-275. Within the general objective of conceiving a cognitive architecture for image interpretation able to generate outputs relevant to several target user profiles, the paper elaborates on a set of operations that should be provided by a cognitive space to guarantee the generation of relevant descriptions. First, it attempts to define a working definition of contrast operation. Then, revisiting well-known results in cognitive studies, it sketches a definition of similarity based on contrast, distin- guished from the metric defined on the conceptual space.
• On the uncontended complexity of anonymous agreement
  
  • Capdevielle Claire
  • Johnen Colette
  • Kuznetsov Petr
  • Milani Alessia
  Distributed Computing, 2017, 30 (6), pp.459-468. (10.1007/s00446-017-0297-z)
  DOI : 10.1007/s00446-017-0297-z
• Non-interference and local correctness in transactional memory
  
  • Kuznetsov Petr
  • Peri Sathya
  Theor. Comput. Sci., 2017, 688, pp.103-116. (10.1016/j.tcs.2016.06.021)
  DOI : 10.1016/j.tcs.2016.06.021
• Discovery and Registration: Finding and Integrating Components into Dynamic Systems
  
  • Rodriguez Berha Helena
  • Moissinac Jean-Claude Jc
  , 2017, pp.325-349. One of the major gaps in the current HTML5 web platform is the lack of an interoperable means for a multimodal application to discover services and applications available in a given space and network, for example, in a smart house with a network of connected objects. To address this gap, the Multimodal Interaction Working Group has produced a draft specification based on distributed services, which aims to support the Discovery and Registration of multimodal components. In this approach, the components are described and virtualized in a Resources Manager communicating bidirectionally through dedicated events. To facilitate the fine-grained management of concurrent multimodal interactions, the Resources Manager registers the distributed components and provides to the Interaction Manager the means to control them. In this way, interoperable search, discovery, and selection of heterogeneous and dynamic features on the Web of Things can be performed by multimodal applications producing natural interaction and a semantically rich user experience. (10.1007/978-3-319-42816-1_15)
  DOI : 10.1007/978-3-319-42816-1_15
• The notion of self-aware computing
  
  • Kounev Samuel
  • Lewis Peter
  • Bellman Kirstie
  • Bencomo Nelly
  • Camara Javier
  • Diaconescu Ada
  • Esterle Lukas
  • Geihs Kurt
  • Giese Holger
  • Gotz Sebastian
  • Inverardi Paola
  • Kephart Jeff
  • Zisman Andrea
  , 2017, pp.3-16.
• Brain lesion detection in 3D PET images using max-trees and a new spatial context criterion
  
  • Urien Hélène
  • Buvat Irène
  • Rougon N. F.
  • Soussan Michael
  • Bloch Isabelle
  , 2017, LNCS 10225, pp.455-466. In this work, we propose a new criterion based on spatial context to select relevant nodes in a max-tree representation of an image, dedicated to the detection of 3D brain tumors for \textsuperscript{18}$F$-FDG PET images. This criterion prevents the detected lesions from merging with surrounding physiological radiotracer uptake. A complete detection method based on this criterion is proposed, and was evaluated on five patients with brain metastases and tuberculosis, and quantitatively assessed using the true positive rates and positive predictive values. The experimental results show that the method detects all the lesions in the PET.
• Détection et segmentation de tumeurs cérébrales en imagerie hybride TEP-IRM
  
  • Urien Hélène
  • Buvat Irène
  • Rougon N. F.
  • Soussan Michael
  • Bloch Isabelle
  , 2017, pp.50.
• Bravo monsieur Le Monde !
  
  • Zayana Karim
  Bulletion de l'APMEP, 2017. Mesurer la circonférence terrestre sans tourner en rond : Ce texte reprend un exposé donné le 10 mars 2017 au lycée Jean Zay à Paris, dans le cadre du plan national de formation « Construction des croisements didactiques en mathématiques et physique-chimie au collège
• A Minimax Optimal Algorithm for Crowdsourcing
  
  • Bonald Thomas
  • Combes Richard
  , 2017. We consider the problem of accurately estimating the reliability of workers based on noisy labels they provide, which is a fundamental question in crowdsourcing. We propose a novel lower bound on the minimax estimation error which applies to any estimation procedure. We further propose Triangular Estimation (TE), an algorithm for estimating the reliability of workers. TE has low complexity, may be implemented in a streaming setting when labels are provided by workers in real time, and does not rely on an iterative procedure. We prove that TE is minimax optimal and matches our lower bound. We conclude by assessing the performance of TE and other state-of-the-art algorithms on both synthetic and real-world data.
• Formal Semantics of Behavior Specifications in the Architecture Analysis and Design Language Standard
  
  • Besnard Loic
  • Gautier Thierry
  • Le Guernic Paul
  • Guy Clément
  • Talpin Jean-Pierre
  • Larson Brian
  • Borde Etienne
  , 2017. (10.1007/978-981-10-4436-6_3)
  DOI : 10.1007/978-981-10-4436-6_3
• Les Communications par Fibres Optiques : La Fin de l'Age de Cuivre
  
  • Gallion Philippe
  , 2017, pp.8.
• Robust Downbeat Tracking Using an Ensemble of Convolutional Networks
  
  • Durand Simon
  • Bello Juan Pablo
  • David Bertrand
  • Richard Gael
  IEEE/ACM Transactions on Audio, Speech and Language Processing, Institute of Electrical and Electronics Engineers, 2017, 25 (1), pp.76-89. <div><p>In this paper, we present a novel state of the art system for automatic downbeat tracking from music signals. The audio signal is first segmented in frames which are synchronized at the tatum level of the music. We then extract different kind of features based on harmony, melody, rhythm and bass content to feed convolutional neural networks that are adapted to take advantage of the characteristics of each feature. This ensemble of neural networks is combined to obtain one downbeat likelihood per tatum. The downbeat sequence is finally decoded with a flexible and efficient temporal model which takes advantage of the assumed metrical continuity of a song. We then perform an evaluation of our system on a large base of 9 datasets, compare its performance to 4 other published algorithms and obtain a significant increase of 16.8 percent points compared to the second best system, for altogether a moderate cost in test and training. The influence of each step of the method is studied to show its strengths and shortcomings.</p></div> (10.1109/TASLP.2016.2623565)
  DOI : 10.1109/TASLP.2016.2623565
• Parameter estimation of perfusion models in dynamic contrast-enhanced imaging: a unified framework for model comparison
  
  • Romain Blandine
  • Rouet Laurence
  • Ohayon Daniel
  • Lucidarme Olivier
  • d'Alché-Buc Florence
  • Letort Véronique
  Medical Image Analysis, Elsevier, 2017, 35, pp.360--374. Patients follow-up in oncology is generally performed through the acquisition of dynamic sequences of contrast-enhanced images. Estimating parameters of appropriate models of contrast intake diffusion through tissues should help characterizing the tumour physiology. However, several models have been developed and no consensus exists on their clinical use. In this paper, we propose a unified framework to analyse models of perfusion and estimate their parameters in order to obtain reliable and relevant parametric images. After defining the biological context and the general form of perfusion models, we propose a methodological framework for model assessment in the context of parameter estimation from dynamic imaging data: global sensitivity analysis, structural and practical identifiability analysis, parameter estimation and model comparison. Then, we apply our methodology to five of the most widely used compartment models (Tofts model, extended Tofts model, two-compartment model, tissue-homogeneity model and distributed-parameters model) and illustrate the results by analysing the behaviour of these models when applied to data acquired on five patients with abdominal tumours. (10.1016/j.media.2016.07.008)
  DOI : 10.1016/j.media.2016.07.008
• Déborder l'expérience pour laisser une trace. Vidéophénoménographie d'un rappeur
  
  • Kneubühler Marine
  , 2017, pp.147-242.
• On some bounds for symmetric tensor rank of multiplication in finite fields
  
  • Ballet Stéphane
  • Pieltant Julia
  • Rambaud Matthieu
  • Sijsling Jeroen
  , 2017, 686, pp.93 - 121. We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover, we discuss the validity of certain published bounds. (10.1090/conm/686/13779)
  DOI : 10.1090/conm/686/13779
• Conception d'absorbants à base de métasurfaces et Application de la Transformation d'Espace pour le contrôle du rayonnement d’une antenne imprimée
  
  • Lepage A. C.
  • Begaud Xavier
  , 2017.
• LISP EID Block
  
  • Iannone Luigi
  • Lewis Darrel
  • Meyer Dave
  • Fuller Vince
  , 2017.
• Dynamic mitigation of EDFA power excursions with machine learning
  
  • Huang Yishen
  • Gutterman Craig L.
  • Samadi Payman
  • Cho Patricia B.
  • Samoud Wiem
  • Ware Cédric
  • Lourdiane Mounia
  • Zussman Gil
  • Bergman Keren
  Optics Express, Optical Society of America - OSA Publishing, 2017, 25 (3), pp.2245 - 2258. Dynamic optical networking has promising potential to support the rapidly changing traffic demands in metro and long-haul networks. However, the improvement in dynamicity is hindered by wavelength-dependent power excursions in gain-controlled erbium doped fiber amplifiers (EDFA) when channels change rapidly. We introduce a general approach that leverages machine learning (ML) to characterize and mitigate the power excursions of EDFA systems with different equipment and scales. An ML engine is developed and experimentally validated to show accurate predictions of the power dynamics in cascaded EDFAs. Recommended channel provisioning based on the ML predictions achieves within 1% error of the lowest possible power excursion over 94% of the time. We also showcase significant mitigation of EDFA power excursions in super-channel provisioning when compared to the first-fit wavelength assignment algorithm (10.1364/OE.25.002245)
  DOI : 10.1364/OE.25.002245