Comparative Study on Hidden Markov Model Versus Support Vector Machine: A Component-Based Method for Better Face Recognition

Face Recognition is an efficient technique and one of the most liked biometric software application for the identification and verification of specific individual in a digital image by analysing and comparing patterns. This paper presents a survey on well-known techniques of face recognition. The primary goal of this review is to observe the performance of different face recognition algorithms such as SVM (Support Vector Machine), CNN (Convolutional Neural Network), Eigenface based algorithm, Gabor Wavelet, PCA (Principle Component Analysis) and HMM (Hidden Markov Model). It presents comparative analysis about the efficiency of each algorithm. This paper also figure out about various face recognition applications used in real world and face recognition challenges like Illumination Variation, Pose Variation, Occlusion, Expressions Variation, Low Resolution and Ageing in brief. Another interesting component covered in this paper is review of datasets available for face recognition. So, must needed survey of many recently introduced face recognition aspects and algorithms are presented.

There are many techniques for face recognition which compare the desired face image with a set of faces images stored in a database. Most of these techniques fail if faces images are exposed to high-density noise. Therefore, it is necessary to find a robust method to recognize the corrupted face image with a high density noise. In this work, face recognition algorithm was suggested by using the combination of de-noising filter and PCA. Many studies have shown that PCA has ability to solve the problem of noisy images and dimensionality reduction. However, in cases where faces images are exposed to high noise, the work of PCA in removing noise is useless, therefore adding a strong filter will help to improve the performance of recognizing faces in the case of existing high-density noise in faces images. In this paper, Median filter, Hybrid Median Filter, Adaptive Median filter, and Adaptive Weighted Mean Filter were used to remove the noise from the faces images, and they were compared in order to use the best of these filters as a pre-processing step before the face recognition process. Experimental results showed that the Adaptive Weighted Mean Filter gave better results compared with the other filters. Thus, the performance of face recognition process was improved under high-density noise using the Adaptive Weighted Mean Filter and Principal Component Analysis. For the corrupted images by 90 % noise density, Recognition rate by using Median Filter reached 0% and 33% by using Hybrid Median Filter. While Recognition rate by using the Adaptive Median Filter and Adaptive Weighted Mean Filter reached 100%.

Digital image recognition based on Fractional-order-PCA-SVM coupling algorithm

A low-power and real-time hidden Markov model (HMM) accelerator is proposed for gesture user interfaces on wearable smart devices. HMM algorithm is widely used for sequence recognitions such as speech recognition and gesture recognition due to its best-in-class recognition accuracy. However, the HMM algorithm incorporates high computational complexity and requires massive memory bandwidth for sequence matches. There have been studies on hardware acceleration of the HMM algorithm to resolve these issues, but they were focused on the speech recognition and did not incorporate the motion orientation capability required for the gesture recognition case. In this paper, we propose an HMM accelerator incorporating the motion orientation block for gesture recognitions on wearable devices. Binary search is exploited in the motion orientation to avoid the division and arctangent associated with the orientation and reduce its arithmetic complexity. In addition, gesture models are clustered in the gesture database to save the memory bandwidth by reducing memory transactions. Moreover, logarithmic arithmetic is used in Viterbi decoding in the HMM for more reduction in its complexity. Thanks to these schemes, this work achieves 25.6% power reduction compared with a plain hardware implementation of the gesture recognizing HMM.

The movements of talkers' face, nose, mouth and throat are known to convey visual cues and represent several different kinds of informationl, and that can improve speech recognition rate, especially for persons with speech-impairments. We proposed a new speech recognition method using these visual features and hidden Markov model (HMM). Based on global optimisation, a new genetic algorithm (GA) for training HMM was proposed. Six chinese vowels were taken as the experimental data, ten handicapped speakers were taken as the testee. Recognition experiments show that the method is effective and high speed and accuracy for speech recognition. At present, the average recognition rate is 91.47% using improved HMM and 88.96% using the classic training HMM algorithm, So the features has very good robustness and the improved HMM is very good.

Support vector machine (SVM) is always used for face recognition. However, kernel function selection is a key problem for SVM. This paper tries to make some contributions to this problem with focus on optimizing the parameters in the selected kernel function to improve the accuracy of classification and recognition of SVM. Firstly, an improved artificial fish swarm optimization algorithm (IAFSA) is proposed to optimize the parameters in SVM. In the improved version of artificial fish swarm optimization algorithm, the visual distance and the step size of artificial fish are adjusted adaptively. In the early stage of convergence, artificial fish are widely distributed, and the visual distance and step size take larger values to accelerate the convergence of the algorithm. In the later stage of convergence, artificial fish gathered gradually, and the visual distance and the step size were given small values to prevent oscillation. Then the optimized SVM is used to recognize face images. Simultaneously, in order to improve the accuracy rate of face recognition, an improved local binary pattern (ILBP) is proposed to extract features of face images. Numerical results show the advantage of our new algorithm over a range of existing algorithms.

