一种过程支持向量机及其在动态模式分类中的应用

针对一般SVM在机制上难以直接对动态模式进行分类的问题,提出了一种基于函数正交基展开的过程支持向量机.该模型的输入为时变函数,输出为模式类别.在输入函数空间中选择一组适当的正交函数基,将输入函数在该组函数基下进行有限项展开,把展开式系数作为核函数的输入.由于时变函数在基函数映射下与展开式系数一一对应,从而可利用SVM的变换机制实现动态模式分类.给出了基于SMO的求解算法,实验结果验证了模型和算法的有效性.     

Hierarchical classification of protein function with ensembles of rules and particle swarm optimisation

This paper focuses on hierarchical classification problems where the classes to be predicted are organized in the form of a tree. The standard top-down divide and conquer approach for hierarchical classification consists of building a hierarchy of classifiers where a classifier is built for each internal (non-leaf) node in the class tree. Each classifier discriminates only between its child classes. After the tree of classifiers is built, the system uses them to classify test examples one class level at a time, so that when the example is assigned a class at a given level, only the child classes need to be considered at the next level. This approach has the drawback that, if a test example is misclassified at a certain class level, it will be misclassified at deeper levels too. In this paper we propose hierarchical classification methods to mitigate this drawback. More precisely, we propose a method called hierarchical ensemble of hierarchical rule sets (HEHRS), where different ensembles are built at different levels in the class tree and each ensemble consists of different rule sets built from training examples at different levels of the class tree. We also use a particle swarm optimisation (PSO) algorithm to optimise the rule weights used by HEHRS to combine the predictions of different rules into a class to be assigned to a given test example. In addition, we propose a variant of a method to mitigate the aforementioned drawback of top-down classification. These three types of methods are compared against the standard top-down hierarchical classification method in six challenging bioinformatics datasets, involving the prediction of protein function. Overall HEHRS with the rule weights optimised by the PSO algorithm obtains the best predictive accuracy out of the four types of hierarchical classification method.     

一种改进的应用于噪声数据中的KNN算法

基于实例的KNN算法不可避免地要依赖于数据的质量,但原始数据含有噪声,因而KNN算法的结果势必会因为数据中的噪声而受到严重的影响。事实上,大多噪声都服从一定的模型,而且模型一般是已知的。充分利用数据中的噪声模型,以减小噪声对KNN算法结果的影响。通过实验结果表明该方法是有效的。     

地铁站场景下的可行驶区域检测

在室内环境下的机器人视觉导航任务中,可行驶区域检测是不可或缺的一部分,这是保证自动驾驶任务实现的基础.目前较多的解决方法是对数据集中出现过的障碍物进行识别来检测可行驶区域,缺乏灵活性,因此本文提出了一种针对地铁站等室内平坦地面的可行驶区域检测方法,提高实用性.本文采用经典的MobileNetV3网络对采集到的前方图像进行分类,判断是否为地面区域.由于室内地面的地标、箭头等贴纸的影响,因此需要对非地面区域进一步判断,与常规的立体障碍物进行区分.本文利用连续帧之间的特征点匹配获得相机移动距离,并利用直线拟合计算斜率的方法达到区分立体障碍物与平面地标的目的.实验表明,本文提出的方法能较好地检测机器人前方可行驶区域,具有较高的实用价值.     

Transfer Learning on Deep Neural Networks to Detect Pornography

While the internet has a lot of positive impact on society, there are negative components. Accessible to everyone through online platforms, pornography is, inducing psychological and health related issues among people of all ages. While a difficult task, detecting pornography can be the important step in determining the porn and adult content in a video. In this paper, an architecture is proposed which yielded high scores for both training and testing. This dataset was produced from 190 videos, yielding more than 19 h of videos. The main sources for the content were from YouTube, movies, torrent, and websites that hosts both pornographic and non-pornographic contents. The videos were from different ethnicities and skin color which ensures the models can detect any kind of video. A VGG16, Inception V3 and Resnet 50 models were initially trained to detect these pornographic images but failed to achieve a high testing accuracy with accuracies of 0.49, 0.49 and 0.78 respectively. Finally, utilizing transfer learning, a convolutional neural network was designed and yielded an accuracy of 0.98.     

