Method of noise reduction using correction vectors based on dynamic aspects of speech and noise normalization

BACKGROUND OF THE INVENTION

[0001] The present invention relates to noise reduction. In particular, the present invention relates to removing noise from signals used in pattern recognition.

[0002] A pattern recognition system, such as a speech recognition system, takes an input signal and attempts to decode the signal to find a pattern represented by the signal. For example, in a speech recognition system, a speech signal (often referred to as a test signal) is received by the recognition system and is decoded to identify a string of words represented by the speech signal.

[0003] To decode the incoming test signal, most recognition systems utilize one or more models that describe the likelihood that a portion of the test signal represents a particular pattern. Examples of such models include Neural Nets, Dynamic Time Warping, segment models, and Hidden Markov Models.

[0004] Before a model can be used to decode an incoming signal, it must be trained. This is typically done by measuring input training signals generated from a known training pattern. For example, in speech recognition, a collection of speech signals is generated by speakers reading from a known text. These speech signals are then used to train the models.

[0005] In order for the models to work optimally, the signals used to train the model should be similar to the eventual test signals that are decoded. In particular, the training signals should have the same amount and type of noise as the test signals that are decoded.

[0006] Typically, the training signal is collected under “clean” conditions and is considered to be relatively noise free. To achieve this same low level of noise in the test signal, many prior art systems apply noise reduction techniques to the testing data.

[0007] In one technique for removing noise, the prior art identifies a set of correction vectors from a stereo signal formed of two channel signals, each channel containing the same pattern signal. One of the channel signals is “clean” and the other includes additive noise. Using feature vectors that represent frames of these channel signals, a collection of noise correction vectors are determined by subtracting feature vectors of the noisy channel signal from feature vectors of the clean channel signal. When a feature vector of a noisy pattern signal, either a training signal or a test signal, is later received, a suitable correction vector is added to the feature vector to produce a noise reduced feature vector.

[0008] This stereo-based technique for generating correction vectors has in the past utilized only static descriptions of the pattern signals. Thus, the correction, vectors have not incorporated the dynamic nature of pattern signals such as speech. As a result, the sequences of noise-reduced feature vectors tend to include a large number of discontinuities between neighboring feature vectors. In other words, the changes between neighboring noise-reduced feature vectors are not as smooth as in normal speech.

[0009] In addition, the stereo-based correction does not perform optimally if a noise in an input signal was not found in the training data. When this occurs, the system attempts to find the closest correction vector. However, since the noise was not found in the training data, the correction vector will not adequately remove the noise. In fact, in areas of the input signal where the signal-to-noise ratio is low, the correction vector can actually worsen the noise in the input signal.

[0010] In light of this, a noise reduction technique is needed that is more effective at removing noise from pattern signals.

SUMMARY OF THE INVENTION

[0011] A method and apparatus are provided for reducing noise in a signal. The noise reduction technique converts a frame of a noisy signal into a noisy feature vector. A correction vector is then selected based on the noisy feature vector. The selected correction vector incorporates dynamic aspects of pattern signals. Under some embodiments, the dynamic aspects are incorporated as dynamic coefficients in the correction vector. In other embodiments, the dynamic aspects are incorporated by passing correction vectors through a filter. In still further embodiments, the dynamic aspects are incorporated by selecting the correction vector based on a sequence of noisy feature vectors instead of based on a single noisy feature vector. Once selected, the correction vector is added to the noisy feature vector to produce a cleaned feature vector.

[0012] Under a second aspect of the invention, noise in a noisy signal is estimated and a value representing the noise is subtracted from a value representing the noisy signal. This creates a noise-normalized value, which is used to identify a correction value. The correction value is added to the noise-normalized value to produce a cleaned noise-normalized value. The value representing the noise is then added to the cleaned noise-normalized value to produce a value representing a cleaned signal.

BRIEF DESCRIPTION OF THE DRAWINGS

P-0013[0013]FIG. 1 is a block diagram of one computing environment in which the present invent on may be practiced.

P-0014[0014]FIG. 2 is a block diagram of an alternative computing environment in which the present invention may be practiced.

P-0015[0015]FIG. 3 is a flow diagram of a method of training a noise reduction system under one embodiment of the present invention.

P-0016[0016]FIG. 4 is a block diagram of components used in one embodiment of the present invention to train a noise reduction system.

P-0017[0017]FIG. 5 is a flow diagram of a method of using a noise reduction system under one embodiment of the present invention.

P-0018[0018]FIG. 6 is a flow diagram of a method of training a noise reduction system under a second embodiment of the present invention.

P-0019[0019]FIG. 7 is a flow diagram of a method of using a noise reduction system of the second embodiment of the present invention.

P-0020[0020]FIG. 8 is a flow diagram of a method of using a noise reduction system of a third embodiment of the present invention.

P-0021[0021]FIG. 9 is a flow diagram of a method of training a noise reduction system using noise-normalization.

P-0022[0022]FIG. 10 is a flow diagram of a method of using a noise reduction system that employs noise-normalization

P-0023[0023]FIG. 11 is a block diagram of a pattern recognition system in which the present invention may be used.

DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS

P-0024[0024]FIG. 1 illustrates an example of a suitable computing system environment <b>100</b> on which the invention may be implemented. The computing system environment <b>100</b> 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 <b>100</b> be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment <b>100</b>.

P-0025[0025] 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.

P-0026[0026] 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 may also 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 may be located in both local and remote computer storage media including memory storage devices.

