A study on several machine-learning methods for classification of malignant and benign clustered microcalcifications

In this paper, we investigate several state-of-the-art machine-learning methods for automated classification of clustered microcalcifications (MCs). The classifier is part of a computer-aided diagnosis (CADx) scheme that is aimed to assisting radiologists in making more accurate diagnoses of breast cancer on mammograms. The methods we considered were: support vector machine (SVM), kernel Fisher discriminant (KFD), relevance vector machine (RVM), and committee machines (ensemble averaging and AdaBoost), of which most have been developed recently in statistical learning theory. We formulated differentiation of malignant from benign MCs as a supervised learning problem, and applied these learning methods to develop the classification algorithm. As input, these methods used image features automatically extracted from clustered MCs. We tested these methods using a database of 697 clinical mammograms from 386 cases, which included a wide spectrum of difficult-to-classify cases. We analyzed the distribution of the cases in this database using the multidimensional scaling technique, which reveals that in the feature space the malignant cases are not trivially separable from the benign ones. We used receiver operating characteristic (ROC) analysis to evaluate and to compare classification performance by the different methods. In addition, we also investigated how to combine information from multiple-view mammograms of the same case so that the best decision can be made by a classifier. In our experiments, the kernel-based methods (i.e., SVM, KFD, and RVM) yielded the best performance (Az = 0.85, SVM), significantly outperforming a well-established, clinically-proven CADx approach that is based on neural network (Az = 0.80).     

A support vector machine approach for detection of microcalcifications

In this paper, we investigate an approach based on support vector machines (SVMs) for detection of microcalcification (MC) clusters in digital mammograms, and propose a successive enhancement learning scheme for improved performance. SVM is a machine-learning method, based on the principle of structural risk minimization, which performs well when applied to data outside the training set. We formulate MC detection as a supervised-learning problem and apply SVM to develop the detection algorithm. We use the SVM to detect at each location in the image whether an MC is present or not. We tested the proposed method using a database of 76 clinical mammograms containing 1120 MCs. We use free-response receiver operating characteristic curves to evaluate detection performance, and compare the proposed algorithm with several existing methods. In our experiments, the proposed SVM framework outperformed all the other methods tested. In particular, a sensitivity as high as 94% was achieved by the SVM method at an error rate of one false-positive cluster per image. The ability of SVM to out perform several well-known methods developed for the widely studied problem of MC detection suggests that SVM is a promising technique for object detection in a medical imaging application.     

SVM算法及其在乳腺X片微钙化点 自动检测中的应用

支持矢量机(SVM)是一种新的统计学习方法,其学习原则是使结构风险最小,而非经典学习方法所遵循经验风险最小原则.这使得SVM具有更强的泛化能力.并且,由于SVM求解的是凸二次优化问题,使之能保证所找到的极值解就是全局最优解.本文首次将SVM算法用于乳腺X影像微钙化点自动检测中,对临床实际病例的试用结果表明,同目前常用的基于经验风险最小的人工神经网络(ANN)分类方法相比,SVM具有更高的识别率,值得应用推广.     

A similarity learning approach to content-based image retrieval: application to digital mammography

In this paper, we describe an approach to content-based retrieval of medical images from a database, and provide a preliminary demonstration of our approach as applied to retrieval of digital mammograms. Content-based image retrieval (CBIR) refers to the retrieval of images from a database using information derived from the images themselves, rather than solely from accompanying text indices. In the medical-imaging context, the ultimate aim of CBIR is to provide radiologists with a diagnostic aid in the form of a display of relevant past cases, along with proven pathology and other suitable information. CBIR may also be useful as a training tool for medical students and residents. The goal of information retrieval is to recall from a database information that is relevant to the user's query. The most challenging aspect of CBIR is the definition of relevance (similarity), which is used to guide the retrieval machine. In this paper, we pursue a new approach, in which similarity is learned from training examples provided by human observers. Specifically, we explore the use of neural networks and support vector machines to predict the user's notion of similarity. Within this framework we propose using a hierarchal learning approach, which consists of a cascade of a binary classifier and a regression module to optimize retrieval effectiveness and efficiency. We also explore how to incorporate online human interaction to achieve relevance feedback in this learning framework. Our experiments are based on a database consisting of 76 mammograms, all of which contain clustered microcalcifications (MCs). Our goal is to retrieve mammogram images containing similar MC clusters to that in a query. The performance of the retrieval system is evaluated using precision-recall curves computed using a cross-validation procedure. Our experimental results demonstrate that: 1) the learning framework can accurately predict the perceptual similarity reported by human observers, thereby serving as a basis for CBIR; 2) the learning-based framework can significantly outperform a simple distance-based similarity metric; 3) the use of the hierarchical two-stage network can improve retrieval performance; and 4) relevance feedback can be effectively incorporated into this learning framework to achieve improvement in retrieval precision based on online interaction with users; and 5) the retrieved images by the network can have predicting value for the disease condition of the query.     

