A Highly Accurate Dysphonia Detection System Using Linear Discriminant Analysis

The recognition of pathological voice is considered a difficult task for speech analysis.Moreover,otolaryngologists needed to rely on oral communication with patients to discover traces of voice pathologies like dysphonia that are caused by voice alteration of vocal folds and their accuracy is between 60%–70%.To enhance detection accuracy and reduce processing speed of dysphonia detection,a novel approach is proposed in this paper.We have leveraged Linear Discriminant Analysis(LDA)to train multiple Machine Learning(ML)models for dysphonia detection.Several ML models are utilized like Support Vector Machine(SVM),Logistic Regression,and K-nearest neighbor(K-NN)to predict the voice pathologies based on features like Mel-Frequency Cepstral Coefficients(MFCC),Fundamental Frequency(F0),Shimmer(%),Jitter(%),and Harmonic to Noise Ratio(HNR).The experiments were performed using Saarbrucken Voice Data-base(SVD)and a privately collected dataset.The K-fold cross-validation approach was incorporated to increase the robustness and stability of the ML models.According to the experimental results,our proposed approach has a 70%increase in processing speed over Principal Component Analysis(PCA)and performs remarkably well with a recognition accuracy of 95.24%on the SVD dataset surpassing the previous best accuracy of 82.37%.In the case of the private dataset,our proposed method achieved an accuracy rate of 93.37%.It can be an effective non-invasive method to detect dysphonia.

Direct linear discriminant analysis based on column pivoting QR decomposition and economic SVD

A direct linear discriminant analysis algorithm based on economic singular value decomposition （DLDA/ESVD） is proposed to address the computationally complex problem of the conventional DLDA algorithm, which directly uses ESVD to reduce dimension and extract eigenvectors corresponding to nonzero eigenvalues. Then a DLDA algorithm based on column pivoting orthogonal triangular （QR） decomposition and ESVD （DLDA/QR-ESVD） is proposed to improve the performance of the DLDA/ESVD algorithm by processing a high-dimensional low rank matrix, which uses column pivoting QR decomposition to reduce dimension and ESVD to extract eigenvectors corresponding to nonzero eigenvalues. The experimental results on ORL, FERET and YALE face databases show that the proposed two algorithms can achieve almost the same performance and outperform the conventional DLDA algorithm in terms of computational complexity and training time. In addition, the experimental results on random data matrices show that the DLDA/QR-ESVD algorithm achieves better performance than the DLDA/ESVD algorithm by processing high-dimensional low rank matrices.

Unsupervised Linear Discriminant Analysis

An algorithm for unsupervised linear discriminant analysis was presented. Optimal unsupervised discriminant vectors are obtained through maximizing covariance of all samples and minimizing covariance of local k-nearest neighbor samples. The experimental results show our algorithm is effective.

Linear Discriminant Analysis and Kernel Vector Quantization for Mandarin Digits Recognition

Linear discriminant analysis and kernel vector quantization are integrated into vector quantization based speech recognition system for improving the recognition accuracy of Mandarin digits. These techniques increase the class separability and optimize the clustering procedure. Speaker-dependent (SD) and speaker-independent (SI) experiments are performed to evaluate the performance of the proposed method. The experiment results show that the proposed method is capable of reaching the word error rate of 3.76% in SD case and 6.60 % in SI case. Such a system can be suitable for being embedded in personal digital assistant(PDA), mobile phone and so on to perform voice controlling such as digit dialing, calculating, etc.

Balanced multiple weighted linear discriminant analysis and its application to visual process monitoring

Visual process monitoring is important in complex chemical processes.To address the high state separation of industrial data,we propose a new criterion for feature extraction called balanced multiple weighted linear discriminant analysis(BMWLDA).Then,we combine BMWLDA with self-organizing map(SOM)for visual monitoring of industrial operation processes.BMWLDA can extract the discriminative feature vectors from the original industrial data and maximally separate industrial operation states in the space spanned by these discriminative feature vectors.When the discriminative feature vectors are used as the input to SOM,the training result of SOM can differentiate industrial operation states clearly.This function improves the performance of visual monitoring.Continuous stirred tank reactor is used to verify that the class separation performance of BMWLDA is more effective than that of traditional linear discriminant analysis,approximate pairwise accuracy criterion,max–min distance analysis,maximum margin criterion,and local Fisher discriminant analysis.In addition,the method that combines BMWLDA with SOM can effectively perform visual process monitoring in real time.

Emotion recognition of Uyghur speech using uncertain linear discriminant analysis

