# Use Brain-Like Audio Features to Improve Speech Recognition Performance

Authors: Junyi Wang; Bingyao Li; Jiahong Zhang
Journal: Journal of Sensors
 (2022)

---

## Abstract

Speech recognition plays an important role in the field of human-computer interaction through the use of acoustic sensors, but speech recognition is technically difficult, has complex overall logic, relies heavily on neural network algorithms, and has extremely high technical requirements. In speech recognition, feature extraction is the first step in speech recognition for recovering and extracting speech features. Existing methods, such as Meier spectral coefficients (MFCC) and spectrograms, lose a large amount of acoustic information and lack biological interpretability. Then, for example, existing speech self-supervised representation learning methods based on contrast prediction need to construct a large number of negative samples during training, and their learning effects depend on large batches of training, which requires a large amount of computational resources for the problem. Therefore, in this paper, we propose a new feature extraction method, called SHH (spike-H), that resembles the human brain and achieves higher speech recognition rates than previous methods. The features extracted using the proposed model are subsequently fed into the classification model. We propose a novel parallel CRNN model with an attention mechanism that considers both temporal and spatial features. Experimental results show that the proposed CRNN achieves an accuracy of 94.8% on the Aurora dataset. In addition, audio similarity experiments show that SHH can better distinguish audio features. In addition, the ablation experiments show that SHH is applicable to digital speech recognition.


---

## Body

## 1. Introduction

Speech recognition, which enables acoustic sensors for human-machine dialogue, is an important technology in the field of human-computer interaction, and it mainly consists of feature extraction and model fitting. Audio features simplify the signal sampled from the original waveform, thus speeding up the understanding of audio semantics by machines [1]. Commonly used feature extraction methods include Fast Fourier Transform (FFT), Short-Time Fourier Transform, Wavelet Transform, and Mel-filter bank. The results of audio feature extraction are available in various forms, such as spectrum, spectrogram, wavelet coefficients, Mel spectrogram, and Mel-filter coefficients (MFCC). Feature extraction methods are widely used in various audio tasks but are still limited to the transformation of the spectrum and the fitting of functions; this leads to a large loss of acoustic information and a lack of biointerpretability [2]. The audio processing method proposed in this study for performing speech recognition is based on audio processing in the human brain.Calvo-Gómez et al. used spike pulses to accurately encode the temporal location and size of audio features [3]. They used gammatones to decompose the audio signal and obtain spike maps. Gammatones are mathematical approximations of cochlear filters [4]. Spike maps provide better reproduction of audio features because they avoid blocking artifacts and temporal frequency trade-offs associated with conventional spectrogram representations. In response to the problem that existing speech self-supervised representation learning methods based on contrast prediction need to construct a large number of negative samples during training and their learning effects depend on large batches of training, which require a large amount of computational resources, a method using only positive samples for speech contrast learning is proposed and combined with a masking reconstruction task to obtain a multitask self-supervised speech representation learning method, which reduces the training complexity while reducing the training complexity and improving the performance of speech representation learning [5]. Among them, the positive-sample contrast learning task, borrowing ideas from the SimSiam method in image self-supervised representation learning, uses a twin network architecture to perform two data enhancements on the original speech signal with the same encoder, passing one branch through a forward network and the other branch using a gradient stopping strategy to adjust the model parameters to maximize the similarity of the outputs of the 2 branches [6]. The entire training process does not require the construction of negative samples and can be performed using small batches, which substantially improves the learning efficiency. Using the LibriSpeech corpus for self-supervised representation learning and fine-tuning tests in a variety of downstream tasks, comparative experiments show that the representation model obtained by the new method meets or exceeds the performance of existing mainstream speech representation learning models in several tasks [7].Inspired by biological neurons, spiking neuron networks (SNNs) are very popular in deep learning (DL). As a widely used neuronal model in SNNs, the Hodgkin-Huxley (HH) model describes the electrical behavior of giant squid axon membranes, and some biological spiking neuron models are based on it [8]. To solve the problem of computationally overloaded HH neuron model, leaky integrate-firing (LIF), regular spikes (RS, also called Izhikevich model), and other neuron models have been proposed. In the HH model, there are three ionic currents in the membrane: sodium ion current, potassium ion current, and leakage current. A set of ordinary differential equations can be used to model the dynamics of the cell membrane potential. When the potential reaches a certain value, a pulse is generated. We obtained audio features by feeding the spike maps into the HH model for further processing and used the output audio pulse sequence features for subsequent processing [9].In previous work, support vector machines (SVMs) and convolutional neural networks (CNNs) were used as classifiers after processing audio signals using SNNs [10]. We refer to common DL methods used in speech recognition and try to design a better network structure. CNNs and recurrent neural networks (RNNs) are widely used for speech recognition. CNNs can efficiently analyze and process input spectrograms and are suitable for processing spatial features, while RNNs can efficiently analyze time series data and are suitable for processing temporal features [11]. Therefore, the combination of these two methods is advantageous. The RNN layer is generally connected in series after the CNN layer. However, in this study, features are fed into the CNN and RNN in parallel and their outputs are combined so that both temporal and spatial features can be considered [12].The main contributions of this study can be summarized as follows: (1) we propose SHH, a feature extraction method that combines spikegram and HH models, which perform audio signal processing like the cochlea and neuron, respectively. We extracted spikegrams from the audio signal instead of transforming them spectrally. The spike maps were processed using the HH neuron model, and the number of pulses was used as an audio feature. Dynamic time warping (DTW) experiments and ablation experiments were performed on the Aurora dataset to demonstrate the efficiency of our method. (2) We propose a parallel CRNN for training and testing. Features are fed to ResCNN and BRNN blocks and stitched at the output to better accomplish the analysis from temporal and spatial perspectives. The network achieved an accuracy of 94.8% on the Aurora dataset, which is better than the accuracy obtained using other models [13].The rest of the paper is divided into the following sections. In Section2, the study that inspired us is summarized. In Section 3, the proposed method is described, including spikegram, HH features, and CRNN. In Section 4, the experimental results are presented, the results are discussed, and a comparison with previous work is made. Finally, conclusions are presented in Section 5.


## 2. Research Background

### 2.1. Brain-Like Audio Feature Extraction Methods

Recent research has focused on brain-like audio feature extraction methods. A two-layer probabilistic model was developed by Vaishnavi et al. A two-layer probabilistic generative model based on spike maps was developed for complex acoustic structures. Spike maps are not suitable for standard classification methods such as multilayer perceptrons (MLPs), which usually require normalized vectors as input data [14]. Li et al. proposed a data representation method to solve this problem and make it applicable to MLP classifiers. Spikegrams have been commonly used for audio tasks, such as audio watermarking, music genre classification, and automatic instrument recognition [15].SNNs have been used for speech recognition. Neuronal models such as LIF, RS, and HH have been used to process audio signals and applied to speech classification tasks. Xu and Cox compared the biological interpretability and implementation cost of various impulse neuron models [16]. The LIF and RS models are one-dimensional (1D) neuron models with low computational cost but poor biointerpretability compared to the HH model; therefore, we chose the HH model. In future studies, we will compare these neuronal models in detail.


### 2.2. Attention Mechanism

