Entity

Time filter

Source Type


Meo M.,CNRS Informatics, Signals & Systems Lab in Sophia Antipolis
Conference proceedings : ... Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Conference | Year: 2011

Atrial fibrillation (AF) is the most common cardiac arrhythmia encountered in clinical practice. Radiofrequency catheter ablation (CA) is becoming one of the most widely employed therapies. Yet selection of patients who will benefit from this treatment remains a challenging task. Previous works have examined several electrocardiogram (ECG) parameters as potential predictors of CA success, such as fibrillatory wave (f-wave) amplitude. However, they require a manual computation and consider only a subset of electrodes, so inter-lead spatial variability of the 12-lead ECG is not fully exploited. The present study puts forward an automatic procedure for f-wave amplitude computation to non-invasively predict CA outcome. An extension of this quantitative measure to the whole set of leads is also proposed, based on Principal Component Analysis (PCA). We show that exploiting the spatial diversity present in the surface ECG not only improves the robustness to electrode selection but also increases the predictive power of the amplitude parameter. Source


Allibert G.,CNRS Informatics, Signals & Systems Lab in Sophia Antipolis | Courtial E.,Institute Pluridisciplinaire Of Recherche En Ingenierie Des Systemes | Chaumette F.,CNRS Research on Informatics and Random Systems
IEEE Transactions on Robotics | Year: 2010

This paper deals with the image-based visual servoing (IBVS), subject to constraints. Robot workspace limitations, visibility constraints, and actuators limitations are addressed. These constraints are formulated into state, output, and input constraints, respectively. Based on the predictive-control strategy, the IBVS task is written into a nonlinear optimization problem in the image plane, where the constraints can be easily and explicitly taken into account. Second, the contribution of the image prediction and influence of the prediction horizon are pointed out. The image prediction is obtained due to a model. The latter can be a local model based on the interaction matrix or a nonlinear global model based on 3-D data. Its choice is discussed with respect to the constraints to be handled. Finally, simulations that were obtained with a 6-degree-of-freedom (DOF) free-flying camera highlight the potential advantages of the proposed approach with respect to the image prediction and the constraint handling. © 2010 IEEE. Source


Da Costa Pereira C.,CNRS Informatics, Signals & Systems Lab in Sophia Antipolis | Dragoni M.,Fondazione Bruno Kessler | Pasi G.,University of Milan Bicocca
Information Processing and Management | Year: 2012

A new model for aggregating multiple criteria evaluations for relevance assessment is proposed. An Information Retrieval context is considered, where relevance is modeled as a multidimensional property of documents. The usefulness and effectiveness of such a model are demonstrated by means of a case study on personalized Information Retrieval with multi-criteria relevance. The following criteria are considered to estimate document relevance: aboutness, coverage, appropriateness, and reliability. The originality of this approach lies in the aggregation of the considered criteria in a prioritized way, by considering the existence of a prioritization relationship over the criteria. Such a prioritization is modeled by making the weights associated to a criterion dependent upon the satisfaction of the higher-priority criteria. This way, it is possible to take into account the fact that the weight of a less important criterion should be proportional to the satisfaction degree of the more important criterion. Experimental evaluations are also reported. © 2011 Elsevier Ltd. All rights reserved. Source


Gorisse D.,Yakaz Laboratory | Cord M.,University Pierre and Marie Curie | Precioso F.,CNRS Informatics, Signals & Systems Lab in Sophia Antipolis
IEEE Transactions on Pattern Analysis and Machine Intelligence | Year: 2012

In the past 10 years, new powerful algorithms based on efficient data structures have been proposed to solve the problem of Nearest Neighbors search (or Approximate Nearest Neighbors search). If the Euclidean Locality Sensitive Hashing algorithm, which provides approximate nearest neighbors in a euclidean space with sublinear complexity, is probably the most popular, the euclidean metric does not always provide as accurate and as relevant results when considering similarity measure as the Earth-Mover Distance and distances. In this paper, we present a new LSH scheme adapted to distance for approximate nearest neighbors search in high-dimensional spaces. We define the specific hashing functions, we prove their local-sensitivity, and compare, through experiments, our method with the Euclidean Locality Sensitive Hashing algorithm in the context of image retrieval on real image databases. The results prove the relevance of such a new LSH scheme either providing far better accuracy in the context of image retrieval than euclidean scheme for an equivalent speed, or providing an equivalent accuracy but with a high gain in terms of processing speed. © 2012 IEEE. Source


Bucci M.,University of Turku | De Luca A.,University of Naples Federico II | Fici G.,CNRS Informatics, Signals & Systems Lab in Sophia Antipolis
Theoretical Computer Science | Year: 2013

Trapezoidal words are words having at most n+1 distinct factors of length n for every n≥0. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal words and that a closed trapezoidal word is a Sturmian palindrome if and only if its longest repeated prefix is a palindrome. We also define a new class of words, semicentral words, and show that they are characterized by the property that they can be written as uxyu, for a central word u and two different letters x,y. Finally, we investigate the prefixes of the Fibonacci word with respect to the property of being open or closed trapezoidal words, and show that the sequence of open and closed prefixes of the Fibonacci word follows the Fibonacci sequence. © 2012 Elsevier B.V. All rights reserved. Source

Discover hidden collaborations