P-0027[0027] With reference to FIG. 1, an exemplary system for implementing the invention includes a general-purpose computing device in the form of a computer <b>110</b>. Components of computer <b>110</b> may include, but are not limited to, a processing unit <b>120</b>, a system memory <b>130</b>, and a system bus <b>121</b> that couples various system components including the system memory to the processing unit <b>120</b>. The system bus <b>121</b> 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.

P-0028[0028] Computer <b>110</b> typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer <b>110</b> 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 <b>110</b>. 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.

P-0029[0029] The system memory <b>130</b> includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) <b>131</b> and random access memory (RAM) <b>132</b> A basic input/output system <b>133</b> (BIOS), containing the basic routines that help to transfer information between elements within computer <b>110</b>, such as during start-up, is typically stored in ROM <b>131</b>. RAM <b>132</b> typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit <b>120</b>. By way of example, and not limitation, FIG. 1 illustrates operating system <b>134</b>, application programs <b>135</b>, other program modules <b>136</b>, and program data <b>137</b>.

P-0030[0030] The computer <b>110</b> may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive <b>141</b> that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive <b>151</b> that reads from or writes to a removable, nonvolatile magnetic disk <b>152</b>, and an optical disk- drive <b>155</b> that reads from or writes to a removable, nonvolatile optical disk <b>156</b> 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 <b>141</b> is typically connected to the system bus <b>121</b> through a non-removable memory interface such as interface <b>140</b>, and magnetic disk drive <b>151</b> and optical disk drive <b>155</b> are typically connected to the system bus <b>121</b> by a removable memory interface, such as interface <b>150</b>.

P-0031[0031] 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 <b>110</b>. In FIG. 1, for example, hard disk drive <b>141</b> is illustrated as storing operating system <b>144</b>, application programs <b>145</b>, other program modules <b>146</b>, and program data <b>147</b>. Note that these components can either be the same as or different from operating system <b>134</b>, application programs <b>135</b>, other program modules <b>136</b>, and program data <b>137</b>. Operating system <b>144</b>, application programs <b>145</b>, other program modules <b>146</b>, and program data <b>147</b> are given different numbers here to illustrate that, at a minimum, they are different copies.

P-0032[0032] A user may enter commands and information into the computer <b>110</b> through input devices such as a keyboard <b>162</b>, a microphone <b>163</b>, and a pointing device <b>161</b>, 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 <b>120</b> through a user input interface <b>160</b> 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 <b>191</b> or other type of display device is also connected to the system bus <b>121</b> via an interface, such as a video interface <b>190</b>. In addition to the monitor, computers may also include other peripheral output devices such as speakers <b>197</b> and printer <b>196</b>, which may be connected through an output peripheral interface <b>190</b>.

P-0033[0033] The computer <b>110</b> may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer <b>180</b>. The remote computer <b>180</b> 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 <b>110</b>. The logical connections depicted in FIG. 1 include a local area network (LAN) <b>171</b> and a wide area network (WAN) <b>173</b>, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.

P-0034[0034] When used in a LAN networking environment, the computer <b>110</b> is connected to the LAN <b>171</b> through a network interface or adapter <b>170</b>. When used in a WAN networking environment, the computer <b>110</b> typically includes a modem <b>172</b> or other means for establishing communications over the WAN <b>173</b>, such as the Internet. The modem <b>172</b>, which may be internal or external, may be connected to the system bus <b>121</b> via the user input interface <b>160</b>, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer <b>110</b>, 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 <b>185</b> as residing on remote computer <b>180</b>. 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.

P-0035[0035]FIG. 2 is a block diagram of a mobile device <b>200</b>, which is an exemplary computing environment. Mobile device <b>200</b> includes a microprocessor <b>202</b>, memory <b>204</b>, input/output (I/O) components <b>206</b>, and a communication interface <b>208</b> 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 <b>210</b>.

P-0036[0036] Memory <b>204</b> 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 <b>204</b> is not lost when the general power to mobile device <b>200</b> is shut down. A portion of memory <b>204</b> is preferably allocated as addressable memory for program execution, while another portion of memory <b>204</b> is preferably used for storage, such as to simulate storage on a disk drive.

P-0037[0037] Memory <b>204</b> includes an operating system <b>212</b>, application programs <b>214</b> as well as an object store <b>216</b>. During operation, operating system <b>212</b> is preferably executed by processor <b>202</b> from memory <b>204</b>. Operating system <b>212</b>, in one preferred embodiment, is a WINDOWS® CE brand operating system commercially available from Microsoft Corporation. Operating system <b>212</b> is preferably designed for mobile devices, and implements database features that can be utilized by applications <b>214</b> through a set of exposed application programming interfaces and methods. The objects in object store <b>216</b> are maintained by applications <b>214</b> and operating system <b>212</b>, at least partially in response to calls to the exposed application programming interfaces and methods.

P-0038[0038] Communication interface <b>208</b> represents numerous devices and technologies that allow mobile device <b>200</b> to send and receive information. The devices include wired and wireless modems, satellite receivers and broadcast tuners to name a few. Mobile device <b>200</b> can also be directly connected to a computer to exchange data therewith. In such cases, communication interface <b>208</b> can be an infrared transceiver or a serial or parallel communication connection, all of which are capable of transmitting streaming information.

P-0039[0039] Input/output components <b>206</b> 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 <b>200</b>. In addition, other input/output devices may be attached to or found with mobile device <b>200</b> within the scope of the present invention.

P-0040[0040] Under one aspect of the present invention, a system and method are provided that reduce noise in pattern recognition signals. To do this, the present invention identifies a collection of correction vectors, r_k, that incorporate dynamic aspects of the pattern signal. These correction vectors are then added to a feature vector representing a portion of a noisy pattern signal to produce a feature vector representing a portion of a “clean” pattern signal.