Some researchers have conducted relevant studies for the future unmanned system intelligence and the development needs of multiunmanned system cooperative perception and cognition to solve the scientific problems of information overload and crossplatform multisource perceptual information fusion and proposed to explore the mechanism of multisource attention mechanism on the regulation of unmanned system intelligent perceptual system by studying the mechanism of the regulation of bionic endogenous and exogenous attention and the mechanism of its mapping heterogeneous multisource perceptron. Combined with the ability of brain cognition to combine cues from different sensory channels to achieve fast and efficient information filtering and heterogeneous multi-source cognition of objects and events in the external world and the use of different reference systems to characterize the features and locations of objects, an intelligent perception and information processing framework based on bionic multisource attention mechanism is constructed, which is useful for engineering the implementation of intelligent perception, cognitive system, and attention mechanism of unmanned systems. The design reference value for engineering the intelligent perception, cognitive system, and attention mechanism of unmanned systems is certain. It has greater significance to this paper [17].Another scholar proposed an improved graph attention (GAR) mechanism model for the problem that a large amount of feature information is easily lost in the process of learning graph embedding node representation and its incomplete graph topology retention in graph neural network model. The model is divided into two parts: node-level bidirectional attention mechanism and graph-level self-attentive graph pooling. Firstly, in the process of learning new feature vector representations of graph nodes, a bidirectional graph attention weight is adopted to provide a reliable choice for neighborhood node retention while enhancing the similarity properties among nodes; secondly, a graph embedding representation is generated at the pooling layer by using node feature vectors as inputs in the overall topology of the graph in conjunction with a self-attention graph pool and by paying attention to the self-attention weights provided by the convolution layer; finally, the model is tested on Cora, Citeseer, and PubMed datasets, and the experimental results show that compared with the baseline graph attention mechanism model, the improved model can fully consider the local and overall structural features of the graph, effectively enhance the model’s ability to aggregate neighborhood information, reduce the loss of original features in the graph embedding process, and significantly improve the performance of the model in downstream tasks. It provides some help for the study of this paper [18].The DL attention mechanism involved in this paper is based on the visual attention mechanism of the human brain. Wang et al. [19] combined RNN with attention mechanism and applied it to computer vision. Yang et al. [20] implemented the attention mechanism in audio processing and proposed a parallel attention framework. Efficient Channel Attention (ECA) replaces the two convolutions in the squeeze and excitation network with a more efficient connection method that improves accuracy, reduces the number of parameters, and yields accurate channel weights and attention information; the audio signal is split into multiple channels by using filters. We use the ECA module to obtain more reliable attention information and to allocate computational resources more rationally.


### 2.3. Speech Recognition Model

Some scholars have studied language recognition models and found that speech recognition systems often have recognition errors when the audio quality is poor. To improve recognition accuracy, we design an English translation robot speech recognition system based on a continuous hidden Markov model. In the hardware, the audio signal receiver and the main processor of the robot audio recognition module are designed. In the software, quantize the audio signal and preemphasize the processing, calculate the ratio between the frame shift distance and the length of each frame, obtain the analog signal conversion frequency and the basic unit quantization index, construct the speech text decoder based on the continuous hidden Markov model, calculate the width of the window function, obtain the Markov chain probability path in the grid, compare the complexity of different probability paths, design the English translation robot speech recognition algorithm, and get the speech recognition results of English translation robot. From the experimental data, it can be seen that the speech recognition accuracy of this system is above 75% under three different audio qualities, which is more stable than other systems, and the accuracy is higher under the same audio quality, which shows that the speech recognition system with the continuous hidden Markov model is better than other systems [21].The DLs involved in this study have been successfully applied to automatic speech recognition (ASR). CNNs are suitable for acoustic modeling because they consider the structural localization in the feature space. CNNs have been used for end-to-end speech recognition. By increasing the number of layers in a CNN, the recognition accuracy can be improved. End-to-end ASR models have been developed using 1D convolution, batch normalization, ReLU, dropout, and residual join in Jasper model, replacing acoustic and articulation models with CNNs.RNNs are suitable for processing time series data. Long Short-Time Memory (LSTM) is a type of RNN that can better solve the gradient disappearance and gradient explosion problems in long sequence training. Yu et al. [22] extended the deep LSTM RNN and achieved excellent performance in long-range speech recognition tasks. Sailaja et al. used LSTM-RNN as a classification model to process features extracted using MFCC and spectral and logarithmic spectrum [23].The combination of CNN and RNN can better handle speech tasks because it integrates the temporal and spatial features of the speech signal. Shi et al. [24] used CRNN to solve the scene text recognition problem. After extracting image features using CNN, RNN was used to predict the sequence. The final result is obtained from the CTC translation layer. This structure was used for speech recognition by Yu et al. [25] by replacing the LSTM with a convolutional LSTM. In end-to-end speech recognition tasks, CNN and RNN are used as encoder and decoder, respectively. In this study, we combine CNN and RNN in parallel, instead of the serial structure used in previous studies, to take into account the temporal and spatial characteristics of audio features. In addition, most of the previous work used MFCC and spectrograms, while we used an audio feature extraction method that performs audio processing like a human brain.


## 2.1. Brain-Like Audio Feature Extraction Methods

Recent research has focused on brain-like audio feature extraction methods. A two-layer probabilistic model was developed by Vaishnavi et al. A two-layer probabilistic generative model based on spike maps was developed for complex acoustic structures. Spike maps are not suitable for standard classification methods such as multilayer perceptrons (MLPs), which usually require normalized vectors as input data [14]. Li et al. proposed a data representation method to solve this problem and make it applicable to MLP classifiers. Spikegrams have been commonly used for audio tasks, such as audio watermarking, music genre classification, and automatic instrument recognition [15].SNNs have been used for speech recognition. Neuronal models such as LIF, RS, and HH have been used to process audio signals and applied to speech classification tasks. Xu and Cox compared the biological interpretability and implementation cost of various impulse neuron models [16]. The LIF and RS models are one-dimensional (1D) neuron models with low computational cost but poor biointerpretability compared to the HH model; therefore, we chose the HH model. In future studies, we will compare these neuronal models in detail.


## 2.2. Attention Mechanism

Some researchers have conducted relevant studies for the future unmanned system intelligence and the development needs of multiunmanned system cooperative perception and cognition to solve the scientific problems of information overload and crossplatform multisource perceptual information fusion and proposed to explore the mechanism of multisource attention mechanism on the regulation of unmanned system intelligent perceptual system by studying the mechanism of the regulation of bionic endogenous and exogenous attention and the mechanism of its mapping heterogeneous multisource perceptron. Combined with the ability of brain cognition to combine cues from different sensory channels to achieve fast and efficient information filtering and heterogeneous multi-source cognition of objects and events in the external world and the use of different reference systems to characterize the features and locations of objects, an intelligent perception and information processing framework based on bionic multisource attention mechanism is constructed, which is useful for engineering the implementation of intelligent perception, cognitive system, and attention mechanism of unmanned systems. The design reference value for engineering the intelligent perception, cognitive system, and attention mechanism of unmanned systems is certain. It has greater significance to this paper [17].Another scholar proposed an improved graph attention (GAR) mechanism model for the problem that a large amount of feature information is easily lost in the process of learning graph embedding node representation and its incomplete graph topology retention in graph neural network model. The model is divided into two parts: node-level bidirectional attention mechanism and graph-level self-attentive graph pooling. Firstly, in the process of learning new feature vector representations of graph nodes, a bidirectional graph attention weight is adopted to provide a reliable choice for neighborhood node retention while enhancing the similarity properties among nodes; secondly, a graph embedding representation is generated at the pooling layer by using node feature vectors as inputs in the overall topology of the graph in conjunction with a self-attention graph pool and by paying attention to the self-attention weights provided by the convolution layer; finally, the model is tested on Cora, Citeseer, and PubMed datasets, and the experimental results show that compared with the baseline graph attention mechanism model, the improved model can fully consider the local and overall structural features of the graph, effectively enhance the model’s ability to aggregate neighborhood information, reduce the loss of original features in the graph embedding process, and significantly improve the performance of the model in downstream tasks. It provides some help for the study of this paper [18].The DL attention mechanism involved in this paper is based on the visual attention mechanism of the human brain. Wang et al. [19] combined RNN with attention mechanism and applied it to computer vision. Yang et al. [20] implemented the attention mechanism in audio processing and proposed a parallel attention framework. Efficient Channel Attention (ECA) replaces the two convolutions in the squeeze and excitation network with a more efficient connection method that improves accuracy, reduces the number of parameters, and yields accurate channel weights and attention information; the audio signal is split into multiple channels by using filters. We use the ECA module to obtain more reliable attention information and to allocate computational resources more rationally.


