mfERG_LAB: Software for processing multifocal electroretinography signals

The multifocal electroretinography technique consists of performing sectorized light excitation of the retina and capturing the resulting evoked potential. This provides functional localized information about the state of the retinal neurons. Analysis of multifocal electroretinography signals can be used for diagnosing different types of optic neuropathies (glaucomatous, demyelinating and ischemic ethiology). In order to obtain a reliable diagnosis, it is necessary to apply advanced processing algorithms (morphological, frequency and time-frequency analysis, etc.) to the multifocal electroretinography signal. This paper presents a software application developed in MATLAB(?) (MathWorks Inc., MA) designed to perform advanced multifocal electroretinography signal analysis and classification. This intuitive application, mfERG_LAB, is used to plot the signals, apply various algorithms to them and present the data in an appropriate format. The application's computational power and modular structure make it suitable for use in clinical settings as a powerful and innovative diagnostic tool, as well as in research and teaching settings as a means of assessing new algorithms.     

Succinct Representation of Labeled Graphs

In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our main results are the succinct representations of labeled and multi-labeled graphs (we consider planar triangulations, planar graphs and k-page graphs) to support various label queries efficiently. The additional space cost to store the labels is essentially the information-theoretic minimum. As far as we know, our representations are the first succinct representations of labeled graphs. We also have two preliminary results to achieve the main contribution. First, we design a succinct representation of unlabeled planar triangulations to support the rank/select of edges in ccw (counter clockwise) order in addition to the other operations supported in previous work. Second, we design a succinct representation for a k-page graph when k is large to support various navigational operations more efficiently. In particular, we can test the adjacency of two vertices in O(lg?k) time, while previous work uses O(k) time.     

Dense versus Sparse Approaches for Estimating the Fundamental Matrix

There are two main strategies for solving correspondence problems in computer vision: sparse local feature based approaches and dense global energy based methods. While sparse feature based methods are often used for estimating the fundamental matrix by matching a small set of sophistically optimised interest points, dense energy based methods mark the state of the art in optical flow computation. The goal of our paper is to show that this separation into different application domains is unnecessary and can be bridged in a natural way. As a first contribution we present a new application of dense optical flow for estimating the fundamental matrix. Comparing our results with those obtained by feature based techniques we identify cases in which dense methods have advantages over sparse approaches. Motivated by these promising results we propose, as a second contribution, a new variational model that recovers the fundamental matrix and the optical flow simultaneously as the minimisers of a single energy functional. In experiments we show that our coupled approach is able to further improve the estimates of both the fundamental matrix and the optical flow. Our results prove that dense variational methods can be a serious alternative even in classical application domains of sparse feature based approaches.     

On Camera Calibration with Linear Programming and Loop Constraint Linearization

A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After estimating a set of reliable epipolar geometries, a parameterization of the graph of trifocal tensors is proposed in which each trifocal tensor is linearly encoded by a 4-vector. The strength of this parameterization is that the homographies relating two adjacent trifocal tensors, as well as the projection matrices depend linearly on the parameters. Two methods for estimating these parameters in a global way taking into account loops in the graph are developed. Both methods are based on sequential linear programming: the first relies on a locally linear approximation of the polynomials involved in the loop constraints whereas the second uses alternating minimization. Both methods have the advantage of being non-incremental and of uniformly distributing the error across all the cameras. Experiments carried out on several real data sets demonstrate the accuracy of the proposed approach and its efficiency in distributing errors over the whole set of cameras.     

Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking

This paper deals with the problem of supervised wrapper-based feature subset selection in datasets with a very large number of attributes. Recently the literature has contained numerous references to the use of hybrid selection algorithms: based on a filter ranking, they perform an incremental wrapper selection over that ranking. Though working fine, these methods still have their problems: (1) depending on the complexity of the wrapper search method, the number of wrapper evaluations can still be too large; and (2) they rely on a univariate ranking that does not take into account interaction between the variables already included in the selected subset and the remaining ones.Here we propose a new approach whose main goal is to drastically reduce the number of wrapper evaluations while maintaining good performance (e.g. accuracy and size of the obtained subset). To do this we propose an algorithm that iteratively alternates between filter ranking construction and wrapper feature subset selection (FSS). Thus, the FSS only uses the first block of ranked attributes and the ranking method uses the current selected subset in order to build a new ranking where this knowledge is considered. The algorithm terminates when no new attribute is selected in the last call to the FSS algorithm. The main advantage of this approach is that only a few blocks of variables are analyzed, and so the number of wrapper evaluations decreases drastically.The proposed method is tested over eleven high-dimensional datasets (2400-46,000 variables) using different classifiers. The results show an impressive reduction in the number of wrapper evaluations without degrading the quality of the obtained subset.     

ISS-Lyapunov functions for time-varying hyperbolic systems of balance laws

A family of time-varying hyperbolic systems of balance laws is considered. The partial differential equations of this family can be stabilized by selecting suitable boundary conditions. For the stabilized systems, the classical technique of construction of Lyapunov functions provides a function which is a weak Lyapunov function in some cases, but is not in others. We transform this function through a strictification approach to obtain a time-varying strict Lyapunov function. It allows us to establish asymptotic stability in the general case and a robustness property with respect to additive disturbances of input-to-state stability (ISS) type. Two examples illustrate the results.     

Generation of an adaptive simulation driven by product trajectories

The tracking of products trajectories involves major challenges in simulation generation and adaptation. Positioning techniques and technologies have become available and affordable to incorporate more deeply into workshop operations. We present our 2-year effort into developing a general framework in location and manufacturing applications. We demonstrate the features of the proposed applications using a case study, a synthetic flexible manufacturing environment, with product-driven policy, which enables the generation of a location data stream of product trajectories over the whole plant. These location data are mined and processed to reproduce the manufacturing system dynamics in an adaptive simulation scheme. This article proposes an original method for the generation of simulation models in discrete event systems. This method uses the product location data in the running system. The data stream of points (product ID, location, and time) is the starting point for the algorithm to generate a queuing network simulation model.     

On Kalman filtering over fading wireless channels with controlled transmission powers

We study stochastic stability of centralized Kalman filtering for linear time-varying systems equipped with wireless sensors. Transmission is over fading channels where variable channel gains are counteracted by power control to alleviate the effects of packet drops. We establish sufficient conditions for the expected value of the Kalman filter covariance matrix to be exponentially bounded in norm. The conditions obtained are then used to formulate stabilizing power control policies which minimize the total sensor power budget. In deriving the optimal power control laws, both statistical channel information and full channel information are considered. The effect of system instability on the power budget is also investigated for both these cases.     

Cognitive conflict in human-automation interactions: a psychophysiological study

The review of literature in sociology and distributed artificial intelligence reveals that the occurrence of conflict is a remarkable precursor to the disruption of multi-agent systems. The study of this concept could be applied to human factors concerns, as man-system conflict appears to provoke perseveration behavior and to degrade attentional abilities with a trend to excessive focus. Once entangled in such conflicts, the human operator will do anything to succeed in his current goal even if it jeopardizes the mission. In order to confirm these findings, an experimental setup, composed of a real unmanned ground vehicle, a ground station is developed. A scenario involving an authority conflict between the participants and the robot is proposed. Analysis of the effects of the conflict on the participants' cognition and arousal is assessed through heart-rate measurement (reflecting stress level) and eye-tracking techniques (index of attentional focus). Our results clearly show that the occurrence of the conflict leads to perseveration behavior and can induce higher heart rate as well as excessive attentional focus. These results are discussed in terms of task commitment issues and increased arousal. Moreover, our results suggest that individual differences may predict susceptibility to perseveration behavior.