P-0041[0041] A method for training the correction vectors under one embodiment of the present invention is described below with reference to the flow diagram of FIG. 3 and the block diagram of FIG. 4. A method of applying the correction vectors to noisy feature vectors is described below with reference to the flow diagram of FIG. 5.

P-0042[0042] The method of training correction vectors begins in step <b>300</b> of FIG. 3, where a “clean” channel signal is converted into a sequence of feature vectors. To do this, a speaker <b>400</b> of FIG. 4, speaks into a microphone <b>402</b>, which converts the audio waves into electrical signals. The electrical signals are then sampled by an analog-to-digital converter <b>404</b> to generate a sequence of digital values, which are grouped into frames of values by a frame constructor <b>406</b>. In one embodiment, A-to-D converter <b>404</b> samples the analog signal at 16 kHz and 16 bits per sample, thereby creating 32 kilobytes of speech data per second and frame constructor <b>406</b> creates a new frame every 10 milliseconds that includes 25 milliseconds worth of data.

P-0043[0043] Each frame of data provided by frame constructor <b>406</b> is converted into a feature vector by a feature extractor <b>408</b>. In one embodiment, each feature vector includes a set of static coefficients that describe the static aspects of a frame of speech, a set of delta coefficients that describe current rates of change of the static coefficients, and a set of acceleration coefficients that describe the current rates of change of the delta coefficients. Thus, the feature vectors capture the dynamic aspects of the input speech signal by indicating how the speech signal is changing over time. Methods for identifying such feature vectors are well known in the art and include 39-dimensional Mel-Frequency Cepstrum Coefficients (MFCC) extraction with 13 static coefficients, 13 delta coefficients and 13 acceleration coefficients.

P-0044[0044] In step <b>302</b> of FIG. 3, a noisy channel signal is converted into feature vectors. Although the conversion of step <b>302</b> is shown as occurring after the conversion of step <b>300</b>, any part of the conversion may be performed before, during or after step <b>300</b> under the present invention. The conversion of step <b>302</b> is performed through a process similar to that described above for step <b>300</b>.

P-0045[0045] In the embodiment of FIG. 4, the process of step <b>302</b> begins when the same speech signal generated by speaker <b>400</b> is provided to a second microphone <b>410</b>. This second microphone also receives an additive noise signal from an additive noise source <b>412</b>. Microphone <b>410</b> converts the speech and noise signals into a single electrical signal, which is sampled by an analog-to-digital converter <b>414</b>. The sampling characteristics for A/D converter <b>414</b> are the same as those described above for A/D converter <b>404</b>. The samples provided by A/D converter <b>414</b> are collected into frames by a frame constructor <b>416</b>, which acts in a manner similar to frame constructor <b>406</b>. These frames of samples are then converted into feature vectors by a feature extractor <b>418</b>, which uses the same feature extraction method as feature extractor <b>408</b>.

P-0046[0046] In other embodiments, microphone <b>410</b>, A/D converter <b>414</b>, frame constructor <b>416</b> and feature extractor <b>418</b> are not present. Instead, the additive noise is added to a stored version of the speech signal at some point within the processing chain formed by microphone <b>402</b>, A/D converter <b>404</b>, frame constructor <b>406</b>, and feature extractor <b>408</b>. For example, the analog version of the “clean” channel signal may be stored after it is created by microphone <b>402</b>. The original “clean” channel signal is then applied to A/D converter <b>404</b>, frame constructor <b>406</b>, and feature extractor <b>408</b>. When that process is complete, an analog noise signal is added to the stored “clean” channel signal to form a noisy analog channel signal. This noisy signal is then applied to A/D converter <b>404</b>, frame constructor <b>406</b>, and feature extractor <b>408</b> to form the feature vectors for the noisy channel signal.

P-0047[0047] In other embodiments, digital samples of noise are added to stored digital samples of the “clean” channel signal between A/D converter <b>404</b> and frame constructor <b>406</b>, or frames of digital noise samples are added to stored frames of “clean” channel samples after frame constructor <b>406</b>. In still further embodiments, the frames of “clean” channel samples are converted into the frequency domain and the spectral content of additive noise is added to the frequency-domain representation of the “clean” channel signal. This produces a frequency-domain representation of a noisy channel signal that can be used for feature extraction.

P-0048[0048] The feature vectors for the noisy channel signal and the “clean” channel signal are provided to a noise reduction trainer <b>420</b> in FIG. 4. At step <b>304</b> of FIG. 3, noise reduction trainer <b>420</b> groups the feature vectors for the noisy channel signal into mixture components. This grouping can be done by grouping similar noisy feature vectors together using a maximum likelihood training technique or by grouping feature vectors that represent a temporal section of the speech signal together. Those skilled in the art will recognize that other techniques for grouping the feature vectors may be used and that the two techniques listed above are only provided as examples.

P-0049[0049] After the feature vectors of the noisy channel signal have been grouped into mixture components, noise reduction trainer <b>420</b> generates a set of distribution values that are indicative of the distribution of the feature vectors within the mixture component. This is shown as step <b>306</b> in FIG. 3. In many embodiments, this involves determining a mean vector and a standard deviation vector for each vector component in the feature vectors of each mixture component. In an embodiment in which maximum likelihood training is used to group the feature vectors, the means and standard deviations are provided as by-products of identifying the groups for the mixture components.

