Publications

2017

• Règles d'Associations Temporelles de signaux sociaux pour la synthèse d'Agents Conversationnels Animés : Application aux attitudes sociales
  
  • Janssoone Thomas
  • Clavel Chloé
  • Bailly Kevin
  • Richard Gael
  Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2017. Afin d'améliorer l'interaction entre des humains et des agents conversationnels animés (ACA), l'un des enjeux majeurs du domaine est de générer des agents crédibles socialement. Dans cet article, nous présentons une méthode, intitulée SMART pour social multimodal association rules with timing, capable de trouver automatiquement des associations temporelles entre l'utilisation de signaux sociaux (mouvements de tête, expressions faciales, prosodie. . .) issues de vidéos d'interactions d'humains exprimant différents états affectifs (comportement, attitude, émotions,. . .). Notre système est basé sur un algorithme de fouille de séquences qui lui permet de trouver des règles d'associations temporelles entre des signaux sociaux extraits automatiquement de flux audio-vidéo. SMART va également analyser le lien de ces règles avec chaque état affectif pour ne conserver que celles qui sont pertinentes. Finalement, SMART va les enrichir afin d'assurer une animation facile d'un ACA pour qu'il exprime l'état voulu. Dans ce papier, nous formalisons donc l'implémentation de SMART et nous justifions son inté-rêt par plusieurs études. Dans un premier temps, nous montrons que les règles calculées sont bien en accord avec la littérature en psychologie et sociologie. Ensuite, nous présentons les résultats d'évaluations perceptives que nous avons conduites suite à des études de corpus pro-posant l'expression d'attitudes sociales marquées. ABSTRACT. In the field of Embodied Conversational Agent (ECA) one of the main challenges is to generate socially believable agents. The long run objective of the present study is to infer rules for the multimodal generation of agents' socio-emotional behaviour. In this paper, we introduce the Social Multimodal Association Rules with Timing (SMART) algorithm. It proposes to Revue d'intelligence artificielle-n o 4/2017, 511-537 512 RIA. Volume 31-n o 4/2017 learn the rules from the analysis of a multimodal corpus composed by audio-video recordings of human-human interactions. The proposed methodology consists in applying a Sequence Mining algorithm using automatically extracted Social Signals such as prosody, head movements and facial muscles activation as an input. This allows us to infer Temporal Association Rules for the behaviour generation. We show that this method can automatically compute Temporal Association Rules coherent with prior results found in the literature especially in the psychology and sociology fields. The results of a perceptive evaluation confirms the ability of a Temporal Association Rules based agent to express a specific stance. (10.3166/RIA.31.511-537)
  DOI : 10.3166/RIA.31.511-537
• Uniform bootstrap central limit theorems for Harris chains
  
  • Ciołek Gabriela
  , 2017. The main objective of this talk is to present bootstrap uniform functional central limit theorem for Harris recurrent Markov chains over uniformly bounded classes of functions. We show that the result can be generalized also to the unbounded case. To avoid some complicated mixing conditions, we make use of the well-known regeneration properties of Markov chains. We show that in the atomic case the proof of the bootstrap uniform central limit theorem for Markov chains for functions dominated by a function in L2 space proposed by Radulovic (2004) can be significantly simplified. Regenerative properties of Markov chains can be applied in order to extend some concepts in robust statistics from i.i.d. to a Markovian setting. Bertail and Clémençon (2006) have dened an inuence function and Fréchet dierentiability on the torus what allowed to The main objective of this talk is to present bootstrap uniform functional central limit theorem for Harris recurrent Markov chains over uniformly bounded classes of functions. We show that the result can be generalized also to the unbounded case. To avoid some complicated mixing conditions, we make use of the well-known regeneration properties of Markov chains. We show that in the atomic case the proof of the bootstrap uniform central limit theorem for Markov chains for functions dominated by a function in L2 space proposed by Radulovic (2004) can be signicantly simplified. Regenerative properties of Markov chains can be applied in order to extend some concepts in robust statistics from i.i.d. to a Markovian setting. Bertail and Clémençon (2006) have defined an inluence function and Fréchet differentiability on the torus what allowed to extend the notion of robustness from single observations to the blocks of data instead. In this talk, we present bootstrap uniform central limit theorems for Fréchet differentiable functionals in a Markovian case.The notion of robustness from single observations to the blocks of data instead. In this talk, we present bootstrap uniform central limit theorems for Fréchet differentiable functionals in a Markovian case.