To achieve efficient a d compact low-dimensional features for speech emotion recognition,a novel featurereduction method using uncertain linear discriminant analysis is proposed.Using the same principles as for conventional linear discriminant analysis(LDA),uncertainties of the noisy or distorted input data ae employed in order to estimate maximaiy discriminant directions.The effectiveness of the proposed uncertain LDA(ULDA)is demonstrated in the Uyghur speech emotion recognition task.The emotional features of Uyghur speech,especially,the fundamental fequency and formant,a e analyzed in the collected emotional data.Then,ULDA is employed in dimensionality reduction of emotional features and better performance is achieved compared with other dimensionality reduction techniques.The speech emotion recognition of Uyghur is implemented by feeding the low-dimensional data to support vector machine(SVM)based on the proposed ULDA.The experimental results show that when employing a appropriate uncertainty estimation algorithm,uncertain LDA outperforms the conveetional LDA counterpart on Uyghur speech emotion recognition.

Incremental Linear Discriminant Analysis Dimensionality Reduction and 3D Dynamic Hierarchical Clustering WSNs

Optimizing the sensor energy is one of the most important concern in Three-Dimensional(3D)Wireless Sensor Networks(WSNs).An improved dynamic hierarchical clustering has been used in previous works that computes optimum clusters count and thus,the total consumption of energy is optimal.However,the computational complexity will be increased due to data dimension,and this leads to increase in delay in network data transmission and reception.For solving the above-mentioned issues,an efficient dimensionality reduction model based on Incremental Linear Discriminant Analysis(ILDA)is proposed for 3D hierarchical clustering WSNs.The major objective of the proposed work is to design an efficient dimensionality reduction and energy efficient clustering algorithm in 3D hierarchical clustering WSNs.This ILDA approach consists of four major steps such as data dimension reduction,distance similarity index introduction,double cluster head technique and node dormancy approach.This protocol differs from normal hierarchical routing protocols in formulating the Cluster Head(CH)selection technique.According to node’s position and residual energy,optimal cluster-head function is generated,and every CH is elected by this formulation.For a 3D spherical structure,under the same network condition,the performance of the proposed ILDA with Improved Dynamic Hierarchical Clustering(IDHC)is compared with Distributed Energy-Efficient Clustering(DEEC),Hybrid Energy Efficient Distributed(HEED)and Stable Election Protocol(SEP)techniques.It is observed that the proposed ILDA based IDHC approach provides better results with respect to Throughput,network residual energy,network lifetime and first node death round.

A Comparison of Two Linear Discriminant Analysis Methods That Use Block Monotone Missing Training Data

We revisit a comparison of two discriminant analysis procedures, namely the linear combination classifier of Chung and Han (2000) and the maximum likelihood estimation substitution classifier for the problem of classifying unlabeled multivariate normal observations with equal covariance matrices into one of two classes. Both classes have matching block monotone missing training data. Here, we demonstrate that for intra-class covariance structures with at least small correlation among the variables with missing data and the variables without block missing data, the maximum likelihood estimation substitution classifier outperforms the Chung and Han (2000) classifier regardless of the percent of missing observations. Specifically, we examine the differences in the estimated expected error rates for these classifiers using a Monte Carlo simulation, and we compare the two classifiers using two real data sets with monotone missing data via parametric bootstrap simulations. Our results contradict the conclusions of Chung and Han (2000) that their linear combination classifier is superior to the MLE classifier for block monotone missing multivariate normal data.

Image Processing System for Air Classification Using Linear Discriminant Analysis

An air classifier is used in the recycling process of covered electric wire in the recycling factories, in which the covered electric wires are crushed, sieved, and classified by the air classifier, which generates wastes. In these factories, operators manually adjust the air flow rate while checking the wastes discharged from the separator outlet. However, the adjustments are basically done by trial and error, and it is difficult to do them appropriately. In this study, we tried to develop the image processing system that calculates the ratio of copper (Cu) product and polyvinyl chloride (PVC) in the wastes as a substitute for the operator’s eyes. Six colors of PVC (white, gray, green, blue, black, and red) were used in the present work. An image consists of foreground and background. An image’s regions of interest are objects (Cu particles) in its foreground. However, the particles having a color similar to the background color are buried in the background. Using the difference of two color backgrounds, we separated particles and background without dependent of background. The Otsu’ thresholding was employed to choose the threshold to maximize the degree of separation of the particles and background. The ratio of Cu to PVC pixels from mixed image was calculated by linear discriminant analysis. The error of PVC pixels resulted in zero, whereas the error of Cu pixels arose to 4.19%. Comparing the numbers of Cu and PVC pixels within the contour, the minority of the object were corrected to the majority of the object. The error of Cu pixels discriminated as PVC incorrectly became zero percent through this correction.

Analysis and Experiments on Two Linear Discriminant Analysis Methods