P-0050[0050] Once the means and standard deviations have been determined for each mixture component, the noise reduction trainer <b>420</b> determines a correction vector, r_k, for each mixture component, k, at step <b>308</b> of FIG. 3. Under one embodiment, the vector components of the correction vector for each mixture component are determined using a weighted least squares estimation technique. Under this technique, the correction vector components are calculated as: <maths id="MATH-US-00001" num="1"><math overflow="scroll"><mtable><mtr><mtd><mrow><msub><mi>r</mi><mrow><mi>i</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>=</mo><mfrac><mrow><munderover><mo>∑</mo><mrow><mi>t</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>T</mi><mo>-</mo><mn>1</mn></mrow></munderover><mo></mo><mrow><mi>p</mi><mo>(</mo><mrow><mi>k</mi><mo></mo><mrow><mo></mo><msub><mi>y</mi><mi>t</mi></msub><mo>)</mo></mrow><mo></mo><mrow><mo>(</mo><mrow><msub><mi>x</mi><mrow><mi>i</mi><mo>,</mo><mi>t</mi></mrow></msub><mo>-</mo><msub><mi>y</mi><mrow><mi>i</mi><mo>,</mo><mi>t</mi></mrow></msub></mrow><mo>)</mo></mrow></mrow></mrow></mrow><mrow><munderover><mo>∑</mo><mrow><mi>t</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>T</mi><mo>-</mo><mn>1</mn></mrow></munderover><mo></mo><mrow><mi>p</mi><mo></mo><mrow><mo>(</mo><mrow><mi>k</mi><mo></mo><mrow><mo></mo><msub><mi>y</mi><mi>i</mi></msub></mrow></mrow><mo>)</mo></mrow></mrow></mrow></mfrac></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>1</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00001.TIF" id="EMI-M00001" he="45.1332" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00001" attachment-type="nb" file="US20030191638A1-20031009-M00001.NB" /></attachments></maths>

P-0051[0051] Where r_i,kis the i^thvector component of a correction vector, r_k, for mixture component k, y_i,tis the i^thvector component for the feature vector y_tin the t^thframe of the noisy channel signal, x_i,tis the i^thvector component for the feature vector in the t^thframe of the “clean” channel signal, T is the total number of frames in the “clean” and noisy channel signals, and p(k|y_t) is the probability of the k^thmixture component given the feature vector for the t^thframe of the noisy channel signal. Equation 1 is calculated for each mixture component in the model. As a result, the correction vector has static coefficients, delta coefficients and acceleration coefficients and therefore incorporates dynamic aspects of speech.

P-0052[0052] In equation 1, the p(k|y_t) term provides a weighting function that indicates the relative relationship between the k^thmixture component and the current frame of the channel signals.

P-0053[0053] The p(k|y_t) term can be calculated using Bayes' theorem as: <maths id="MATH-US-00002" num="2"><math overflow="scroll"><mtable><mtr><mtd><mrow><mi>p</mi><mo>(</mo><mrow><mrow><mi>k</mi><mo></mo><mrow><mo></mo><msub><mi>y</mi><mi>t</mi></msub><mo>)</mo></mrow></mrow><mo>=</mo><mfrac><mrow><mi>p</mi><mo>(</mo><mrow><msub><mi>y</mi><mi>t</mi></msub><mo></mo><mrow><mo></mo><mi>k</mi><mo>)</mo></mrow><mo></mo><mrow><mi>p</mi><mo></mo><mrow><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mrow></mrow></mrow><mrow><munderover><mo>∑</mo><mrow><mi>all</mi><mo></mo><mstyle><mtext> </mtext></mstyle><mo></mo><mi>k</mi></mrow><mstyle><mtext> </mtext></mstyle></munderover><mo></mo><mrow><mi>p</mi><mo>(</mo><mrow><msub><mi>y</mi><mi>t</mi></msub><mo></mo><mrow><mo></mo><mi>k</mi><mo>)</mo></mrow><mo></mo><mrow><mi>p</mi><mo></mo><mrow><mo>(</mo><mi>k</mi><mo>)</mo></mrow></mrow></mrow></mrow></mrow></mfrac></mrow></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>2</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00002.TIF" id="EMI-M00002" he="27.13095" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00002" attachment-type="nb" file="US20030191638A1-20031009-M00002.NB" /></attachments></maths>

P-0054[0054] Where P(y_t|k) is the probability of the noisy feature vector given the k^thmixture component, and p(k) is the probability of the k^thmixture component.

P-0055[0055] The probability of the noisy feature vector given the k^thmixture, component, p(y_t|k) can be determined using a normal distribution based on the distribution values determined for the k^thmixture component in step <b>306</b> of FIG. 3. In one embodiment, the probability of the k^thmixture component, p(k), is simply the inverse of the number of mixture components. For example, in an embodiment that has 256 mixture components, the probability of any one mixture component is 1/256.

P-0056[0056] After a correction vector has been determined for each mixture component at step <b>308</b>, the process of training the noise reduction system of the present invention is complete. The correction vectors and distribution values for each mixture component are then stored in a noise reduction parameter storage <b>422</b> of FIG. 4.

P-0057[0057] Once a correction vector has been determined for each mixture, the vectors may be used in a noise reduction technique of the present invention. In particular, the correction vectors may be used to remove noise in a training signal and/or test signal used in pattern recognition.