Visual-based action recognition has already been widely used in human-machine interfaces. However it is a challenging research to recognise the human actions from different viewpoints. In order to solve this issue, a novel multi-view space Hidden Markov Models (HMMs) algorithm for view-invariant action recognition is proposed. Firstly a view-insensitive feature representation by combining the bag-of-words of interest point with the amplitude histogram of optical flow is utilised for describing the human action sequences. The combined features could not only solve the problem that there was no possibility in establishing an association between traditional bag-of-words of interest point method and HMMs, but also greatly reduce the redundancy in the video. Secondly the view space is partitioned into multiple sub-view space according to the camera rotation viewpoint. Human action models are trained by HMMs algorithm in each sub-view space. By computing the probabilities of the test sequence (i.e. observation sequence) for the given multi-view space HMMs, the similarity between the sub-view space and the test sequence viewpoint are analysed during the recognition process. Finally the action with unknown viewpoint is recognised via the probability weighted combination. The experimental results on multi-view action dataset IXMAS demonstrate that the proposed approach is highly efficient and effective in view-invariant action recognition.

According to statistics from the Global Burden of Cancer Study (Globocon) of the World Health Organization (WHO), cancer, particularly breast cancer, is a severe health issue in Indonesia with 68,858 new cases and 22,000 deaths recorded in 2020. Ultrasonography (USG) technology is acknowledged as one of the potentials to support early detection, which is vital in reducing mortality from breast cancer. This study focuses on classifying ultrasound images using the Support Vector Machine (SVM) algorithm, GLCM feature extraction, Min-Max normalization, and Mutual Information with SelectKBest Feature Selection. From several experiments using the SVM algorithm with various combinations of parameter values that have been set and different Tests, namely using a Train/Test Split with a proportion of 80/20 and K-Fold Cross Validation, it shows that the SVM algorithm is capable of classifying ultrasound images of breast cancer. into two categories (Benign Tumor and Malignant Tumor) with the same maximum accuracy of 79% after applying the SMOTE Balancing Data technique or without using the Balancing Data technique. As a result, the Support Vector Machine (SVM) algorithm has the potential to be an effective model for identifying breast cancer ultrasound images, both on data from the original set that has not been balanced and data from the set that has been balanced.

본 논문에서는 음성 인식률 개선에 관한 방법을 제시하고 연구하였다. 기존의 음성 검출 방법 중 많이 이용되고 있는 HMM(Hidden Markov Model) 알고리즘을 이용하여서 음성을 검출하였다. 실험은 음성 검출과 음성 인식의 두 가지 방법으로 진행하였다. 음성 검출은 음성의 단위로 영교차율을 구하여 데이터의 유무를 판별하였다. 음성 인식은 음성의 형상의 패턴을 분석한 후 학습된 패턴과 비교 하는 형식으로 분석하였다. 실험 결과, 제안된 음성 형상의 패턴인식 이용한 알고리즘은 92%의 음성 인식률을 얻어 80%의 기존 HMM 알고리즘에 비해서 약 12%의 향상된 인식률을 얻을 수 있었다. In this paper, we suggested a method about the improvement of the voice recognition rate and carried out a study on it. In general, voices were detected by applying the most widely-used method, HMM (Hidden Markov Model) algorithm. Regarding the method of detecting voices, the zero crossing ratio was calculated based on the units of voices before the existence of data was identified. Regarding the method of recognizing voices, the patterns shown by the forms of voices were analyzed before they were compared to the patterns which had already been learned. According to the results of the experiment, in comparison with the recognition rate of 80% shown by the existing HMM algorithm, the suggested algorithm based on the recognition of the patterns shown by the forms of voices showed the recognition rate of 92%, reflecting the recognition rate improved by about 12% compared to the existing one.

Face recognition is a common means of identity authentication. Mobile learning platform login technology has developed from user name and password to face recognition. In order to improve effectively the rate of face recognition, this paper proposes a kind of face recognition algorithm based on self-adaptive blocking local binary pattern (LBP) and dual channel convolutional neural network (CNN) with different convolution kernels. Firstly, the Gamma correction, the Mallet wavelet filtering and normalization are used to preprocess the face image. The face image is decomposed and reconstructed by 2-layer Mallet wavelet to filter out the interference signal effectively. Although the general LBP operator extracts the overall texture and contour features of the face image, the distribution of the bright spot, dark spot and other micro details cannot be fully characterized. In order to solve this problem, integral projection is introduced to project the image horizontally and vertically. The extreme points of the projection represent the texture mutation points of the face image in the horizontal and vertical directions. These extreme points are used as the boundary of the image blocking, and the LBP value of the face image is extracted by the self-adaptive blocking strategy. Combining the features of k-nearest neighbor classifier and softmax, a k-softmax classification method is proposed to classify and recognize the face image labels. After two channel network structure training, this method is tested on Yale, ORL, extended Yale B and self-built face databases by five experiments, comparing with other face recognition algorithms. The results show that the proposed method based on SAB-LBP and dual channel CNN has high recognition rate and computational efficiency.