联合循环平稳特征PCA与RVM的频谱感知

针对无线信道环境中低信噪比情况下主用户信号检测率较低的问题,提出了一种基于循环平稳特征主成分分析(PCA)与相关向量机(RVM)的认知网络频谱感知算法。该算法结合了主成分分析算法与相关向量机分类方法,应用于解决认知网络频谱感知问题。首先对信号循环平稳特征参数进行特征提取,通过主成分分析进行降维提取信号主成分,生成训练样本和待测样本,并完成对相关向量机的训练,再采用训练完成的相关向量机算法分别对有无主用户情况下的信号进行分类检测,最后获得主用户信号存在性的感知判断。仿真实验表明,与人工神经网络、支持向量机和最大最小特征值算法相比较,所提算法在低信噪比情况下具有较高的分类检测性能,检测率最大可提高61.6%,有效地实现了对主用户信号的感知。     

Application of kernel methods in signals modulation classification

A new approach to common signals classification of relevance vector machine(RVM) was presented and two signal classifiers based on kernel methods of support vector machine(SVM) and RVM were compared and analyzed.First several robust features of signals were extracted as the input of classifiers,then the kernel thought was used to map feature vectors impliedly to the high dimensional feature space,and multi-class RVM and SVM classifiers were designed to complete AM,CW,SSB,MFSK and MPSK signals recognition.Simulation result showed that when chose proper parameter,RVM and SVM had comparable accuracy but RVM had less learning time and basis functions.The classification speed of RVM is much faster than SVM.     

基于支持向量约简的快速目标检测

支持向量机(SVM)由于其出色的泛化能力,已成为目标检测领域应用最为广泛的分类器之一.然而在检测过程中,过多的支持向量会产生很大的时间开销,从而降低目标检测系统的实时性.针对此问题,提出一种约简支持向量的方法,以降低分类器的决策开销,加快检测速度.此方法采用迭代的方式来估计特征空间中向量的原像,通过构建精简原像集来简化支持向量机,从而达到了提升分类速度的效果.利用精简的SVM结合Selective Search+ BoW模型构建了一款快速检测器,测试结果表明:该检测器能够在保证检测率的前提下,通过约简支持向量,提高目标检测的实时性.     

Machine learning approach to recognize ventricular arrhythmias using VMD based features

The occurrence of life-threatening ventricular arrhythmias (VAs) such as Ventricular tachycardia (VT) and Ventricular fibrillation (VF) leads to sudden cardiac death which requires detection at an early stage. The main aim of this work is to develop an automated system using machine learning tool for accurate prediction of VAs that may reduce the mortality rate. In this paper, a novel method using variational mode decomposition (VMD) based features and C4.5 classifier for detection of ventricular arrhythmias is presented. The VMD model was used to decompose the electrocardiography (ECG) signals to extract useful informative features. The method was tested for ECG signals obtained from PhysioNet database. Two standard databases i.e. CUDB (Creighton University Ventricular Tachyarrhythmia Database) and VFDB (MIT-BIH Malignant Ventricular Ectopy Database) were considered for this work. A set of time–frequency features were extracted and ranked by the gain ratio attribute evaluation method. The ranked features are subjected to support vector machine (SVM) and C4.5 classifier for classification of normal, VT and VF classes. The best detection was obtained with sensitivity of 97.97%, specificity of 99.15%, and accuracy of 99.18% for C4.5 classifier with a 5 s data analysis window. These results were better than SVM classifier result having an average accuracy of 86.87%. Hence, the proposed method demonstrates the efficiency in detecting the life-threatening VAs and can serve as an assistive tool to clinicians in the diagnosis process.

     

强混叠模式下基于神经元捕获/抑制原理的分类器设计

