# Patent

## Title
Training wideband acoustic models in the cepstral domain using mixed-bandwidth training data and extended vectors for speech recognition

## Abstract

A method and apparatus are provided that generate values for a first set of dimensions of a feature vector from a speech signal. The values of the first set of dimensions are used to estimate values for a second set of dimensions of the feature vector to form an extended feature vector. The extended feature vector is then used to train an acoustic model.

## Background
BACKGROUND OF THE INVENTION
The present invention relates to speech recognition. In particular, the present invention relates to training acoustic models for speech recognition.
In speech recognition, speech signals are compared to acoustic models to identify a sequence of phonemes that is represented by the speech signal. In most such systems, the comparison between the speech signal and the models is performed in what is known as the cepstral domain. To place a speech signal in the cepstral domain, the speech signal is sampled by an analog-to-digital converter to form frames of digital values. A Discrete Fourier Transform is applied to the frames of digital values to place them in the frequency domain. The power spectrum is computed from the frequency domain values by taking the magnitude squared of the spectrum. Mel weighting is applied to the power spectrum and the logarithm of each of the weighted frequency components is determined. A truncated discrete cosine transform is then applied to form a cepstral vector for each frame. The truncated discrete cosine transform typically converts a forty dimension vector that is present after the log function into a thirteen dimension cepstral vector.
In order for speech decoding to be performed in the cepstral domain, the models must be trained on cepstral vectors. One way to obtain such training data is to convert speech signals into cepstral vectors using a high sampling rate such as sixteen kilohertz. When speech is sampled at this high sampling rate, it is considered wideband data. This wideband data is desirable because it includes information for a large number of frequency components thereby providing more information for forming models that can discriminate between different phonetic sounds.
Although such wideband speech data is desirable, it is expensive to obtain. In particular, it requires that a speaker be in the same room as the microphone used to collect the speech data. In other words, the speech cannot pass through a narrowband filter before reaching the microphone. This requirement forces either the speaker or the designer of the speech recognition system to travel in order to collect training speech.
A second technique for collecting training speech is to collect the speech through a telephone network. In such systems, people are invited to call into a telephone number and provide examples of speech.
In order to limit the amount of data passed through the telephone network, it is common for telephone network providers to sample the speech signal at a low sampling rate. As a result, the speech received for training is narrowband speech that is missing some of the frequency components that are present in wideband training speech. Because such speech includes less information than wideband speech, the models trained from such narrowband telephone speech do not perform as well as models trained from wideband speech.
Although systems have been developed that attempt to decode speech from less than perfect data, such systems have operated in the spectral domain and have not provided a way to train models from less than perfect data. Because the Discrete Cosine Transform that places vectors in the cepstral domain mixes frequency components, and often involves a truncation of features, such systems cannot be applied directly to training cepstral domain acoustic models.
Thus a system is needed that can construct better wideband acoustic models in the cepstral domain using narrowband telephone data.
SUMMARY OF THE INVENTION
A method and apparatus are provided that generate values for a first set of dimensions of a feature vector from a speech signal. The values of the first set of dimensions are used to estimate values for a second set of dimensions of the feature vector to form an extended feature vector. The extended feature vector is then used to train an acoustic model.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of one computing environment in which the present invention may be practiced.
FIG. 2 is a block diagram of an alternative-computing environment in which the present invention may be practiced.
FIG. 3 is a block diagram of speech recognition training and decoding system of the present invention.
FIG. 4 is a flow diagram of a method for training a speech recognition system using mixed-bandwidth data.
FIG. 5 is a graph showing HMM states over time.
FIG. 6 is a flow diagram of a method of training acoustic models using bandwidth extended features.



DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS
FIG. 1 illustrates an example of a suitable computing system environment 100 on which the invention may be implemented. The computing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 100.
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, telephony systems, distributed computing environments that include any of the above systems or devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention is designed to be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules are located in both local and remote computer storage media including memory storage devices.
With reference to FIG. 1, an exemplary system for implementing the invention includes a general-purpose computing device in the form of a computer 110. Components of computer 110 may include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory to the processing unit 120. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.
Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 110. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media.
The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation, FIG. 1 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.
The computer 110 may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive 141 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156 such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.
The drives and their associated computer storage media discussed above and illustrated in FIG. 1, provide storage of computer readable instructions, data structures, program modules and other data for the computer 110. In FIG. 1, for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies.
A user may enter commands and information into the computer 110 through input devices such as a keyboard 162, a microphone 163, and a pointing device 161, such as a mouse, trackball or touch pad. Other input devices (not shown) may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. In addition to the monitor, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 195.
The computer 110 is operated in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110. The logical connections depicted in FIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates remote application programs 185 as residing on remote computer 180. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
FIG. 2 is a block diagram of a mobile device 200, which is an exemplary computing environment. Mobile device 200 includes a microprocessor 202, memory 204, input/output (I/O) components 206, and a communication interface 208 for communicating with remote computers or other mobile devices. In one embodiment, the afore-mentioned components are coupled for communication with one another over a suitable bus 210.
Memory 204 is implemented as non-volatile electronic memory such as random access memory (RAM) with a battery back-up module (not shown) such that information stored in memory 204 is not lost when the general power to mobile device 200 is shut down. A portion of memory 204 is preferably allocated as addressable memory for program execution, while another portion of memory 204 is preferably used for storage, such as to simulate storage on a disk drive.
Memory 204 includes an operating system 212, application programs 214 as well as an object store 216. During operation, operating system 212 is preferably executed by processor 202 from memory 204. Operating system 212, in one preferred embodiment, is a WINDOWS® CE brand operating system commercially available from Microsoft Corporation. Operating system 212 is preferably designed for mobile devices, and implements database features that can be utilized by applications 214 through a set of exposed application programming interfaces and methods. The objects in object store 216 are maintained by applications 214 and operating system 212, at least partially in response to calls to the exposed application programming interfaces and methods.
Communication interface 208 represents numerous devices and technologies that allow mobile device 200 to send and receive information. The devices include wired and wireless modems, satellite receivers and broadcast tuners to name a few. Mobile device 200 can also be directly connected to a computer to exchange data therewith. In such cases, communication interface 208 can be an infrared transceiver or a serial or parallel communication connection, all of which are capable of transmitting streaming information.
Input/output components 206 include a variety of input devices such as a touch-sensitive screen, buttons, rollers, and a microphone as well as a variety of output devices including an audio generator, a vibrating device, and a display. The devices listed above are by way of example and need not all be present on mobile device 200. In addition, other input/output devices may be attached to or found with mobile device 200 within the scope of the present invention.
The present invention provides a technique for training wideband acoustic models in the cepstral domain using a mixture of wideband speech data and narrowband speech data. Under one embodiment, an iterative algorithm is used in which all of the model parameters in the cepstral domain are converted into the spectral domain during each iteration. In the spectral domain, estimates of components missing from the narrowband data are used to update the spectral domain model parameters. The spectral domain model parameters are then converted back into the cepstral domain. In other embodiments, the narrowband data is extended by estimating values for missing components in the narrowband data from models generated from wideband data. After the narrowband feature vectors have been extended, they are used to train the acoustic model in the cepstral domain.
FIG. 3 provides a block diagram of a training and decoding system of the present invention. In FIG. 3, there are two sources of training speech data. Specifically, wideband speech data is provided when a speech signal 300 is detected by a microphone 302. Narrowband speech data is provided when a speech signal 304 passes through a telephone network 306, or some other filtering channel. The output of telephone network 306 may either be an analog signal or a digital signal.
The analog signal provided by microphone 302 or telephone network 306 is sampled by analog-to-digital converter 308, which in one embodiment samples at 16 kilohertz. If the telephone network 306 provides digital samples, the signal from the telephone network is not applied to analog-to-digital converter 308. Instead, the digital signal is “up-sampled” to provide samples at the same rate as those provided by analog-to-digital converter 308.
The digital samples are provided to a frame construction unit 310, which groups the digital samples into frames. Typically, the frame is “windowed” by multiplying the frame's samples by a windowing function. Typically, a Hamming window is used. The frames of digital samples are provided to a Discrete Fourier Transform (DFT) 312, which transforms the frames of time-domain samples into frames of frequency-domain samples.
The magnitudes of the frequency-domain values from DFT 312 are squared by a power calculation 313 to form a power spectrum, which is weighted by mel scale weighting 314. The logarithm of each weighted component is then computed by logarithm 316. The output of log 316 is a set of log spectral vectors 318, with one vector per frame.
The spectral vectors are converted into cepstral vectors 322 by a Discrete Cosine Transform 320. Discrete Cosine Transform 320 is a truncated transform in which the dimensionality of each cepstral vector is less than the dimensionality of the spectral vector applied to the transform.
As noted in the background, narrowband speech data is missing certain frequency components because telephone network 306 samples the speech data at a low sampling rate and attenuates the low frequencies, those less than 300 Hz. These missing components are readily identifiable in the spectral domain since the narrowband spectral vectors will have rather small values for certain frequency components for which the wideband speech data has significant values. Under the present invention, these missing components are treated as missing variables and are estimated through an Expectation-Maximization algorithm. This estimation is performed in the spectral domain because in the cepstral domain, the observed components of the frequency spectrum and the missing components of the frequency spectrum are combined together and cannot be separated in order to form an estimate of the missing components.
Although the estimates of the missing components are formed in the spectral domain, the models that are trained must be trained in the cepstral domain in order to make them useful for speech recognition. Under one embodiment, the models comprise a mixture of Gaussians with mean and covariance parameters νk and Φk, respectively, and prior probability p(k) where k is the index of the mixture component. Thus, the probability of a cepstral vector z given a mixture component k is defined as:

p(z|k)=N(z; νk, Φk)=N(Cx; νk, Φk)  EQ. 1

where in the right-hand side of the equation, the cepstral vector z has been replaced by Cx which represents the log spectral vector x applied to discrete cosine transform matrix C.

