Search results for "ALGORITHM"
showing 10 items of 4887 documents
Testing different ICA algorithms and connectivity analyses on MS patients.
2015
Multiple sclerosis (MS) is a progressive neurological disorder that affects the central nervous system. Functional magnetic resonance imaging (fMRI) has been employed to track the course and disease progression in patients with MS. The two main aims of this study were to apply in a data-driven approach the independent component analysis (ICA) in the spatial domain to depict the active sources and to look at the effective connectivity between the identified spatial sources. Several ICA algorithms have been proposed for fMRI data analysis. In this study, we aimed to test two well characterized algorithms, namely, the fast ICA and the complex infomax algorithms, followed by two effective conne…
An efficient functional magnetic resonance imaging data reduction strategy using neighborhood preserving embedding algorithm
2021
High dimensionality data have become common in neuroimaging fields, especially group-level functional magnetic resonance imaging (fMRI) datasets. fMRI connectivity analysis is a widely used, powerful technique for studying functional brain networks to probe underlying mechanisms of brain function and neuropsychological disorders. However, data-driven technique like independent components analysis (ICA), can yield unstable and inconsistent results, confounding the true effects of interest and hindering the understanding of brain functionality and connectivity. A key contributing factor to this instability is the information loss that occurs during fMRI data reduction. Data reduction of high …
Influence of the scalp thickness on the intracranial contribution to rheoencephalography
2004
In spite of the great efforts made by the scientific community, up to now there is no agreement about the rheoencephalography (REG) capability to reflect cerebral blood flow (CBF). Moreover, a standard procedure and the optimal electrode arrangement have not been established yet. In a previous study, we found, using a classical four-shell spherical model of the head and solving it by numerical methods that, theoretically, there could exist an electrode arrangement to register an REG II free of extracranial contribution. In this paper, we have studied the influence of scalp thickness on the intracranial contribution to REG II. The study has been performed by solving the head model, using in …
Mutual information-based feature selection for low-cost BCIs based on motor imagery
2016
In the present study a feature selection algorithm based on mutual information (MI) was applied to electro-encephalographic (EEG) data acquired during three different motor imagery tasks from two dataset: Dataset I from BCI Competition IV including full scalp recordings from four subjects, and new data recorded from three subjects using the popular low-cost Emotiv EPOC EEG headset. The aim was to evaluate optimal channels and band-power (BP) features for motor imagery tasks discrimination, in order to assess the feasibility of a portable low-cost motor imagery based Brain-Computer Interface (BCI) system. The minimal sub set of features most relevant to task description and less redundant to…
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm
2019
Abstract In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows and (constant) travel times. Second, we show that, if the special conditions do not hold, the time-independent optimal solution provides both a lower bound and (eventually) an upper bound with a worst-case guarantee for the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. Finally, a branch-and-bound algorithm is presented and tested on a set of 4800 instances. The results have been compared…
A branch-and-price framework for decomposing graphs into relaxed cliques
2021
We study the family of problems of partitioning and covering a graph into/with a minimum number of relaxed cliques. Relaxed cliques are subsets of vertices of a graph for which a clique-defining property—for example, the degree of the vertices, the distance between the vertices, the density of the edges, or the connectivity between the vertices—is relaxed. These graph partitioning and covering problems have important applications in many areas such as social network analysis, biology, and disease-spread prevention. We propose a unified framework based on branch-and-price techniques to compute optimal decompositions. For this purpose, new, effective pricing algorithms are developed, and new…
Determination of particle number and brightness using a laser scanning confocal microscope operating in the analog mode
2008
We describe a method to obtain the brightness and number of molecules at each pixel of an image stack obtained with a laser scanning microscope. The method is based on intensity fluctuations due to the diffusion of molecules in a pixel. For a detector operating in the analog mode, the variance must be proportional to the intensity. Once this constant has been calibrated, we use the ratio between the variance and the intensity to derive the particle brightness. Then, from the ratio of the intensity to the brightness we obtain the average number of particles in the pixel. We show that the method works with molecules in solution and that the results are comparable to those obtained with fluctu…
Angiocardiographic digital still images compressed via irreversible methods: concepts and experiments.
1997
Abstract We defined, implemented and tested two new methods for irreversible compression of angiocardiographic still images: brightness error limitation (BEL) and pseudo-gradient adaptive brightness and contrast error limitation (PABCEL). The scan path used to compress the digital images is based on the Peano–Hilbert plane-filling curve. The compression methods limit, for each pixel, the brightness errors introduced when approximating the original image (i.e. the difference between the values of corresponding pixels as grey levels). Additional limitations are imposed to the contrast error observed when considering along the scan path consecutive pixels of both the original and the reconstru…
Comparison of measured brightness temperatures from SMOS with modelled ones from ORCHIDEE and H-TESSEL over the Iberian Peninsula
2017
19 pges, 10 figures, 6 tables
A Ciliary Motility Index for Activity Measurement in Cell Cultures With Respiratory Syncytial Virus
2018
[EN] Background: The respiratory epithelium is frequently infected by the respiratory syncytial virus, resulting in inflammation, a reduction in cilia activity and an increase in the production of mucus. Methods: In this study, an automatic method has been proposed to characterize the ciliary motility from cell cultures by means of a motility index using a dense optical flow algorithm. This method allows us to determine the ciliary beat frequency (CBF) together with a ciliary motility index of the cells in the cultures. The object of this analysis is to automatically distinguish between normal and infected cells in a culture. Results: The method was applied in 2 stages. It was concluded fro…