目前的许多分类器设计方法,如多层感知器网络(MLP)、支持向量机(SVM)、相关向量机(RVM)、径向基函数网络(RBF)等,实际是非线性映射加线性分类的方法,即将输入空间的非线性可分问题经非线性映射到另一空间,在那一空间实现线性分类.本文则开拓性的运用脉冲耦合神经网络神经元的点火捕获的思想,提出了一种基于耦合神经元点火捕获/抑制特性的分类器设计方法,使一类样本对应神经元总是较其它类样本对应神经元先点火以实现对样本的有效分类.所设计的分类器可实现对样本空间中任意复杂分布训练样本的非线性稳健分类,特别是有效实现复杂混叠模式的模式稳健分类,大量复杂混叠模式分类问题的仿真实验验证了本文方法的有效性和可行性,并应用于微波暗室实测一维距离像数据的自动目标识别中.     

Beamforming‐based feature extraction and RVM‐based method for attacker node classification in CRN

Cognitive radio is a promising technology for the future wireless spectrum allocation to improve the utilization rate of the licensed bands. However, the cognitive radio network is susceptible to various attacks. Hence, there arises a need to develop a highly efficient security measure against the attacks. This paper presents a beamforming‐based feature extraction and relevance vector machine (RVM)‐based method for the classification of the attacker nodes in the cognitive radio network. Initially, the allocation of the Rayleigh channel is performed for the communication. The quaternary phase shift keying method is used for modulating the signals. After obtaining the modulated signal, the extraction of the beamforming‐based features is performed. The RVM classifier is used for predicting the normal nodes and attacker nodes. If the node is detected as an attacker node, then communication with that node is neglected. Particle swarm optimization is applied for predicting the optimal channel, based on the beamforming feature values. Then, signal communication with the normal nodes is started. Finally, the signal is demodulated. The signal‐to‐noise ratio and bit‐error rate values are computed to evaluate the performance of the proposed approach. The accuracy, sensitivity, and specificity of the RVM classifier method are higher than the support vector machine classifier. The proposed method achieves better performance in terms of throughput, channel sensing/probing rate, and channel access delay. Copyright © 2016 John Wiley & Sons, Ltd.     

Color classification using margin-setting with ellipsoids

This paper presents a robust and computationally efficient genetic algorithm for color classification. It designs well-fitted color space prolate spheroids (ellipsoids) that envelop the training pixels. The ellipsoids are then used to classify unlabeled image pixels in accordance with their color, in order to partition the image. The color classification algorithm described here has very low error rates, boasts very high operational speed, and permits trading higher indecision rates for lower rates of misclassification. The performance of the color classifier developed in this paper is compared with those of the support vector machine (SVM) and the nearest-neighbor (kNN) classifiers. It has been shown that our color classifier outperforms SVM and kNN for partitioning of color images that contain several closely spaced color classes. It has higher correct classification, lower misclassification, and significantly reduced operational latency in comparison with color classifiers based on kNN and SVM.     

Blind equalizer for constant-modulus signals based on Gaussian process regression

A new blind equalization method for constant modulus (CM) signals based on Gaussian process for regression (GPR) by incorporating a constant modulus algorithm (CMA)-like error function into the conventional GPR framework is proposed. The GPR framework formulates the posterior density function for weights using Bayes' rule under the assumption of Gaussian prior for weights. The proposed blind GPR equalizer is based on linear-in-weights regression model, which has a form of nonlinear minimum mean-square error solution. Simulation results in linear and nonlinear channels are presented in comparison with the state-of-the-art support vector machine (SVM) and relevance vector machine (RVM) based blind equalizers. The simulation results show that the proposed blind GPR equalizer without cumbersome cross-validation procedures shows the similar performances to the blind SVM and RVM equalizers in terms of intersymbol interference and bit error rate.     

基于中心矩特征的雷达HRRP自动目标识别

针对雷达高分辨距离像(HRRP)的方位敏感性和平移敏感性，对一定角域内的HRRP非相干平均，提取具有平移不变性的中心矩作为特征向量，采用Karhunen-Loeve变换进一步进行特征压缩，建立相应的支撑矢量机（SVM）分类算法，与基于原始距离像特征的最大似然(ML)方法和基于中心矩特征的ML方法识别结果比较，该方法在减少计算量的同时具有较高的识别率，具有良好的推广能力。     

基于支持向量机的地基单站GPS反演大气剖面

提出基于支持向量机的地基单站GPS遥感大气剖面的反演方法,主要包括经典支持向量机、最小二乘支持向量机、相关向量机3种方法,利用青岛地区的历史数据进行了仿真反演对比研究,并与神经网络反演方法进行比较,结果表明支持向量机能够有效地应用于地基单站GPS大气遥感领域。     