## 2.3. Speech Recognition Model

Some scholars have studied language recognition models and found that speech recognition systems often have recognition errors when the audio quality is poor. To improve recognition accuracy, we design an English translation robot speech recognition system based on a continuous hidden Markov model. In the hardware, the audio signal receiver and the main processor of the robot audio recognition module are designed. In the software, quantize the audio signal and preemphasize the processing, calculate the ratio between the frame shift distance and the length of each frame, obtain the analog signal conversion frequency and the basic unit quantization index, construct the speech text decoder based on the continuous hidden Markov model, calculate the width of the window function, obtain the Markov chain probability path in the grid, compare the complexity of different probability paths, design the English translation robot speech recognition algorithm, and get the speech recognition results of English translation robot. From the experimental data, it can be seen that the speech recognition accuracy of this system is above 75% under three different audio qualities, which is more stable than other systems, and the accuracy is higher under the same audio quality, which shows that the speech recognition system with the continuous hidden Markov model is better than other systems [21].The DLs involved in this study have been successfully applied to automatic speech recognition (ASR). CNNs are suitable for acoustic modeling because they consider the structural localization in the feature space. CNNs have been used for end-to-end speech recognition. By increasing the number of layers in a CNN, the recognition accuracy can be improved. End-to-end ASR models have been developed using 1D convolution, batch normalization, ReLU, dropout, and residual join in Jasper model, replacing acoustic and articulation models with CNNs.RNNs are suitable for processing time series data. Long Short-Time Memory (LSTM) is a type of RNN that can better solve the gradient disappearance and gradient explosion problems in long sequence training. Yu et al. [22] extended the deep LSTM RNN and achieved excellent performance in long-range speech recognition tasks. Sailaja et al. used LSTM-RNN as a classification model to process features extracted using MFCC and spectral and logarithmic spectrum [23].The combination of CNN and RNN can better handle speech tasks because it integrates the temporal and spatial features of the speech signal. Shi et al. [24] used CRNN to solve the scene text recognition problem. After extracting image features using CNN, RNN was used to predict the sequence. The final result is obtained from the CTC translation layer. This structure was used for speech recognition by Yu et al. [25] by replacing the LSTM with a convolutional LSTM. In end-to-end speech recognition tasks, CNN and RNN are used as encoder and decoder, respectively. In this study, we combine CNN and RNN in parallel, instead of the serial structure used in previous studies, to take into account the temporal and spatial characteristics of audio features. In addition, most of the previous work used MFCC and spectrograms, while we used an audio feature extraction method that performs audio processing like a human brain.


## 3. Materials and Methods

In this section, we describe our method in detail. The work includes feature extraction based on spike maps and HH models.


### 3.1. Dataset Processing

The experiments are conducted on the Aurora dataset. Aurora is part of the Tidigits dataset, which includes both adult and child voices. Aurora takes out the adult part of Tidigits at a sampling rate of 16 kHz. Using the Hamming window, all the audio is divided intoN frames with 40% overlap to support frame lengths of 0.1-0.25 ms, and N is positively correlated with the length of the audio.


### 3.2. Spike Map

In the peripheral auditory system, incoming sound signals are mechanically transmitted to the inner ear, undergo a highly complex transformation, and are then encoded by spikes in the auditory nerve. The audio signal is encoded using a set of kernel functions by Smith et al.(1)xt=∑simφmt−τim+εt,where εt denotes Gaussian white noise, τim and sim are the time position and coefficients of the ith instance of the kernel function, φm, respectively. The superscript m or subscript represents the type of kernel function. We choose gammatone as the kernel function to decompose the sound signal, denoted as φt.
(2)φt=ctn−1e−2πbtcos2πft+θ,wherecis the scale factor, n is the filter border, is the time decay coefficient, f is the filter center frequency, and θ is the filter phase. The spectrogram is a traditional time-frequency visualization, but it actually has some important differences from the way the ear analyzes sound; most importantly, the frequency subbands of the ear widen for higher frequencies, while the spectrogram has a constant bandwidth over all frequency channels.However, this is a rather expensive calculation. D.P.W. Ellis offers an alternative algorithm which gives very similar results and calculates the time-frequency distribution about 30-40 times faster than the full method. The result is16∗N, where 16 stands for the number of kernels and N for the time period.The acoustic signal can be most efficiently encoded by decomposing discrete acoustic signal cells; each cell has an exact amplitude and temporal location. Smith et al. used the matched pursuit algorithm to compute the acoustic signal. The matched pursuit algorithm is used to calculateτim and the sim value of the sum, iteratively approaching the input signal to determine the best solution for encoding. The resulting spike map consists of three dimensions: time, center frequency, and amplitude. The X-axis represents time, the Y-axis represents the central frequency, and the size of the circles represents the amplitude. The feature vectors containing these three dimensions are fed into the HH model.


### 3.3. HH Model

We use the HH model to calculate the number of spikes. There are three types of ionic currents in the membrane: sodium current, potassium current, and leakage current. The total current through the cell membrane can be calculated as follows:(3)I=CMdVdt+g¯Kn4V−VK+g¯Nam4hV−VNa+g¯LV−VL,where g¯ion represents the maximum conductivity of ions, CMrepresents the membrane capacity, and V is the displacement of the membrane potential from its resting value.m,n,andh are the intramodel variables associated with the ion channels; their differential equations are as follows:
(4)dndt=αnV1−n−βnVn,dmdt=αmV1−m−βmVm,dhdt=αhV1−h−βhVh,whereαn,αm,αh,βn,βm,andβhare the equations related to V functions related to
(5)αnV=0.01V+551−e−V+55/10,αmV=0.1V+401−e−V+40/10,αhV=0.07e−V+65/20,βnV=0.125e−V+65/80,βmV=4e−V+65/18,βmV=4e−V+65/18.Equation (6) is obtained by solving equation (3) using Euler’s method. Equation (3) is obtained by using Euler’s method.
(6)dVdt=−1CMg¯Kn4V−VK+g¯Nam4hV−VNa+g¯LV−VL+I.First, the initial values of the variables are set and the value of the parameterg¯L is 0.3; the value of the g¯K parameter is 36; the value of g¯Na the parameter is 120; the value EL of the parameter is -54.5; the EK value of the parameter is -77; the value of the parameter ENa is 50; the value of the parameter CM is 1; and the value of the parameter V0 is -70. Eionis the equilibrium potential of the ion, V0, which is the resting potential. The value of the current is obtained from the central frequency and the scale. We directly use the amplitude as the magnitude of the current. For each kernel, traversing each time window, the current values are entered into the HH model for 50 ms, divided into 5,000 time steps of 0.01 ms. We use equation (7) to update the variables for each time step and then calculate the voltage value for the current time step to obtain an approximate Vt function. A pulse is generated when the voltage is greater than the maximum value obtained at the previous and the next time step. The relationship between voltage and time is described in detail in this paper.
(7)V+=step∗−1CMg¯Kn4V−VK+g¯Nam4hV−VNa+g¯LV−VL+I.We count the spikes for each segment and then repeat the above operation for each kernel. The final features are obtained. These features are fed into the CRNN model, which will be discussed in Section3.4.