• CLEAR: Covariant LEAst-Square Refitting with Applications to Image Restoration
  
  • Deledalle Charles-Alban
  • Papadakis Nicolas
  • Salmon Joseph
  • Vaiter Samuel
  SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2017, 10 (1), pp.243-284. In this paper, we propose a new framework to remove parts of the systematic errors affecting popular restoration algorithms, with a special focus for image processing tasks. Generalizing ideas that emerged for $\ell_1$ regularization, we develop an approach re-fitting the results of standard methods towards the input data. Total variation regularizations and non-local means are special cases of interest. We identify important covariant information that should be preserved by the re-fitting method, and emphasize the importance of preserving the Jacobian (w.r.t. the observed signal) of the original estimator. Then, we provide an approach that has a ``twicing'' flavor and allows re-fitting the restored signal by adding back a local affine transformation of the residual term. We illustrate the benefits of our method on numerical simulations for image restoration tasks. (10.1137/16M1080318)
  DOI : 10.1137/16M1080318
• Rate Allocation in Predictive Video Coding Using a Convex Optimization Framework
  
  • Fiengo Aniello
  • Chierchia Giovanni
  • Cagnazzo Marco
  • Pesquet-Popescu Béatrice
  IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2017, 26 (1), pp.479 - 489. Optimal rate allocation is among the most challenging tasks to perform in the context of predictive video coding, because of the dependencies between frames induced by motion compensation. In this paper, using a recursive rate-distortion model that explicitly takes into account these dependencies, we approach the frame-level rate allocation as a convex optimization problem. This technique is integrated into the recent HEVC encoder, and tested on several standard sequences. Experiments indicate that the proposed rate allocation ensures a better performance (in the rate-distortion sense) than the standard HEVC rate control, and with a little loss w.r.t. an optimal exhaustive research which is largely compensated by a much shorter execution time. (10.1109/TIP.2016.2621666)
  DOI : 10.1109/TIP.2016.2621666