In order to iteratively train the model parameters for the cepstral domain, while estimating the missing components from the narrowband data in the spectral domain, the cepstral domain model parameters must be converted to the log mel spectra during each iteration of training. If the cepstral vectors have the same dimensionality as the log spectral vectors (and thus the discrete cosine transform matrix is a square matrix), the conversion between the cepstral model parameters and the log mel spectral model parameters can be performed trivially via an inverse discrete cosine transform. However, because most speech recognition systems perform dimensionality reduction when converting from log mel spectral to cepstral, the discrete cosine transform matrix is not square. As a result, the log mel spectral covariance matrices obtain from cepstral covariance matrices via an inverse discrete cosine transform are rank deficient. Specifically, if the discrete cosine transform matrix is M×L with M<L, than the log mel spectral covariance matrix Σ=C−1ΦC−T is an L×L matrix with at most rank M. This is problematic because the covariance matrix must be full rank in order for it to be invertible and have a non-zero determinant.
One possible solution is to simply train an L-dimensional cepstral model using a square cosine transform, and then truncate the model parameters to M dimensions after training is complete. However this is sub-optimal, as the best way to maximize the overall likelihood may be optimize the higher dimensions of the model, which will be discarded at the expense of the lower dimensions, which are the ones of interest.
The present invention provides a solution that ensures that the log mel spectral covariance matrix is full rank but also ensures that the higher dimensions in the cepstral domain do not bias the posterior probability calculations in the iterative algorithm used to train the model. Specifically, to avoid biasing the posterior probability calculations, the present invention sets the model parameters for the cepstral dimensions that will not form part of the final model to be equal for all of the mixture components. By doing this, each of these dimensions will contribute equally to the likelihood of each mixture component and thus not alter the posterior probabilities.
To achieve this, the present invention uses a square discrete cosine transform matrix. This results in an inverse discrete cosine transform matrix that can be divided into a set of M columns and a set of R columns. Thus, for an inverse discrete cosine transform matrix C−1 the following is defined:




  
    
      
        
          μ
          k
        
        =
        
          
            C
            
              -
              1
            
          
          ⁢
          
            v
            k
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        2
      
    
  
  
    
      
        
          μ
          k
        
        =
        
          
            [
            
              
                C
                M
                
                  -
                  1
                
              
              ⁢
              
                C
                R
                
                  -
                  1
                
              
            
            ]
          
          ⁡
          
            [
            
              
                
                  
                    v
                    
                      k
                      ,
                      M
                    
                  
                
              
              
                
                  
                    v
                    
                      k
                      ,
                      R
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        3
      
    
  
  
    
      
        
          μ
          k
        
        =
        
          
            
              C
              M
              
                -
                1
              
            
            ⁢
            
              v
              
                k
                ,
                M
              
            
          
          +
          
            
              C
              R
              
                -
                1
              
            
            ⁢
            
              v
              
                k
                ,
                R
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        4
      
    
  




where νk is the cepstral mean vector having L dimensions, μk is the mel spectral mean vector having L dimensions, νk,M are the first M dimensions of the cepstral mean vector, νk,R are the last R dimensions of the cepstral mean vector, Cm−1 the first M columns of the inverse discrete cosine transform matrix, and CR−1 are the last R columns of the inverse discrete cosine transform matrix.

Similarly, the log mel spectral covariance matrix can be defined as:




  
    
      
        
          ∑
          k
        
        ⁢
        
          =
          
            
              C
              
                -
                1
              
            
            ⁢
            
              Φ
              k
            
            ⁢
            
              C
              
                -
                T
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        5
      
    
  
  
    
      
        
          ∑
          k
        
        ⁢
        
          =
          
            
              
                [
                
                  
                    C
                    M
                    
                      -
                      1
                    
                  
                  ⁢
                  
                    C
                    R
                    
                      -
                      1
                    
                  
                
                ]
              
              ⁡
              
                [
                
                  
                    
                      
                        Φ
                        
                          k
                          ,
                          M
                        
                      
                    
                    
                      
                        0
                        T
                      
                    
                  
                  
                    
                      0
                    
                    
                      
                        Φ
                        
                          k
                          ,
                          R
                        
                      
                    
                  
                
                ]
              
            
            ⁡
            
              [
              
                
                  
                    
                      C
                      M
                      
                        -
                        T
                      
                    
                  
                
                
                  
                    
                      C
                      R
                      
                        -
                        T
                      
                    
                  
                
              
              ]
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        6
      
    
  
  
    
      
        
          ∑
          k
        
        ⁢
        
          =
          
            
              
                C
                M
                
                  -
                  1
                
              
              ⁢
              
                Φ
                
                  k
                  ,
                  M
                
              
              ⁢
              
                C
                M
                
                  -
                  T
                
              
            
            +
            
              
                C
                R
                
                  -
                  1
                
              
              ⁢
              
                Φ
                
                  k
                  ,
                  R
                
              
              ⁢
              
                C
                R
                
                  -
                  T
                
              
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        7
      
    
  




where 0 is an R×M 0 matrix, Φk,M and Φk,R are assumed to be diagonal, although not required, CM−T and CR−T are the transpose of the inverse discrete cosine transform matrices CM−1 and CR−1.

Equations 4 and 7 show that the log mel spectral mean vector μk and covariance matrix Σk can be decomposed into the sum of two terms, the first reflecting the contribution of the first M dimensions of the cepstral vector and the second reflecting the contribution of the last R dimensions of the cepstral vector. In order to ensure that any differences in the posterior probabilities of the various mixture components are due only to the first M cepstral coefficients, and yet ensure that Σk is full rank, the second additive term is set to be identical for all mixture components. Thus, equations 4 and 7 become:

μk=CM−1νk+bG   EQ. 8

Σk=CM−1ΦkCM−T+AG   EQ. 9

where bG and AG are the same for each mixture component.

FIG. 4 provides a flow diagram of a method of training cepstral model values using the inverse discrete cosine transform described above. In step 400 of FIG. 4, the values for bG and AG are determined using wideband data. Specifically, wideband spectral data 318 produced by log function 316 are applied to a square discrete cosine transform to produce a set of extended cepstral vectors. The last R dimensions of the cepstral vectors are used to determine a mean cepstral vector for the last R dimensions, νG,R, and a covariance matrix for the last R dimensions, ΦG,R. Note that the mean vector and the covariance matrix are global values that are determined across all of the mixture components. The values for bG and AG are then calculated as:

bG=CR−1νG,R   EQ. 10

AG=CR−1ΦG,RCR−T   EQ. 11

These values are stored as training parameters 325 of FIG. 3.
At step 402, initial values for the cepstral model parameters for each mixture component are determined. Specifically, the cepstral mean vector νk and cepstral covariance matrix Φk is determined for each mixture component from the wideband data alone using an EM algorithm. During the EM algorithm, the prior probability, mean and covariance are updated during each iteration as:




  
    
      
        
          p
          ⁡
          
            (
            k
            )
          
        
        =
        
          
            1
            N
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              p
              ⁡
              
                (
                
                  k
                  ⁢
                  
                    ❘
                  
                  ⁢
                  
                    x
                    i
                  
                
                )
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        12
      
    
  
  
    
      
        
          v
          k
        
        =
        
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              
                p
                ⁡
                
                  (
                  
                    k
                    ⁢
                    
                      ❘
                    
                    ⁢
                    
                      x
                      i
                    
                  
                  )
                
              
              ⁢
              
                x
                i
              
            
          
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              p
              ⁡
              
                (
                
                  k
                  ⁢
                  
                    ❘
                  
                  ⁢
                  
                    x
                    i
                  
                
                )
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        13
      
    
  
  
    
      
        
          Φ
          k
        
        =
        
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              
                p
                ⁡
                
                  (
                  
                    k
                    ⁢
                    
                      ❘
                    
                    ⁢
                    
                      x
                      i
                    
                  
                  )
                
              
              ⁢
              
                (
                
                  
                    x
                    i
                  
                  -
                  
                    
                      v
                      ^
                    
                    k
                  
                
                )
              
              ⁢
              
                
                  (
                  
                    
                      x
                      i
                    
                    -
                    
                      
                        v
                        ^
                      
                      k
                    
                  
                  )
                
                T
              
            
          
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              p
              ⁡
              
                (
                
                  k
                  ⁢
                  
                    ❘
                  
                  ⁢
                  
                    x
                    i
                  
                
                )
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        14
      
    
  




where N is the number of frames in the wideband training data, p(k|xi) is the probability of mixture component k given feature vector xi which is computed during the E step of the EM algorithm, and {circumflex over (ν)}k is the mean determined during the last or current iteration of the EM algorithm.

After the cepstral model parameters have been initialized at step 402, they are converted into the spectral domain using equations 8 and 9 above at step 404. This creates log mel spectral mean μk and covariance matrix Σk.
Under the present invention, the model parameters are updated in the spectral domain using a combination of wideband data and narrowband data. The wideband data contains all of the frequency components found in the mean μk and covariance matrix Σk. However, the narrowband data does not include values for certain frequency components that are present in the wideband data. The components that the narrowband data does possess are referred to as observed components and the frequency components that the narrowband data does not possess are referred to as missing components. Typically, the narrowband data is missing certain frequency components because the speech signal has passed through some type of filter or has been sampled at a low sampling rate. The filtering can be performed to reduce the bandwidth of data passed through a channel or to remove frequency components that are likely to be corrupted by noise.
The observed and missing frequency components can be used to divide the spectral mean vector and the covariance matrix into partitions such that:




  
    
      
        
          μ
          k
        
        =
        
          
            [
            
              
                μ
                k
                
                  o
                  ,
                  T
                
              
              ⁢
              
                μ
                k
                
                  m
                  ,
                  T
                
              
            
            ]
          
          T
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        15
      
    
  
  
    
      
        
          ∑
          k
        
        ⁢
        
          =
          
            [
            
              
                
                  
                    ∑
                    k
                    oo
                  
                
                
                  
                    ∑
                    k
                    mo
                  
                
              
              
                
                  
                    ∑
                    k
                    om
                  
                
                
                  
                    ∑
                    k
                    
                      m
                      ⁢
                      
                        
                      
                      ⁢
                      m
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        16
      
    
  




Using these partitions, the following values can be determined at step 406 during the E step of an EM algorithm:




  
    
      
        
          μ
          ik
          
            m
            |
            o
          
        
        =
        
          
            μ
            k
            m
          
          +
          
            
              ∑
              k
              mo
            
            ⁢
            
              
                ∑
                k
                
                  oo
                  ,
                  
                    -
                    1
                  
                
              
              ⁢
              
                (
                
                  
                    x
                    i
                    o
                  
                  -
                  
                    μ
                    k
                    o
                  
                
                )
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        17
      
    
  
  
    
      
        
          ∑
          k
          
            m
            |
            o
          
        
        ⁢
        
          =
          
            
              ∑
              k
              
                m
                ⁢
                
                  
                
                ⁢
                m
              
            
            ⁢
            
              -
              
                
                  ∑
                  k
                  mo
                
                ⁢
                
                  
                    ∑
                    k
                    
                      oo
                      ,
                      
                        -
                        1
                      
                    
                  
                  ⁢
                  
                    ∑
                    k
                    om
                  
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        18
      
    
  
  
    
      
        
          p
          ⁡
          
            (
            
              k
              ❘
              
                x
                i
                o
              
            
            )
          
        
        =
        
          
            
              p
              ⁡
              
                (
                
                  
                    x
                    i
                    o
                  
                  ⁢
                  
                    ❘
                  
                  ⁢
                  k
                
                )
              
            
            ⁢
            
              p
              ⁡
              
                (
                k
                )
              
            
          
          
            
              ∑
              
                
                  k
                  ′
                
                =
                1
              
              K
            
            ⁢
            
              
                p
                ⁡
                
                  (
                  
                    
                      x
                      i
                      o
                    
                    ⁢
                    
                      ❘
                    
                    ⁢
                    
                      k
                      ′
                    
                  
                  )
                
              
              ⁢
              
                p
                ⁡
                
                  (
                  
                    k
                    ′
                  
                  )
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        19
      
    
  




where xio is a vector of the frequency components that are observed at time i in both the narrowband data and the wideband data, p(xio|k) is a probability of the observed frequency components given mixture component k which is defined as a normal distribution with mean μko and covariance Σkoo, p(k) is the prior probability of a mixture component which initially is set to 1/K where K is the number of mixture components.

Note that in the computation of p(k|xio) of equation 19, more dimensions will be used for the wideband data than for the narrowband data since the wideband data includes more observed components.
In equation 17, only those components that are found in both the wideband data and the narrowband data are used in the difference calculation.
Once these values have been calculated at step 406, they are used in an M step of the EM algorithm, shown as step 408 in FIG. 4, to compute updated values for μk,Σk and p(k). Specifically, the update equation for μk is:




  
    
      
        
          
            μ
            k
            new
          
          =
          
            
              
                ∑
                
                  i
                  =
                  1
                
                N
              
              ⁢
              
                
                  p
                  ⁡
                  
                    (
                    
                      k
                      ⁢
                      
                        ❘
                      
                      ⁢
                      
                        x
                        i
                        o
                      
                    
                    )
                  
                
                ⁢
                
                  
                    x
                    ~
                  
                  ik
                
              
            
            
              
                ∑
                
                  i
                  =
                  1
                
                N
              
              ⁢
              
                p
                ⁡
                
                  (
                  
                    k
                    ⁢
                    
                      ❘
                    
                    ⁢
                    
                      x
                      i
                      o
                    
                  
                  )
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          where
          ⁢
          
            :
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        20
      
    
  
  
    
      
        
          
            x
            ~
          
          ik
        
        =
        
          {
          
            
              
                
                  x
                  i
                
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  frame
                  ⁢
                  
                    
                  
                  ⁢
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  is
                  ⁢
                  
                    
                  
                  ⁢
                  wideband
                
              
            
            
              
                
                  [
                  
                    
                      
                        
                          x
                          i
                          o
                        
                      
                    
                    
                      
                        
                          μ
                          ik
                          
                            m
                            |
                            o
                          
                        
                      
                    
                  
                  ]
                
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  frame
                  ⁢
                  
                    
                  
                  ⁢
                  i
                  ⁢
                  
                    
                      
                    
                    ⁢
                    
                      
                    
                  
                  ⁢
                  is
                  ⁢
                  
                    
                      
                    
                    ⁢
                    
                      
                    
                  
                  ⁢
                  narrowband
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        21
      
    
  




with μikm|o computed from the current set of model parameters.

The update equation for the covariance matrix is:




  
    
      
        
          ∑
          k
          new
        
        ⁢
        
          =
          
            
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  N
                
                ⁢
                
                  
                    p
                    ⁡
                    
                      (
                      
                        k
                        ❘
                        
                          x
                          i
                          o
                        
                      
                      )
                    
                  
                  ⁢
                  
                    (
                    
                      
                        
                          x
                          ~
                        
                        ik
                      
                      -
                      
                        μ
                        k
                      
                    
                    )
                  
                  ⁢
                  
                    
                      (
                      
                        
                          
                            x
                            ~
                          
                          ik
                        
                        -
                        
                          μ
                          k
                        
                      
                      )
                    
                    T
                  
                
              
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  N
                
                ⁢
                
                  p
                  ⁡
                  
                    (
                    
                      k
                      ⁢
                      
                        ❘
                      
                      ⁢
                      
                        x
                        i
                        o
                      
                    
                    )
                  
                
              
            
            +
            
              
                
                  ∑
                  ~
                
                k
                
                  m
                  |
                  o
                
              
              ⁢
              
                

              
              ⁢
              
                where
                ⁢
                
                  :
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        2
      
    
  
  
    
      
        
          
            ∑
            ~
          
          k
          
            m
            |
            o
          
        
        ⁢
        
          =
          
            [
            
              
                
                  
                    0
                    oo
                  
                
                
                  
                    0
                    om
                  
                
              
              
                
                  
                    0
                    mo
                  
                
                
                  
                    ∑
                    k
                    
                      m
                      /
                      o
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        23
      
    
  




and the update equation for p(k) is:





  
    
      
        
          
            p
            ⁡
            
              (
              k
              )
            
          
          new
        
        =
        
          
            1
            N
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              p
              ⁡
              
                (
                
                  k
                  ⁢
                  
                    ❘
                  
                  ⁢
                  
                    x
                    i
                    o
                  
                
                )
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        24
      
    
  




In equation 22, the state-dependent conditional covariance, Σkm|o, is only added to the covariance assigned to the Σkmm partition of Φk, and reflects the uncertainty associated with the absence of the missing components in the narrowband training vectors.
An intuition for update equations 20-24 is that for wideband data, the mean will be updated based on the entire wideband feature vector. However, for narrowband data, only some of the dimensions of the mean are updated from the observed dimensions in the narrowband feature vector. For those dimensions that are not present in the narrowband feature vector, an approximation to those missing feature components is used to derive the update for the mean. This approximation is derived in equation 17 by adjusting the mean for the missing components from the previous iteration based on the difference between the observed component and the mean for the observed component as well as the covariance between the missing components and the observed components.
After the mean and covariance have been updated in the spectral domain, they are converted to the cepstral domain at step 410. This is done by applying the mean and covariance to a truncated discrete cosine transform as:

νkCtruncμk   EQ. 25

ΦkCtruncΣk CtruncT   EQ. 26

This produces a new cepstral mean vector and cepstral covariance for each mixture component k and is stored in cepstral models 326.
After the mean and covariance for each mixture component has been converted to the cepstral domain, the method of FIG. 4 determines if the model parameters have converged at step 412. If the model parameters have not converged, the process returns to step 404 and converts the current cepstral model parameters to the spectral domain using equations 8 and 9 above. Steps 406, 408, 410 and 412 are then repeated using the new spectral model parameters.
When the cepstral model parameters converge at step 412, the process ends at step 414. The cepstral model parameters 326 may then be used by decoding unit 328 to decode input cepstral vectors.
The process of training the cepstral model parameters shown in FIG. 4 allows parameters to be trained based on a combination of wideband data and narrowband data. As a result, the invention can be practiced with a small amount of wideband data and a large amount of inexpensive narrowband data. This reduces the cost of training speech recognition models in the cepstral domain. In addition, the technique for allowing an inversion of the cepstral model parameters to the spectral domain as found above allows the model parameters to be updated in the spectral domain where the observed components and the missing components from the narrowband data can be separated from each other. Such separation of the missing and observed frequency components would not be possible in the cepstral domain.
The invention has been described above with reference to a Gaussian mixture model. This Gaussian mixture model could be extended to a Hidden Markov Model with K states, each state having a mixture of Q Gaussians associated with it. During HMM decoding, a sequence of HMM states is identified from an observation sequence Xo=[x0o . . . xn−1o]. FIG. 5 shows a graph of HMM states over time with HMM states shown on vertical axis 500 and time shown on horizontal axis 502. At any state and time, the probability of a mixture component in that state is based on the probability of entering that state at that time from all possible state sequences that precede that state, the probability of leaving that state at that time through all possible state sequences after that state, and the probability of that mixture component in that state given the observed feature vector. For example, in FIG. 5, the probability of a mixture component of state 504 is based on all of the possible state sequences that enter state 504 at time 506, shown as lines connecting states from time point 508 to state 504, all of the possible state sequences that extend from state 504, shown as lines connecting state 504 to states at time point 510, and the probability of the mixture component given the observed feature vector. In terms of an equation, the posterior probability of the qth Gaussian in HMM state k for frame i, given an observation sequence of feature vectors is defined as:




  
    
      
        
          γ
          ikq
        
        =
        
          
            
              
                α
                ik
              
              ⁢
              
                β
                ik
              
            
            
              
                ∑
                
                  
                    k
                    ′
                  
                  =
                  1
                
                K
              
              ⁢
              
                
                  α
                  
                    ik
                    ′
                  
                
                ⁢
                
                  β
                  
                    ik
                    ′
                  
                
              
            
          
          ⁢
          
            
              
                p
                ⁡
                
                  (
                  
                    
                      
                        x
                        i
                        o
                      
                      ⁢
                      
                        ❘
                      
                      ⁢
                      k
                    
                    ,
                    q
                  
                  )
                
              
              ⁢
              
                p
                ⁡
                
                  (
                  
                    k
                    ,
                    q
                  
                  )
                
              
            
            
              
                ∑
                
                  
                    q
                    ′
                  
                  =
                  1
                
                Q
              
              ⁢
              
                
                  p
                  ⁡
                  
                    (
                    
                      
                        
                          x
                          i
                          o
                        
                        ⁢
                        
                          ❘
                        
                        ⁢
                        k
                      
                      ,
                      
                        q
                        ′
                      
                    
                    )
                  
                
                ⁢
                
                  p
                  ⁡
                  
                    (
                    
                      
                        k
                        ′
                      
                      ,
                      
                        q
                        ′
                      
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        27
      
    
  




where αik and βik are the conventional forward and backward variables used in the Baum Welch training algorithm for HMM models, p(k,q) is the mixture weight of the qth Gaussian in state k, and p(xio|k,q)=N(xio;μkqo,Σkqoo), is the likelihood of the given Gaussian measured using the observed components only. Thus, the αik and βik terms provide the probability of reaching state k from the beginning of the sequence of observed vectors until the current vector and reaching the last vector in the sequence of observed vectors from the current vector. The remaining terms provide the probability of the qth mixture component in state k given the current observation value. Using this posterior definition, equations 20, 22 and 24 become:





  
    
      
        
          μ
          qk
          new
        
        =
        
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              
                γ
                iqk
              
              ⁢
              
                
                  x
                  ~
                
                iqk
              
            
          
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              γ
              iqk
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        28
      
    
  
  
    
      
        
          ∑
          qk
          new
        
        ⁢
        
          =
          
            
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  N
                
                ⁢
                
                  
                    
                      γ
                      iqk
                    
                    ⁡
                    
                      (
                      
                        
                          
                            x
                            ~
                          
                          iqk
                        
                        -
                        
                          μ
                          qk
                        
                      
                      )
                    
                  
                  ⁢
                  
                    
                      (
                      
                        
                          
                            x
                            ~
                          
                          iqk
                        
                        -
                        
                          μ
                          qk
                        
                      
                      )
                    
                    T
                  
                
              
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  N
                
                ⁢
                
                  γ
                  iqk
                
              
            
            +
            
              
                ∑
                ~
              
              qk
              
                m
                |
                o
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        29
      
    
  
  
    
      
        
          
            p
            ⁡
            
              (
              
                q
                ,
                k
              
              )
            
          
          new
        
        =
        
          
            1
            N
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              γ
              iqk
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        30
      
    
  




where k and q are used to index the model parameters, with k representing the HMM state and q representing the mixture component of the state.
The Hidden Markov Model training described above is computationally expensive since it requires an update of the estimate of the missing components for each state at each frame of the input. Under a separate embodiment, a wideband cepstral vector zi is inferred given an observed narrowband log mel spectral vector xio. This inferred wideband cepstral vector is then combined with measured wideband cepstral data to train acoustic models in the cepstral domain. Under one embodiment, the inference is performed using a minimum mean squared error estimate (MMSE) of a wideband cepstral vector zi, which can be expressed as:

{circumflex over (z)}i=E[z|xio]=E[zio+zm|xio]=Coxio+CmE[xm|xio]  EQ. 31

where E[.] represents the expectation operator, Co represents the elements of the discrete cosine transform matrix C that are applied to the frequency components observed in the narrowband data, Cm represents the portions of the discrete cosine transform that are applied to the frequency components that are missing in the narrowband data but that are present in the wideband data, xm represents the missing frequency components in the narrowband data and xio represents the observed frequency components in the narrowband feature vector.

The expected value of the missing frequency components given the observed frequency components, E[xm|xio] can be determined from Gaussian mixture model parameters as:




  
    
      
        
          E
          ⁢
          
            
          
          [
          
            
              x
              m
            
            |
            
              x
              i
              o
            
          
          ]
        
        =
        
          
            ∑
            
              k
              =
              1
            
            K
          
          ⁢
          
            ∫
            
              
                x
                m
              
              ⁢
              p
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    x
                    m
                  
                  ,
                  
                    k
                    ❘
                    
                      x
                      i
                      o
                    
                  
                
                )
              
              ⁢
              
                d
                
                  x
                  m
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        32
      
    
  
  
    
      
        
          E
          ⁢
          
            
          
          [
          
            
              x
              m
            
            |
            
              x
              i
              o
            
          
          ]
        
        =
        
          
            ∑
            
              k
              =
              1
            
            K
          
          ⁢
          
            p
            ⁢
            
              
            
            ⁢
            
              (
              
                k
                ❘
                
                  x
                  i
                  o
                
              
              )
            
            ⁢
            
              ∫
              
                
                  x
                  m
                
                ⁢
                p
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      
                        x
                        m
                      
                      |
                      
                        x
                        i
                        o
                      
                    
                    ,
                    k
                  
                  )
                
                ⁢
                
                  d
                  
                    x
                    m
                  
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        33
      
    
  
  
    
      
        
          E
          ⁢
          
            
          
          [
          
            
              x
              m
            
            |
            
              x
              i
              o
            
          
          ]
        
        =
        
          
            ∑
            
              k
              =
              1
            
            K
          
          ⁢
          
            p
            ⁢
            
              
            
            ⁢
            
              (
              
                k
                ❘
                
                  x
                  i
                  o
                
              
              )
            
            ⁢
            
              
            
            ⁢
            
              μ
              ik
              
                m
                ❘
                o
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        34
      
    
  




where p(k|xio) is the posterior probability of the kth Gaussian based only on the observed components of the feature vector and μikm|o is the conditional mean defined in equation 17. Substituting equation 34 into equation 31 leads to the solution for the minimum mean squared error estimate of zi given the narrowband observation xio:





  
    
      
        
          
            z
            ^
          
          i
        
        =
        
          
            
              C
              o
            
            ⁢
            
              x
              i
              o
            
          
          +
          
            
              C
              m
            
            ⁡
            
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  K
                
                ⁢
                
                  p
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      k
                      ❘
                      
                        x
                        i
                        o
                      
                    
                    )
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    μ
                    ik
                    
                      m
                      ❘
                      o
                    
                  
                
              
              )
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        35
      
    
  




Equation 35 describes the inference for a Gaussian Mixture Model. For a Hidden Markov Model, the summation is performed across all mixture components and all states. Thus, Equation 35 becomes:




  
    
      
        
          
            z
            ^
          
          i
        
        =
        
          
            
              C
              o
            
            ⁢
            
              x
              i
              o
            
          
          +
          
            
              C
              m
            
            ⁡
            
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  K
                
                ⁢
                
                  
                    ∑
                    
                      q
                      =
                      1
                    
                    Q
                  
                  ⁢
                  
                    
                      γ
                      ikq
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      μ
                      iqk
                      
                        m
                        ❘
                        o
                      
                    
                  
                
              
              )
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        36
      
    
  