### 3.4. CRNN Model Structure

In the proposed CRNN model, CNN is applied to spatial data and RNN is applied to sequential data. CRNN consists of two parts: a ResCNN block and a BRNN block. Features are fed into these two blocks, which can efficiently process both spatial and temporal feature information. For ease of expression, the convolution is abbreviated as Conv and the batch normalization is abbreviated as BN.An ECA layer is set before the ResCNN block. The ECA obtains accurate channel weights and attention information by aggregating the information of each channel on a one-dimensional convolutional layer. After the ECA layer, the next ResCNN block can focus on the more effective channels.The ResCNN block has two channels. The network on the right side consists of three convolutional layers and a pooling layer. We treatConv+BN+ReLU as a single layer. The first layer is a convolutional layer of size (1, 1, 0), which makes the output have the same size as the input. This convolution has a kernel size of 1, a padding of 0, and a span of 1. The second and third layers are convolutional layers of sizes (3, 1, 0) and (1, 1, 0), respectively. The subsequent layer is the maximal ensemble layer, where the feature map is reduced by half.The network on the left contains only one convolutional layer of size (3, 1, 1), thus keeping the image size constant. The final output of ResCNN is obtained by summing the outputs of the two pathways.The proposed BRNN model includes two bidirectional RNN layers with LSTM units. The BRNN combines two RNNs, one moving forward from the beginning to the end of the sequence and the other moving backward to obtain the complete past and future background information of each point in the input sequence. We use LSTM because it overcomes the drawbacks of RNNs, such as long-term dependence and gradient disappearance.Finally, the outputs of ResCNN and BRN are combined and fed to the fully connected layer. The SoftMax function reflects the weights in the fully connected layer with probability values between 0 and 1.


### 3.5. Neural Networks

Other kinds of algorithms require relevant mathematical mapping relations. The artificial neural network algorithm involved in this paper does not require a large number of mathematical mapping relations, so it does not need to input a large number of mathematical equations in the first place, because it needs to be able to learn some other basic mathematical rules systematically by training the data in advance, so that it can output the required mathematical calculation results and simulate the mathematical model better given certain function values and mathematical function values. As a complex discipline in computer science and mathematics and statistics, one of the main core functions of artificial neural network is to train algorithms for mathematical calculations and information statistics.The basic algorithm theory BP algorithm theory process mainly includes the output signal deviation forward and backward linear propagation process calculation and the output signal error forward and backward linear propagation process which are two process calculation process. That is, the signal error can be adjusted according to the two input directions from the actual input signal direction to the actual expected signal output, respectively, to calculate the signal output, from the direction of the real expected signal output and then to the real expected input direction of the two directions, respectively, and to calculate the signal error to adjust the signal error weight range and error threshold. In the study of the propagation method after the forward superposition of the signal, the input node signal is mainly the node on the actual output of the signal after the inverse superposition through the role of the hidden layer, and the actual output node signal can be generated through the nonlinear transformation process. If we find that the actual signal output node position is not consistent with the actual input node expectation signal of the actual output node direction position, it will be easy to produce the process of backward feed-back propagation method for signal error compensation. The principle of error input signal back propagation processing system is that the system will automatically back propagate its various output signals or error information values to each error input layer of the system through the hidden layer nodes layer by layer and will sequentially transfer its output error signal value distribution to the nodes on each layer corresponding to all other layers of the system error input signal elements, with the system in each layer of the system nodes obtained. The output error input signal values obtained by the system at each layer node are used as the basis for its calculation to automatically adjust the weights of the system’s error output signal elements.


## 3.1. Dataset Processing

The experiments are conducted on the Aurora dataset. Aurora is part of the Tidigits dataset, which includes both adult and child voices. Aurora takes out the adult part of Tidigits at a sampling rate of 16 kHz. Using the Hamming window, all the audio is divided intoN frames with 40% overlap to support frame lengths of 0.1-0.25 ms, and N is positively correlated with the length of the audio.


## 3.2. Spike Map

In the peripheral auditory system, incoming sound signals are mechanically transmitted to the inner ear, undergo a highly complex transformation, and are then encoded by spikes in the auditory nerve. The audio signal is encoded using a set of kernel functions by Smith et al.(1)xt=∑simφmt−τim+εt,where εt denotes Gaussian white noise, τim and sim are the time position and coefficients of the ith instance of the kernel function, φm, respectively. The superscript m or subscript represents the type of kernel function. We choose gammatone as the kernel function to decompose the sound signal, denoted as φt.
(2)φt=ctn−1e−2πbtcos2πft+θ,wherecis the scale factor, n is the filter border, is the time decay coefficient, f is the filter center frequency, and θ is the filter phase. The spectrogram is a traditional time-frequency visualization, but it actually has some important differences from the way the ear analyzes sound; most importantly, the frequency subbands of the ear widen for higher frequencies, while the spectrogram has a constant bandwidth over all frequency channels.However, this is a rather expensive calculation. D.P.W. Ellis offers an alternative algorithm which gives very similar results and calculates the time-frequency distribution about 30-40 times faster than the full method. The result is16∗N, where 16 stands for the number of kernels and N for the time period.The acoustic signal can be most efficiently encoded by decomposing discrete acoustic signal cells; each cell has an exact amplitude and temporal location. Smith et al. used the matched pursuit algorithm to compute the acoustic signal. The matched pursuit algorithm is used to calculateτim and the sim value of the sum, iteratively approaching the input signal to determine the best solution for encoding. The resulting spike map consists of three dimensions: time, center frequency, and amplitude. The X-axis represents time, the Y-axis represents the central frequency, and the size of the circles represents the amplitude. The feature vectors containing these three dimensions are fed into the HH model.


## 3.3. HH Model

