It is a challenging topic to develop an efficient algorithm for large scale classification problems in many applications of machine learning. In this paper, a hierarchical clustering and fixed-layer local learning (HC...It is a challenging topic to develop an efficient algorithm for large scale classification problems in many applications of machine learning. In this paper, a hierarchical clustering and fixed-layer local learning (HCFLL) based support vector machine(SVM) algorithm is proposed to deal with this problem. Firstly, HCFLL hierarchically clusters a given dataset into a modified clustering feature tree based on the ideas of unsupervised clustering and supervised clustering. Then it locally trains SVM on each labeled subtree at a fixed-layer of the tree. The experimental results show that compared with the existing popular algorithms such as core vector machine and decision-tree support vector machine, HCFLL can significantly improve the training and testing speeds with comparable testing accuracy.展开更多
In this work a Support Vector Machine Regression(SVMR) algorithm is used to calculate local magnitude(MI) using only five seconds of signal after the P wave onset of one three component seismic station. This algor...In this work a Support Vector Machine Regression(SVMR) algorithm is used to calculate local magnitude(MI) using only five seconds of signal after the P wave onset of one three component seismic station. This algorithm was trained with 863 records of historical earthquakes, where the input regression parameters were an exponential function of the waveform envelope estimated by least squares and the maximum value of the observed waveform for each component in a single station. Ten-fold cross validation was applied for a normalized polynomial kernel obtaining the mean absolute error for different exponents and complexity parameters. The local magnitude(MI) could be estimated with 0.19 units of mean absolute error. The proposed algorithm is easy to implement in hardware and may be used directly after the field seismological sensor to generate fast decisions at seismological control centers, increasing the possibility of having an effective reaction.展开更多
Finger vein recognition is a biometric technique which identifies individuals using their unique finger vein patterns. It is reported to have a high accuracy and rapid processing speed. In addition, it is impossible t...Finger vein recognition is a biometric technique which identifies individuals using their unique finger vein patterns. It is reported to have a high accuracy and rapid processing speed. In addition, it is impossible to steal a vein pattern located inside the finger. We propose a new identification method of finger vascular patterns using a weighted local binary pattern (LBP) and support vector machine (SVM). This research is novel in the following three ways. First, holistic codes are extracted through the LBP method without using a vein detection procedure. This reduces the processing time and the complexities in detecting finger vein patterns. Second, we classify the local areas from which the LBP codes are extracted into three categories based on the SVM classifier: local areas that include a large amount (LA), a medium amount (MA), and a small amount (SA) of vein patterns. Third, different weights are assigned to the extracted LBP code according to the local area type (LA, MA, and SA) from which the LBP codes were extracted. The optimal weights are determined empirically in terms of the accuracy of the finger vein recognition. Experimental results show that our equal error rate (EER) is significantly lower compared to that without the proposed method or using a conventional method.展开更多
Local diversity AdaBoost support vector machine(LDAB-SVM) is proposed for large scale dataset classification problems.The training dataset is split into several blocks firstly, and some models based on these dataset...Local diversity AdaBoost support vector machine(LDAB-SVM) is proposed for large scale dataset classification problems.The training dataset is split into several blocks firstly, and some models based on these dataset blocks are built.In order to obtain a better performance, AdaBoost is used in each model building.In the boosting iteration step, the component learners which have higher diversity and accuracy are collected via the kernel parameters adjusting.Then the local models via voting method are integrated.The experimental study shows that LDAB-SVM can deal with large scale dataset efficiently without reducing the performance of the classifier.展开更多
Image interpolation plays an important role in image process applications. A novel support vector machines (SVMs) based interpolation scheme is proposed with increasing the local spatial properties in the source ima...Image interpolation plays an important role in image process applications. A novel support vector machines (SVMs) based interpolation scheme is proposed with increasing the local spatial properties in the source image as SVMs input patterns. After the proper neighbor pixels region is selected, trained support vectors are obtained by training SVMs with local spatial properties that include the average of the neighbor pixels gray values and the gray value variations between neighbor pixels in the selected region. The support vector regression machines are employed to estimate the gray values of unknown pixels with the neighbor pixels and local spatial properties information. Some interpolation experiments show that the proposed scheme is superior to the linear, cubic, neural network and other SVMs based interpolation approaches.展开更多
Based on feature compression with orthogonal locality preserving projection(OLPP),a novel fault diagnosis model is proposed in this paper to achieve automation and high-precision of fault diagnosis of rotating machi...Based on feature compression with orthogonal locality preserving projection(OLPP),a novel fault diagnosis model is proposed in this paper to achieve automation and high-precision of fault diagnosis of rotating machinery.With this model,the original vibration signals of training and test samples are first decomposed through the empirical mode decomposition(EMD),and Shannon entropy is constructed to achieve high-dimensional eigenvectors.In order to replace the traditional feature extraction way which does the selection manually,OLPP is introduced to automatically compress the high-dimensional eigenvectors of training and test samples into the low-dimensional eigenvectors which have better discrimination.After that,the low-dimensional eigenvectors of training samples are input into Morlet wavelet support vector machine(MWSVM) and a trained MWSVM is obtained.Finally,the low-dimensional eigenvectors of test samples are input into the trained MWSVM to carry out fault diagnosis.To evaluate our proposed model,the experiment of fault diagnosis of deep groove ball bearings is made,and the experiment results indicate that the recognition accuracy rate of the proposed diagnosis model for outer race crack、inner race crack and ball crack is more than 90%.Compared to the existing approaches,the proposed diagnosis model combines the strengths of EMD in fault feature extraction,OLPP in feature compression and MWSVM in pattern recognition,and realizes the automation and high-precision of fault diagnosis.展开更多
Structural health monitoring(SHM)in service has attracted increasing attention for years.Load localization on a structure is studied hereby.Two algorithms,i.e.,support vector machine(SVM)method and back propagation ne...Structural health monitoring(SHM)in service has attracted increasing attention for years.Load localization on a structure is studied hereby.Two algorithms,i.e.,support vector machine(SVM)method and back propagation neural network(BPNN)algorithm,are proposed to identify the loading positions individually.The feasibility of the suggested methods is evaluated through an experimental program on a carbon fiber reinforced plastic laminate.The experimental tests involve in application of four optical fiber-based sensors for strain measurement at discrete points.The sensors are specially designed fiber Bragg grating(FBG)in small diameter.The small-diameter FBG sensors are arrayed in 2-D on the laminate surface.The testing results indicate that the loading position could be detected by the proposed method.Using SVM method,the 2-D FBG sensors can approximate the loading location with maximum error less than 14 mm.However,the maximum localization error could be limited to about 1 mm by applying the BPNN algorithm.It is mainly because the convergence conditions(mean square error)can be set in advance,while SVM cannot.展开更多
The knowledge of subnuclear localization in eukaryotic cells is indispensable for under-standing the biological function of nucleus, genome regulation and drug discovery. In this study, a new feature representation wa...The knowledge of subnuclear localization in eukaryotic cells is indispensable for under-standing the biological function of nucleus, genome regulation and drug discovery. In this study, a new feature representation was pro-posed by combining position specific scoring matrix (PSSM) and auto covariance (AC). The AC variables describe the neighboring effect between two amino acids, so that they incorpo-rate the sequence-order information;PSSM de-scribes the information of biological evolution of proteins. Based on this new descriptor, a support vector machine (SVM) classifier was built to predict subnuclear localization. To evaluate the power of our predictor, the benchmark dataset that contains 714 proteins localized in nine subnuclear compartments was utilized. The total jackknife cross validation ac-curacy of our method is 76.5%, that is higher than those of the Nuc-PLoc (67.4%), the OET- KNN (55.6%), AAC based SVM (48.9%) and ProtLoc (36.6%). The prediction software used in this article and the details of the SVM parameters are freely available at http://chemlab.scu.edu.cn/ predict_SubNL/index.htm and the dataset used in our study is from Shen and Chou’s work by downloading at http://chou.med.harvard.edu/ bioinf/Nuc-PLoc/Data.htm.展开更多
Enormousmethods have been proposed for the detection and segmentation of blur and non-blur regions of the images.Due to the limited available information about blur type,scenario and the level of blurriness,detection ...Enormousmethods have been proposed for the detection and segmentation of blur and non-blur regions of the images.Due to the limited available information about blur type,scenario and the level of blurriness,detection and segmentation is a challenging task.Hence,the performance of the blur measure operator is an essential factor and needs improvement to attain perfection.In this paper,we propose an effective blur measure based on local binary pattern(LBP)with adaptive threshold for blur detection.The sharpness metric developed based on LBP used a fixed threshold irrespective of the type and level of blur,that may not be suitable for images with variations in imaging conditions,blur amount and type.Contrarily,the proposed measure uses an adaptive threshold for each input image based on the image and blur properties to generate improved sharpness metric.The adaptive threshold is computed based on the model learned through support vector machine(SVM).The performance of the proposed method is evaluated using two different datasets and is compared with five state-of-the-art methods.Comparative analysis reveals that the proposed method performs significantly better qualitatively and quantitatively against all of the compared methods.展开更多
基金National Natural Science Foundation of China ( No. 61070033 )Fundamental Research Funds for the Central Universities,China( No. 2012ZM0061)
文摘It is a challenging topic to develop an efficient algorithm for large scale classification problems in many applications of machine learning. In this paper, a hierarchical clustering and fixed-layer local learning (HCFLL) based support vector machine(SVM) algorithm is proposed to deal with this problem. Firstly, HCFLL hierarchically clusters a given dataset into a modified clustering feature tree based on the ideas of unsupervised clustering and supervised clustering. Then it locally trains SVM on each labeled subtree at a fixed-layer of the tree. The experimental results show that compared with the existing popular algorithms such as core vector machine and decision-tree support vector machine, HCFLL can significantly improve the training and testing speeds with comparable testing accuracy.
文摘In this work a Support Vector Machine Regression(SVMR) algorithm is used to calculate local magnitude(MI) using only five seconds of signal after the P wave onset of one three component seismic station. This algorithm was trained with 863 records of historical earthquakes, where the input regression parameters were an exponential function of the waveform envelope estimated by least squares and the maximum value of the observed waveform for each component in a single station. Ten-fold cross validation was applied for a normalized polynomial kernel obtaining the mean absolute error for different exponents and complexity parameters. The local magnitude(MI) could be estimated with 0.19 units of mean absolute error. The proposed algorithm is easy to implement in hardware and may be used directly after the field seismological sensor to generate fast decisions at seismological control centers, increasing the possibility of having an effective reaction.
基金Project(No.R112002105070020(2010))supported by the National Research Foundation of Korea(NRF) through the Biometrics Engi-neering Research Center(BERC)at Yonsei University
文摘Finger vein recognition is a biometric technique which identifies individuals using their unique finger vein patterns. It is reported to have a high accuracy and rapid processing speed. In addition, it is impossible to steal a vein pattern located inside the finger. We propose a new identification method of finger vascular patterns using a weighted local binary pattern (LBP) and support vector machine (SVM). This research is novel in the following three ways. First, holistic codes are extracted through the LBP method without using a vein detection procedure. This reduces the processing time and the complexities in detecting finger vein patterns. Second, we classify the local areas from which the LBP codes are extracted into three categories based on the SVM classifier: local areas that include a large amount (LA), a medium amount (MA), and a small amount (SA) of vein patterns. Third, different weights are assigned to the extracted LBP code according to the local area type (LA, MA, and SA) from which the LBP codes were extracted. The optimal weights are determined empirically in terms of the accuracy of the finger vein recognition. Experimental results show that our equal error rate (EER) is significantly lower compared to that without the proposed method or using a conventional method.
基金supported by the National Natural Science Foundation of China (60603098)
文摘Local diversity AdaBoost support vector machine(LDAB-SVM) is proposed for large scale dataset classification problems.The training dataset is split into several blocks firstly, and some models based on these dataset blocks are built.In order to obtain a better performance, AdaBoost is used in each model building.In the boosting iteration step, the component learners which have higher diversity and accuracy are collected via the kernel parameters adjusting.Then the local models via voting method are integrated.The experimental study shows that LDAB-SVM can deal with large scale dataset efficiently without reducing the performance of the classifier.
文摘Image interpolation plays an important role in image process applications. A novel support vector machines (SVMs) based interpolation scheme is proposed with increasing the local spatial properties in the source image as SVMs input patterns. After the proper neighbor pixels region is selected, trained support vectors are obtained by training SVMs with local spatial properties that include the average of the neighbor pixels gray values and the gray value variations between neighbor pixels in the selected region. The support vector regression machines are employed to estimate the gray values of unknown pixels with the neighbor pixels and local spatial properties information. Some interpolation experiments show that the proposed scheme is superior to the linear, cubic, neural network and other SVMs based interpolation approaches.
基金supported by Fundamental Research Funds for the Central Universities of China (Grant No. CDJZR10118801)
文摘Based on feature compression with orthogonal locality preserving projection(OLPP),a novel fault diagnosis model is proposed in this paper to achieve automation and high-precision of fault diagnosis of rotating machinery.With this model,the original vibration signals of training and test samples are first decomposed through the empirical mode decomposition(EMD),and Shannon entropy is constructed to achieve high-dimensional eigenvectors.In order to replace the traditional feature extraction way which does the selection manually,OLPP is introduced to automatically compress the high-dimensional eigenvectors of training and test samples into the low-dimensional eigenvectors which have better discrimination.After that,the low-dimensional eigenvectors of training samples are input into Morlet wavelet support vector machine(MWSVM) and a trained MWSVM is obtained.Finally,the low-dimensional eigenvectors of test samples are input into the trained MWSVM to carry out fault diagnosis.To evaluate our proposed model,the experiment of fault diagnosis of deep groove ball bearings is made,and the experiment results indicate that the recognition accuracy rate of the proposed diagnosis model for outer race crack、inner race crack and ball crack is more than 90%.Compared to the existing approaches,the proposed diagnosis model combines the strengths of EMD in fault feature extraction,OLPP in feature compression and MWSVM in pattern recognition,and realizes the automation and high-precision of fault diagnosis.
基金supported by the National Natural Science Foundation of China(Nos.11402112,51405223)
文摘Structural health monitoring(SHM)in service has attracted increasing attention for years.Load localization on a structure is studied hereby.Two algorithms,i.e.,support vector machine(SVM)method and back propagation neural network(BPNN)algorithm,are proposed to identify the loading positions individually.The feasibility of the suggested methods is evaluated through an experimental program on a carbon fiber reinforced plastic laminate.The experimental tests involve in application of four optical fiber-based sensors for strain measurement at discrete points.The sensors are specially designed fiber Bragg grating(FBG)in small diameter.The small-diameter FBG sensors are arrayed in 2-D on the laminate surface.The testing results indicate that the loading position could be detected by the proposed method.Using SVM method,the 2-D FBG sensors can approximate the loading location with maximum error less than 14 mm.However,the maximum localization error could be limited to about 1 mm by applying the BPNN algorithm.It is mainly because the convergence conditions(mean square error)can be set in advance,while SVM cannot.
文摘The knowledge of subnuclear localization in eukaryotic cells is indispensable for under-standing the biological function of nucleus, genome regulation and drug discovery. In this study, a new feature representation was pro-posed by combining position specific scoring matrix (PSSM) and auto covariance (AC). The AC variables describe the neighboring effect between two amino acids, so that they incorpo-rate the sequence-order information;PSSM de-scribes the information of biological evolution of proteins. Based on this new descriptor, a support vector machine (SVM) classifier was built to predict subnuclear localization. To evaluate the power of our predictor, the benchmark dataset that contains 714 proteins localized in nine subnuclear compartments was utilized. The total jackknife cross validation ac-curacy of our method is 76.5%, that is higher than those of the Nuc-PLoc (67.4%), the OET- KNN (55.6%), AAC based SVM (48.9%) and ProtLoc (36.6%). The prediction software used in this article and the details of the SVM parameters are freely available at http://chemlab.scu.edu.cn/ predict_SubNL/index.htm and the dataset used in our study is from Shen and Chou’s work by downloading at http://chou.med.harvard.edu/ bioinf/Nuc-PLoc/Data.htm.
基金This work is supported by the BK-21 FOUR program and by the Creative Challenge Research Program(2021R1I1A1A01052521)through National Research Foundation of Korea(NRF)under Ministry of Education,Korea.
文摘Enormousmethods have been proposed for the detection and segmentation of blur and non-blur regions of the images.Due to the limited available information about blur type,scenario and the level of blurriness,detection and segmentation is a challenging task.Hence,the performance of the blur measure operator is an essential factor and needs improvement to attain perfection.In this paper,we propose an effective blur measure based on local binary pattern(LBP)with adaptive threshold for blur detection.The sharpness metric developed based on LBP used a fixed threshold irrespective of the type and level of blur,that may not be suitable for images with variations in imaging conditions,blur amount and type.Contrarily,the proposed measure uses an adaptive threshold for each input image based on the image and blur properties to generate improved sharpness metric.The adaptive threshold is computed based on the model learned through support vector machine(SVM).The performance of the proposed method is evaluated using two different datasets and is compared with five state-of-the-art methods.Comparative analysis reveals that the proposed method performs significantly better qualitatively and quantitatively against all of the compared methods.