Foley-Sammon linear discriminant analysis (FSLDA) and uncorrelated linear discriminant analysis (ULDA) are two well-known kinds of linear discriminant analysis. Both ULDA and FSLDA search the kth discriminant vector in an n-k+1 dimensional subspace, while they are subject to their respective constraints. Evidenced by strict demonstration, it is clear that in essence ULDA vectors are the covariance-orthogonal vectors of the corresponding eigen-equation. So, the algorithms for the covariance-orthogonal vectors are equivalent to the original algorithm of ULDA, which is time-consuming. Also, it is first revealed that the Fisher criterion value of each FSLDA vector must be not less than that of the corresponding ULDA vector by theory analysis. For a discriminant vector, the larger its Fisher criterion value is, the more powerful in discriminability it is. So, for FSLDA vectors, corresponding to larger Fisher criterion values is an advantage. On the other hand, in general any two feature components extracted by FSLDA vectors are statistically correlated with each other, which may make the discriminant vectors set at a disadvantageous position. In contrast to FSLDA vectors, any two feature components extracted by ULDA vectors are statistically uncorrelated with each other. Two experiments on CENPARMI handwritten numeral database and ORL database are performed. The experimental results are consistent with the theory analysis on Fisher criterion values of ULDA vectors and FSLDA vectors. The experiments also show that the equivalent algorithm of ULDA, presented in this paper, is much more efficient than the original algorithm of ULDA, as the theory analysis expects. Moreover, it appears that if there is high statistical correlation between feature components extracted by FSLDA vectors, FSLDA will not perform well, in spite of larger Fisher criterion value owned by every FSLDA vector. However, when the average correlation coefficient of feature components extracted by FSLDA vectors is at a low level, the performance of FSLDA are comparable with ULDA.

DIMENSIONALITY REDUCTION BASED ON SVM AND LDA,AND ITS APPLICATION TO CLASSIFICATION TECHNIQUE

Some dimensionality reduction （DR） approaches based on support vector machine （SVM） are proposed. But the acquirement of the projection matrix in these approaches only considers the between-class margin based on SVM while ignoring the within-class information in data. This paper presents a new DR approach, call- ed the dimensionality reduction based on SVM and LDA （DRSL）. DRSL considers the between-class margins from SVM and LDA, and the within-class compactness from LDA to obtain the projection matrix. As a result, DRSL can realize the combination of the between-class and within-class information and fit the between-class and within-class structures in data. Hence, the obtained projection matrix increases the generalization ability of subsequent classification techniques. Experiments applied to classification techniques show the effectiveness of the proposed method.

Face Recognition Using LDA with Wavelet Transform Approach

Linear Discriminant Analysis （LDA） is one of the principal techniques used in face recognition systems. LDA is well-known scheme for feature extraction and dimension reduction. It provides improved performance over the standard Principal Component Analysis （PCA） method of face recognition by introducing the concept of classes and distance between classes. This paper provides an overview of PCA, the various variants of LDA and their basic drawbacks. The paper also has proposed a development over classical LDA, i.e., LDA using wavelets transform approach that enhances performance as regards accuracy and time complexity. Experiments on ORL face database clearly demonstrate this and the graphical comparison of the algorithms clearly showcases the improved recognition rate in case of the proposed algorithm.

Soft measurement of wood defects based on LDA feature fusion and compressed sensor images

We proposed a detection method for wood defects based on linear discriminant analysis (LDA) and the use of compressed sensor images. Wood surface images were captured, using a camera Oscar F810C IRF camera, and then the image segmentation was performed, and the defect features were extracted from wood board images. To reduce the processing time, LDA algorithm was used to integrate these features and reduce their dimensions. Features after fusion were used to construct a data dictionary and a compressed sensor was designed to recognize the wood defects types. Of the three major defect types, 50 images live knots, dead knots, and cracks were used to test the effects of this method. The average time for feature fusion and classification was 0.446 ms with the classification accuracy of 94%.

Efficient face recognition method based on DCT and LDA

It has been demonstrated that the linear discriminant analysis (LDA) is an effective approach in face recognition tasks. However, due to the high dimensionality of an image space, many LDA based approaches first use the principal component analysis (PCA) to project an image into a lower dimensional space, then perform the LDA transform to extract discriminant feature. But some useful discriminant information to the following LDA transform will be lost in the PCA step. To overcome these defects, a face recognition method based on the discrete cosine transform (DCT) and the LDA is proposed. First the DCT is used to achieve dimension reduction, then LDA transform is performed on the lower space to extract features. Two face databases are used to test our method and the correct recognition rates of 97.5% and 96.0% are obtained respectively. The performance of the proposed method is compared with that of the PCA+ LDA method and the results show that the method proposed outperforms the PCA+ LDA method.