where γikq is defined in equation 26 above.

FIG. 6 provides a flow diagram of a method in which equation 35 or 36 may be used to infer wideband cepstral vectors from narrowband cepstral data as part of training acoustic models in the cepstral domain. In step 600 of FIG. 6, an acoustic model is trained in the cepstral domain using only wideband data. Such training is described above with reference to equations 13 and 14, in which an EM algorithm is used to train a mean νk and a covariance Φk for each mixture component k.
In step 602, the cepstral domain model parameters are converted to the spectral domain using equations 8-11 described above. Using the model parameters in the spectral domain, the posterior probability and the conditional mean vector are determined for each Gaussian. For a Gaussian mixture model, this involves computing p(k|xio) and μikm|o using equations 19 and 17 described above. For a Hidden Markov Model, this involves computing p(k,q|xio) and μiqkm|o using equations 19 and 17 above and indexing the Gaussian models by their state k and mixture component q. In equations 19, the probability of a mixture component p(k) (or p(q,k) for an HMM) can be determined during the training of the cepstral domain model parameters. Using the values of the posterior probability and the conditional mean, the vector extensions for the narrowband vector can be determined and the wideband data vector can be inferred using Equation 35 or Equation 36 at step 604.
After all of the narrowband data has been extended to form extended narrowband vectors, the extended narrowband vectors are combined with the wideband data vectors to train the acoustic models in the spectral domain at step 606.
Under one embodiment, the extended narrowband vectors are not as “trusted” as the wideband vectors since the extended narrowband vectors have their missing components estimated. To reflect this “mistrust,” a weighting factor can be assigned to the posterior probability of each frame of bandwidth-extended speech when the Gaussian parameter updates are computed during the EM training of the models in the cepstral domain. Thus, for an HMM model the prior model, the mean and the variance are updated as:




  
    
      
        
          p
          ⁢
          
            
          
          ⁢
          
            (
            
              k
              ,
              q
            
            )
          
        
        =
        
          
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  w
                
              
              ⁢
              
                γ
                ikq
              
            
            +
            
              λ
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  
                    N
                    b
                  
                
                ⁢
                
                  γ
                  jkq
                
              
            
          
          
            
              N
              w
            
            +
            
              N
              b
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        37
      
    
  
  
    
      
        
          v
          kq
        
        =
        
          
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  π
                
              
              ⁢
              
                
                  γ
                  ikq
                
                ⁢
                
                  
                
                ⁢
                
                  z
                  i
                
              
            
            +
            
              λ
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  
                    N
                    b
                  
                
                ⁢
                
                  
                    γ
                    jkq
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      z
                      ^
                    
                    j
                  
                
              
            
          
          
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  π
                
              
              ⁢
              
                γ
                ikq
              
            
            +
            
              λ
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  
                    N
                    b
                  
                
                ⁢
                
                  γ
                  jkq
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        38
      
    
  
  
    
      
        
          Φ
          kq
        
        =
        
          
            
              
                
                  
                    
                      ∑
                      
                        i
                        =
                        1
                      
                      
                        N
                        π
                      
                    
                    ⁢
                    
                      
                        
                          γ
                          ikq
                        
                        ⁡
                        
                          (
                          
                            
                              z
                              i
                            
                            -
                            
                              v
                              kq
                            
                          
                          )
                        
                      
                      ⁢
                      
                        
                          (
                          
                            
                              z
                              i
                            
                            -
                            
                              v
                              kq
                            
                          
                          )
                        
                        T
                      
                    
                  
                  +
                
              
            
            
              
                
                  
                    
                      λ
                      ∑
                    
                    
                      j
                      =
                      1
                    
                    
                      N
                      b
                    
                  
                  ⁢
                  
                    
                      
                        γ
                        jkq
                      
                      ⁡
                      
                        (
                        
                          
                            
                              z
                              ^
                            
                            j
                          
                          -
                          
                            v
                            kq
                          
                        
                        )
                      
                    
                    ⁢
                    
                      
                        (
                        
                          
                            
                              z
                              ^
                            
                            j
                          
                          -
                          
                            v
                            kq
                          
                        
                        )
                      
                      T
                    
                  
                
              
            
          
          
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  N
                  π
                
              
              ⁢
              
                γ
                ikq
              
            
            +
            
              λ
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  
                    N
                    b
                  
                
                ⁢
                
                  γ
                  jkq
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        39
      
    
  




