Quadratic optimization fine tuning for the Support Vector Machines learning phase

This work presents a comparative analysis of specific, rather than general, mathematical programming implementation techniques of the quadratic optimization problem (QP) based on Support Vector Machines (SVM) learning process. Considering the Karush–Kuhn–Tucker (KKT) optimality conditions, we present a strategy of implementation of the SVM-QP following three classical approaches: (i) active set, also divided in primal and dual spaces, methods, (ii) interior point methods and (iii) linearization strategies. We also present the general extension to treat large-scale applications consisting in a general decomposition of the QP problem into smaller ones, conserving the exact solution approach. In the same manner, we propose a set of heuristics to take into account for a better than a random selection process for the initialization of the decomposition strategy. We compare the performances of the optimization strategies using some well-known benchmark databases.     

Computer aided detection system for micro calcifications in digital mammograms

Breast cancer continues to be a significant public health problem in the world. Early detection is the key for improving breast cancer prognosis. Mammogram breast X-ray is considered the most reliable method in early detection of breast cancer. However, it is difficult for radiologists to provide both accurate and uniform evaluation for the enormous mammograms generated in widespread screening. Micro calcification clusters (MCCs) and masses are the two most important signs for the breast cancer, and their automated detection is very valuable for early breast cancer diagnosis. The main objective is to discuss the computer-aided detection system that has been proposed to assist the radiologists in detecting the specific abnormalities and improving the diagnostic accuracy in making the diagnostic decisions by applying techniques splits into three-steps procedure beginning with enhancement by using Histogram equalization (HE) and Morphological Enhancement, followed by segmentation based on Otsu's threshold the region of interest for the identification of micro calcifications and mass lesions, and at last classification stage, which classify between normal and micro calcifications ‘patterns and then classify between benign and malignant micro calcifications. In classification stage; three methods were used, the voting K-Nearest Neighbor classifier (K-NN) with prediction accuracy of 73%, Support Vector Machine classifier (SVM) with prediction accuracy of 83%, and Artificial Neural Network classifier (ANN) with prediction accuracy of 77%.     

Automatic classification and prediction models for early Parkinson’s disease diagnosis from SPECT imaging

Early and accurate diagnosis of Parkinson’s disease (PD) is important for early management, proper prognostication and for initiating neuroprotective therapies once they become available. Recent neuroimaging techniques such as dopaminergic imaging using single photon emission computed tomography (SPECT) with ¹²³I-Ioflupane (DaTSCAN) have shown to detect even early stages of the disease. In this paper, we use the striatal binding ratio (SBR) values that are calculated from the ¹²³I-Ioflupane SPECT scans (as obtained from the Parkinson’s progression markers initiative (PPMI) database) for developing automatic classification and prediction/prognostic models for early PD. We used support vector machine (SVM) and logistic regression in the model building process. We observe that the SVM classifier with RBF kernel produced a high accuracy of more than 96% in classifying subjects into early PD and healthy normal; and the logistic model for estimating the risk of PD also produced high degree of fitting with statistical significance indicating its usefulness in PD risk estimation. Hence, we infer that such models have the potential to aid the clinicians in the PD diagnostic process.     

Use of renewables for the production of chemicals: Glycerol oxidation over carbon supported gold catalysts

As a renewable feedstock and due to its high functionality glycerol is an attractive reactant for the production of a large number of valuable compounds. We report on an environmentally friendly alternative to produce chemicals from the glycerol oxidation, which are currently produced either by stoichiometric oxidation processes or by enzymatic routes. We investigate the heterogeneously catalyzed liquid-phase oxidation of glycerol with carbon supported gold catalysts. The prepared nanosized gold catalysts are highly active, so that the reaction could be performed under atmospheric pressure. The influence of the preparation method of the catalysts has been investigated. Moreover, the support effect on the catalytic process has been studied and discussed in terms of pore structure of the investigated carbon materials. The promotor effect of platinum on Au/C catalysts was examined and it could be shown that the presence of Pt increases not only the catalyst activity but also the selectivity. By promoting the gold catalysts with platinum the selectivity to dihydroxyacetone could be increased from 26% (Au/C) to 36% (Au–Pt/C).     

基于线性判别边信息结合PHL的三维人脸识别

针对三维人脸识别中受光照、姿态、表情等变化而影响识别性能的问题,提出了一种原型超平面学习算法。利用SVM将弱标记数据集中的每个样本表示为一个原型超平面中层特征,使用学习组合系数从未标记的通用数据集中选择支持向量稀疏集;借助于Fisher准则最大化未标记数据集的判别能力,使用迭代优化算法求解目标函数;利用SILD进行特征提取,余弦相似性度量完成最终的人脸识别。在USCD/Honda、FRGC v2、LFW及自己搜集的人脸数据集上的实验结果表明,该算法优于其他几种三维人脸识别算法。     

TiO_2－Al_2O_3复合载体在石油化工催化剂中的应用

介绍了ＴｉＯ_２－Ａｌ_２Ｏ_３复合载体的制备方法及其物化性能。以此载体研制出的ＢＹ型裂解汽油加氢催化剂各项性能指标均符合标准值的要求；并在工业使用中取得了较好的效果。     

Multi-label core vector machine with a zero label

Multi-label core vector machine (Rank-CVM) is an efficient and effective algorithm for multi-label classification. But there still exist two aspects to be improved: reducing training and testing computational costs further, and detecting relevant labels effectively. In this paper, we extend Rank-CVM via adding a zero label to construct its variant with a zero label, i.e., Rank-CVMz, which is formulated as the same quadratic programming form with a unit simplex constraint and non-negative ones as Rank-CVM, and then is solved by Frank–Wolfe method efficiently. Attractively, our Rank-CVMz has fewer variables to be solved than Rank-CVM, which speeds up training procedure dramatically. Further, the relevant labels are effectively detected by the zero label. Experimental results on 12 benchmark data sets demonstrate that our method achieves a competitive performance, compared with six existing multi-label algorithms according to six indicative instance-based measures. Moreover, on the average, our Rank-CVMz runs 83 times faster and has slightly fewer support vectors than its origin Rank-CVM.     

Towards subject independent continuous sign language recognition: A segment and merge approach

This paper presents a segment-based probabilistic approach to robustly recognize continuous sign language sentences. The recognition strategy is based on a two-layer conditional random field (CRF) model, where the lower layer processes the component channels and provides outputs to the upper layer for sign recognition. The continuously signed sentences are first segmented, and the sub-segments are labeled SIGN or ME (movement epenthesis) by a Bayesian network (BN) which fuses the outputs of independent CRF and support vector machine (SVM) classifiers. The sub-segments labeled as ME are discarded and the remaining SIGN sub-segments are merged and recognized by the two-layer CRF classifier; for this we have proposed a new algorithm based on the semi-Markov CRF decoding scheme. With eight signers, we obtained a recall rate of 95.7% and a precision of 96.6% for unseen samples from seen signers, and a recall rate of 86.6% and a precision of 89.9% for unseen signers.