1. Field of the Invention
The present invention relates generally to the field of speech recognition and, more particularly, speech recognition in noisy environments.
2. Related Art
Automatic speech recognition (“ASR”) refers to the ability to convert speech signals into words, or put another way, the ability of a machine to recognize human voice. ASR systems are generally categorized into three types: speaker-independent ASR, speaker-dependent ASR and speaker-verification ASR. Speaker-independent ASR can recognize a group of words from any speaker and allow any speaker to use the available vocabularies after having been trained for a standard vocabulary. Speaker-dependent ASR, on the other hand, can identify a vocabulary of words from a specific speaker after having been trained for an individual user. Training usually requires the individual to say words or phrases one or more times to train the system. A typical application is voice dialing where a caller says a phrase such as “call home” or a name from the caller's directory and the phone number is dialed automatically. Speaker-verification ASR can identify a speaker's identity by matching the speaker's voice to a previously stored pattern. Typically, speaker-verification ASR allows the speaker to choose any word/phrase in any language as the speaker's verification word/phrase, i.e. spoken password. The speaker may select a verification word/phrase at the beginning of an enrollment procedure during which the speaker-verification ASR is trained and speaker parameters are generated. Once the speaker's identity is stored, the speaker-verification ASR is able to verify whether a claimant is whom he/she claims to be. Based on such verification, the speaker-verification ASR may grant or deny the claimant's access or request.
Detecting when actual speech activity contained in an input speech signal begins and ends is a basic problem for all ASR systems, and it is well-recognized that proper detection is crucial for good speech recognition accuracy. This detection process is referred to as endpointing.
Continuing with
Referring now to
It is seen in graph 200 of
Another disadvantage of the conventional energy-based endpoint detection algorithm, such as the one utilized by endpoint detection system 100, is that it has little or no immunity to background noise. In the presence of background noise, the conventional endpointer often fails to determine the accurate endpoints of a speech utterance by either (1) missing the leading or trailing low-energy sounds such as fricatives, (2) classifying clicks, pops and background noises as part of speech, or (3) falsely classifying background/silence noise as speech while missing the actual speech. Such errors lead to high false rejection rates, and reflect negatively on the overall performance of the ASR system.
Thus, there is an intense need in the art for a new and improved endpoint detection system that is capable of handling background noise. It is also desired to design the endpoint detection system such that computational requirements are kept to a minimum. It is further desired that the endpoint detection system be able to detect the beginning and end of speech in real time.
In accordance with the purpose of the present invention as broadly described herein, there is provided for an endpoint detection of speech for improved speech recognition in noisy environments. In one aspect, the background energy of a first portion of a speech signal is determined. Following, one or more features of the first portion is extracted, and the one or more features can be, for example, cepstral vectors. An average distance is thereafter calculated for first portion base on the one or more features extracted. Subsequently, the energy of a second portion of the speech signal is measured, and one or more features of the second portion is extracted. Based on the one or more features of the second portion, a distance is then calculated for the second portion. Thereafter, the energy measured for the second portion is contrasted with the background energy of the first portion, and the distance calculated for the second portion is compared with the distance of the first portion. The second portion of the speech signal is then classified as either speech or non-speech based on the contrast and the comparison.
Moreover, a system for endpoint detection of speech for improved speech recognition in noisy environments can be assembled comprising a cepstral computing module configured to extract one or more features of a first portion of a speech signal and one or more features of a second portion of the speech signal. The system further comprises an energy computing module configured to measure the energy of the second portion. Also, the system comprises an endpointer module configured to determine the background energy of the first portion and to calculate an average distance of the first portion based on the one or more feature of the first portion extracted by the cepstral computing module. The endpointer module can be further configured to calculate a distance of the second portion based on the one or more features of the second portion. In order to classify the second portion as speech or non-speech, the endpointer module is configured to contrast the energy of the second portion with the background energy of the first portion and to compare the distance of the second portion with the average distance of the second portion.
These and other aspects of the present invention will become apparent with further reference to the drawings and specification, which follow. It is intended that all such additional systems, methods, features and advantages be included within this description, be within the scope of the present invention, and be protected by the accompanying claims.
The features and advantages of the present invention will become more readily apparent to those ordinarily skilled in the art after reviewing the following detailed description and accompanying drawings, wherein:
The present invention may be described herein in terms of functional block components and various processing steps. It should be appreciated that such functional blocks may be realized by any number of hardware components and/or software components configured to perform the specified functions. For example, the present invention may employ various integrated circuit components, e.g., memory elements, digital signal processing elements, logic elements, and the like, which may carry out a variety of functions under the control of one or more microprocessors or other control devices. Further, it should be noted that the present invention may employ any number of conventional techniques for speech recognition, data transmission, signaling, signal processing and conditioning, tone generation and detection and the like. Such general techniques that may be known to those skilled in the art are not described in detail herein.
It should be appreciated that the particular implementations shown and described herein are merely exemplary and are not intended to limit the scope of the present invention in any way. Indeed, for the sake of brevity, conventional data transmission, encoding, decoding, signaling and signal processing and other functional and technical aspects of the data communication system and speech recognition (and components of the individual operating components of the system) may not be described in detail herein. Furthermore, the connecting lines shown in the various figures contained herein are intended to represent exemplary functional relationships and/or physical couplings between the various elements. It should be noted that many alternative or additional functional relationships or physical connections may be present in a practical communication system.
Referring now to
Continuing with
In the present embodiment, as part of the initial characterization of background/silence, endpointer 308 is configured to measure the energy value of the initial frames of the speech signal 301 and, based on that measurement, to determine whether there is speech activity in the first approximately 100 msec of speech signal 301. Depending on the window size of the individual input frames as well as the frame rate, the first approximately 100 msec can be contained in, for example, the first 4, 8 or 10 frames of input speech. As a specific example, given a window size of 30 msec and a frame rate of 20 msec, the characterization of the background/silence may be based on the initial four overlapping frames. It is noted that the frames on which the characterization of background/silence is based are also referred to as the “initial frames” or a “first portion” in the present application. The determination of whether there is speech activity in the initial approximately 100 msec is achieved by measuring the energy values of the initial four frames and comparing them to a predefined threshold energy value. Endpointer 308 can be configured to determine if any of the initial frames contain actual speech activity by comparing the energy value of each of the initial frames to the predefined threshold energy value. If any frame has an energy value higher than the predefined threshold energy value, endpointer 308 would conclude that the frame contains actual speech activity. In one embodiment, the predefined energy threshold is set relatively high such that a determination by endpointer 308 that there is indeed speech activity in the initial approximately 100 msec can be accepted with confidence.
Continuing with the present example, if endpointer 308 determines that there is speech activity within approximately the first 100 msec, i.e. in the initial four frames of speech signal 301, the characterization of the background/silence for the purpose of endpointing speech signal 301 stops. As discussed above, the presence of actual speech activity within the first approximately 100 msec may result in inaccurate characterization of background/silence. Accordingly, if actual speech activity is found in the first approximately 100 msec, it is desirable that the endpointing of the speech signal be halted. In such event, endpoint detection system 300 can be configured to prompt the speaker that the speaker has spoken too soon and to further prompt the speaker to try again. On the other hand, if the energy value of each of the initial four frames as measured by endpointer 308 is below the preset threshold energy value, endpointer 308 may conclude that no speech activity is present in the initial four frames. The initial four frames will then serve as the basis for the characterization of background/silence for speech signal 301.
Continuing with
where NF is the number of frames (e.g. NF=4 in the present example), and cj(i) is the ith cepstral coefficient corresponding to the jth frame. The resulting vector, Cmean, which is also referred to as “mean distance” in this application, represents the average spectral characteristics of background/silence across the initial four frames of the speech signal.
Once Cmean has been determined, cepstral computing module 306 measures the Euclidean distance between each of the four frames of background/silence and the mean cepstral vector, Cmean. The Euclidean distance is computed by cepstral computing module 306 according to Equation 2, below:
where dj is the Euclidean distance between frame j and the mean cepstral vector Cmean, p is the order of the cepstral analysis, cj(i) are the elements of the jth frame cepstral vector, and Cmean (i) are the elements of the background/silence mean cepstral vector, Cmean.
Following the computation of the Euclidean distance between each of the four frames of background/silence and the mean cepstral vector, Cmean, according to Equation 2 above, cepstral computing module 306 computes the average distance, Dsilence, between the first four frames and the average cepstral vector, Cmean. Equation 3, below, is used to compute Dsilence:
where Dsilence is the average Euclidean distance between the first four frames and Cmean, dj is the Euclidean distance between frame j and the mean cepstral vector, Cmean, and NF is the number of frames (e.g. NF=4 in the present example). Thereafter, feature extraction module 302 provides endpointer 308 with its computations, i.e. with the values for Dsilence and Cmean. It is noted that Dsilence is also referred to as “average distance” in the present application.
Following the computation of Esilence by endpointer 308, and Dsilence and Cmean by cepstral computing module 306, endpoint detection system 300 proceeds with endpointing the remaining frames of speech signal 301. It is noted that the remaining frames of speech signal 301 are also referred to as a “second portion” in the present application. The remaining frames of speech signal 301 are received sequentially by feature extraction module 302. According to the present embodiment, once the characterization of background/silence has been completed, only two parameters need be computed for each of the subsequent frames in order to determine if it is speech or non-speech.
As shown in
where p is the order of the cepstral analysis, ck(i) are the elements of the current cepstral vector and cmean(i) are the elements of the background mean cepstral vector. After Ek and dk are computed, feature extraction module 302 sends the information to endpointer 308 for further endpoint processing. It is appreciated that feature extraction module 302 computes Ek and dk for each frame of speech signal 301 as the frame is received by extraction module 302. In other words, the computations are done “on the fly.” Further, endpointer 308 receives the information, i.e. Ek and dk, from feature extraction module 302 on the fly as well.
Continuing with
Ek>κ*Esilence Condition 1
dk>α*Dsilence and Ek>β*Esilence Condition 2
dk>Dsilence and Ek>η*Esilence Condition 3
where Esilence is the mean background/silence computed by endpointer 308 based on the initial approximately 100 msec, e.g. the first four frames, of speech signal 301, Dsilence is the average Euclidean distance between the first four frames and Cmean, dk is the cepstral distance between the “current” frame k and Cmean, Ek is the energy of the current frame k, and α, β, κ and η are values determined experimentally and incorporated into the present endpointing algorithm. For example, in one embodiment, α can be set at 3, β can be set at 0.75, κ can be set at 1.3, and η can be set at 1.1.
From the three conditions set forth above, i.e. Conditions 1, 2 and 3, it is manifest that endpoint detection system 300 endpoints speech based on various factors in addition to energy. For the energy-based component of the present embodiment, i.e. Condition 1, a preset threshold energy value is attained by adding a predetermined constant value κ to the average silence energy, Esilence. The value of κ can be determined experimentally and based on an understanding of the difference in energy values for speech versus non-speech. According to Condition 1, an input frame is classified as speech if its energy value, as measured by energy computation module 304, is greater than κ*Esilence. It is appreciated, however, that in environments where the background noise is high, an endpointer using exclusively an energy-based threshold could erroneously categorize some leading or trailing low-energy sounds such as fricatives as non-speech. Conversely, the endpointer might mistakenly classify high energy sounds such as clicks, pops and sharp noises as speech. At other times, the endpointer might be triggered falsely by noise and completely miss the endpoints of actual speech activity. Accordingly, relying solely on an energy-based endpointing mechanism has many shortcomings.
Thus, in order to overcome such shortcomings associated with endpointing based on energy values alone, the present endpointer considers other parameters. Hence, Conditions 2 and 3 are included to complement Condition 1 and to increase the robustness of the endpointing outcome. Condition 2 ensures that a low-energy sound will be properly classified as speech if it possesses similar spectral characteristics to speech (i.e. if the cepstral distance between the “current” frame and silence, dk, is large). Condition 3 ensures that high energy sounds are classified as speech only if they have similar spectral characteristics to speech.
Continuing with
Referring now to
As shown in graph 400, total speech region 418 comprises speech region 420, speech region 422 and speech region 424, while background/silence or “non-speech” is grouped in silence region 416. Speech region 420 includes all frames of an input speech signal, such as speech signal 301, which endpoint detection system 300 determines to satisfy Condition 1. In other words, frames of the speech signal which have energy values that exceed (1.3*Esilence) would be classified as speech and plotted in speech region 420. Speech region 422 includes the frames of the input speech signal which endpoint detection system 300 determines to satisfy Condition 2, that is those frames which have cepstral distances greater than (3*Dsilence) and energy values greater than (0.75*Esilence). Speech region 424 includes the frames of the input speech signal which the present endpoint detection system determines to satisfy Condition 3, that is those frames which have cepstral distances greater than (Dsilence) and energy values greater than (1.1*Esilence). It should be noted that a speech signal may have frames exhibiting characteristics that would satisfy more than one of the three Conditions. For example, a frame may have an energy value that exceeds (1.3*Esilence) while also having a cepstral distance greater than (3*Dsilence). The combination of high energy and cepstral distance means that the characteristics of this frame would satisfy all three Conditions. Thus, although speech regions 420, 422 and 424 are shown in graph 400 as separate and distinct regions, it is appreciated that certain regions can overlap.
The advantages of endpoint detection system 300, which relies on both the energy and the cepstral feature sets of the speech signal to endpoint speech are apparent when graph 400 of
Referring now to
As shown, method 500 for endpointing the beginning of speech starts at step 510 when speech signal 501, which can correspond, for example, to speech signal 301 of
If it is determined at step 512 that the energy value of the frame is equal to or greater than Ethreshold, the endpointer classifies the frame as speech. The process then proceeds to step 514 where counter variable N is set to zero. Counter variable N tracks the number of frames initially received by the endpoint detection system, which does not exceed Ethreshold. Thus, when a frame energy exceeds Ethreshold, counter variable N is set to zero and the speaker is notified that the speaker has spoken too soon. Because the first five frames of the speech signal (or first 100 msec, given a 30 msec window size and a 20 msec frame rate) will be used to characterize background/silence, it is preferred that there be no actual speech activity in the first five frames. Thus, if the endpointer determines that there is actual speech activity in the first five frames, endpointing of speech signal 501 halts, and the process returns to the beginning to where a new speech signal can be received.
If it is determined at step 512 that the energy value of the received frame, i.e. next frame, is less that Ethreshold, method 500 proceeds to step 516 where counter variable N is incremented by 1. At step 518, it is determined whether counter variable N is equal to five, i.e. whether 100 msec of speech input have been received without actual speech activity. If counter variable N is less than 5, method 500 for endpointing the beginning of speech returns to step 510 where the next frame of speech signal 501 is received by the endpointer.
If it is determined at step 518 that counter variable N is equal to 5, then method 500 for endpointing the beginning of speech proceeds to step 520 where Esilence is computed by averaging the energy across all five frames received by the endpointer. Esilence represents the average background/silence of speech signal 501 and is computed by averaging the energy values of the five frames. Following, at step 522, the endpointer signals the feature extraction module, e.g. feature extraction module 302 of
Once Esilence, Cmean and Dsilence have been computed in steps 520, 522 and 524, respectively, method 500 for endpointing the beginning of speech proceeds to step 526. At step 526, endpoint detection system 300 receives the following frame (“frame k”) of speech signal 501. Method 500 then proceeds to step 528 where the frame energy of frame k (“Ek”) is computed. Computation of Ek is done in a manner well known in the art. Following, at step 530, the Euclidean distance (“dk”) between the cepstral vector for frame k and Cmean is computed. Euclidean distance dk is computed according to Equation 4 shown above.
Next, method 500 for endpointing the beginning of speech proceeds to step 532 where the characteristics of frame k, i.e. Ek and dk, are utilized to determine whether frame k should be classified as speech or non-speech. More particularly, at step 532, it is determined whether frame k satisfies any of three conditions utilized by the present endpoint detection system to classify input frames as speech or non-speech. These three conditions are shown above as Conditions 1, 2 and 3. If frame k does not satisfy any of the three Conditions 1, 2 or 3, i.e. if frame k is non-speech, the process proceeds to step 534 where counter variable T is set to zero. Counter variable T tracks the number of consecutive frames containing actual speech activity, i.e. the number of consecutive frames satisfying, at step 532, at least one of the three Conditions 1, 2 or 3. Method 500 for endpointing the beginning of speech then returns to step 526, where the next frame of speech signal 501 is received.
If it is determined, at step 532, that frame k satisfies at least one of the three Conditions 1, 2 or 3, then method 500 for endpointing the beginning of speech continues to step 536, where counter variable T is incremented by one. Next, at step 538, it is determined whether counter variable T is equal to five. If counter variable T is not equal to five, method 500 for endpointing the beginning of speech returns to step 526 where the next frame of speech signal 501 is received by the endpoint detection system. On the other hand, if it is determined, at step 538, that counter variable T is equal to five, it indicates that the endpointer has classified five consecutive frames, i.e. 100 msec, of speech signal 501 as having actual speech activity. Method 500 for endpointing the beginning of speech would then proceed to step 540, where the endpointer declares that the beginning of speech has been found. In one embodiment, the endpointer may be configured to “go back” approximately 100-200 msec of input speech signal 501 to ensure that no actual speech activity is bypassed. The endpointer can then signal the recognition component of the speech recognition system to begin “recognizing” the incoming speech. After the beginning of speech has been declared at step 540, method 500 for endpointing the beginning of speech ends at step 542.
Referring now to
Once frame k has been received at step 610, method 600 for endpointing the end of speech proceeds to step 612, where endpointer 308 measures the energy of frame k (“Ek”) in a manner known in the art. Following, at step 614, the Euclidean distance (“dk”) between the cepstral vector for frame k and Cmean is computed. Euclidean distance dk is computed according to Equation 4 shown above, while Cmean, which represents the average spectral characteristics of background/silence of speech signal 601, is computed according to Equation 1 shown above.
Next, method 600 for endpointing the end of speech proceeds to step 616 where the characteristics of frame k, i.e. Ek and dk, are utilized to determine whether frame k should be classified as speech or non-speech. More particularly, at step 616, it is determined whether frame k satisfies any of three conditions utilized by the present endpoint detection system to classify input frames as speech or non-speech. These three conditions are shown above as Conditions 1, 2 and 3. If frame k satisfies any of the three Conditions 1, 2 or 3, i.e. the endpointer determines that frame k contains actual speech activity, the process proceeds to step 618 where counter variable X and counter variable Y are each incremented by one. Counter variable X tracks a count of the number of frames of speech signal 601 that have been classified as silence without encountering at least five consecutive frames classified as speech. Counter variable Y tracks the number of consecutive frames classified as speech, i.e. the number of consecutive frames that satisfy any of the three Conditions 1, 2 or 3.
After counter variable Y has been incremented at step 618, method 600 for endpointing the end of speech proceeds to step 620 where it is determined whether counter variable Y is equal to or greater than five. Since counter variable Y represents the number of consecutive frames classified as speech, determining at step 620 that counter variable Y is equal to or greater than five would indicate that at least 100 msec of actual speech activity have been consecutively classified. In such event, method 600 proceeds to step 622 where counter variable X is reset to zero. If it is instead determined, at step 620, that counter variable Y is less than five, method 600 returns to step 610 where the next frame of speech signal 601 is received and processed.
Referring again to step 616 of method 600 for endpointing the end of speech, if it is determined at step 616 that the characteristics of frame k, i.e. Ek and dk, do not satisfy any of the three Conditions 1, 2 or 3, then the endpointer can classify frame k as non-speech. Method 600 then proceeds to step 624 where counter variable X is incremented by one, and counter variable Y is reset to zero. Counter variable Y is reset to zero because a non-speech frame has been classified.
Next, method 600 for endpointing the end of speech proceeds to step 626, where it is determined whether counter variable X is equal to 20. According to the present embodiment, counter variable X equaling 20 indicates that the endpoint detection system has processed 20 frames or 400 msec of speech signal 601 without classifying consecutively at least 5 frames or 100 msec of actual speech activity. In other words, 400 consecutive milliseconds of speech signal 601 have been endpointed without encountering 100 consecutive milliseconds of speech activity. Thus, if it is determined at step 626 that counter variable X is less than 20, then method 600 returns to step 610, where the next frame of speech signal 601 can be received and endpointed. However, if it is determined instead that counter variable X is equal to 20, method 600 for endpointing the end of speech proceeds to step 628 where the endpointer can declare that the end of speech for speech signal 601 has been found. In one embodiment, the endpointer may be configured to “go back” approximately 100-200 msec of input speech signal 601 and declare that speech actually ended approximately 100-200 msec prior to the current frame k. After end of speech has been declared at step 628, method 600 for endpointing the end of speech ends at step 630.
As described above in connection with some embodiments, the present invention overcomes many shortcomings of conventional approaches and has many advantages. For example, the present invention improves endpointing by relying on more than just the energy of the speech signal. More particularly, the spectral characteristics of the speech signal is taken into account, resulting in a more discerning endpointing mechanism. Further, because the characterization of background/silence is computed for each new input speech signal rather than being preset, greater endpointing accuracy is achieved. The characterization of background/silence for each input speech signal also translates to better handling of background noise, since the environmental conditions in which the speech signal is recorded are taken into account. Additionally, by using a readily available feature set, e.g. the cepstral feature set, the present invention is able to achieve improvements in endpointing speech with relatively low computational costs. Even more, the advantages of the present invention are accomplished in real-time.
The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
The present application is a Continuation of U.S. application Ser. No. 11/903,290, filed Sep. 21, 2007 now abandoned, which is a Continuation of U.S. application Ser. No. 09/948,331, filed Sep. 5, 2001, now U.S. Pat. No. 7,277,853, which claims the benefit of U.S. provisional application Ser. No. 60/272,956, filed Mar. 2, 2001, which is hereby fully incorporated by reference in the present application.
Number | Name | Date | Kind |
---|---|---|---|
4821325 | Martin | Apr 1989 | A |
4868879 | Morito | Sep 1989 | A |
5293588 | Satoh | Mar 1994 | A |
5305422 | Junqua | Apr 1994 | A |
5617508 | Reaves | Apr 1997 | A |
5692104 | Chow | Nov 1997 | A |
5794195 | Hormann | Aug 1998 | A |
6321197 | Kushner | Nov 2001 | B1 |
6324509 | Bi | Nov 2001 | B1 |
6381570 | Li | Apr 2002 | B2 |
6449594 | Hwang | Sep 2002 | B1 |
6480823 | Zhao | Nov 2002 | B1 |
6901362 | Jiang | May 2005 | B1 |
7277853 | Bou-Ghazale | Oct 2007 | B1 |
20020120443 | Epstein | Aug 2002 | A1 |
Number | Date | Country | |
---|---|---|---|
20100030559 A1 | Feb 2010 | US |
Number | Date | Country | |
---|---|---|---|
60272956 | Mar 2001 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11903290 | Sep 2007 | US |
Child | 12459168 | US | |
Parent | 09948331 | Sep 2001 | US |
Child | 11903290 | US |