Search results for " image processing."

Feature Dimensionality Reduction for Mammographic Report Classification

2016

The amount and the variety of available medical data coming from multiple and heterogeneous sources can inhibit analysis, manual interpretation, and use of simple data management applications. In this paper a deep overview of the principal algorithms for dimensionality reduction is carried out; moreover, the most effective techniques are applied on a dataset composed of 4461 mammographic reports is presented. The most useful medical terms are converted and represented using a TF-IDF matrix, in order to enable data mining and retrieval tasks. A series of query have been performed on the raw matrix and on the same matrix after the dimensionality reduction obtained using the most useful techni…

Adaptive Population Importance Samplers: A General Perspective

2016

Importance sampling (IS) is a well-known Monte Carlo method, widely used to approximate a distribution of interest using a random measure composed of a set of weighted samples generated from another proposal density. Since the performance of the algorithm depends on the mismatch between the target and the proposal densities, a set of proposals is often iteratively adapted in order to reduce the variance of the resulting estimator. In this paper, we review several well-known adaptive population importance samplers, providing a unified common framework and classifying them according to the nature of their estimation and adaptive procedures. Furthermore, we interpret the underlying motivation …

Automated Scenario Generation for Training of Humanitarian Responders in High-Risk Settings

2019

Measuring the agreement between brain connectivity networks.

2016

Investigating the level of similarity between two brain networks, resulting from measures of effective connectivity in the brain, can be of interest from many respects. In this study, we propose and test the idea to borrow measures of association used in machine learning to provide a measure of similarity between the structure of (un-weighted) brain connectivity networks. The measures here explored are the accuracy, Cohen's Kappa (K) and Area Under Curve (AUC). We implemented two simulation studies, reproducing two contexts of application that can be particularly interesting for practical applications, namely: i) in methodological studies, performed on surrogate data, aiming at comparing th…

Distributed Particle Metropolis-Hastings Schemes

2018

We introduce a Particle Metropolis-Hastings algorithm driven by several parallel particle filters. The communication with the central node requires the transmission of only a set of weighted samples, one per filter. Furthermore, the marginal version of the previous scheme, called Distributed Particle Marginal Metropolis-Hastings (DPMMH) method, is also presented. DPMMH can be used for making inference on both a dynamical and static variable of interest. The ergodicity is guaranteed, and numerical simulations show the advantages of the novel schemes.

Group Metropolis Sampling

2017

Monte Carlo (MC) methods are widely used for Bayesian inference and optimization in statistics, signal processing and machine learning. Two well-known class of MC methods are the Importance Sampling (IS) techniques and the Markov Chain Monte Carlo (MCMC) algorithms. In this work, we introduce the Group Importance Sampling (GIS) framework where different sets of weighted samples are properly summarized with one summary particle and one summary weight. GIS facilitates the design of novel efficient MC techniques. For instance, we present the Group Metropolis Sampling (GMS) algorithm which produces a Markov chain of sets of weighted samples. GMS in general outperforms other multiple try schemes…

Recycling Gibbs sampling

2017

Gibbs sampling is a well-known Markov chain Monte Carlo (MCMC) algorithm, extensively used in signal processing, machine learning and statistics. The key point for the successful application of the Gibbs sampler is the ability to draw samples from the full-conditional probability density functions efficiently. In the general case this is not possible, so in order to speed up the convergence of the chain, it is required to generate auxiliary samples. However, such intermediate information is finally disregarded. In this work, we show that these auxiliary samples can be recycled within the Gibbs estimators, improving their efficiency with no extra cost. Theoretical and exhaustive numerical co…

Multi-agent Systems for Estimating Missing Information in Smart Cities

2019

International audience; Smart cities aim at improving the quality of life of citizens. To do this, numerous ad-hoc sensors need to be deployed in a smart city to monitor the environmental state. Even if nowadays sensors are becoming more and more cheap their installation and maintenance costs increase rapidly with their number. This paper makes an inventory of the dimensions required for designing an intelligent system to support smart city initiatives. Then we propose a multi-agent based solution that uses a limited number of sensors to estimate at runtime missing information in smart cities using a limited number of sensors.

SREP: An Energy Efficient Relay Protocol for Wireless Sensor Networks

2018

While wireless sensor networks continue to break new grounds in applications, favored by technological innovations, energy efficiency continues to stagnate. Duty cycling remains the most popular and effective technique used to improve energy efficiency and thus lifetime of the network. Nevertheless, duty cycling imposes temporary unavailability on the network leading to deterioration of quality of service. To take care of this rather contradicting reality, this paper proposes Sleep Relay Protocol (SREP). Network nodes are divided into sets according to their location and the sets sleep in relay within a duty cycle period. Two set formation algorithms are proposed at initiation of our propos…

Deep Learning-Based Real-Time Object Detection in Inland Navigation

2019

International audience; Semi-autonomous and fully-autonomous systems must have knowledge about the objects in their environment to ensure a safe navigation. Modern approaches implement deep learning techniques to train a neural network for object detection. This project will study the effectiveness of using several promising algorithms such as Faster R-CNN, SSD, and different versions of YOLO, to detect, classify, and track objects in near real-time fluvial domain. Since no dataset is available for this purpose in literature, we first started by annotating a dataset of 2488 images with almost 35 400 annotations for training the convolutional neural network architectures. We made this data s…