where λ is between zero and one, zi represents a wideband speech vector, {circumflex over (z)}j represents an extended narrowband feature vector Nw represents the number of wideband feature vectors, Nb represents the number of extended narrowband feature vectors and γikq and γjkq are the state posterior probabilities computed from the E-step of the conventional Baum Welch algorithm and are defined as:





  
    
      
        
          γ
          ikq
        
        =
        
          
            
              
                α
                ik
              
              ⁢
              
                β
                ik
              
            
            
              
                ∑
                
                  
                    k
                    ′
                  
                  =
                  1
                
                K
              
              ⁢
              
                
                  α
                  
                    ik
                    ′
                  
                
                ⁢
                
                  β
                  
                    ik
                    ′
                  
                
              
            
          
          ⁢
          
            
              p
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    
                      z
                      i
                    
                    ❘
                    k
                  
                  ,
                  q
                
                )
              
              ⁢
              
                
              
              ⁢
              p
              ⁢
              
                
              
              ⁢
              
                (
                
                  k
                  ,
                  q
                
                )
              
            
            
              
                ∑
                
                  q
                  =
                  1
                
                Q
              
              ⁢
              
                p
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      
                        z
                        i
                      
                      |
                      k
                    
                    ,
                    
                      q
                      ′
                    
                  
                  )
                
                ⁢
                
                  
                
                ⁢
                p
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    k
                    ,
                    
                      q
                      ′
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        40
      
    
  
  
    
      
        
          γ
          jkq
        
        =
        
          
            
              
                α
                jk
              
              ⁢
              
                β
                jk
              
            
            
              
                ∑
                
                  
                    k
                    ′
                  
                  =
                  1
                
                K
              
              ⁢
              
                
                  α
                  
                    jk
                    ′
                  
                
                ⁢
                
                  β
                  
                    jk
                    ′
                  
                
              
            
          
          ⁢
          
            
              p
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    
                      
                        z
                        ^
                      
                      j
                    
                    ❘
                    k
                  
                  ,
                  q
                
                )
              
              ⁢
              
                
              
              ⁢
              p
              ⁢
              
                
              
              ⁢
              
                (
                
                  k
                  ,
                  q
                
                )
              
            
            
              
                ∑
                
                  
                    q
                    ′
                  
                  =
                  1
                
                Q
              
              ⁢
              
                p
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      
                        
                          z
                          ^
                        
                        j
                      
                      |
                      k
                    
                    ,
                    q
                  
                  )
                
                ⁢
                
                  
                
                ⁢
                p
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    k
                    ,
                    q
                  
                  )
                
              
            
          
        
      
    
    
      
        EQ
        .
        
          
        
        ⁢
        41
      
    
  