P-0058[0058]FIG. 5 provides a flow diagram that describes the technique for reducing noise in a training signal and/or test signal. The process of FIG. 5 begins at step <b>500</b> where a noisy training signal or test signal is converted into a series of feature vectors where each feature vector includes static coefficients, delta coefficients and acceleration coefficients. The noise reduction technique then determines which mixture component best matches each noisy feature vector at step <b>502</b>. This is done by applying the noisy-feature vector to a distribution of noisy channel feature vectors associated with each mixture component. In one embodiment, this distribution is a collection of normal distributions defined by the mixture component's mean and standard deviation vectors. The mixture component that provides the highest probability for the noisy feature vector is then selected as the best match for the feature vector. This selection is represented in an equation as:

<i>{circumflex over (k)}=arg</i>_kmax <i>c</i>_k<i>N</i>(<i>y;μ</i>_k,Σ_k)   EQ. 3

P-0059[0059] Where {circumflex over (k)} is the best matching mixture component, c_kis a weight factor for the k^thmixture component, N(y;μ_k,Σ_k) is the value for the individual noisy feature vector, y, from the normal distribution generated for the mean vector, μ_k, and the standard deviation vector, Σ_k, of the k^thmixture component. In most embodiments, each mixture component is given an equal weight factor c_k.

P-0060[0060] Once the best mixture component for each input feature vector has been identified at step <b>502</b>, the corresponding correction vector for those mixture components is (element-by-element) added to the individual feature vectors to form “clean” feature vectors. In terms of an equation:

<i>x</i>_l<i>=y</i>_i<i>+r</i>_i,k  EQ. 4

P-0061[0061] Where x_iis the i^thvector component of an individual “clean” feature vector, y_iis the i^thvector component of an individual noisy feature vector from the input signal, and r_i,kis the i^thvector component of the correction vector, optimally selected for the individual noisy feature vector. The operation of Equation 4 is repeated for each vector component. Thus, Equation 4 can be re-written in vector notation as:

<i>x=y+r</i>_k  EQ. 5

P-0062[0062] where x is the “clean” feature vector, y is the noisy feature vector, and r_kis the correction vector.

P-0063[0063] In a second embodiment of the present invention, the dynamic aspects of speech are incorporated into the correction vector by selecting the correction vector based on a plurality of noisy feature vectors.

P-0064[0064] The operation of such an embodiment is shown in FIG. 6. In steps <b>600</b> and <b>602</b> of FIG. 6, a clean channel signal and a noisy channel signal are converted into sequences of feature vectors by feature extractors <b>408</b> and <b>418</b>. In this embodiment, feature extractors <b>408</b> and <b>418</b> only need to produce static coefficients. However, it is contemplated that they may optionally produce delta coefficients or acceleration coefficients.

P-0065[0065] After the feature vectors have been formed, sets of n feature vectors from the noisy channel are grouped into mixture components in step <b>604</b>. Thus, where n is three, triples of feature vectors are grouped into mixture components. This grouping can be done by grouping similar triples of feature vectors together using a maximum likelihood training technique or by using other techniques known to those skilled in the art.

P-0066[0066] In step <b>606</b>, a set of distribution values is determine for each mixture component that describe the distribution of the sets of feature vectors in the mixture component. For example, when n equals three, the distribution values describe the distribution of triples in each mixture component. In many embodiments, this example would involve determining a mean triple of vectors and a standard deviation triple of vectors.

P-0067[0067] Once the distribution values have been determined, a correction vector is determined for each mixture component at step <b>608</b>. Under one embodiment, a single correction vector is determined for each mixture component by using equation 1 above with p(k|y_t−n, . . . , y_t−1,y_t)—representing the probability of a mixture component given a set of n noisy training feature vectors—being substituted for p(k|y_t). Because the correction vectors are based on more than one noisy training feature vector, they incorporate dynamic information found in the training speech signal.

P-0068[0068] Once a correction vector has been determined for each mixture, the vectors may be used in a noise reduction technique as shown in FIG. 7. In step <b>700</b> of FIG. 7 a noisy signal is converted into feature vectors using the same technique as steps <b>600</b> and <b>602</b>. Using overlapping sets of n feature vectors, a most likely mixture component is identified for each set by applying the n feature vectors to the distribution values associated with each mixture component at step <b>702</b>. The mixture component that provides the highest probability for the set of n noisy feature vectors is selected as the best match for the set and the correction vector associated with the selected mixture component is added to the last noisy feature vector in the set at step <b>704</b>. This produces a noise reduced feature vector for each set.

P-0069[0069] In a third embodiment, the dynamic nature of speech is incorporated in the correction vectors by smoothing the correction vectors over time. In particular, the correction vectors are smoothed by applying them to a filter that is trained based on probabilistic knowledge of the dynamic, time-varying properties of speech gathered from a set of training data.

P-0070[0070] In one embodiment, the filter is an infinite impulse response, time-varying filter, which is the solution to an objective function of cleaned speech, constrained by the probabilistic knowledge from the training data. To form the filter, a sequence of distributions on the correction vector, r_t, and its first difference, r_t−r_t-1, must determined from the training data. This can be accomplished by dividing the training data into sets of utterances each having T frames. For each utterance, the correction vector r_tat frame t in the utterance is determined. The distribution of correction vectors r_tis then determined across all of the utterances. Similarly, the distribution of the first differences at each frame t is determined. The result is T distributions for the correction vector and T distributions for the first difference, with each distribution for the correction vectors defined by a mean _tand a variance <maths id="MATH-US-00003" num="3"><math overflow="scroll"><mrow><msubsup><mi>σ</mi><msub><mover><mi>s</mi><mo>^</mo></mover><mi>t</mi></msub><mn>2</mn></msubsup><mo>,</mo></mrow></math><img file="US20030191638A1-20031009-M00003.TIF" id="EMI-M00003" he="12.95595" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00003" attachment-type="nb" file="US20030191638A1-20031009-M00003.NB" /></attachments></maths>

