Publications

2017

• Décomposition de séries temporelles d'images SAR pour la détection de changements
  
  • Lobry Sylvain
  • Denis L.
  • Zhao Weiying
  • Tupin Florence
  Traitement du Signal, Lavoisier, 2017.
• 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
• 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
• 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
• Demystifying the asymptotic behavior of global denoising
  
  • Houdard Antoine
  • Almansa Andrès
  • Delon Julie
  Journal of Mathematical Imaging and Vision, Springer Verlag, 2017. In this work, we revisit the global denoising framework recently introduced by Talebi and Milanfar. We analyze the asymptotic behavior of its mean-squared error restoration performance in the oracle case when the image size tends to infinity. We introduce precise conditions on both the image and the global filter to ensure and quantify this convergence. We also make a clear distinction between two different levels of oracle that are used in that framework. By reformulating global denoising with the classical formalism of diagonal estimation, we conclude that the second-level oracle can be avoided by using Donoho and Johnstone’s theorem, whereas the first-level oracle is mostly required in the sequel. We also discuss open issues concerning the most challenging aspect, namely the extension of these results to the case where neither oracle is required. (10.1007/s10851-017-0716-6)
  DOI : 10.1007/s10851-017-0716-6
• 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
• 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
• 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.
• 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.
• 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
• 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.
• 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.
• Parameter Sensitivity Analysis of the Energy/Frequency Convexity Rule for Nanometer-scale Application Processors
  
  • de Vogeleer Karel
  • Memmi Gerard
  • Jouvelot Pierre
  Sustainable Computing : Informatics and Systems, Elsevier, 2017, 15, pp.16-27. Both theoretical and experimental evidence are presented in this work in order to validate the existence of an Energy/Frequency Convexity Rule, which relates energy consumption and microprocessor frequency for nanometer-scale microprocessors. Data gathered during several month-long experimental acquisition campaigns, supported by several independent publications, suggest that energy consumed is indeed depending on the microprocessor's clock frequency, and, more interestingly, the curve exhibits a clear minimum over the processor's frequency range. An analytical model for this behavior is presented and motivated, which fits well with the experimental data. A parameter sensitivity analysis shows how parameters affect the energy minimum in the clock frequency space. The conditions are discussed under which this convexity rule can be exploited, and when other methods are more effective, with the aim of improving the computer system's energy management efficiency. We show that the power requirements of the computer system, besides the microprocessor, and the overhead affect the location of the energy minimum the most. The sensitivity analysis of the Energy/Frequency Convexity Rule puts forward a number of simple guidelines especially for by low-power systems, such as battery-powered and embedded systems, and less likely by high-performance computer systems. (10.1016/j.suscom.2017.05.001)
  DOI : 10.1016/j.suscom.2017.05.001
• Acoustic Features for Environmental Sound Analysis
  
  • Serizel Romain
  • Bisot Victor
  • Essid Slim
  • Richard Gael
  , 2017, pp.71-101. Most of the time it is nearly impossible to differentiate between particular type of sound events from a waveform only. Therefore, frequency domain and time-frequency domain representations have been used for years providing representations of the sound signals that are more inline with the human perception. However, these representations are usually too generic and often fail to describe specific content that is present in a sound recording. A lot of work have been devoted to design features that could allow extracting such specific information leading to a wide variety of hand-crafted features. During the past years, owing to the increasing availability of medium scale and large scale sound datasets, an alternative approach to feature extraction has become popular, the so-called feature learning. Finally, processing the amount of data that is at hand nowadays can quickly become overwhelming. It is therefore of paramount importance to be able to reduce the size of the dataset in the feature space. The general processing chain to convert an sound signal to a feature vector that can be efficiently exploited by a classifier and the relation to features used for speech and music processing are described is this chapter. (10.1007/978-3-319-63450-0_4)
  DOI : 10.1007/978-3-319-63450-0_4
• Convergence to multi-resource fairness under end-to-end window control
  
  • Bonald Thomas
  • Roberts James
  • Vitale Christian
  , 2017. The paper relates to multi-resource sharing between flows with heterogeneous requirements as arises in networks with wireless links or software routers implementing network function virtualization. Bottleneck max fairness (BMF) is a sharing objective in this context with good performance. The paper shows that BMF results when local fairness is imposed at each resource while flow rates are controlled by an end-to-end window. We analytically prove convergence to BMF under a fluid model when flows share a network limited to 2 resources while numerical results confirm BMF convergence for larger networks. Simulation results illustrate the impact of packetized transmission.
• Using modular extension to provably protect Edwards curves against fault attacks
  
  • Dugardin Margaux
  • Guilley Sylvain
  • Moreau Martin
  • Najm Zakaria
  • Rauzy Pablo
  Journal of Cryptographic Engineering, Springer, 2017, vol. 7, nb. 4.
• FDOPA Patterns in Adrenal Glands
  
  • Moreau Aurélie
  • Giraudet Anne Laure
  • Kryza David
  • Borson-Chazot Françoise
  • Bournaud-Salinas Claire
  • Mognetti Thomas
  • Lifante Jean-Christophe
  • Combemale Patrick
  • Giammarile Francesco
  • Houzard Claire
  Clinical Nuclear Medicine, Lippincott, Williams & Wilkins, 2017, 42 (5), pp.379-382. (10.1097/RLU.0000000000001636)
  DOI : 10.1097/RLU.0000000000001636
• Repenser les médiations. Analyse des manières de faire découvrir et apprécier les œuvres et pratiques culturelles, de la production à la réception
  
  • Bonnéry Stéphane
  • Coavoux Samuel
  • Deslyper Rémi
  • Eloy Florence
  • Francois Sébastien
  • Giraud Frédérique
  • Legon Tomas
  • Mille Muriel
  , 2017.