We use the HH model to calculate the number of spikes. There are three types of ionic currents in the membrane: sodium current, potassium current, and leakage current. The total current through the cell membrane can be calculated as follows:(3)I=CMdVdt+g¯Kn4V−VK+g¯Nam4hV−VNa+g¯LV−VL,where g¯ion represents the maximum conductivity of ions, CMrepresents the membrane capacity, and V is the displacement of the membrane potential from its resting value.m,n,andh are the intramodel variables associated with the ion channels; their differential equations are as follows:
(4)dndt=αnV1−n−βnVn,dmdt=αmV1−m−βmVm,dhdt=αhV1−h−βhVh,whereαn,αm,αh,βn,βm,andβhare the equations related to V functions related to
(5)αnV=0.01V+551−e−V+55/10,αmV=0.1V+401−e−V+40/10,αhV=0.07e−V+65/20,βnV=0.125e−V+65/80,βmV=4e−V+65/18,βmV=4e−V+65/18.Equation (6) is obtained by solving equation (3) using Euler’s method. Equation (3) is obtained by using Euler’s method.
(6)dVdt=−1CMg¯Kn4V−VK+g¯Nam4hV−VNa+g¯LV−VL+I.First, the initial values of the variables are set and the value of the parameterg¯L is 0.3; the value of the g¯K parameter is 36; the value of g¯Na the parameter is 120; the value EL of the parameter is -54.5; the EK value of the parameter is -77; the value of the parameter ENa is 50; the value of the parameter CM is 1; and the value of the parameter V0 is -70. Eionis the equilibrium potential of the ion, V0, which is the resting potential. The value of the current is obtained from the central frequency and the scale. We directly use the amplitude as the magnitude of the current. For each kernel, traversing each time window, the current values are entered into the HH model for 50 ms, divided into 5,000 time steps of 0.01 ms. We use equation (7) to update the variables for each time step and then calculate the voltage value for the current time step to obtain an approximate Vt function. A pulse is generated when the voltage is greater than the maximum value obtained at the previous and the next time step. The relationship between voltage and time is described in detail in this paper.
(7)V+=step∗−1CMg¯Kn4V−VK+g¯Nam4hV−VNa+g¯LV−VL+I.We count the spikes for each segment and then repeat the above operation for each kernel. The final features are obtained. These features are fed into the CRNN model, which will be discussed in Section3.4.


## 3.4. CRNN Model Structure

In the proposed CRNN model, CNN is applied to spatial data and RNN is applied to sequential data. CRNN consists of two parts: a ResCNN block and a BRNN block. Features are fed into these two blocks, which can efficiently process both spatial and temporal feature information. For ease of expression, the convolution is abbreviated as Conv and the batch normalization is abbreviated as BN.An ECA layer is set before the ResCNN block. The ECA obtains accurate channel weights and attention information by aggregating the information of each channel on a one-dimensional convolutional layer. After the ECA layer, the next ResCNN block can focus on the more effective channels.The ResCNN block has two channels. The network on the right side consists of three convolutional layers and a pooling layer. We treatConv+BN+ReLU as a single layer. The first layer is a convolutional layer of size (1, 1, 0), which makes the output have the same size as the input. This convolution has a kernel size of 1, a padding of 0, and a span of 1. The second and third layers are convolutional layers of sizes (3, 1, 0) and (1, 1, 0), respectively. The subsequent layer is the maximal ensemble layer, where the feature map is reduced by half.The network on the left contains only one convolutional layer of size (3, 1, 1), thus keeping the image size constant. The final output of ResCNN is obtained by summing the outputs of the two pathways.The proposed BRNN model includes two bidirectional RNN layers with LSTM units. The BRNN combines two RNNs, one moving forward from the beginning to the end of the sequence and the other moving backward to obtain the complete past and future background information of each point in the input sequence. We use LSTM because it overcomes the drawbacks of RNNs, such as long-term dependence and gradient disappearance.Finally, the outputs of ResCNN and BRN are combined and fed to the fully connected layer. The SoftMax function reflects the weights in the fully connected layer with probability values between 0 and 1.


## 3.5. Neural Networks

Other kinds of algorithms require relevant mathematical mapping relations. The artificial neural network algorithm involved in this paper does not require a large number of mathematical mapping relations, so it does not need to input a large number of mathematical equations in the first place, because it needs to be able to learn some other basic mathematical rules systematically by training the data in advance, so that it can output the required mathematical calculation results and simulate the mathematical model better given certain function values and mathematical function values. As a complex discipline in computer science and mathematics and statistics, one of the main core functions of artificial neural network is to train algorithms for mathematical calculations and information statistics.The basic algorithm theory BP algorithm theory process mainly includes the output signal deviation forward and backward linear propagation process calculation and the output signal error forward and backward linear propagation process which are two process calculation process. That is, the signal error can be adjusted according to the two input directions from the actual input signal direction to the actual expected signal output, respectively, to calculate the signal output, from the direction of the real expected signal output and then to the real expected input direction of the two directions, respectively, and to calculate the signal error to adjust the signal error weight range and error threshold. In the study of the propagation method after the forward superposition of the signal, the input node signal is mainly the node on the actual output of the signal after the inverse superposition through the role of the hidden layer, and the actual output node signal can be generated through the nonlinear transformation process. If we find that the actual signal output node position is not consistent with the actual input node expectation signal of the actual output node direction position, it will be easy to produce the process of backward feed-back propagation method for signal error compensation. The principle of error input signal back propagation processing system is that the system will automatically back propagate its various output signals or error information values to each error input layer of the system through the hidden layer nodes layer by layer and will sequentially transfer its output error signal value distribution to the nodes on each layer corresponding to all other layers of the system error input signal elements, with the system in each layer of the system nodes obtained. The output error input signal values obtained by the system at each layer node are used as the basis for its calculation to automatically adjust the weights of the system’s error output signal elements.


## 4. Results and Discussion

### 4.1. Neural Network Research

A neural network is essentially a nonlinear predictive model that, like its name, is an algorithm that imitates the human and animal nervous systems for computation. It is based on imitating the human and animal brain neural network system to perform the computation and then to process the content of each module. Neural network algorithm is a derivative of data mining technology, which is one of the types of data mining technology that can be used for big data mining, such as analysis, classification, aggregation, and other data mining functions. Its advantages and disadvantages are very clear; the first advantage is that it is extremely resistant to interference, and the second is that it is capable of deep learning and better memory in a nonlinear situation and can handle more complex situations. At the same time, it has two disadvantages. First, its computation and processing results are low-dimensional and cannot be adapted to a high-dimensional environment, so it has a hard-to-interpret nature. The second is that both supervised learning and unsupervised learning require a long learning time and data collection using more traditional neural network methods.The main first of all utilized in this paper is wavelet neural networks, and such neural networks process data from two main parts of the algorithm. These two types of algorithms are the effective supervised learning and the ineffective unsupervised learning that are common in algorithms. In the latter part, the data are first analyzed by clustering through certain algorithms to obtain the central part of the hidden neural network, and then, the results of this step are used to perform calculations to figure out the value of the width of the number. The wavelet neural network is shown in Figure1.Figure 1
Wavelet neural network.Next is the fuzzy neural network. This type of neural network (FNN for short) begins with a deep combination of fuzzy theory and neural network algorithms. In the process of data mining and information processing by neural network algorithms, fuzzy theory is incorporated to improve the mapping and the relevance of mathematical relations. The efficiency of supervised learning and unsupervised learning is better improved. The algorithmic formulas of such neural networks and the related structural diagrams are more commonly used and common and can be found in general textbooks. This kind of neural network is shown in the figure; it goes through five levels in the process of training and supervised and unsupervised learning, at the beginning of the two levels; as the level increases, the range of calculations required will double, but as it enters the third level and enters the fourth level and enters the fifth level, the content of calculations will gradually decrease until it becomes one. Of course, this type of graph is first tested for dimensionality at this node in the input layer when the input is made. The specific value assumes that the dimension value isn and the node that needs to be input is n. Depending on the number of nodes needed, it is passed all the way to the layer of the dimensionality function and the related layer of functions for further computation, as well as finally to the output layer. This type of fuzzy theory combined neural network has the same nature as the wavelet neural network and the neural network combined with generalized theory, which both use the traditional gradient form of computation downward to calculate the centroid of the affiliation and the associated required width value and the final output value and the weights we need. This is shown in Figure 2.Figure 2
Fuzzy neural network.Again, the generalized regression neural network generalized regression neural network (GRNN) is a four-layer forward propagation neural network with fewer parameters and better nonlinear mapping capability in its network structure. The difference between this neural network and other neural network algorithms is that there is no supervised learning and unsupervised learning data input and training process. The training results are obtained by optimizing the relevant factors in the second layer. It does not have a specific computational process like other types of neural networks but has a specific supervised and unsupervised learning data processing process and training process. The computational process is not shown in detail here, and the specific computational process can be obtained by the radial basis neural network inference, which will not be done in this example. Although this kind of neural network combined with the generalized theory, it does not require supervised and unsupervised learning training, but its second layer, that is, its mode layer, is prone to the phenomenon of violation of statistical laws; firstly, it is very easy to cause the phenomenon of underfitting and not easy to fit, and secondly, the relevant factors in his will appear random wandering phenomenon, so it is more troublesome, as shown in Figure3.Figure 3
Generalized regression neural network.Finally, radial basis neural network (RBFNN for short) is one of the most typical radial basis theories combined with the depth of the three levels of the second which is a forward neural network algorithm structure; in addition, the same as the traditional neural network with supervised learning and unsupervised learning of the data training, it is mainly only three layers which is more convenient. Secondly, it has a better statistical basis, it is a linear computation, and then, it can pass to the next layer after data processing by function. After three layers of computation, the output results are obtained. In the case of camera neural network, it outputs data mainly through two layers of algorithms; the specific computation is supervised learning and unsupervised learning, respectively. In the supervised learning area, it needs to perform clustering algorithm and analysis of some relevant data for clustering to calculate the required width value and the required neural network result. The radial basis neural network is shown in Figure4.Figure 4
Structure of the radial basis neural network.