P-0071[0071] and each distribution for the first difference defined by a mean {circumflex over (d)}_tand a variance <maths id="MATH-US-00004" num="4"><math overflow="scroll"><mrow><msubsup><mi>σ</mi><msub><mover><mi>d</mi><mo>^</mo></mover><mi>t</mi></msub><mn>2</mn></msubsup><mo>.</mo></mrow></math><img file="US20030191638A1-20031009-M00004.TIF" id="EMI-M00004" he="13.91985" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00004" attachment-type="nb" file="US20030191638A1-20031009-M00004.NB" /></attachments></maths>

P-0072[0072] Once these values are trained, the filter can be implemented using a forward-backward recursion. Before the recursion begins, the filter is initialized using a sequence of initial correction vectors determined using the process of FIG. 5 above. (Note, the delta and acceleration parameters do not need to be present in this embodiment). At each frame, t, this initialization involves the following calculations: <maths id="MATH-US-00005" num="5"><math overflow="scroll"><mtable><mtr><mtd><mrow><msub><mi>μ</mi><mi>t</mi></msub><mo>=</mo><mfrac><msub><mi>r</mi><mi>t</mi></msub><msubsup><mover><mi>σ</mi><mo>^</mo></mover><msub><mover><mi>s</mi><mo>^</mo></mover><mi>t</mi></msub><mn>2</mn></msubsup></mfrac></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>6</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00005.TIF" id="EMI-M00005" he="21.12075" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00005" attachment-type="nb" file="US20030191638A1-20031009-M00005.NB" /></attachments></maths><maths id="MATH-US-00006" num="6"><math overflow="scroll"><mtable><mtr><mtd><mrow><msub><mi>v</mi><mi>t</mi></msub><mo>=</mo><mrow><msubsup><mover><mi>σ</mi><mo>^</mo></mover><msub><mover><mi>d</mi><mo>^</mo></mover><mi>t</mi></msub><mn>2</mn></msubsup><mo>+</mo><msubsup><mover><mi>σ</mi><mo>^</mo></mover><msub><mover><mi>d</mi><mo>^</mo></mover><mrow><mi>t</mi><mo>+</mo><mn>1</mn></mrow></msub><mn>2</mn></msubsup><mo>+</mo><mfrac><mn>1</mn><msubsup><mover><mi>σ</mi><mo>^</mo></mover><msub><mover><mi>s</mi><mo>^</mo></mover><mi>t</mi></msub><mn>2</mn></msubsup></mfrac></mrow></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>7</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00006.TIF" id="EMI-M00006" he="23.04855" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00006" attachment-type="nb" file="US20030191638A1-20031009-M00006.NB" /></attachments></maths>

P-0073[0073] where μ_twill eventually hold the filtered value of the correction vector.

P-0074[0074] After the filter is initialized, the forward filtering recursion progresses with the following calculations at each frame, beginning with the second frame and ending at frame T: <maths id="MATH-US-00007" num="7"><math overflow="scroll"><mtable><mtr><mtd><mrow><mi>tmp</mi><mo>=</mo><mfrac><mn>1</mn><mrow><msubsup><mover><mi>σ</mi><mo>^</mo></mover><msub><mover><mi>d</mi><mo>^</mo></mover><mi>t</mi></msub><mn>2</mn></msubsup><mo>+</mo><msub><mi>v</mi><mi>t</mi></msub></mrow></mfrac></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>8</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00007.TIF" id="EMI-M00007" he="24.01245" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00007" attachment-type="nb" file="US20030191638A1-20031009-M00007.NB" /></attachments></maths><maths id="MATH-US-00008" num="8"><math overflow="scroll"><mtable><mtr><mtd><mrow><msub><mi>v</mi><mi>t</mi></msub><mo>=</mo><mrow><msub><mi>v</mi><mi>t</mi></msub><mo>+</mo><mrow><mi>tmp</mi><mo>*</mo><mfrac><mrow><mo>-</mo><mn>1</mn></mrow><msubsup><mover><mi>σ</mi><mo>^</mo></mover><msub><mover><mi>d</mi><mo>^</mo></mover><mi>t</mi></msub><mn>2</mn></msubsup></mfrac></mrow></mrow></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>9</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00008.TIF" id="EMI-M00008" he="24.01245" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00008" attachment-type="nb" file="US20030191638A1-20031009-M00008.NB" /></attachments></maths>  μ_t=μ_t<i>+tmp*μ</i>_t-1  EQ. 10

P-0075[0075] After the forward recursion is finished, the backward recursion is performed, beginning at frame T-<b>1</b> and ending at frame <b>1</b>. The backward recursion includes the following calculations: <maths id="MATH-US-00009" num="9"><math overflow="scroll"><mtable><mtr><mtd><mrow><mi>tmp</mi><mo>=</mo><mfrac><mn>1</mn><mrow><msubsup><mover><mi>σ</mi><mo>^</mo></mover><msub><mover><mi>d</mi><mo>^</mo></mover><mrow><mi>t</mi><mo>+</mo><mn>1</mn></mrow></msub><mn>2</mn></msubsup><mo>+</mo><msub><mi>v</mi><mrow><mi>t</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></mfrac></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>11</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00009.TIF" id="EMI-M00009" he="24.01245" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00009" attachment-type="nb" file="US20030191638A1-20031009-M00009.NB" /></attachments></maths>

μ_t=μ_t+μ_t+1<i>*tmp </i>  EQ. 12

P-0076[0076] After the backward filtering recursion is done, the sequence of μ_tvalues contains a filtered sequence of correction vectors that incorporates dynamic aspects of speech.

