RESUMO

Abstract Multiple Sclerosis (MS) is the most common neurodegenerative disease among young adults. Diagnosis and monitoring of MS is performed with T2-weighted or T2 FLAIR magnetic resonance imaging, where MS lesions appear as hyperintense spots in the white matter. In recent years, multiple algorithms have been proposed to detect these lesions with varying success rates, which greatly depend on the amount of a priori information required by each algorithm, such as the use of an atlas or the involvement of an expert to guide the segmentation process. In this work, a fully automatic method that does not rely on a priori anatomical information is proposed and evaluated. The proposed algorithm is based on an over-segmentation in superpixels and their classification by means of Gauss-Markov Measure Fields (GMMF). The main advantage of the over-segmentation is that it preserves the borders between tissues, while the GMMF classifier is robust to noise and computationally efficient. The proposed segmentation is then applied in two stages: first to segment the brain region and then to detect hyperintense spots within the brain. The proposed method is evaluated with synthetic images from BrainWeb, as well as real images from MS patients. The proposed method produces competitive results with respect to other algorithms in the state of the art, without requiring user assistance nor anatomical prior information.

Resumen La Esclerosis Múltiple (MS) es una de las enfermedades neurodegenerativas más comunes en adultos jóvenes. El diagnóstico y su monitoreo se realiza generalmente mediante imágenes de resonancia magnética T2 o T2 FLAIR, donde se observan regiones hiperintensas relacionadas a lesiones cerebrales causadas por la MS. En años recientes, múltiples algoritmos han sido propuestos para detectar estas lesiones con diferentes tasas de éxito las cuales dependen en gran medida de la cantidad de información a priori que requiere cada algoritmo, como el uso de un atlas o el involucramiento de un experto que guíe el proceso de segmentación. En este trabajo, se propone un método automático independiente de información anatómica. El algoritmo propuesto está basado en una sobresegmentación en superpixeles y su clasificación mediante un proceso de Campos Aleatorios de Markov de Medidas Gaussianas (GMMF). La principal ventaja de la sobresegmentación es que preserva bordes entre tejidos, además que tiene un costo reducido en tiempo de ejecución, mientras que el clasificador GMMF es robusto a ruido y computacionalmente eficiente. La segmentación propuesta es aplicada en dos etapas: primero para segmentar el cerebro y después para detectar las lesiones en él. El método propuesto es evaluado usando imágenes sintéticas de BrainWeb, así como también imágenes reales de pacientes con MS. Con respecto a los resultados, el método propuesto muestra un desempeño competitivo respecto a otros métodos en el estado del arte, tomando en cuenta que éste no requiere de asistencia o información a priori.

RESUMO

A series of short events, called A-phases, can be observed in the human electroencephalogram (EEG) during Non-Rapid Eye Movement (NREM) sleep. These events can be classified in three groups (A1, A2, and A3) according to their spectral contents, and are thought to play a role in the transitions between the different sleep stages. A-phase detection and classification is usually performed manually by a trained expert, but it is a tedious and time-consuming task. In the past two decades, various researchers have designed algorithms to automatically detect and classify the A-phases with varying degrees of success, but the problem remains open. In this paper, a different approach is proposed: instead of attempting to design a general classifier for all subjects, we propose to train ad-hoc classifiers for each subject using as little data as possible, in order to drastically reduce the amount of time required from the expert. The proposed classifiers are based on deep convolutional neural networks using the log-spectrogram of the EEG signal as input data. Results are encouraging, achieving average accuracies of 80.31% when discriminating between A-phases and non A-phases, and 71.87% when classifying among A-phase sub-types, with only 25% of the total A-phases used for training. When additional expert-validated data is considered, the sub-type classification accuracy increases to 78.92%. These results show that a semi-automatic annotation system with assistance from an expert could provide a better alternative to fully automatic classifiers. Graphical abstract A/N Deep Learning Classifier.

Assuntos

RESUMO

Time-deconvolution of the instrument response from fluorescence lifetime imaging microscopy (FLIM) data is usually necessary for accurate fluorescence lifetime estimation. In many applications, however, the instrument response is not available. In such cases, a blind deconvolution approach is required. An iterative methodology is proposed to address the blind deconvolution problem departing from a dataset of FLIM measurements. A linear combination of a base conformed by Laguerre functions models the fluorescence impulse response of the sample at each spatial point in our formulation. Our blind deconvolution estimation (BDE) algorithm is formulated as a quadratic approximation problem, where the decision variables are the samples of the instrument response and the scaling coefficients of the basis functions. In the approximation cost function, there is a bilinear dependence on the decision variables. Hence, due to the nonlinear nature of the estimation process, an alternating least-squares scheme iteratively solves the approximation problem. Our proposal searches for the samples of the instrument response with a global perspective, and the scaling coefficients of the basis functions locally at each spatial point. First, the iterative methodology relies on a least-squares solution for the instrument response, and quadratic programming for the scaling coefficients applied just to a subset of the measured fluorescence decays to initially estimate the instrument response to speed up the convergence. After convergence, the final stage computes the fluorescence impulse response at all spatial points. A comprehensive validation stage considers synthetic and experimental FLIM datasets of ex vivo atherosclerotic plaques and human breast cancer cell samples that highlight the advantages of the proposed BDE algorithm under different noise and initial conditions in the iterative scheme and parameters of the proposal.

Assuntos

RESUMO

A novel method for approximate string matching with applications to bioinformatics is presented in this paper. Unlike most methods in the literature, the proposed method does not depend on the computation of the edit distance between two sequences, but uses instead a similarity index obtained by applying the phase correlation method. The resulting algorithm provides a finer control over the false positive rate, allowing users to pick out relevant matchings in less time, and can be applied for both offline and online processing.

Assuntos