where αik and αjk are the forward variables and βik and βjk are and backward variables used in the Baum Welch training algorithm.

The value of λ may be set by using a development set of data and testing different values of λ to see which value gives the best acoustic models as tested against the development set. Under many embodiments, the present inventors have found that a value of λ at 0.2 performs well.
Thus, through the present invention, acoustic models may be trained in the cepstral domain using a combination of wideband training data and narrowband training data. Under some embodiments, the narrowband data is used directly in the EM algorithm with the missing components of the narrowband data estimated in the EM iterations. In other embodiments, the narrowband feature vectors are extended by estimating the values of their missing components based on models trained on wideband data only. The extended narrowband feature vectors are then used together with wideband feature vectors to train an acoustic model in the cepstral domain. This invention allows for acoustic models to be trained in the cepstral domain using less expensive narrowband acoustic data thereby making it less expensive to train wideband acoustic models in the cepstral domain while not severely impacting the performance of the acoustic models.
Although the present invention has been described with reference to particular embodiments, workers skilled in the art will recognize that changes may be made in form and detail without departing from the spirit and scope of the invention.

## Claims

1. A method of training acoustic models, the method comprising:
receiving a speech signal through a filtered channel;
generating values for a first set of dimensions of a feature vector from the speech signal;
using the values of the first set of dimensions of the feature vector generated from the speech signal and parameters of a model to estimate values for a second set of dimensions to thereby form an extended feature vector; and
using the extended feature vector to train an acoustic model.

