Automatic multiple sclerosis lesion detection in brain MRI by FLAIR thresholding

Magnetic resonance imaging (MRI) is frequently used to detect and segment multiple sclerosis lesions due to the detailed and rich information provided. We present a modified expectation-maximisation algorithm to segment brain tissues (white matter, grey matter, and cerebro-spinal fluid) as well as a partial volume class containing fluid and grey matter. This algorithm provides an initial segmentation in which lesions are not separated from tissue, thus a second step is needed to find them. This second step involves the thresholding of the FLAIR image, followed by a regionwise refinement to discard false detections. To evaluate the proposal, we used a database with 45 cases comprising 1.5T imaging data from three different hospitals with different scanner machines and with a variable lesion load per case. The results for our database point out to a higher accuracy when compared to two of the best state-of-the-art approaches.     

Generating operation specifications from UML class diagrams: A model transformation approach

One of the more tedious and complex tasks during the specification of conceptual schemas (CSs) is modeling the operations that define the system behavior. This paper aims to simplify this task by providing a method that automatically generates a set of basic operations that complement the static aspects of the CS and suffice to perform all typical life-cycle create/update/delete changes on the population of the elements of the CS. Our method guarantees that the generated operations are executable, i.e. their executions produce a consistent state wrt the most typical structural constraints that can be defined in CSs (e.g. multiplicity constraints). In particular, our method takes as input a CS expressed as a Unified Modeling Language (UML) class diagram (optionally defined using a profile to enrich the specification of associations) and generates an extended version of the CS that includes all necessary operations to start operating the system. If desired, these basic operations can be later used as building blocks for creating more complex ones. We show the formalization and implementation of our method by means of model-to-model transformations. Our approach is particularly relevant in the context of Model Driven Development approaches.     

Approximation of a Variable Density Cloud of Points by Shrinking a Discrete Membrane

This paper describes a method to obtain a closed surface that approximates a general 3D data point set with nonuniform density. Aside from the positions of the initial data points, no other information is used. Particularly, neither the topological relations between the points nor the normal to the surface at the data points are needed. The reconstructed surface does not exactly interpolate the initial data points, but approximates them with a bounded maximum distance. The method allows one to reconstruct closed surfaces with arbitrary genus and closed surfaces with disconnected shells.     

On the measurement of privacy as an attacker’s estimation error

A wide variety of privacy metrics have been proposed in the literature to evaluate the level of protection offered by privacy-enhancing technologies. Most of these metrics are specific to concrete systems and adversarial models and are difficult to generalize or translate to other contexts. Furthermore, a better understanding of the relationships between the different privacy metrics is needed to enable more grounded and systematic approach to measuring privacy, as well as to assist system designers in selecting the most appropriate metric for a given application. In this work, we propose a theoretical framework for privacy-preserving systems, endowed with a general definition of privacy in terms of the estimation error incurred by an attacker who aims to disclose the private information that the system is designed to conceal. We show that our framework permits interpreting and comparing a number of well-known metrics under a common perspective. The arguments behind these interpretations are based on fundamental results related to the theories of information, probability, and Bayes decision.     

Speeding up the spatial adiabatic passage of matter waves in optical microtraps by optimal control

We numerically investigate the performance of atomic transport in optical microtraps via the so called spatial adiabatic passage technique. Our analysis is carried out by means of optimal control methods, which enable us to determine suitable transport control pulses. We investigate the ultimate limits of the optimal control in speeding up the transport process in a triple well configuration for both a single atomic wave packet and a Bose-Einstein condensate within a regime of experimental parameters achievable with current optical technology.     

An improved 3D imaging system for dimensional quality inspection of rolled products in the metal industry

Measurement, inspection and quality control in industry have benefited from 3D techniques for imaging and visualization in recent years. The development of machine vision devices at decreased costs, as well as their miniaturization and integration in industrial processes, have accelerated the use of 3D imaging systems in industry. In this paper we describe how to improve the performance of a 3D imaging system for inline dimensional quality inspection of long, flat-rolled metal products manufactured in rolling mills we designed and developed in previous works. Two dimensional characteristics of rolled products are measured by the system: width and flatness. The system is based on active triangulation using a single-line pattern projected onto the surface of the product under inspection for range image acquisition. Taking the system calibration into account the range images are transformed into a calibrated point cloud representing the 3D surface reconstruction of the product. Two approaches to improve the line detection and extraction method used in the original system are discussed, one intended for high-speed processing with lower accuracy, and the other providing high accuracy while incurring higher computational time expenses. A mechanism to remove, or at least reduce, the effects of product movements while manufacturing, such as bouncing and flapping, is also proposed to improve the performance of the system.     

EEG signal preprocessing for biometric recognition

Electroencephalography (EEG) has been recently investigated as a biometric modality for automatic people recognition purposes. Several studies have shown that brain signals possess subject-specific traits that allow distinguishing people. Nonetheless, extracting discriminative characteristics from EEG recordings may be a challenging task, due to the significant presence of artifacts in the acquired data. In order to cope with such issue, in this paper we evaluate the effectiveness of some preprocessing techniques in automatically removing undesired EEG contributions, with the aim of improving the achievable recognition rates. Specifically, methods based on blind source separation and sample entropy estimation are here investigated. An extensive set of experimental tests, performed over a large database comprising recordings taken from 50 healthy subjects during three distinct sessions spanning a period of about one month, in both eyes-closed and eyes-open conditions, is carried out to analyze the performance of the proposed approaches.     

A UML/OCL framework for the analysis of graph transformation rules

In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, together with the properties of interest (like rule applicability, conflicts or independence). The intermediate representation serves three purposes: (1) it allows the seamless integration of graph transformation rules with the MOF and OCL standards, and enables taking the meta-model and its OCL constraints (i.e. well-formedness rules) into account when verifying the correctness of the rules; (2) it permits the interoperability of graph transformation concepts with a number of standards-based model-driven development tools; and (3) it makes available a plethora of OCL tools to actually perform the rule analysis. This approach is especially useful to analyse the operational semantics of Domain Specific Visual Languages. We have automated these ideas by providing designers with tools for the graphical specification and analysis of graph transformation rules, including a back-annotation mechanism that presents the analysis results in terms of the original language notation.