Patent US4802224A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4802224A Expired / Lapsed US ⏱️ 0.0 years remaining

Reference speech pattern generating method

Assignee: NTT Inc
•
Filing: 1986-09-22
•
Granted: 1989-01-31
•
Expires: 2006-09-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A time series of spectral parameters is extracted from a learning speech, the spectral parameters are divided into a plurality of segments for each voice interval, and the segments are clustered into a plurality of clusters. For each cluster an initial reference pattern representing the cluster is computed. The segment boundaries are corrected using the computed reference patterns (a correcting step), the segments of the corrected spectral parameter time series are clustered (a clustering step), and for each cluster, a reference pattern representing the cluster is computed (a reference pattern computing step). The correcting step, the clustering step, and the reference pattern computing step are performed at least once, and the reference patterns obtained by the last reference pattern computing step are regarded as reference patterns desired to be obtained.

Inventors

  • 👤 Yoshinao Shiraki
  • 👤 Masaaki Honda

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 19:35
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/06; G10L15/063; G10L19/00; G10L19/0018

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 203 words
A reference pattern generating method comprising: a step for inputting a learning speech; a step for extracting spectral parameters of the learning speech in units of frames; a segmentation step for dividing a time series of extracted spectral parameters into segments for each voice interval; a step for clustering the segments into a plurality of clusters; a step for computing, for each cluster, an initial reference pattern representing the cluster; a correction step for correcting the segmentation boundaries of the spectral parameter time series through use of the computed reference patterns; a clustering step for clustering the segments of the spectral parameters corrected in segmentation boundaries into clusters each corresponding to one of the initial reference patterns; and a corrected reference pattern computing step for computing, for each cluster, a reference pattern representing the cluster and repeating the clustering of the learning speech through use of the computed reference patterns until a measure of error is converged, whereby corrected reference patterns are computed; the correction step, the clustering step, and the corrected reference pattern computing step being performed at least once and the reference patterns obtained by the last corrected reference pattern computing step being regarded as reference patterns desired to be obtained.
Claim 2
Dependent Claim 203 words
A reference pattern generating method comprising: a step for inputting a learning speech; a step for extracting spectral parameters of the learning speech in units of frames; a segmentation step for dividing a time series of extracted spectral parameters into segments for each voice interval; a step for clustering the segments into a plurality of clusters; a step for computing, for each cluster, an initial reference pattern representing the cluster; a correction step for correcting the segmentation boundaries of the spectral parameter time series through use of the computed reference patterns; a clustering step for clustering the segments of the spectral parameters corrected in segmentation boundaries into clusters each corresponding to one of the initial reference patterns; and a corrected reference pattern computing step for computing, for each cluster, a reference pattern representing the cluster and repeating the clustering of the learning speech through use of the computed reference patterns until a measure of error is converged, whereby corrected reference patterns are computed; the correction step, the clustering step, and the corrected reference pattern computing step being performed at least once and the reference patterns obtained by the last corrected reference pattern computing step being regarded as reference patterns desired to be obtained.
Claim 3
Dependent Claim 79 words
The reference pattern generating method according to claim 1, wherein each time the reference patterns are computed by the corrected reference pattern computing step, the total quantization error of the learning speech quantized by the reference patterns is computed, it is checked whether the rate of reduction of the total quantization error is smaller than a predetermined value, and if so, the repetition of the correction step, the clustering step and the corrected reference pattern computing step, is stopped.
Claim 4
Dependent Claim 115 words
A reference pattern generating method according to claim 1, wherein letting the sum of matching distances between the learning speech and the reference patterns up to a time T S in a voice interval of the learning speech be represented by σ(T S ), candidates of segment boundaries determined beforehand by T s ', the number of segments of the voice interval by M and the segment boundary correcting width by Δ, the correction step determines a time T S-1 by the following recursive formula: ##EQU12## where ##EQU13## and d is the matching distance when the segments of the learning speech from the time T S-1 to T S are quantized by the reference patterns.
Claim 5
Dependent Claim 65 words
A reference pattern generating method according to claim 1, wherein in the correction step and the corrected reference pattern computing step, the matching distance between the learning speech segment and the reference pattern is provided by obtaining a weighted Euclidean distance including power after subjecting the reference pattern to a linear transformation to make its length equal to the length of the learning speech segment.
Claim 6
Dependent Claim 98 words
A reference pattern generating method according to claim 1, wherein, in the step of computing the representative reference pattern for each cluster, letting the reference pattern to be computed be represented by X G , a linear transformation matrix by H lj , the segment in the cluster by X j and its length l j , the reference pattern X j is computed by the following equation: ##EQU14## in a manner to minimize a measure of error given by ##EQU15## whereby reference patterns of a fixed length can be computed from samples of segments of different lengths.
Claim 7
Dependent Claim 119 words
A speech coding method comprising: a step for extracting spectral parameters of an input speech in units of frames; a segmentation step for dividing a time series of the extracted spectral parameters into segments; a correcting/selecting step for correcting the segment boundaries of each segment, and at the same time, selecting that one of prepared reference patterns which bears the closest resemblance to the segment so that the matching distance between the reference pattern and the segment is minimized; and a step for outputting a code indicating the length of each segment of the spectral parameter time series divided at the corrected segment boundaries and a code indicating the reference pattern which bears the closest resemblance to the segment.
Claim 8
Dependent Claim 119 words
A speech coding method comprising: a step for extracting spectral parameters of an input speech in units of frames; a segmentation step for dividing a time series of the extracted spectral parameters into segments; a correcting/selecting step for correcting the segment boundaries of each segment, and at the same time, selecting that one of prepared reference patterns which bears the closest resemblance to the segment so that the matching distance between the reference pattern and the segment is minimized; and a step for outputting a code indicating the length of each segment of the spectral parameter time series divided at the corrected segment boundaries and a code indicating the reference pattern which bears the closest resemblance to the segment.
Claim 9
Dependent Claim 92 words
A speech coding method according to claim 6, wherein the segmentation step and the correcting/selecting step are repeated while changing the segmentation number, to thereby obtain the rate of change of the matching distance which is minimum for a particular segmentation number, the smallest one of the segmentation numbers which makes the absolute value of the rate of change smaller than a predetermined value is obtained, and a code of the segment length and a code of a reference pattern obtained by the correcting/selecting step for the smallest segmentation number is output.
Claim 10
Dependent Claim 121 words
A speech coding method according to claim 6, wherein letting the sum of matching distances between the input speech and the reference patterns up to a time T S in a voice interval of the input speech be represented by σ(T S ), candidates of segment boundaries determined beforehand by T s ', the number of segments of the voice interval by M and the segment boundary correcting width by Δ, a time T S-1 for the correction of the segment boundaries in the correcting/selecting step is determined by the following recursive formula: ##EQU16## where ##EQU17## and d is the matching distance when the input speech segments from the time T S-1 to T S are quantized by the reference patterns.
Claim 11
Dependent Claim 57 words
A speech coding method according to claim 6, wherein in the correcting/selecting step, the matching distance between the input speech segment and the reference pattern is provided by obtaining a weighted Euclidean distance including power after subjecting the reference pattern to a linear transformation to make its length equal to the length of the input speech segment.
Claim 12
Dependent Claim 81 words
A speech coding method according to claim 4, wherein letting the input speech segment be represented by X j , its length by l j , the reference pattern by X G , and a linear transformation matrix by H lj , the matching distance between the input speech segment and the reference pattern is obtained by performing the following equation: ##EQU18## whereby the distances between input speech segments of different length and reference patterns of a fixed length are computed.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-01-31 1992-08-01 1993-01-31 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-01-31 1996-08-01 1997-01-31 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-01-31 2000-08-01 2001-01-31 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag