Novel Contiguous Cross Propagation Neural Network Built CAD for Lung Cancer

The present progress of visual-based detection of the diseased area of a malady plays an essential part in the medical field. In that case, the image processing is performed to improve the image data, wherein it inhibits unintended distortion of image features or it enhances further processing in various applications and fields. This helps to show better results especially for diagnosing diseases. Of late the early prediction of cancer is necessary to prevent disease-causing problems. This work is proposed to identify lung cancer using lung computed tomography (CT) scan images. It helps to identify cancer cells’ affected areas. In the present work, the original input image from Lung Image Database Consortium (LIDC) typically suffers from noise problems. To overcome this, the Gabor filter used for image processing is highly enhanced. In the next stage, the Spherical Iterative Refinement Clustering (SIRC) algorithm identifies cancer-suspected areas on the CT scan image. This approach can help radiologists and medical experts recognize cancer diseases and syndromes so that serious progress can be avoided in the early stages. These new methods help to remove unwanted portions of the CT image and better utilization the image. The subspace extraction of features approach is beneficial for evaluating lung cancer. This paper introduces a novel approach called Contiguous Cross Propagation Neural Network that tends to locate regions afflicted by lung cancer using CT scan pictures (CCPNN). By using the feature values from the fourth step of the procedure, the proposed CCPNN tends to categorize the lesion in the lung nodular site. The efficiency of the suggested CCPNN approach is evaluated using classification metrics such as recall (%), precision (%), F-measure (percent), and accuracy (%). Finally, the incorrect classification ratios are determined to compare the trained networks’ effectiveness, through these parameters of CCPNN, it obtains the outstanding performance of 98.06% and it has provided the lowest false ratio of 1.8%.     

Computational methods for pigmented skin lesion classification in images: review and future trends

Skin cancer is considered as one of the most common types of cancer in several countries, and its incidence rate has increased in recent years. Melanoma cases have caused an increasing number of deaths worldwide, since this type of skin cancer is the most aggressive compared to other types. Computational methods have been developed to assist dermatologists in early diagnosis of skin cancer. An overview of the main and current computational methods that have been proposed for pattern analysis and pigmented skin lesion classification is addressed in this review. In addition, a discussion about the application of such methods, as well as future trends, is also provided. Several methods for feature extraction from both macroscopic and dermoscopic images and models for feature selection are introduced and discussed. Furthermore, classification algorithms and evaluation procedures are described, and performance results for lesion classification and pattern analysis are given.

     

Kernel-based learning and feature selection analysis for cancer diagnosis

DNA microarray is a very active area of research in the molecular diagnosis of cancer. Microarray data are composed of many thousands of features and from tens to hundreds of instances, which make the analysis and diagnosis of cancer very complex. In this case, gene/feature selection becomes an elemental and essential task in data classification. In this paper, we propose a complete cancer diagnostic process through kernel-based learning and feature selection. First, support vector machines recursive feature elimination (SVM-RFE) is used to prefilter the genes. Second, the SVM-RFE is enhanced by using binary dragonfly (BDF), which is a recently developed metaheuristic that has never been benchmarked in the context of feature selection. The objective function is the average of classification accuracy rate generated by three kernel-based learning methods. We conducted a series of experiments on six microarray datasets often used in the literature. Experiment results demonstrate that this approach is efficient and provides a higher classification accuracy rate using a reduced number of genes.     

基于HOG-GLRLM特征的肠癌病理图片分类

针对利用单一特征集对肠癌病理图像的识别率难以提高这一情况,提出了一个基于HOG-GLRLM特征肠癌病理图片分类方法。考虑到图像中丰富的纹理和边缘信息,分别利用改进型的灰度行程矩阵和梯度方向直方图提取特征。并采用最小冗余最大关联的方法对各自和合并特征集进行特征选择。实验结果表明该方法的有效性。     

Soft computing models based feature selection for TRUS prostate cancer image classification

Ultrasound imaging is the most suitable method for early detection of prostate cancer. It is very difficult to distinguish benign and malignant nature of the affliction in the early stage of cancer. This is reflected in the high percentage of unnecessary biopsies that are performed and many deaths caused by late detection or misdiagnosis. A computer based classification system can provide a second opinion to the radiologists. Generally, objects are described in terms of a set of measurable features in pattern recognition. The selection and quality of the features representing each pattern will have a considerable bearing on the success of subsequent pattern classification. Feature selection is a process of selecting the most wanted or dominating features set from the original features set in order to reduce the cost of data visualization and increasing classification efficiency and accuracy. The region of interest (ROI) is identified from transrectal ultrasound (TRUS) images using DBSCAN clustering with morphological operators after image enhancement using M3-filter. Then the 22 grey level co-occurrence matrix features are extracted from the ROIs. Soft computing model based feature selection algorithms genetic algorithm (GA), ant colony optimization (ACO) and QR are studied. In this paper, QR-ACO (hybridization of rough set based QR and ACO) and GA-ACO (hybridization GA and ACO) are proposed for reducing feature set in order to increase the accuracy and efficiency of the classification with regard to prostate cancer. The selected features may have the best discriminatory power for classifying prostate cancer based on TRUS images. Support vector machine is tailored for evaluation of the proposed feature selection methods through classification. Then, the comparative analysis is performed among these methods. Experimental results show that the proposed method QR-ACO produces significant results. Number of features selected using QR-ACO algorithm is minimal, is successful and has high detection accuracy.     

Automatic classification for solitary pulmonary nodule in CT image by fractal analysis based on fractional Brownian motion model

Perfusion computed tomography (CT) method has been used to differentiate malignant pulmonary nodules from benign nodules based on the assessment for the change of the CT attenuation value within the pulmonary nodules. Instead of using the change of the CT attenuation value, a set of fractal features based on fractional Brownian motion model is proposed in this paper to automatically distinguish malignant nodules from benign nodules. In a set of 107 CT images from 107 different patients with each image containing a solitary pulmonary nodule, our experimental results obtained from a support vector machine classifier show that the accuracy, sensitivity, specificity, positive predictive value, negative predictive value, and the area under the ROC curve are 83.11%, 90.92%, 71.70%, 80.05%, 87.52%, and 0.8437, respectively, by using the proposed fractal-based feature set. Such a result outperforms the conventional method of using the change of the CT attenuation value as the feature for classification. When combining this conventional method with our proposed fractal-based method, the accuracy, sensitivity, specificity, positive predictive value, negative predictive value, and the area under the ROC curve can be promoted to 88.82%, 93.92%, 82.90%, 87.30%, 90.20%, and 0.9019, respectively. In other words, a high performance of pulmonary nodule classification can be achieved with a single post-contrast CT scan.     

基于圆点滤波器的毛玻璃型肺结节检测

针对圆点滤波器不能提取候选毛玻璃型肺结节的问题,提出一种基于自适应非线性滤波器和圆点滤波器相结合的检测毛玻璃型肺结节的方法。对于内含有32个毛玻璃型结节的23套CT影像的漏检率为15.6%,平均每套影像需要时间1.2 min。该方法在所需运行时间及敏感性上都优于现有方法。     

A new hybrid intelligent system for accurate detection of Parkinson's disease

Elderly people are commonly affected by Parkinson's disease (PD) which is one of the most common neurodegenerative disorders due to the loss of dopamine-producing brain cells. People with PD's (PWP) may have difficulty in walking, talking or completing other simple tasks. Variety of medications is available to treat PD. Recently, researchers have found that voice signals recorded from the PWP is becoming a useful tool to differentiate them from healthy controls. Several dysphonia features, feature reduction/selection techniques and classification algorithms were proposed by researchers in the literature to detect PD. In this paper, hybrid intelligent system is proposed which includes feature pre-processing using Model-based clustering (Gaussian mixture model), feature reduction/selection using principal component analysis (PCA), linear discriminant analysis (LDA), sequential forward selection (SFS) and sequential backward selection (SBS), and classification using three supervised classifiers such as least-square support vector machine (LS-SVM), probabilistic neural network (PNN) and general regression neural network (GRNN). PD dataset was used from University of California-Irvine (UCI) machine learning database. The strength of the proposed method has been evaluated through several performance measures. The experimental results show that the combination of feature pre-processing, feature reduction/selection methods and classification gives a maximum classification accuracy of 100% for the Parkinson's dataset.     

基于特征选择模型的钓鱼网站快速识别方法

目前在识别钓鱼网站的研究中,对识别速度有着越来越高的需求,因此提出了一种基于混合特征选择模型的钓鱼网站快速识别方法。混合特征选择模型包含初次特征选择、二次特征选择和分类三个主要部分,使用信息增益、卡方检验相结合以及基于随机森林的递归特征消除算法建立了混合特征选择模型,并在模型中使用分布函数与梯度,获取最佳截断阈值,得到最优数据集,从而提高钓鱼网站识别的效率。实验数据表明,使用该混合特征选择模型进行特征筛选后的数据集,维度降低了79.2%,在分类精确度几乎不损失的情况下,降低了32%的分类时间复杂度,有效地提高了分类效率。另外,使用UCI机器学习库中的大型钓鱼数据集对该模型进行评价,分类精确率虽然损失1.7%,但数据集维度降低了70%,分类时间复杂度降低了41.1%。     

Breast density classification to reduce false positives in CADe systems

This paper describes a novel weighted voting tree classification scheme for breast density classification. Breast parenchymal density is an important risk factor in breast cancer. Moreover, it is known that mammogram interpretation is more difficult when dense tissue is involved. Therefore, automated breast density classification may aid in breast lesion detection and analysis. Several classification methods have been compared and a novel hierarchical classification procedure of combined classifiers with linear discriminant analysis (LDA) is proposed as the best solution to classify the mammograms into the four BIRADS tissue classes. The classification scheme is based on 298 texture features. Statistical analysis to test the normality and homoscedasticity of the data was carried out for feature selection. Thus, only features that are influenced by the tissue type were considered. The novel classification techniques have been incorporated into a CADe system to drive the detection algorithms and tested with 1459 images. The results obtained on the 322 screen-film mammograms (SFM) of the mini-MIAS dataset show that 99.75% of samples were correctly classified. On the 1137 full-field digital mammograms (FFDM) dataset results show 91.58% agreement. The results of the lesion detection algorithms were obtained from modules integrated within the CADe system developed by the authors and show that using breast tissue classification prior to lesion detection leads to an improvement of the detection results. The tools enhance the detectability of lesions and they are able to distinguish their local attenuation without local tissue density constraints.     

Multi-objective Grey Wolf Optimizer for improved cervix lesion classification

Cervical cancer is one of the vital and most frequent cancers, but can be cured effectively if diagnosed in the early stage. This is a novel effort towards effective characterization of cervix lesions from contrast enhanced CT-Scan images to provide a reliable and objective discrimination between benign and malignant lesions. Performance of such classification models mostly depends on features used to represent samples in a training dataset. Selection of optimal feature subset here is NP-hard; where, randomized algorithms do better. In this paper, Grey Wolf Optimizer (GWO), which is a population based meta-heuristic inspired by the leadership hierarchy and hunting mechanism of grey wolves has been utilized for feature selection. The traditional GWO is applicable for continuous single objective optimization problems. Since, feature selection is inherently multi-objective; this paper proposes two different approaches for multi-objective binary GWO algorithms. One is a scalarized approach to multi-objective GWO (MOGWO) and the other is a Non-dominated Sorting based GWO (NSGWO). These are used for wrapper based feature selection that selects optimal textural feature subset for improved classification of cervix lesions. For experiments, contrast enhanced CT-Scan (CECT) images of 62 patients have been used, where all lesions had been recommended for surgical biopsy by specialist. Gray-level co-occurrence matrix based texture features are extracted from two-level decomposition of wavelet coefficients of cervix regions extracted from CECT images. The results of proposed approaches are compared with mostly used meta-heuristics such as genetic algorithm (GA) and firefly algorithm (FA) for multi-objective optimization. With better diversification and intensification, GWO obtains Pareto solutions, which dominate the solutions obtained by GA and FA when assessed on the utilized cervix lesion cases. Cervix lesions are up to 91% accurately classified as benign and malignant with only five features selected by NSGWO. A two-tailed t-test was conducted by hypothesizing the mean F-score obtained by the proposed NSGWO method at significance level = 0.05. This confirms that NSGWO performs significantly better than other methods for the real cervix lesion dataset in hand. Further experiments were conducted on high dimensional microarray gene expression datasets collected online. The results demonstrate that the proposed method performs significantly better than other methods selecting relevant genes for high-dimensional, multi-category cancer diagnosis with an average of 12.82% improvement in F-score value.     

森林优化特征选择算法的增强与扩展