• Closed-form expressions of the eigen decomposition of 2 x 2 and 3 x 3 Hermitian matrices
  
  • Deledalle Charles-Alban
  • Denis Loic
  • Tabti Sonia
  • Tupin Florence
  , 2017. The eigen decomposition of covariance matrices is at the core of many data analysis techniques. The study of 2-components or 3-components vector fields typically requires computing numerous eigen decompositions of 2 x 2 or 3 x 3 matrices. This is, for example, the case in the analysis of interferometric or polarimetric SAR images, see MuLoG algorithm (https://hal.archives-ouvertes.fr/hal-01388858). The closed-form expression of eigen-values and eigenvectors then provides a way to derive faster data processing algorithms. This note gives these expressions in the general case (special cases where some coefficients are zero, or the eigenvalues are not separated may not be covered and then require either to introduce a small perturbation of the initial matrix or to derive other expressions).
• Top-k Querying of Unknown Values under Order Constraints (Extended Version)
  
  • Amarilli Antoine
  • Amsterdamer Yael
  • Milo Tova
  • Senellart Pierre
  , 2017. Many practical scenarios make it necessary to evaluate top-k queries over data items with partially unknown values. This paper considers a setting where the values are taken from a numerical domain, and where some partial order constraints are given over known and unknown values: under these constraints, we assume that all possible worlds are equally likely. Our work is the first to propose a principled scheme to derive the value distributions and expected values of unknown items in this setting, with the goal of computing estimated top-k results by interpolating the unknown values from the known ones. We study the complexity of this general task, and show tight complexity bounds, proving that the problem is intractable, but can be tractably approximated. We then consider the case of tree-shaped partial orders, where we show a constructive PTIME solution. We also compare our problem setting to other top-k definitions on uncertain data.
• Les facettes de l'Open Data : émergence, fondements et travail en coulisses
  
  • Denis Jérôme
  • Goëta Samuel
  , 2017, pp.121-138. Dans ce chapitre, nous revenons sur l'émergence des politiques d'open data en mettant en lumière les grands principes (de la transparence jusqu'à la modernisation de l'administration, en passant par la libre circulation de l'information) que différentes initiatives ont progressivement stabilisés pour faire de l'ouverture des données publiques un enjeu international. Nous montrons ensuite, à partir d'une enquête ethnographique menée dans plusieurs institutions françaises ce que cette ouverture implique concrètement : un travail délicat qui demeure largement invisible et représente le coût caché des principes fondateurs de l'open data.
• Towards building 3D individual models from MRI segmentation and tractography to enhance surgical planning for pediatric pelvic tumors and malformations
  
  • Muller Cécile
  • Virzi Alessio
  • Marret Jean-Baptiste
  • Mille Eva
  • Berteloot Laureline
  • Grevent David
  • Blanc Thomas
  • Garcelon Nicolas
  • Buffet Isabelle
  • Hullier-Ammard Elisabeth
  • Gori Pietro
  • Boddaert Nathalie
  • Bloch Isabelle
  • Sarnacki Sabine
  , 2017, pp.113-115.
• La fabrique des données brutes. Le travail en coulisses de l'open data
  
  • Denis Jérôme
  • Goëta Samuel
  , 2017. Depuis quelques années, les initiatives d’open data se sont multipliées à travers le monde. Présentées jusque dans la presse grand public comme une ressource inexploitée, le « pétrole » sur lequel le monde serait assis, les données publiques sont devenues objet de toutes les attentions et leur ouverture porteuse de toutes les promesses, à la fois terreau d’un renouveau démocratique et moteur d’une innovation distribuée. Comme dans les sciences, qui ont connu un mouvement de focalisation similaire sur les données et leur partage, l’injonction à l’ouverture opère une certaine mise en invisibilité. Le vocabulaire de la « libération », de la « transparence » et plus encore celui de la « donnée brute » efface toute trace des conditions de production des données, des contextes de leurs usages initiaux et pose leur universalité comme une évidence. Ce chapitre explore les coulisses de l’open data afin de retrouver les traces de cette production et d’en comprendre les spécificités. À partir d’une série d’entretiens ethnographiques dans diverses institutions, il décrit la fabrique des données brutes, dont l’ouverture ne se résume jamais à une mise à disponibilité immédiate, évidente et universelle. Il montre que trois aspects sont particulièrement sensibles dans le processus d’ouverture : l’identification, l'extraction et la « brutification » des données. Ces trois séries d’opérations donnent à voir l’épaisseur sociotechnique des données brutes dont la production mêle dimensions organisationnelles, politiques et techniques.
• Trends in Social Network Analysis - Information Propagation, User Behavior Modeling, Forecasting, and Vulnerability Assessment
  
  • Missaoui Rokia
  • Abdessalem Talel
  • Latapy Mathieu
  , 2017, pp.255. <p>The book collects contributions from experts worldwide addressing recent scholarship in social network analysis such as influence spread, link prediction, dynamic network biclustering, and delurking. It covers both new topics and new solutions to known problems. The contributions rely on established methods and techniques in graph theory, machine learning, stochastic modelling, user behavior analysis and natural language processing, just to name a few. This text provides an understanding of using such methods and techniques in order to manage practical problems and situations. Trends in Social Network Analysis: Information Propagation, User Behavior Modelling, Forecasting, and Vulnerability Assessment appeals to students, researchers, and professionals working in the field.</p> <p> </p> (10.1007/978-3-319-53420-6)
  DOI : 10.1007/978-3-319-53420-6
• 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
• 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
• 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
• 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
• 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
• 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.
• 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.
• 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.
• 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.
• 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
• 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
• 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
• Parametric models of phase-amplitude coupling in neural time series
  
  • Dupré La Tour Tom
  • Grenier Yves
  • Gramfort Alexandre
  , 2017.
• Demonstration of 16QAM-OFDM UDWDM Transmission Using a Tunable Optical Flat Comb Source
  
  • Hraghi Abir
  • Chaibi Mohamed E.
  • Menif Mourad
  • Erasme Didier
  Journal of Lightwave Technology, Institute of Electrical and Electronics Engineers (IEEE)/Optical Society of America(OSA), 2017, 35 (2), pp.238-245. A new approach for designing broad and flattened spectrum multicarriers optical sources is presented leading to a 32 spectral lines source using a dual-arm Mach-Zehnder modulator (MZM) and a 41 spectral lines source from two-stage MZM. A modified simulated annealing-based optimization method is applied to derive the necessary settings allowing the optical flat comb source (OFCS) to be ultraflat. The OFCS is mooted as a technology to enhance the overall capacity of an access optical network by increasing the number of WDM channels. Here, we demonstrate an ultra-dense WDM (UDWDM) trans- mission for application to passive optical networks (PON) with (11x12.5Gbps) Quadrature Amplitude Modulation (QAM) based on a 4b/s/Hz spectral efficiency orthogonal frequency division multiplex (16QAM-OFDM) transmitter and direct detection. We use an OFCS to generate the 11 subcarriers spaced by 6.25GHz, made of a two-stage MZM. We study the performance of 3 filtered channels in terms of error vector magnitude (EVM) in back-to-back (B-to-B) conditions and after propagation through 25km and 100km standard single mode fiber (SSMF). (10.1109/JLT.2016.2636442)
  DOI : 10.1109/JLT.2016.2636442