2. The method of claim 1 wherein using the values of the first set of dimensions and parameters of a model to estimate the values of the second set of dimensions comprises estimating the values of the second set of dimensions based on a mean vector for the first set of dimensions of the feature vector.

3. The method of claim 2 wherein using the values of the first set of dimensions and parameters of a model to estimate the values of the second set of dimensions further comprises estimating the values of the second set of dimensions based on a mean vector for the second set of dimensions of the feature vector.

4. The method of claim 3 wherein the mean vector for the second set of dimensions of the feature vector is trained from training feature vectors having values for both the first set of dimensions and the second set of dimensions.

5. The method 1 wherein the values for the first set of dimensions of the extended feature vector and the values for the second set of dimensions of the extended feature vector are in the spectral domain.

6. The method of claim 5 wherein using the extended feature vector to train the acoustic model comprises transforming the extended feature vector to the cepstral domain.

7. The method of claim 6 wherein using the extended feature vector to train the acoustic model further comprises also using training feature vectors having values for the first and second set of dimensions that are derived from a training speech signal to train the acoustic model.

8. The method of claim 7 further comprising weighting the extended feature vector less than a training feature vector when training the acoustic model.

9. A computer-readable storage medium having encoded thereon computer-executable instructions that when executed by a processor cause the processor to perform steps comprising:
receiving a first speech signal after it has passed though a filter;
receiving a second speech signal;
forming an extended feature vector by forming values for a first set of frequency components of the extended feature vector from the received first speech signal and estimating values for a second set of frequency components of the extended feature vector based on a model;
forming a wideband feature vector by forming values for all of the frequency components of the wideband feature vector from the second speech signal; and
using the extended feature vector and the wideband feature vector to train an acoustic model.