### 4.2. Experiments and Results

#### 4.2.1. Audio Similarity Experiments

First, speech isolated word recognition is achieved by calculating the similarity between speech and matched audio signals. The audio similarity between the same and different speech signals is calculated to determine whether audio features can be used to distinguish them. DTW is a commonly used speech matching algorithm to calculate the similarity between two vectors of different dimensions. The performance of DTW as an early metric learning method is determined by the input features.The proposed algorithm matches two speech vector sums with different m_1-dimensional m_2 degrees. Each m_1-dimensional m_2 degree of the sum is also a vector that is a feature value for each time period in the speech signal. In this study, we calculated the DTW distance between two transposed SHH features and performed the same operation on MFCC features for comparison. The DTW distance indicates the similarity of the audio.We selected 50 audios for each digit from the Aurora dataset and extracted their SHH and MFCC features. The average similarity of audio was calculated for the same digit (SSD) and different digits (SDD). The difference between the SSD and SDD values can be used to determine if the DTW algorithm can distinguish these features well.For audio with the same digits, the feature vectors for all audio are computed in pairs to determine the average DTW distance for each digit. The SSD is the average result of ten digits.For audio of two different digits, all audio features of both digits are mapped one by one to calculate the DTW distance. We average the results of 2500 calculations to obtain the average DTW distance between each pair of digits. The SDD is the average of the results for 45 digit pairs. This is shown in Figure5.Figure 5
Average DTW distance (SSD) for each speech digit and average DTW distance (SDD) between every two different speech digits and the difference between DTW distance for different audios and the same audio.The authors also list the average SSD, the average SDD, and the differences, as shown in Figure6.Figure 6
Average DTW distance for 10 digital voice audio signals.SHH features are more concise than MFCC. For the same audio signal, the DTW distance of SHH features is much smaller than that of MFCC, while the difference of DTW distance is relatively more obvious for different audio signals.The degree of audio similarity reflected by SHH is very similar to that perceived by the human ear. An audio that sounds very similar to the human ear has a high degree of similarity in SHH features, but MFCC features vary greatly. The differences in SHH features are even more pronounced for an audio that sounds very different to the human ear.Therefore, feature extraction using SHH is similar to audio processing in the human brain and can better distinguish audio features; therefore, they perform better in speech classification and isolated word recognition.


#### 4.2.2. CRNN Model Testing and Ablation Experiments

To demonstrate the role of each module in the proposed human brain-like feature extraction method, we designed ablation experiments. In Experiment 1, spikegram and HH modules were used. In Experiment 2, only spikegram features were fed into the CRNN model to demonstrate the validity of the HH model. In Experiment 3, the spikegram and HH modules were not used; instead, MFCC features were extracted to demonstrate the superiority of the proposed method. All three experiments were conducted on the same dataset and used the same training parameters. The dataset was divided into 80% of the data for training and 20% for testing. The learning rate of the neural network was initially set to 0.001, with adaptive updates every 40 calendar hours. The number of training epochs was 1000. Figure7 shows the training and testing accuracy of the model using three different feature extraction methods. This is shown in Figure 7.Figure 7
Accuracy of the model using different feature extraction methods.The article also lists the performance of the models in terms of accuracy (P), recall (R), and f1 score (F1) on the SHH method. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 8.Figure 8
Performance of the model on SHH method in terms of precision (P), recall (R), and f1 score (F1).The performance of the model on the spikegram method in terms of precision (P), recall (R), and f1 score (F1) is presented. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 9.Figure 9
Performance of the model on spikegram method in terms of precision (P), recall (R), and f1 score (F1).The performance of the model on the MFCC method in terms of precision (P), recall (R), and f1 score (F1) is presented. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 10.Figure 10
Performance of the model on MFCC method in terms of precision (P), recall (R), and f1 score (F1).Three feature extraction methods were used for the experiments: SHH, spikegram, and MFCC. The ablation experiments demonstrate the superiority of the proposed methods. MFCC exhibits superior overfitting performance over spikegram and HH features in a given classification model. In addition, the features extracted using our method have smaller sizes, which may contribute to the generalization ability of the classification model.


### 4.3. Discussion

The performance of the proposed model in digital speech recognition tasks is compared with the performance of other recent models. Tavanaei et al. proposed a nonrecursive SNN to convert speech signals into spike sequence features; they extracted the minimum feature vector from each frame of the spectrum after FFT and used the RS model to convert audio signals into spike sequences. Srinivas et al. used SVM andK-nearest to perform English numeric classification using SVM and K-nearest-neighbor (KNN) classifiers and ensemble methods, i.e., random forests; MFCC features were obtained for all input instances. Zada et al. developed an isolated digit recognition for Pashto language by using deep CNN. In another study, 20 MFCC features were extracted for each isolated digit and input to the CNN; for spoken digit corpus data, MFCC showed better performance than cepstral features. In addition, vector quantization feature matching technique and light gradient boosting machine (LightGBM) were used for feature vector clustering.SHH was used in Experiment 1 and obtained an accuracy of 94.8% on the test set, which is higher than the accuracy using existing models. In addition, our method uses fewer layers of neuronal networks. This is shown in Table1Table 1
Comparison with other models in terms of feature extraction method, classification model, and accuracy in the same task.
MethodFeaturesClassification methodAccuracyTavanaei and Maida [26]FFT+RSSVM91%Watt and Kostylev [27]MFCCSVM+KNN97.5%Zada and Ullah [28]MFCCCNN84.17%Rakshith et al. [7]MFCCVQ93%Proposed methodSpike mapSpeech recognition network (CRNN)93.43%SHHCRNN94.8%