P-0077[0077] In a further embodiment, the time-varying filter described above is replaced with a time-invariant filter having a transfer function of: <maths id="MATH-US-00010" num="10"><math overflow="scroll"><mtable><mtr><mtd><mrow><mrow><mi>H</mi><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow><mo>=</mo><mfrac><mrow><mo>-</mo><mn>0.5</mn></mrow><mrow><mrow><mo>(</mo><mrow><msup><mi>z</mi><mrow><mo>-</mo><mn>1</mn></mrow></msup><mo>-</mo><mn>0.5</mn></mrow><mo>)</mo></mrow><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo>-</mo><mn>2</mn></mrow><mo>)</mo></mrow></mrow></mfrac></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>13</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00010.TIF" id="EMI-M00010" he="18.96615" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00010" attachment-type="nb" file="US20030191638A1-20031009-M00010.NB" /></attachments></maths>

P-0078[0078] Under this filter, the parameters for adjusting μ_tdo not change with each frame. The parameters were selected by the inventors based on training data such that they incorporate the dynamic aspects of speech. However, they are not calculated rigorously from the correction vector distributions. As a result of the filter being time-invariant, the initialization simplifies to performing the following calculation for each frame: <maths id="MATH-US-00011" num="11"><math overflow="scroll"><mtable><mtr><mtd><mrow><msub><mi>μ</mi><mi>t</mi></msub><mo>=</mo><mfrac><msub><mi>r</mi><mi>t</mi></msub><mn>4</mn></mfrac></mrow></mtd><mtd><mrow><mi>EQ</mi><mo>.</mo><mstyle><mtext> </mtext></mstyle><mo></mo><mn>14</mn></mrow></mtd></mtr></mtable></math><img file="US20030191638A1-20031009-M00011.TIF" id="EMI-M00011" he="17.03835" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00011" attachment-type="nb" file="US20030191638A1-20031009-M00011.NB" /></attachments></maths>

P-0079[0079] The forward recursion simplifies to performing the following calculation beginning at frame <b>2</b> and ending at frame T:

μ_t=μ_t+0.5*μ_t-1  EQ. 15

P-0080[0080] Lastly, the backward recursion simplifies to performing the following calculation beginning at frame T-<b>1</b> and ending at frame <b>1</b>:

μ_t=μ_t+μ_t+1*0.5   EQ. 16

P-0081[0081] Note that the parameters found in Equations 13-16 were determined heuristically and that other parameters may work as well. As such, the time-invariant embodiment of the filter is not limited to the parameters shown above.

P-0082[0082] The process for using the filters described above to incorporate dynamic aspects of speech into the correction vectors is shown in FIG. 8. In step <b>800</b> of FIG. 8, the noisy signal is converted into a sequence of feature vectors.

P-0083[0083] For each feature vector, the best mixture component, and its associated correction vector, are identified at step <b>802</b>. This produces a sequence of correction vectors that are applied to the filter at step <b>804</b>.

P-0084[0084] The filtering performed in step <b>804</b> incorporates dynamic aspects of speech into the correction vectors because the filters are based on the static and dynamic deviations from clean speech to noisy speech found in the training data. Thus, the smoothing function performed by the filter causes the correction vectors to track the dynamic features found in speech.

P-0085[0085] After the correction vectors have been filtered, the filtered vectors are added to respective noisy feature vectors to produce “clean” feature vectors at step <b>806</b>.

P-0086[0086] In a further embodiment of the present invention, the stereo-based noise reduction system is further improved using noise normalization. As noted above, stereo-based noise reduction systems of the past had difficulty processing noisy signals that were corrupted by noise that was not present in the training data. The present invention attempts to improve the handling of noise that was not present in the training data by normalizing the noise in the training data and the noise in the input noisy signal.

P-0087[0087]FIGS. 9 and 10 show flow diagrams for respectively training and using a stereo-based noise reduction system with noise normalization. In step <b>900</b>, the noise in a noisy training signal is estimated. This can be performed in any number of known ways including estimating the noise from non-speech regions in the training signal. Note that in some embodiments, the mean of the noise across a number of frames may be used instead of determining the noise in each individual frame. In other embodiments, an iterative stochastic approximation of the noise is made using the techniques described in METHOD OF ITERATIVE NOISE ESTIMATION IN A RECURSIVE FRAMEWORK, filed on even-date herewith, having attorney docket number M61.12-689, and hereby incorporated by reference.

P-0088[0088] At step <b>902</b>, the noise estimate for each frame of the noisy signal is converted into feature vectors using a feature extraction method. Under one embodiment, a cepstral feature extraction is performed by taking the log of a frequency-domain representation of frames of the signal. At step <b>904</b>, each frame of the noisy training signal and the clean training signal are similarly converted into a feature vector.

P-0089[0089] Although the process of identifying the noise has been shown in FIG. 9 as occurring in the time domain, those skilled in the art will recognize that the step of estimating the noise can be performed in the feature vector domain. In such embodiments, the noisy training signal and the clean training signal are converted into feature vectors. Noise feature vectors are then estimated from the noisy training feature vectors. As a result, a noise signal is never produced in the time-domain.

P-0090[0090] For each frame of the noisy signal, the feature vector for the noise estimate of the frame is subtracted from both the feature vector for the noisy training signal and the feature vector for the clean training signal at step <b>906</b>. In terms of equations:

<i>{overscore (x)}=x−μ</i>  EQ. 7

<i>{overscore (y)}=y−μ</i>  EQ. 8

