Search results for " Computer Science"
showing 10 items of 3983 documents
Comparative survey of visual object classifiers
2018
Classification of Visual Object Classes represents one of the most elaborated areas of interest in Computer Vision. It is always challenging to get one specific detector, descriptor or classifier that provides the expected object classification result. Consequently, it critical to compare the different detection, descriptor and classifier methods available and chose a single or combination of two or three to get an optimal result. In this paper, we have presented a comparative survey of different feature descriptors and classifiers. From feature descriptors, SIFT (Sparse & Dense) and HeuSIFT combination colour descriptors; From classification techniques, Support Vector Classifier, K-Nea…
Automatic Classification of Bright Retinal Lesions via Deep Network Features
2018
The diabetic retinopathy is timely diagonalized through color eye fundus images by experienced ophthalmologists, in order to recognize potential retinal features and identify early-blindness cases. In this paper, it is proposed to extract deep features from the last fully-connected layer of, four different, pre-trained convolutional neural networks. These features are then feeded into a non-linear classifier to discriminate three-class diabetic cases, i.e., normal, exudates, and drusen. Averaged across 1113 color retinal images collected from six publicly available annotated datasets, the deep features approach perform better than the classical bag-of-words approach. The proposed approaches…
Determinantal sets, singularities and application to optimal control in medical imagery
2016
International audience; Control theory has recently been involved in the field of nuclear magnetic resonance imagery. The goal is to control the magnetic field optimally in order to improve the contrast between two biological matters on the pictures. Geometric optimal control leads us here to analyze mero-morphic vector fields depending upon physical parameters , and having their singularities defined by a deter-minantal variety. The involved matrix has polynomial entries with respect to both the state variables and the parameters. Taking into account the physical constraints of the problem, one needs to classify, with respect to the parameters, the number of real singularities lying in som…
Grand Dyck paths with air pockets
2022
Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the $x$-axis. We present enumerative results on GDAP (or their prefixes) subject to various restrictions such as maximal/minimal height, ordinate of the last point and particular first return decomposition. In some special cases we give bijections with other known combinatorial classes.
MAC Design for WiFi Infrastructure Networks: A Game-Theoretic Approach
2011
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios because of non-standard configurations of the nodes. Due to the proliferation of open source drivers and programmable cards, enabling an easy customization of the channel access policies, we propose a game-theoretic analysis of random access schemes. Assuming that each node is rational and implements a best response strategy, we show that…
Surrogate outcomes and transportability
2019
Identification of causal effects is one of the most fundamental tasks of causal inference. We consider an identifiability problem where some experimental and observational data are available but neither data alone is sufficient for the identification of the causal effect of interest. Instead of the outcome of interest, surrogate outcomes are measured in the experiments. This problem is a generalization of identifiability using surrogate experiments and we label it as surrogate outcome identifiability. We show that the concept of transportability provides a sufficient criteria for determining surrogate outcome identifiability for a large class of queries.
Myocardial Infarction Quantification from Late Gadolinium Enhancement MRI Using Top-Hat Transforms and Neural Networks
2019
Significance: Late gadolinium enhanced magnetic resonance imaging (LGE-MRI) is the gold standard technique for myocardial viability assessment. Although the technique accurately reflects the damaged tissue, there is no clinical standard for quantifying myocardial infarction (MI), demanding most algorithms to be expert dependent. Objectives and Methods: In this work a new automatic method for MI quantification from LGE-MRI is proposed. Our novel segmentation approach is devised for accurately detecting not only hyper-enhanced lesions, but also microvascular-obstructed areas. Moreover, it includes a myocardial disease detection step which extends the algorithm for working under healthy scans.…
Laplacian versus Adjacency Matrix in Quantum Walk Search
2015
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk. Besides this natural definition, some quantum walk algorithms instead use the adjacency matrix to effect the walk. While this is equivalent to the Laplacian for regular graphs, it is different for non-regular graphs, and is thus an inequivalent quantum walk. We algorithmically explore this distinction by analyzing search on the complete bipartite graph with multiple marked vertices, using both the Lapla…
Free boundary methods and non-scattering phenomena
2021
We study a question arising in inverse scattering theory: given a penetrable obstacle, does there exist an incident wave that does not scatter? We show that every penetrable obstacle with real-analytic boundary admits such an incident wave. At zero frequency, we use quadrature domains to show that there are also obstacles with inward cusps having this property. In the converse direction, under a nonvanishing condition for the incident wave, we show that there is a dichotomy for boundary points of any penetrable obstacle having this property: either the boundary is regular, or the complement of the obstacle has to be very thin near the point. These facts are proved by invoking results from t…
Nonlocality threshold for entanglement under general dephasing evolutions: A case study
2015
Determining relationships between different types of quantum correlations in open composite quantum systems is important since it enables the exploitation of a type by knowing the amount of another type. We here review, by giving a formal demonstration, a closed formula of the Bell function, witnessing nonlocality, as a function of the concurrence, quantifying entanglement, valid for a system of two noninteracting qubits initially prepared in extended Werner-like states undergoing any local pure-dephasing evolution. This formula allows for finding nonlocality thresholds for the concurrence depending only on the purity of the initial state. We then utilize these thresholds in a paradigmatic …