## 4.1. Neural Network Research

A neural network is essentially a nonlinear predictive model that, like its name, is an algorithm that imitates the human and animal nervous systems for computation. It is based on imitating the human and animal brain neural network system to perform the computation and then to process the content of each module. Neural network algorithm is a derivative of data mining technology, which is one of the types of data mining technology that can be used for big data mining, such as analysis, classification, aggregation, and other data mining functions. Its advantages and disadvantages are very clear; the first advantage is that it is extremely resistant to interference, and the second is that it is capable of deep learning and better memory in a nonlinear situation and can handle more complex situations. At the same time, it has two disadvantages. First, its computation and processing results are low-dimensional and cannot be adapted to a high-dimensional environment, so it has a hard-to-interpret nature. The second is that both supervised learning and unsupervised learning require a long learning time and data collection using more traditional neural network methods.The main first of all utilized in this paper is wavelet neural networks, and such neural networks process data from two main parts of the algorithm. These two types of algorithms are the effective supervised learning and the ineffective unsupervised learning that are common in algorithms. In the latter part, the data are first analyzed by clustering through certain algorithms to obtain the central part of the hidden neural network, and then, the results of this step are used to perform calculations to figure out the value of the width of the number. The wavelet neural network is shown in Figure1.Figure 1
Wavelet neural network.Next is the fuzzy neural network. This type of neural network (FNN for short) begins with a deep combination of fuzzy theory and neural network algorithms. In the process of data mining and information processing by neural network algorithms, fuzzy theory is incorporated to improve the mapping and the relevance of mathematical relations. The efficiency of supervised learning and unsupervised learning is better improved. The algorithmic formulas of such neural networks and the related structural diagrams are more commonly used and common and can be found in general textbooks. This kind of neural network is shown in the figure; it goes through five levels in the process of training and supervised and unsupervised learning, at the beginning of the two levels; as the level increases, the range of calculations required will double, but as it enters the third level and enters the fourth level and enters the fifth level, the content of calculations will gradually decrease until it becomes one. Of course, this type of graph is first tested for dimensionality at this node in the input layer when the input is made. The specific value assumes that the dimension value isn and the node that needs to be input is n. Depending on the number of nodes needed, it is passed all the way to the layer of the dimensionality function and the related layer of functions for further computation, as well as finally to the output layer. This type of fuzzy theory combined neural network has the same nature as the wavelet neural network and the neural network combined with generalized theory, which both use the traditional gradient form of computation downward to calculate the centroid of the affiliation and the associated required width value and the final output value and the weights we need. This is shown in Figure 2.Figure 2
Fuzzy neural network.Again, the generalized regression neural network generalized regression neural network (GRNN) is a four-layer forward propagation neural network with fewer parameters and better nonlinear mapping capability in its network structure. The difference between this neural network and other neural network algorithms is that there is no supervised learning and unsupervised learning data input and training process. The training results are obtained by optimizing the relevant factors in the second layer. It does not have a specific computational process like other types of neural networks but has a specific supervised and unsupervised learning data processing process and training process. The computational process is not shown in detail here, and the specific computational process can be obtained by the radial basis neural network inference, which will not be done in this example. Although this kind of neural network combined with the generalized theory, it does not require supervised and unsupervised learning training, but its second layer, that is, its mode layer, is prone to the phenomenon of violation of statistical laws; firstly, it is very easy to cause the phenomenon of underfitting and not easy to fit, and secondly, the relevant factors in his will appear random wandering phenomenon, so it is more troublesome, as shown in Figure3.Figure 3
Generalized regression neural network.Finally, radial basis neural network (RBFNN for short) is one of the most typical radial basis theories combined with the depth of the three levels of the second which is a forward neural network algorithm structure; in addition, the same as the traditional neural network with supervised learning and unsupervised learning of the data training, it is mainly only three layers which is more convenient. Secondly, it has a better statistical basis, it is a linear computation, and then, it can pass to the next layer after data processing by function. After three layers of computation, the output results are obtained. In the case of camera neural network, it outputs data mainly through two layers of algorithms; the specific computation is supervised learning and unsupervised learning, respectively. In the supervised learning area, it needs to perform clustering algorithm and analysis of some relevant data for clustering to calculate the required width value and the required neural network result. The radial basis neural network is shown in Figure4.Figure 4
Structure of the radial basis neural network.


## 4.2. Experiments and Results

### 4.2.1. Audio Similarity Experiments

First, speech isolated word recognition is achieved by calculating the similarity between speech and matched audio signals. The audio similarity between the same and different speech signals is calculated to determine whether audio features can be used to distinguish them. DTW is a commonly used speech matching algorithm to calculate the similarity between two vectors of different dimensions. The performance of DTW as an early metric learning method is determined by the input features.The proposed algorithm matches two speech vector sums with different m_1-dimensional m_2 degrees. Each m_1-dimensional m_2 degree of the sum is also a vector that is a feature value for each time period in the speech signal. In this study, we calculated the DTW distance between two transposed SHH features and performed the same operation on MFCC features for comparison. The DTW distance indicates the similarity of the audio.We selected 50 audios for each digit from the Aurora dataset and extracted their SHH and MFCC features. The average similarity of audio was calculated for the same digit (SSD) and different digits (SDD). The difference between the SSD and SDD values can be used to determine if the DTW algorithm can distinguish these features well.For audio with the same digits, the feature vectors for all audio are computed in pairs to determine the average DTW distance for each digit. The SSD is the average result of ten digits.For audio of two different digits, all audio features of both digits are mapped one by one to calculate the DTW distance. We average the results of 2500 calculations to obtain the average DTW distance between each pair of digits. The SDD is the average of the results for 45 digit pairs. This is shown in Figure5.Figure 5
Average DTW distance (SSD) for each speech digit and average DTW distance (SDD) between every two different speech digits and the difference between DTW distance for different audios and the same audio.The authors also list the average SSD, the average SDD, and the differences, as shown in Figure6.Figure 6
Average DTW distance for 10 digital voice audio signals.SHH features are more concise than MFCC. For the same audio signal, the DTW distance of SHH features is much smaller than that of MFCC, while the difference of DTW distance is relatively more obvious for different audio signals.The degree of audio similarity reflected by SHH is very similar to that perceived by the human ear. An audio that sounds very similar to the human ear has a high degree of similarity in SHH features, but MFCC features vary greatly. The differences in SHH features are even more pronounced for an audio that sounds very different to the human ear.Therefore, feature extraction using SHH is similar to audio processing in the human brain and can better distinguish audio features; therefore, they perform better in speech classification and isolated word recognition.


### 4.2.2. CRNN Model Testing and Ablation Experiments

