Identification of lambda-cyhalothrin residues on Chinese cabbage using fuzzy uncorrelated discriminant vector analysis and MIR spectroscopy

Excessive pesticide residues on Chinese cabbage will be harmful to people’s health.Therefore,an identification system was designed for qualitative analysis of lambda-cyhalothrin residues on Chinese cabbage leaves.In order to extract discriminant information from mid-infrared(MIR)spectra of Chinese cabbage effectively,fuzzy uncorrelated discriminant vector(FUDV)analysis was proposed by introducing the fuzzy set theory into uncorrelated discriminant vector(UDV)analysis.In this system,the Cary 630 FTIR spectrometer was used to scan four samples of Chinese cabbage with different concentrations of lambda-cyhalothrin.The MIR spectra were preprocessed by standard normal variable(SNV)and Savitzky-Golay smoothing(SG).Next,the high-dimensional MIR spectra were processed for dimension reduction by principal component analysis(PCA).Furthermore,UDV,FUDV,and some other discriminant analysis algorithms were used for feature extraction,respectively.Finally,the K-nearest neighbor(KNN)classifier was employed to classify the data.The experimental results showed that when FUDV was used as the feature extraction algorithm,the identification system reached the maximum classification accuracy of 100%.The results indicated that FUDV combined with MIR spectroscopy was an effective method to identify lambda-cyhalothrin residues on Chinese cabbage.

Training SVMs on a bound vectors set based on Fisher projection

Standard support vector machines （SVMs） train- ing algorithms have O（l3） computational and O（l2） space complexities, where l is the training set size. It is thus com- /putationally infeasible on very large data sets.To alleviate the Computational burden in SVM training, we propose an algo- rithm to train SVMs on a bound vectors set that is extracted based on Fisher projection. For linear separate problems, we use linear Fisher discriminant to compute the projection line, while for non-linear separate problems, we use kernel Fisher discriminant to compute the projection line. For each case, we select a certain ratio samples whose projections are adja- cent to those of the other class as bound vectors. Theoretical analysis shows that the proposed algorithm is with low com- putational and space complexities.Extensive experiments on several classification benchmarks demonstrate the effective- ness of our approach.