基于支持向量机的运动目标中人脸检测

本文提出基于支持向量机的运动目标中人脸检测方法.首先采用高斯马尔可夫随机场(GMRF)模型的分割算法将运动目标与背景分开,然后根据灰度投影定位头部区域,最后在头部区域以支持向量机作为分类器提取特征器官位置,依此裁剪出人脸样本.实验表明该方法是有效的,鲁棒的.     

一种基于遗传算法的SVM决策树多分类方法

在当前的机器学习领域,如何利用支持向量机（SVM）对多类目标进行分类,同时提高分类器的分类效率已经成为研究的热点之一,有效地解决此问题对于提高目标的识别概率具有较大意义。本文针对SVM多分类问题提出了一种基于遗传算法的SVM最优决策树生成算法。算法以随机生成的决策树构建的SVM分类器对同一测试样本的分类正确率作为遗传算法的适应度函数,通过遗传算法寻找到最优决策树,再以最优决策树构建SVM分类器,最终实现SVM的多分类。将该算法应用于低空飞行声目标识别问题,实验结果表明,新方法比传统的1-a-1、1-a-r、SVM-DL和GADT-SVM方法有更高的分类精度和更短的分类时间。      

Support vector correlation filter with long-term tracking

Boosted by the promising advancement of the correlation filter-based tracker, we propose an algorithm called the SLT (support vector correlation filter with long-term tracking) that is based on the new SCF (support vector correlation filter) framework to handle long-term tracking. To perform long-term tracking, we propose using a detector to refine the position that includes occlusion and deformation and is out-of-view. We used a new judgment criterion called the max response to the average response rate (MAR) to activate the re-detection procedure and then exploit the linear support vector machine (SVM) classifier to obtain a positive refinement. Moreover, we do not update the SVM classifier every frame to reduce the number of computations and obtain better samples to improve the accuracy of the classifier. We use the online passive–aggressive learning algorithm for online learning and use the same MAR criterion to active it. Extensive experimental results on the OTB50 benchmark dataset show its superior performance in terms of accuracy and robustness.     

A New Semantic Kernel Function for Online Anomaly Detection of Software

In this letter, a new online anomaly detection approach for software systems is proposed. The novelty of the proposed approach is to apply a new semantic kernel function for a support vector machine (SVM) classifier to detect fault‐suspicious execution paths at runtime in a reasonable amount of time. The kernel uses a new sequence matching algorithm to measure similarities among program execution paths in a customized feature space whose dimensions represent the largest common subpaths among the execution paths. To increase the precision of the SVM classifier, each common subpath is given weights according to its ability to discern executions as correct or anomalous. Experiment results show that compared with the known kernels, the proposed SVM kernel will improve the time overhead of online anomaly detection by up to 170%, while improving the precision of anomaly alerts by up to 140%.     

基于机器视觉的印刷套准识别方法研究*

针对印刷套准检测存在的精度低、速度慢的问题,提取了印刷标志图像的Tamura纹理特征：粗糙度、对比度和方向度,以描述其印刷标志套准或套不准特征;设计了支持向量机的分类器对印刷标志图像进行套准识别,并采用高斯径向基核函数用于非线性数据的分类。实验结果证明,采用建议的印刷标志图像特征提取和分类方法,识别准确率达到90%,识别时间为0.032751秒。本文建议的方法在识别准确率和识别速度上都优于人工检测和文献8的方法。     

基于自编码网络特征降维的轻量级入侵检测模型

基于支持向量机(SVM)的入侵检测方法受时间和空间复杂度约束,在高维特征空间计算时面临“维数灾害”的问题.为此,本文提出一种基于自编码网络的支持向量机入侵检测模型(AN-SVM).首先,该模型采用多层无监督的限制玻尔兹曼机(RBM)将高维、非线性的原始数据映射至低维空间,建立高维空间和低维空间的双向映射自编码网络结构,进而运用基于反向传播网络的自编码网络权值微调算法重构低维空间数据的最优高维表示,从而获得原始数据的相应最优低维表示;最后,采用SVM分类算法对所学习到的最优低维表示进行入侵识别.实验结果表明,AN-SVM模型降低了入侵检测模型中分类的训练时间和测试时间,并且分类效果优于传统算法,是一种可行且高效的轻量级入侵检测模型.