Statistical Recognition Method of Binary BCH Code

In this paper, a statistical recognition method of the binary BCH code is proposed. The method is applied to both primitive and non-primitive binary BCH code. The block length is first recognized based on the cyclic feature under the condition of the frame length known. And then candidate polynomials are achieved which meet the restrictions. Among the candidate polynomials, the most optimal polynomial is selected based on the minimum rule of the weights sum of the syndromes. Finally, the best polynomial was factorized to get the generator polynomial recognized. Simulation results show that the method has strong capability of anti-random bit error. Besides, the algorithm proposed is very simple, so it is very practical for hardware im-plementation.

An Efficient Bar Code Image Recognition Algorithm for Sorting System

In the sorting system of the production line,the object movement,fixed angle of view,light intensity and other reasons lead to obscure blurred images.It results in bar code recognition rate being low and real time being poor.Aiming at the above problems,a progressive bar code compressed recognition algorithm is proposed.First,assuming that the source image is not tilted,use the direct recognition method to quickly identify the compressed source image.Failure indicates that the compression ratio is improper or the image is skewed.Then,the source image is enhanced to identify the source image directly.Finally,the inclination of the compressed image is detected by the barcode region recognition method and the source image is corrected to locate the barcode information in the barcode region recognition image.The results of multitype image experiments show that the proposed method is improved by 5+times computational efficiency compared with the former methods,and can recognize fuzzy images better.

Recognition of Partially Occluded Objects Based on Segmentation by Median Filtering of Extended Direction Code

The image contour is segmented into lines, arcs and smooth curves by median filtering of extended direction code. Based on this segmentation, a set of new local invariant features are proposed to recognize partially occluded objects, which is more reasonable compared with conventional corner features. The matching results of some typical examples shows that these features are robust ,effective in recognition.

Palmprint Recognition Based on Statistical Local Binary Orientation Code

A novel coding based method named as local binary orientation code （LBOCode） for palmprint recognition is proposed. The palmprint image is firstly convolved with a bank of Gabor filters, and then the orientation information is attained with a winner-take-all rule. Subsequently, the resulting orientation mapping array is operated by uniform local binary pattern. Accordingly, LBOCode image is achieved which contains palmprint orientation information in pixel level. Further we divide the LBOCode image into several equal-size and nonoverlapping regions, and extract the statistical code histogram from each region independently, which builds a global description of palmprint in regional level. In matching stage, the matching score between two palmprints is achieved by calculating the two spatial enhanced histograms＇ dissimilarity, which brings the benefit of computational simplicity. Experimental results demonstrate that the proposed method achieves more promising recognition performance compared with that of several state-of-the-art methods.

Code generation and recognition using a modified ejection system in die-casting process

A code-generation and recognition technology that uses a modified ejection system in the diecasting process is presented.To achieve the highest level of quality management,the first requirement in the manufacturing process is to establish a product management system according to the specific product unit.Thus,a method to individually identify each product,such as a barcode or QR code,is required during the production process.Products manufactured in the die-casting process always have ejector pin(EP)marks.Herein,an ejection system was modified to generate a unique code using EP marks.This ejection system has two features:an EP with a modified head to show the direction of rotation,and a function to dependently rotate EPs(five or six EPs)with a constant angle.The EPs are numbered according to the rotation angle.Thus,the EP marks can be viewed as a five-or six-digit code.A program was also developed to individually identify the products by automatically detecting and reading the EPs using deep learning-based object detection and classification technology.

Face Recognition Using Chain Codes

Face recognition is an active area of biometrics. This study investigates the use of Chain Codes as features for recognition purpose. Firstly a segmentation method, based on skin color model was applied, followed by contour detection, then the chain codes of the contours were determined. The first difference of chain codes were calculated since the latter is invariant to rotation. The features were calculated and stored in a matrix. Experiments were performed using the University of Essex Face database, and results show a recognition rate of 95% with this method, when compared with Principal Components Analysis (PCA) giving 87.5% recognition rate.

A Codebook Design Method for Robust VQ-Based Face Recognition Algorithm