To demonstrate the role of each module in the proposed human brain-like feature extraction method, we designed ablation experiments. In Experiment 1, spikegram and HH modules were used. In Experiment 2, only spikegram features were fed into the CRNN model to demonstrate the validity of the HH model. In Experiment 3, the spikegram and HH modules were not used; instead, MFCC features were extracted to demonstrate the superiority of the proposed method. All three experiments were conducted on the same dataset and used the same training parameters. The dataset was divided into 80% of the data for training and 20% for testing. The learning rate of the neural network was initially set to 0.001, with adaptive updates every 40 calendar hours. The number of training epochs was 1000. Figure7 shows the training and testing accuracy of the model using three different feature extraction methods. This is shown in Figure 7.Figure 7
Accuracy of the model using different feature extraction methods.The article also lists the performance of the models in terms of accuracy (P), recall (R), and f1 score (F1) on the SHH method. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 8.Figure 8
Performance of the model on SHH method in terms of precision (P), recall (R), and f1 score (F1).The performance of the model on the spikegram method in terms of precision (P), recall (R), and f1 score (F1) is presented. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 9.Figure 9
Performance of the model on spikegram method in terms of precision (P), recall (R), and f1 score (F1).The performance of the model on the MFCC method in terms of precision (P), recall (R), and f1 score (F1) is presented. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 10.Figure 10
Performance of the model on MFCC method in terms of precision (P), recall (R), and f1 score (F1).Three feature extraction methods were used for the experiments: SHH, spikegram, and MFCC. The ablation experiments demonstrate the superiority of the proposed methods. MFCC exhibits superior overfitting performance over spikegram and HH features in a given classification model. In addition, the features extracted using our method have smaller sizes, which may contribute to the generalization ability of the classification model.


## 4.2.1. Audio Similarity Experiments

First, speech isolated word recognition is achieved by calculating the similarity between speech and matched audio signals. The audio similarity between the same and different speech signals is calculated to determine whether audio features can be used to distinguish them. DTW is a commonly used speech matching algorithm to calculate the similarity between two vectors of different dimensions. The performance of DTW as an early metric learning method is determined by the input features.The proposed algorithm matches two speech vector sums with different m_1-dimensional m_2 degrees. Each m_1-dimensional m_2 degree of the sum is also a vector that is a feature value for each time period in the speech signal. In this study, we calculated the DTW distance between two transposed SHH features and performed the same operation on MFCC features for comparison. The DTW distance indicates the similarity of the audio.We selected 50 audios for each digit from the Aurora dataset and extracted their SHH and MFCC features. The average similarity of audio was calculated for the same digit (SSD) and different digits (SDD). The difference between the SSD and SDD values can be used to determine if the DTW algorithm can distinguish these features well.For audio with the same digits, the feature vectors for all audio are computed in pairs to determine the average DTW distance for each digit. The SSD is the average result of ten digits.For audio of two different digits, all audio features of both digits are mapped one by one to calculate the DTW distance. We average the results of 2500 calculations to obtain the average DTW distance between each pair of digits. The SDD is the average of the results for 45 digit pairs. This is shown in Figure5.Figure 5
Average DTW distance (SSD) for each speech digit and average DTW distance (SDD) between every two different speech digits and the difference between DTW distance for different audios and the same audio.The authors also list the average SSD, the average SDD, and the differences, as shown in Figure6.Figure 6
Average DTW distance for 10 digital voice audio signals.SHH features are more concise than MFCC. For the same audio signal, the DTW distance of SHH features is much smaller than that of MFCC, while the difference of DTW distance is relatively more obvious for different audio signals.The degree of audio similarity reflected by SHH is very similar to that perceived by the human ear. An audio that sounds very similar to the human ear has a high degree of similarity in SHH features, but MFCC features vary greatly. The differences in SHH features are even more pronounced for an audio that sounds very different to the human ear.Therefore, feature extraction using SHH is similar to audio processing in the human brain and can better distinguish audio features; therefore, they perform better in speech classification and isolated word recognition.


## 4.2.2. CRNN Model Testing and Ablation Experiments

To demonstrate the role of each module in the proposed human brain-like feature extraction method, we designed ablation experiments. In Experiment 1, spikegram and HH modules were used. In Experiment 2, only spikegram features were fed into the CRNN model to demonstrate the validity of the HH model. In Experiment 3, the spikegram and HH modules were not used; instead, MFCC features were extracted to demonstrate the superiority of the proposed method. All three experiments were conducted on the same dataset and used the same training parameters. The dataset was divided into 80% of the data for training and 20% for testing. The learning rate of the neural network was initially set to 0.001, with adaptive updates every 40 calendar hours. The number of training epochs was 1000. Figure7 shows the training and testing accuracy of the model using three different feature extraction methods. This is shown in Figure 7.Figure 7
Accuracy of the model using different feature extraction methods.The article also lists the performance of the models in terms of accuracy (P), recall (R), and f1 score (F1) on the SHH method. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 8.Figure 8
Performance of the model on SHH method in terms of precision (P), recall (R), and f1 score (F1).The performance of the model on the spikegram method in terms of precision (P), recall (R), and f1 score (F1) is presented. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 9.Figure 9
Performance of the model on spikegram method in terms of precision (P), recall (R), and f1 score (F1).The performance of the model on the MFCC method in terms of precision (P), recall (R), and f1 score (F1) is presented. For P/R/F1, the larger the better; the best results are shown in bold. This is shown in Figure 10.Figure 10
Performance of the model on MFCC method in terms of precision (P), recall (R), and f1 score (F1).Three feature extraction methods were used for the experiments: SHH, spikegram, and MFCC. The ablation experiments demonstrate the superiority of the proposed methods. MFCC exhibits superior overfitting performance over spikegram and HH features in a given classification model. In addition, the features extracted using our method have smaller sizes, which may contribute to the generalization ability of the classification model.


## 4.3. Discussion

The performance of the proposed model in digital speech recognition tasks is compared with the performance of other recent models. Tavanaei et al. proposed a nonrecursive SNN to convert speech signals into spike sequence features; they extracted the minimum feature vector from each frame of the spectrum after FFT and used the RS model to convert audio signals into spike sequences. Srinivas et al. used SVM andK-nearest to perform English numeric classification using SVM and K-nearest-neighbor (KNN) classifiers and ensemble methods, i.e., random forests; MFCC features were obtained for all input instances. Zada et al. developed an isolated digit recognition for Pashto language by using deep CNN. In another study, 20 MFCC features were extracted for each isolated digit and input to the CNN; for spoken digit corpus data, MFCC showed better performance than cepstral features. In addition, vector quantization feature matching technique and light gradient boosting machine (LightGBM) were used for feature vector clustering.SHH was used in Experiment 1 and obtained an accuracy of 94.8% on the test set, which is higher than the accuracy using existing models. In addition, our method uses fewer layers of neuronal networks. This is shown in Table1Table 1
Comparison with other models in terms of feature extraction method, classification model, and accuracy in the same task.
MethodFeaturesClassification methodAccuracyTavanaei and Maida [26]FFT+RSSVM91%Watt and Kostylev [27]MFCCSVM+KNN97.5%Zada and Ullah [28]MFCCCNN84.17%Rakshith et al. [7]MFCCVQ93%Proposed methodSpike mapSpeech recognition network (CRNN)93.43%SHHCRNN94.8%


## 5. Conclusion

In this study, we proposed a new feature extraction method, called SHH, for processing speech audio, which combines spike maps and HH models. In SHH, the spike maps are extracted in a manner similar to the way the human ear processes sound, while the HH model simulates the generation of neuronal impulses. The proposed method has good biological interpretability and can extract more accurate audio features. This audio feature extraction method can be widely used in various acoustic sensors due to its low energy consumption. In addition, we propose a new parallel CRNN model with an attention mechanism and obtain superior results in speech digital recognition tasks.



---

*Source: 6742474-2022-09-19.xml*