10. The computer-readable storage medium of claim 9 wherein estimating values for the second set of frequency components further comprises estimating the values based on the values for the first set of frequency components.

11. The computer-readable storage medium of claim 10 wherein estimating values for the second set of frequency components based on a model comprises estimating the values based on a model of values for the first set of frequency components.

12. The computer-readable storage medium of claim 11 wherein estimating values for the second set of frequency components based on a model further comprises estimating the values based on a model of values for the second set of frequency components.

13. The computer-readable storage medium of claim 12 wherein the model of values for the second set of frequency components comprises a mixture model having a mean vector for each of a set of mixture components.

14. The computer-readable storage medium of claim 13 wherein estimating values for the second set of frequency components comprises forming a separate estimate for each mixture component.

15. The computer-readable storage medium of claim 14 wherein estimating values for the second set of frequency components comprises forming a weighted sum of the separate estimates.

16. The computer-readable storage medium of claim 12 wherein the model of values for the second set of frequency components is trained from training feature vectors having values for the first and second set of frequency components.

17. The computer-readable storage medium of claim 12 wherein forming values for the first set of frequency components of the extended feature vector comprises forming values from a speech signal that passed through a telephone network.

18. The computer-readable storage medium of claim 9 further comprising forming a plurality of extended feature vectors and a plurality of wideband feature vectors and using more extended feature vectors than wideband feature vectors to train the acoustic model.

19. The computer-readable storage medium of claim 9 wherein using the extended feature vector and the wideband feature vector to train the acoustic model comprises weighting the extended feature vector differently from the wideband feature vector.

20. A method of training an acoustic model, the method comprising:
collecting training speech signals over a telephone network;
converting the training speech signals into feature vectors;
extending the feature vectors by estimating values for frequency components that are missing in the feature vectors to form extended feature vectors; and
using the extended feature vectors to train the acoustic model.