Search results for "Support Vector Machine"

Quantification and classification of high-resolution magic angle spinning data for brain tumor diagnosis.

2007

The goal of this work is to propose a complete protocol (preprocessing, processing and classification) for classifying brain tumors with proton high-resolution magic-angle spinning ((1)H HR-MAS) data. The different steps of the procedure are detailed and discussed. Feature extraction techniques such as peak integration, including also the automated quantitation method AQSES, were combined with linear (LDA) and non-linear (least-squares support vector machine or LS-SVM) classifiers. Classification accuracy was assessed using a stratified random sampling scheme. The results suggest that LS-SVM performs better than LDA while AQSES performs better than the standard peak integration feature extr…

Hyperspectral detection of citrus damage with Mahalanobis kernel classifier

2007

Presented is a full computer vision system for the identification of post-harvest damage in citrus packing houses. The method is based on the combined use of hyperspectral images and the Mahalanobis kernel classifier. More accurate and reliable results compared to other methods are obtained in several scenarios and acquired images.

Discrimination of retinal images containing bright lesions using sparse coded features and SVM

2015

Diabetic Retinopathy (DR) is a chronic progressive disease of the retinal microvasculature which is among the major causes of vision loss in the world. The diagnosis of DR is based on the detection of retinal lesions such as microaneurysms, exudates and drusen in retinal images acquired by a fundus camera. However, bright lesions such as exudates and drusen share similar appearances while being signs of different diseases. Therefore, discriminating between different types of lesions is of interest for improving screening performances. In this paper, we propose to use sparse coding techniques for retinal images classification. In particular, we are interested in discriminating between retina…

Automatic classification of tissues on pelvic MRI based on relaxation times and support vector machine

2019

International audience; Tissue segmentation and classification in MRI is a challenging task due to a lack of signal intensity standardization. MRI signal is dependent on the acquisition protocol, the coil profile, the scanner type, etc. While we can compute quantitative physical tissue properties independent of the hardware and the sequence parameters, it is still difficult to leverage these physical properties to segment and classify pelvic tissues. The proposed method integrates quantitative MRI values (T1 and T2 relaxation times and pure synthetic weighted images) and machine learning (Support Vector Machine (SVM)) to segment and classify tissues in the pelvic region, i.e.: fat, muscle, …

Differentiation between acute and chronic myocardial infarction by means of texture analysis of late gadolinium enhancement and cine cardiac magnetic…

2017

[EN] The purpose of this study was to differentiate acute from chronic myocardial infarction using machine learning techniques and texture features extracted from cardiac magnetic resonance imaging (MRI). The study group comprised 22 cases with acute myocardial infarction (AMI) and 22 cases with chronic myocardial infarction (CMI). Cine and late gadolinium enhancement (LGE) MRI were analyzed independently to differentiate AMI from CMI. A total of 279 texture features were extracted from predefined regions of interest (ROIs): the infarcted area on LGE MRI, and the entire myocardium on cine MRI. Classification performance was evaluated by a nested cross-validation approach combining a feature…

Weakly supervised alignment of multisensor images

2015

Manifold alignment has become very popular in recent literature. Aligning data distributions prior to product generation is an appealing strategy, since it allows to provide data spaces that are more similar to each other, regardless of the subsequent use of the transformed data. We propose a methodology that finds a common representation among data spaces from different sensors using geographic image correspondences, or semantic ties. To cope with the strong deformations between the data spaces considered, we propose to add nonlineari-ties by expanding the input space with Gaussian Radial Basis Function (RBF) features with respect to the centroids of a partitioning of the data. Such featur…

Assessing the Impact of Temporary Retail Price Discounts Intervals Using SVM Semiparametric Regression

2009

Although the marketing literature has found that temporary retail price discounts cause a significant sales increase, little is known about the specific characteristics of deals that influence the magnitude of the sales spike. In this paper, we analyse the impact of the length of temporary retail price discounts periods on the sales increase using scanner-store daily-sales data for two frequently purchased product categories: ground coffee (a storable category) and yogurt (a perishable category).Wedevelop a robust semiparametric regression model based on support vector statistical theory with several previously proposed predictors along with a daily time description. This model also makes i…

Using Support Vector Semiparametric Regression to estimate the effects of pricing on brand substitution

2008

Statistical criteria for early-stopping of support vector machines

2007

This paper proposes the use of statistical criteria for early-stopping support vector machines, both for regression and classification problems. The method basically stops the minimization of the primal functional when moments of the error signal (up to fourth order) become stationary, rather than according to a tolerance threshold of primal convergence itself. This simple strategy induces lower computational efforts and no significant differences are observed in terms of performance and sparsity.

Kernelizing LSPE(λ)

2007

We propose the use of kernel-based methods as underlying function approximator in the least-squares based policy evaluation framework of LSPE(λ) and LSTD(λ). In particular we present the 'kernelization' of model-free LSPE(λ). The 'kernelization' is computationally made possible by using the subset of regressors approximation, which approximates the kernel using a vastly reduced number of basis functions. The core of our proposed solution is an efficient recursive implementation with automatic supervised selection of the relevant basis functions. The LSPE method is well-suited for optimistic policy iteration and can thus be used in the context of online reinforcement learning. We use the hig…