An Automated Brain Image Analysis System for Brain Cancer using Shearlets

In this paper, an Automated Brain Image Analysis (ABIA) system that classifies the Magnetic Resonance Imaging (MRI) of human brain is presented. The classification of MRI images into normal or low grade or high grade plays a vital role for the early diagnosis. The Non-Subsampled Shearlet Transform (NSST) that captures more visual information than conventional wavelet transforms is employed for feature extraction. As the feature space of NSST is very high, a statistical t-test is applied to select the dominant directional sub-bands at each level of NSST decomposition based on sub-band energies. A combination of features that includes Gray Level Co-occurrence Matrix (GLCM) based features, Histograms of Positive Shearlet Coefficients (HPSC), and Histograms of Negative Shearlet Coefficients (HNSC) are estimated. The combined feature set is utilized in the classification phase where a hybrid approach is designed with three classifiers; k-Nearest Neighbor (kNN), Naive Bayes (NB) and Support Vector Machine (SVM) classifiers. The output of individual trained classifiers for a testing input is hybridized to take a final decision. The quantitative results of ABIA system on Repository of Molecular Brain Neoplasia Data (REMBRANDT) database show the overall improved performance in comparison with a single classifier model with accuracy of 99% for normal/abnormal classification and 98% for low and high risk classification.     

An improved method for voice pathology detection by means of a HMM-based feature space transformation

This paper presents new a feature transformation technique applied to improve the screening accuracy for the automatic detection of pathological voices. The statistical transformation is based on Hidden Markov Models, obtaining a transformation and classification stage simultaneously and adjusting the parameters of the model with a criterion that minimizes the classification error. The original feature vectors are built up using classic short-term noise parameters and mel-frequency cepstral coefficients. With respect to conventional approaches found in the literature of automatic detection of pathological voices, the proposed feature space transformation technique demonstrates a significant improvement of the performance with no addition of new features to the original input space. In view of the results, it is expected that this technique could provide good results in other areas such as speaker verification and/or identification.     

A new strategy for defect inspection by the virtual inspection in semiconductor wafer fabrication

The defect of process equipments is a major factor that impairs the yields in the mass production of semiconductor wafer fabrication and it is a main supervision means to use high-resolution defect inspection tools to detect and monitor the defect damage. Due to the high investment costs of these inspection tools and the resulting decrease in the throughput, how to improve the sampling rate is an important issue for the associated inspection strategy. This paper proposes a new concept and implementation of virtual inspection (VI) to enhance the detection and monitoring of defect in semiconductor production process. The underlying theory of the VI concept is that the state variables identifications (SVIDs) of process equipments can reflect the process quality effectively and loyally. The approach of VI is to combine the application of the fault detection and classification (FDC), and the defect library and the re-engineering of inspection procedure to reach the full-scope of strategic objective. VI enables the defect monitoring to enter a new era by promoting the monitoring level of defect inspection from the previous lot-sampling basis to the wafer-sampling level, and hence upgrades the sampling strategy from random-sampling to full and right-sampling. In this study, various typical defect cases are utilized to illustrate how to create VI models and verify the reliability of the proposed approach. Furthermore, a feasible architecture of the VI implementation for mass production in semiconductor factory is presented in the paper.     

A new mathematical programming approach to multi-group classification problems

In this paper we introduce a goal programming formulation for the multi-group classification problem. Although a great number of mathematical programming models for two-group classification problems have been proposed in the literature, there are few mathematical programming models for multi-group classification problems. Newly proposed multi-group mathematical programming model is compared with other conventional multi-group methods by using different real data sets taken from the literature and simulation data. A comparative analysis on the real data sets and simulation data shows that our goal programming formulation may suggest efficient alternative to traditional statistical methods and mathematical programming formulations for the multi-group classification problem.