Fault detection method with PCA and LDA and its application to induction motor

A feature extraction and fusion algorithm was constructed by combining principal component analysis(PCA) and linear discriminant analysis(LDA) to detect a fault state of the induction motor.After yielding a feature vector with PCA and LDA from current signal that was measured by an experiment,the reference data were used to produce matching values.In a diagnostic step,two matching values that were obtained by PCA and LDA,respectively,were combined by probability model,and a faulted signal was finally diagnosed.As the proposed diagnosis algorithm brings only merits of PCA and LDA into relief,it shows excellent performance under the noisy environment.The simulation was executed under various noisy conditions in order to demonstrate the suitability of the proposed algorithm and showed more excellent performance than the case just using conventional PCA or LDA.

基于direct LDA的幅度谱子空间雷达目标识别

针对高分辨距离像(HRRP)可分性低和维数高的问题,提出一种新的雷达自动目标识别(RATR)方法:dLDA&SVM。先采用直接线性判别分析在HRRP的幅度谱空间进行特征提取,然后在子空间中采用角域均值模板库训练one-against-all支撑向量机(SVM)多类分类器进行目标识别。并设计了最短距离分类器与SVM分类器比较。基于外场实测数据的实验结果表明,与LDA幅度谱子空间法,幅度谱原空间法相比,dLDA&SVM可显著降低数据维数并提高识别性能。

核Direct LDA子空间高光谱影像地物分类

为降低高光谱影像的数据维数,提高地物分类识别效率,提出了一种地物分类方法——核直接线性判别分析(Kernel Direct Linear Discriminant Analysis,KDLDA)子空间法;并推导出类先验概率的一般形式下KDLDA的解。KDLDA子空间法先采用KDLDA提取遥感影像的非线性可分特征,然后在KDLDA子空间采用最小距离分类器进行分类识别。机载可见光/红外成像光谱仪(Airborne Visible/Infrared Imaging Spectrometer,AVIRIS)的高光谱影像识别结果表明,相比原空间法、LDA子空间法、直接线性判别分析(Direct Linear Discriminant Analysis,DLDA)子空间法、核线性判别分析(Kernel Linear Discriminant Analysis,KLDA)子空间法,KDLDA子空间法可显著提高识别效率。

基于Direct LDA的相关向量机遥感图像分类

相关向量机是一种新型的基于贝叶斯统计学习框架的有监督机器学习算法,但是存在对高光谱数据分类精度不高的问题。针对此问题,文中提出了一种改进的算法,该算法将直接线性判别分析法与相关向量机相结合,对高光谱数据进行特征提取,然后采用相关向量机进行遥感图像分类。文中实验数据采用1992年Indian Pines高光谱数据。实验结果显示,与采用相关向量机直接分类,线性判别分析法(LDA)与相关向量机结合的两种方法的分类结果相比,文中算法能够明显降低数据维度,总体分类精度也提升了约1%。

Kernel Model Applied in Kernel Direct Discriminant Analysis for the Recognition of Face with Nonlinear Variations

A kernel-based discriminant analysis method called kernel direct discriminant analysis is employed, which combines the merit of direct linear discriminant analysis with that of kernel trick. In order to demonstrate its better robustness to the complex and nonlinear variations of real face images, such as illumination, facial expression, scale and pose variations, experiments are carried out on the Olivetti Research Laboratory, Yale and self-built face databases. The results indicate that in contrast to kernel principal component analysis and kernel linear discriminant analysis, the method can achieve lower （7%） error rate using only a very small set of features. Furthermore, a new corrected kernel model is proposed to improve the recognition performance. Experimental results confirm its superiority （1% in terms of recognition rate） to other polynomial kernel models.

A positioning method for maize seed laser-cutting slice using linear discriminant analysis based on isometric distance measurement

It is necessary that vision system should aid laser-cutting manipulator to position the specified part of each maize seed for getting the slice breeding genotype analysis with high throughput.Each of trivial maize seeds should be recognized and positioned in a certain posture.Correlation area ratio(CAR)is defined as the metric of pixel attribute.A large template of round mask is adopted for seed morphological detection to measure the CAR values.We get the feature points extracted from the seed image through the isometric mapping operation.Iterative processes of linear discriminant analysis search the morphological data space to learn non-linear transformations to the space where data are linearly separable.Linear discriminant analysis utilizes the data directional distribution to position the major axis and distinguish different parts of maize seed.The labeling partition operation is applied for picking out the scattered pieces to be finely clustered.Without denoising process,the feature region could be recognized with accuracies by the synthetical methods.Extensive experiments on a large amount of seeds demonstrate the effectiveness of proposed methods.