特征选择作为一种重要的数据预处理方法，不但能解决维数灾难问题，还能提高算法的泛化能力.各种各样的方法已被应用于解决特征选择问题，其中，基于演化计算的特征选择算法近年来获得了更多的关注并取得了一些成功.近期研究结果表明，森林优化特征选择算法具有更好的分类性能及维度缩减能力.然而，初始化阶段的随机性、全局播种阶段的人为参数设定，影响了该算法的准确率和维度缩减能力；同时，算法本身存在着高维数据处理能力不足的本质缺陷.从信息增益率的角度给出了一种初始化策略，在全局播种阶段，借用模拟退火控温函数的思想自动生成参数，并结合维度缩减率给出了适应度函数；同时，针对形成的优质森林采取贪心算法，形成一种特征选择算法EFSFOA（enhanced feature selection using forest optimization algorithm）.此外，在面对高维数据的处理时，采用集成特征选择的方案形成了一个适用于EFSFOA的集成特征选择框架，使其能够有效处理高维数据特征选择问题.通过设计对比实验，验证了EFSFOA与FSFOA相比在分类准确率和维度缩减率上均有明显的提高，高维数据处理能力更是提高到了100 000维.将EFSFOA与近年来提出的比较高效的基于演化计算的特征选择方法进行对比，EFSFOA仍具有很强的竞争力.     

RETRACTED ARTICLE: An improved data mining technique for classification and detection of breast cancer from mammograms

The high incidence of breast cancer in women has increased significantly in the recent years. Mammogram breast X-ray imaging is considered the most effective, low-cost, and reliable method in early detection of breast cancer. Although general rules for the differentiation between benign and malignant breast lesion exist, only 15–30% of masses referred for surgical biopsy are actually malignant. Physician experience of detecting breast cancer can be assisted by using some computerized feature extraction and classification algorithms. Computer-aided classification system was used to help in diagnosing abnormalities faster than traditional screening program without the drawback attribute to human factors. In this work, an approach is proposed to develop a computer-aided classification system for cancer detection from digital mammograms. The proposed system consists of three major steps. The first step is region of interest (ROI) extraction of 256 × 256 pixels size. The second step is the feature extraction; we used a set of 26 features, and we found that these features are capable of differentiating between normal and cancerous breast tissues in order to minimize the classification error. The third step is the classification process; we used the technique of the association rule mining to classify between normal and cancerous tissues. The proposed system was shown to have the large potential for cancer detection from digital mammograms.

     

A novel approach to feature extraction from classification models based on information gene pairs

Various microarray experiments are now done in many laboratories, resulting in the rapid accumulation of microarray data in public repositories. One of the major challenges of analyzing microarray data is how to extract and select efficient features from it for accurate cancer classification. Here we introduce a new feature extraction and selection method based on information gene pairs that have significant change in different tissue samples. Experimental results on five public microarray data sets demonstrate that the feature subset selected by the proposed method performs well and achieves higher classification accuracy on several classifiers. We perform extensive experimental comparison of the features selected by the proposed method and features selected by other methods using different evaluation methods and classifiers. The results confirm that the proposed method performs as well as other methods on acute lymphoblastic-acute myeloid leukemia, adenocarcinoma and breast cancer data sets using a fewer information genes and leads to significant improvement of classification accuracy on colon and diffuse large B cell lymphoma cancer data sets.     

Improvement of classification in urban areas by the use of textural features: The case study of Lucknow city,Uttar Pradesh

Investigations have been carried out for digital spectral and textural classification of an Indian urban environment using SPOT images with grey level co-occurrence matrix (GLCM), grey level difference histogram (GLDH), and sum and difference histogram (SADH) approaches. The results indicate that a combination of texture and spectral features significantly improves the classification accuracy compared with classification with pure spectral features only. This improvement is about 9% and 17% for an addition of one and two texture features, respectively. GLDH and SADH give statistically similar results to GLCM, and take less computing time than GLCM. Conventional separability measures like transformed divergence, Bhattacharya distance, etc. are not effective in feature selection when classification is carried out with spectral and texture features. An alternative approach using simple statistics such as average coefficient of variation, skewness, and kurtosis and correlation amongst feature sets has shown greater feature selection potential when a combination of spectral and texture features is used.     

基于SVM算法的宏病毒处理模型研究

宏病毒是存在于Office文档中的病毒,虽然传统杀毒软件可以扫描已有宏病毒,但是对于新出现的宏病毒处理 仍然存在不足。使用机器学习的方法,通过比较正常宏和有害宏的特征不同,提出了一种新的宏特征选择方法,并使用SVM 算法训练得到分类模型。结合分类模型和宏自身的病毒特征进行综合判断,从而可以达到对新出现宏的类别预测。实验结果 表明,采用该模型成功率可以达到83.61%。     