In this study, a data-driven fault diagnosis method was developed for solid oxide fuel cell (SOFC) systems. First, the complete experimental data was obtained following the design of the SOFC system experiments. Then, principal component analysis (PCA) was performed to reduce the dimensionality of the obtained experimental data. Finally, the fault diagnosis algorithms were designed by support vector machine (SVM) and BP neural network to identify and prevent the reformer carbon deposition and heat exchanger rupture faults, respectively. The research results show that both SVM and BP fault diagnosis algorithms can achieve online fault identification. The PCA + SVM algorithm was compared with the SVM algorithm, BP algorithm, and PCA + BP algorithm, and the results show that the PCA + SVM algorithm is superior in terms of running time and accuracy, the diagnosis accuracy reached more than 99%, and the running time was within 20 s. The corresponding system optimization scheme is also proposed.

Dilihat dari sisi konsumen, ada berbagai aspek yang mempengaruhi konsumen untuk membeli suatu kendaraan bermotor. Hal ini karena masing-masing orang memiliki minat dan kebutuhan yang berbeda. Oleh karena itu, tujuan dari penelitian ini adalah untuk mengetahui kelompok umur dan profesi apa saja yang menjadi pelanggan potensial di SPS Motor Honda Lombok Timur. Metode penelitian yang digunakan adalah metode analitik deskriptif, dimana peneliti mengambil data-data penjualan sepeda motor dari SPS Motor Honda Lombok Timur, yang selanjutnya diolah dan dianalisis menggunakan software Rapidminer 5. Hasil analisis data tersebut selanjutnya dideskripsikan dengan detail mengenai kelompok pelanggan potensial. Berdasarkan analisis yang telah dilakukan, dapat ditarik kesimpulan bahwa kelompok yang termasuk dalam pelanggan potensial dari SPS Motor Honda Lombok Timur adalah kelompok dengan kriteria umur berkisar 33-46 tahun yang berprofesi sebagai wiraswasta dan petani, Hal ini disebabkan karena, pelanggan tersebut memiliki penghasilan dengan usia produktif. Sedangkan kelompok pelanggan yang tidak potensial ada 2 irisan yaitu yang pertama apabila kategori usia produktif tapi tidak memiliki penghasilan dengan rentang umur 17-32 tahun dengan profesi pelajar dan wiraswasta. Kedua yaitu, apabila kategori usia tidak produktif dengan rentang usia 47-73 tahun dan tidak memiliki penghasilan dengan profesi petani dan wiraswata.DOI : 10.29408/jit.v2i2.1447

Facial images are of critical importance in many real-world applications from gaming to surveillance. The current literature on facial image analysis, from face detection to face and facial expression recognition, are mainly performed in either RGB, Depth (D), or both of these modalities. But, such analyzes have rarely included Thermal (T) modality. This paper paves the way for performing such facial analyzes using synchronized RGB-D-T facial images by introducing a database of 51 persons including facial images of different rotations, illuminations, and expressions. Furthermore, a face recognition algorithm has been developed to use these images. The experimental results show that face recognition using such three modalities provides better results compared to face recognition in any of such modalities in most of the cases.

The application of HMM algorithm based music note feature recognition teaching in universities

Facial recognition technology has been developed and widely used for decades. However, it has also made privacy concerns and researchers’ expectations for facial recognition privacy-preserving technologies. To provide privacy, detailed or semantic contents in face images should be obfuscated. However, face recognition algorithms have to be tailor-designed according to current obfuscation methods, as a result the face recognition service provider has to update its commercial off-the-shelf (COTS) products for each obfuscation method. Meanwhile, current obfuscation methods have no clearly quantified explanation. This paper presents a universal face obfuscation method for a family of face recognition algorithms using global or local structure of eigenvector space. By specific mathematical explanations, we show that the upper bound of the distance between the original and obfuscated face images is smaller than the given recognition threshold. Experiments show that the recognition degradation is 0% for global structure based and 0.3%-5.3% for local structure based, respectively. Meanwhile, we show that even if an attacker knows the whole obfuscation method, he/she has to enumerate all the possible roots of a polynomial with an obfuscation coefficient, which is computationally infeasible to reconstruct original faces. So our method shows a good performance in both privacy and recognition accuracy without modifying recognition algorithms.