In this paper, we present a theoretical codebook design method for VQ-based fast face recognition algorithm to im-prove recognition accuracy. Based on the systematic analysis and classification of code patterns, firstly we theoretically create a systematically organized codebook. Combined with another codebook created by Kohonen’s Self-Organizing Maps (SOM) method, an optimized codebook consisted of 2×2 codevectors for facial images is generated. Experimental results show face recognition using such a codebook is more efficient than the codebook consisted of 4×4 codevector used in conventional algorithm. The highest average recognition rate of 98.6% is obtained for 40 persons’ 400 images of publicly available face database of AT&T Laboratories Cambridge containing variations in lighting, posing, and expressions. A table look-up (TLU) method is also proposed for the speed up of the recognition processing. By applying this method in the quantization step, the total recognition processing time achieves only 28 msec, enabling real-time face recognition.

Performance analysis and code recognition for dual N-ary orthogonal hybrid modulation systems

A dual N-ary orthogonal hybrid modulation system is introduced in this paper,which can increasethe data rate greatly compared with conventional N-ary orthogonal spread spectrum system,so it can beused for high rate data communication.Then,three code recognition algorithms are presented for dual N-ary orthogonal hybrid modulation system and the analytic bit error rate(BER)performance of the systemin additive white Gaussian noise(AWGN)and flat Rayleigh fading channel is derived.Finally,the com-puter simulation of the system with three code recognition algorithms is performed,which shows that thesimplified maximum a posteriori(MAP)algorithm is the best for the system with a compromise betweenthe performance and the complexity.

Silhouettes Based Human Action Recognition in Video via Procrustes Analysis and Fisher Vector Coding

This paper proposes a framework for human action recognition based on procrustes analysis and Fisher vector coding(FVC).Firstly,we applied a pose feature extracted from silhouette image by employing Procrustes analysis and local preserving projection(LPP).Secondly,the extracted feature can preserve the discriminative shape information and local manifold structure of human pose and is invariant to translation,rotation and scaling.Finally,after the pose feature was extracted,a recognition framework based on FVC and multi-class supporting vector machine was employed to classify the human action.Experimental results on benchmarks demonstrate the effectiveness of the proposed method.

Robust Speech Recognition System Using Conventional and Hybrid Features of MFCC,LPCC,PLP,RASTA-PLP and Hidden Markov Model Classifier in Noisy Conditions

In recent years, the accuracy of speech recognition (SR) has been one of the most active areas of research. Despite that SR systems are working reasonably well in quiet conditions, they still suffer severe performance degradation in noisy conditions or distorted channels. It is necessary to search for more robust feature extraction methods to gain better performance in adverse conditions. This paper investigates the performance of conventional and new hybrid speech feature extraction algorithms of Mel Frequency Cepstrum Coefficient (MFCC), Linear Prediction Coding Coefficient (LPCC), perceptual linear production (PLP), and RASTA-PLP in noisy conditions through using multivariate Hidden Markov Model (HMM) classifier. The behavior of the proposal system is evaluated using TIDIGIT human voice dataset corpora, recorded from 208 different adult speakers in both training and testing process. The theoretical basis for speech processing and classifier procedures were presented, and the recognition results were obtained based on word recognition rate.

Recognition of vertical vowel graphemes of Korean characters based on combination of vowel graphemes

Korean characters consist of 2 dimensional distributed consonantal and vowel graphemes. The purpose of reducing the 2 dimensional characteristics of Korean characters to linear arrangements at early stage of character recognition is to decrease the complexity of following recognition task. By defining the identification codes for the vowel graphemes of Korean characters, the rules for combination of vowel graphemes are established, and a recognition algorithm based on the rules for combination of vowel graphemes, is therefore proposed for vertical vowel graphemes. The algorithm has been proved feasilbe through demonstrating simulations.

ISAR target recognition based on non-negative sparse coding

Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar （ISAR） target recognition, this paper imports the concept of visual perception and presents a novel method, which is based on the combination of non-negative sparse coding （NNSC） and linear discrimination optimization, to recognize targets in ISAR images. This method implements NNSC on the matrix constituted by the intensities of pixels in ISAR images for training, to obtain non-negative sparse bases which characterize sparse distribution of strong scattering centers. Then this paper chooses sparse bases via optimization criteria and calculates the corresponding non-negative sparse codes of both training and test images as the feature vectors, which are input into k neighbors classifier to realize recognition finally. The feasibility and robustness of the proposed method are proved by comparing with the template matching, principle component analysis （PCA） and non-negative matrix factorization （NMF） via simulations.