A new and fast rival genetic algorithm for feature selection

Feature selection is one of the significant steps in classification tasks. It is a pre-processing step to select a small subset of significant features that can contribute the most to the classification process. Presently, many metaheuristic optimization algorithms were successfully applied for feature selection. The genetic algorithm (GA) as a fundamental optimization tool has been widely used in feature selection tasks. However, GA suffers from the hyperparameter setting, high computational complexity, and the randomness of selection operation. Therefore, we propose a new rival genetic algorithm, as well as a fast version of rival genetic algorithm, to enhance the performance of GA in feature selection. The proposed approaches utilize the competition strategy that combines the new selection and crossover schemes, which aim to improve the global search capability. Moreover, a dynamic mutation rate is proposed to enhance the search behaviour of the algorithm in the mutation process. The proposed approaches are validated on 23 benchmark datasets collected from the UCI machine learning repository and Arizona State University. In comparison with other competitors, proposed approach can provide highly competing results and overtake other algorithms in feature selection.

     

改进的多类支持向量机递归特征消除在癌症多分类中的应用

为处理癌症多分类问题,已经提出了多类支持向量机递归特征消除(MSVM-RFE)方法,但该方法考虑的是所有子分类器的权重融合,忽略了各子分类器自身挑选特征的能力。为提高多分类问题的识别率,提出了一种改进的多类支持向量机递归特征消除(MMSVM-RFE)方法。所提方法利用一对多策略把多类问题化解为多个两类问题,每个两类问题均采用支持向量机递归特征消除来逐渐剔除掉冗余特征,得到一个特征子集;然后将得到的多个特征子集合并得到最终的特征子集;最后用SVM分类器对获得的特征子集进行建模。在3个基因数据集上的实验结果表明,改进的算法整体识别率提高了大约2%,单个类别的精度有大幅度提升甚至100%。与随机森林、k近邻分类器以及主成分分析(PCA)降维方法的比较均验证了所提算法的优势。     

基于改进ReliefF与k-means算法的良恶性肺结节分类模型

肺结节是肺癌的症状.在CT图像中,肺结节的形状和大小常被用来进行肺癌的诊断,然而良性和恶性结节的鉴别对于疾病的治疗具有重要意义.由于良恶性结节的边缘纹理特征区别大,因此本文首先利用基于改进的边缘检测算子的灰度-梯度共生矩阵(GGCM)提取小梯度优势、灰度分布不均匀性、能量、灰度熵、梯度熵、混合熵、逆差距、相关性等肺部CT图像的14种纹理特征.然后利用改进的ReliefF算法去除作用小的特征,保留重要特征的特征权重值.最后将重要特征的权重值应用于改进距离度量准则的k-means算法中进行良恶性结节的分类.应用本文算法在LIDC数据集上实验,实验分析结果表明,14种纹理特征对于结节良恶性的分类能力并不相同,而灰度差、梯度差、能量、小梯度优势、相关性、灰度熵、混合熵、逆差矩的组合得到的良恶性肺结节分类效果最好,最终实现了良性结节83.46%,恶性结节95.02%的识别率,可在临床应用中辅助医生进行肺结节的良恶性诊断.     

Real-time object tracking via compressive feature selection

Recently, compressive tracking (CT) has been widely proposed for its efficiency, accuracy and robustness on many challenging sequences. Its appearance model employs non-adaptive random projections that preserve the structure of the image feature space. A very sparse measurement matrix is used to extract features by multiplying it with the feature vector of the image patch. An adaptive Bayes classifier is trained using both positive samples and negative samples to separate the target from background. On the CT framework, however, some features used for classification have weak discriminative abilities, which reduces the accuracy of the strong classifier. In this paper, we present an online compressive feature selection algorithm(CFS) based on the CT framework. It selects the features which have the largest margin when using them to classify positive samples and negative samples. For features that are not selected, we define a random learning rate to update them slowly. It makes those weak classifiers preserve more target information, which relieves the drift when the appearance of the target changes heavily. Therefore, the classifier trained with those discriminative features couples its score in many challenging sequences, which leads to a more robust tracker. Numerous experiments show that our tracker could achieve superior result beyond many state-of-the-art trackers.