P-0091[0091] where μ is the feature vector of the noise estimate, x is the feature vector of the clean training signal, y is the feature vector for the noisy training signal, {overscore (x)} is the feature vector for the noise-normalized clean training signal, and {overscore (y)} is the feature vector for the noise-normalized noisy training signal.

P-0092[0092] At step <b>908</b>, the feature vectors for the noise-normalized noisy training signal are grouped into mixture components in a manner similar to that described above in step <b>304</b> of FIG. 3. Distribution values are then determined for each mixture component at step <b>910</b>. A correction vector for each mixture component is determined at step <b>912</b> in a manner similar to that described for step <b>308</b> above.

P-0093[0093] After step <b>912</b> has been performed for each frame of the training signals, the noise reduction system is sufficiently trained to remove noise from an incoming signal.

P-0094[0094] In FIG. 10, the noise removal process begins at step <b>1000</b> where the noisy input signal is received. At step <b>1002</b>, the noise in each frame of the input signal is estimated. Each estimate is then converted into a feature vector at step <b>1004</b>. In addition, the respective frame of the noisy input signal is converted into a feature vector at step <b>1006</b>. Note, as discussed above for FIG. 9, the step of estimating the noise does not have to be performed in the time-domain. Instead, the noise feature vector can be estimated directly from the noisy feature vector produced for the noisy input signal.

P-0095[0095] In step <b>1008</b>, the feature vector for the noise is subtracted from the feature vector for the noisy input signal to produce a noise-normalized input feature vector. The noise-normalized feature vector is applied to the distribution parameters of the mixture components in step <b>1010</b> to identify a mixture component that best matches the noise-normalized value.

P-0096[0096] The correction vector associated with the selected mixture component is added to the noise-normalized input feature vector at step <b>1012</b> to produce a noise-normalized clean feature vector. This feature vector is then added to the noise feature vector formed in step <b>1004</b> to generate a “clean” feature vector at step <b>1014</b>.

P-0097[0097] Through the process of FIGS. 9 and 10 the performance of the stereo-based noise reduction system is improved, particularly in non-speech regions of the input signal.

P-0098[0098]FIG. 11 provides a block diagram of an environment in which the noise reduction technique of the present invention may be utilized. In particular, FIG. 11 shows a speech recognition system in which one or more of the noise reduction techniques of the present invention can be used to reduce noise in a training signal used to train an acoustic model and/or to reduce noise in a test signal that is applied against an acoustic model to identify the linguistic content of the test signal.

P-0099[0099] In FIG. 11, a speaker <b>1100</b>, either a trainer or a user, speaks into a microphone <b>1104</b>. Microphone <b>1104</b> also receives additive noise from one or more noise sources <b>1102</b>. The audio signals detected by microphone <b>1104</b> are converted into electrical signals that are provided to analog-to-digital converter <b>1106</b>.

P-0100[0100] Although additive noise <b>1102</b> is shown entering through microphone <b>1104</b> in the embodiment of FIG. 11, in other embodiments, additive noise <b>1102</b> may be added to the input speech signal as a digital signal after A-to-D converter <b>1106</b>.

P-0101[0101] A-to-D converter <b>1106</b> converts the analog signal from microphone <b>1104</b> into a series of digital values. In several embodiments, A-to-D converter <b>1106</b> samples the analog signal at 16 kHz and 16 bits per sample, thereby creating 32 kilobytes of speech data per second. These digital values are provided to a frame constructor <b>1107</b>, which, in one embodiment, groups the values into 25 millisecond frames that start 10 milliseconds apart.

P-0102[0102] The frames of data created by frame constructor <b>1107</b> are provided to feature extractor <b>1108</b>, which extracts a feature from each frame. The same feature extraction that was used to train the noise reduction parameters (the correction vectors, means, and standard deviations of the mixture components) is used in feature extractor <b>1108</b>.

P-0103[0103] The feature extraction module produces a stream of feature vectors that are each associated with a frame of the speech signal. This stream of feature vectors is provided to noise reduction module <b>1110</b> of the present invention, which uses the noise reduction parameters stored in noise reduction parameter storage <b>1111</b> to reduce the noise in the input speech signal using one or more of the techniques discussed above.

P-0104[0104] The output of noise reduction module <b>1110</b> is a series of “clean” feature vectors. If the input signal is a training signal, this series of “clean” feature vectors is provided to a trainer <b>1124</b>, which uses the “clean” feature vectors and a training text <b>1126</b> to train an acoustic model <b>1118</b>. Techniques for training such models are known in the art and a description of them is not required for an understanding of the present invention.

P-0105[0105] If the input signal is a test signal, the “clean” feature vectors are provided to a decoder <b>1112</b>, which identifies a most likely sequence of words based on the stream of feature vectors, a lexicon <b>1114</b>, a language model <b>1116</b>, and the acoustic model <b>1118</b>. The particular method used for decoding is not important to the present invention and any of several known methods for decoding may be used.

P-0106[0106] The most probable sequence of hypothesis words is provided to a confidence measure module <b>1120</b>. Confidence measure module <b>1120</b> identifies which words are most likely to have been improperly identified by the speech recognizer, based in part on a secondary acoustic model (not shown). Confidence measure module <b>1120</b> then provides the sequence of hypothesis words to an output module <b>1122</b> along with identifiers indicating which words may have been improperly identified. Those skilled in the art will recognize that confidence measure module <b>1120</b> is not necessary for the practice of the present invention.

P-0107[0107] Although FIG. 11 depicts a speech recognition system, the present invention may be used in any pattern recognition system and is not limited to speech.

P-0108[0108] 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.