Human Mouth-State Recognition Based on Image Warping and Sparse Representation Combined with Homotopy

It is often necessary to recognize human mouth-states for detecting the number of audio sources and improving the speech recognition capability of an intelligent robot auditory system. A human mouth-state recognition method based on image warping and sparse representation( SR) combined with homotopy is proposed.Using properly warped training mouth-state images as atoms of the overcomplete dictionary overcomes the impact of the diversity of the mouths' scales,shapes and positions so that further improvement of the robustness can be achieved and the requirement for a large number of training samples can be relieved. The homotopy method is employed to compute the expansion coefficients effectively,i. e.,for sparse coding. The orthogonal matching pursuit( OMP) is also tested and compared with the homototy method. Experimental results and comparisons with the state-of-the-art methods have proved the effectiveness of the proposed approach.

A SPEECH RECOGNITION METHOD USING COMPETITIVE AND SELECTIVE LEARNING NEURAL NETWORKS

On the basis of asymptotic theory of Gersho, the isodistortion principle of vector clustering was discussed and a kind of competitive and selective learning method (CSL) which may avoid local optimization and have excellent result in application to clusters of HMM model was also proposed. In combining the parallel, self organizational hierarchical neural networks (PSHNN) to reclassify the scores of every form output by HMM, the CSL speech recognition rate is obviously elevated.

Biometric Signature of Private Key by Reliable Iris Recognition Based on Flexible-ICA Algorithm

The numerical world is under a fast development generating facilities and threats. The recommended solutions are especially the protection of information in all its states. The levels of protection show a discrepancy from an application to another;governmental, commercial or even cybercriminal. The infrastructure used in modern cryptography is based on public key cryptosystem. The problem is how to make safe the private key and to memorize it without difficulties and damages. This paper introduces a biometric solution of owner signature generating an encryption of the key using the iris recognition kept in a smart card. Several precautions were taken to guarantee the safety and the availability of the use of the private key. They are two essential goals to attest: the quality of the service and the robustness of suggested safety. Being the quality of the service, the used iris recognition is based on a new emerging method founded on Flexible-ICA algorithm. This method offers a better Equal Error rate compared to other methods previously used. This quality of recognition was also reinforced by an encoding of error using a flag and finally Reed Solomon encoder. For recommended safety, a scheme based on block encryption is used. The proposed scheme is Propagating Cipher Block chaining which offers a very propagation of a high level of confusion and diffusion. Indeed, the robustness of this cryptographic process was studied by setting up strict criteria of safety.

MAP-based Audio Coding Compensation for Speaker Recognition

The performance of the speaker recognition system declines when training and testing audio codecs are mismatched. In this paper, based on analyzing the effect of mismatched audio codecs in the linear prediction cepstrum coefficients, a method of MAP-based audio coding compensation for speaker recognition is proposed. The proposed method firstly sets a standard codec as a reference and trains the speaker models in this codec format, then learns the deviation distributions between the standard codec format and the other ones, next gets the current bias via using a small number adaptive data and the MAP-based adaptive technique, and then adjusts the model parameters by the type of coming audio codec format and its related bias. During the test, the features of the coming speaker are used to match with the adjusted model. The experimental result shows that the accuracy reached 82.4% with just one second adaptive data, which is higher 5.5% than that in the baseline system.

Face Recognition Algorithm Fusing Monogenic Binary Coding and Collaborative Representation

Monogenic binary coding （MBC） have been known to be effective for local feature extraction, while sparse or collaborative representation based classification （CRC） has shown interesting results in robust face recognition. In this paper, a novel face recognition algorithm of fusing MBC and CRC named M-CRC is proposed; in which the dimensionality problem is resolved by projection matrix. The proposed algorithm is evaluated on benchmark face databases, including AR, PolyU-NIR and CAS-PEAL. The results indicate a significant increase in the performance when compared with state-of-the-art face recognition methods.