US 4,882,756 AGrant
Pattern Matching System Using Dynamic Programming
Issue Date:1989-11-21
•13 Claims
•4 Drawing Sheets
Abstract
A pattern matching system and method in which feature vectors of an input pattern to be identified are compared with a plurality of stored reference patterns in order to identify the input pattern. A number L of feature vectors from the input pattern and a feature vector from one of the reference patterns are read into a distance computation unit, under control of a pattern matching control unit. Inter-vector distances are calculated and passed to an asymptotic equation computation unit, which calculates an overall dissimilarity vector for each reference pattern. Because L feature vectors from the input pattern are read into the distance computation unit at a time, memory and reference pattern feature vector transfer requirements are decreased.
Metadata
Assignee
- NEC Corporation
Inventor
- Masao Watari
Application Information
Application Number:US 3089851
Filing Date:1989-02-10
Priority Date:1983-10-27
Art Unit:231
Classifications
IPC:
G10L 506G10L 900
Field of Search:
364381513.541-43
Patent Drawings (4 sheets)
Description
Background of the Invention
The present invention relates to an improvement in a pattern matching system for comparing two patterns expressed as a sequence of feature vectors to compute a measure (which will be called a "dissimilarity") for discrimination between the two patterns.
As speech recognizing means, a variety of methods have been tried. Of these, there has been proposed a relatively simple and effective method of pattern matching by normalizing a nonlinear extension, as is disclosed in U.S. Pat. No. 3,816,722. A speech pattern has non-linear and complex fluctuations due to fluctuations in speaking speed. This makes it necessary to consider the time-axis fluctuation when input and reference patterns are to be matched. This method warps the time axis of one of the patterns to determine the corresponding relationship (which will be called a "time-normalized function") of the time axis for approximating it to the other pattern thereby to determine a discrimination having a normalized time-axis fluctuation. The principle based on that method will be schematically described in the following (which will be called a "horizontal algorithm").
An input pattern A and an n-th reference pattern B.sup.n are expressed as a sequence of feature vectors (one of which will be called "one frame") by the following Equations:
and
When a function (i.e., the time-normalized function) for realizing a mapping from the time axis i of the input pattern onto the corresponding j of the reference pattern is expressed by j=j(i), the normalized difference D (A, B.sup.n) in which the time-axis fluctuation is normalized is attained as a solution of the following minimization problem: ##EQU1## where
This minimization problem is to derive g.sub.n (I, J) by computing (for one horizontal line) the following asymptotic equation from i=j-r to i=j+r for fixed j: ##EQU2## under the following initial condition:
and by advancing the computation of one horizontal line from j=1 to j=J along the j-axis. The value g.sub.n (I, J) thus derived is the normalized dissimilarity D(A, B.sup.n).
The computation of the j-th line of the horizontal algorithm requires the (i-r)th to (i+r)th frames of the input pattern and the j-th frame of the reference pattern. The computation of the (j+1)th line requires the (i-r+1)th to (i+r+1)th frames of the input pattern and the (j+1)th frame of the reference pattern. If the (i-r)th frame of the input pattern is neglected for the frame which was used for computation of the j-th line and if the (i+r+1)th frame of the input pattern and the (j+1)th frame of the reference pattern are added, however, it is possible to execute the computation of the (j+1)th line. In other words, the pattern matching system for executing the horizontal algorithm is equipped with pattern buffers for the (2r+1) frames of the input pattern and for one frame of the reference pattern and reads in one frame of the input pattern and one frame of the reference pattern for the one horizontal line computation thereby to compute the distance of Equation (4) and the asymptotic Equation (6).
If one horizontal line computation is repeated for each reference pattern when the normalized dissimilarity from N reference patterns is to be determined, the value g.sub.n (i, j) derived for the j-th line is used for each reference pattern, when the (j+1)th line is to be computed, thereby necessitating the temporary storage of the values g.sub.n (i, j) of N reference patterns. Keeping out the temporary storage, the computations of one horizontal line are conducted from 1 to J for each reference pattern. In this case, the dissimilarities g.sub.n (i, j) can be consecutively stored in the memories for three lines, i.e., j-th, (j-1)th and (j-2)th lines so that the number of the memories for the dissimilarities g.sub.n (i, j) can be reduced. Since the operations of deriving the normalized dissimilarities from one reference pattern are repeated N times, however, the computations are started after the final frame of the input pattern is attained.
As has been described above, there is not much transfer of pattern data in the pattern matching system for executing the horizontal algorithm. However, the pattern matching system has shortcomings in that it requires buffer memories having a large capacity for the (2r+2) frames of the feature vectors, and in that its response is delayed because the computations cannot be started before the final frame of the input pattern is attained.
On the other hand, there has been proposed by the present inventor and others, as is disclosed in U.S. patent application Ser. No. 447,829, a method (which will be called a "vertical algorithm") in which the order of computing the asymptotic Equation (6) is interchanged between i and j.
According to this method, the value g.sub.n (I, J), i.e., the normalized dissimilarity D(A, B.sup.n) is derived by computing (for one column) the asymptotic Equation (6) from j=i-r to J=i+r for fixed i and by advancing the computations of the one column from i=1 to i=I along the i-axis. The computation of one column of the vertical algorithm can be advanced in synchronism with the input of each frame of the input pattern, because it is conducted along the time axis i of the input pattern, so that its response time can be shortened.
When the dissimilarities from the N reference patterns are to be computed in synchronism with the input of the input pattern, however, the one column computation is repeated for the N reference patterns, and the resultant dissimilarity g.sub.n (i, j) is temporarily stored for each reference pattern so that it is used for the next column computation. This makes it necessary to provide memories of one column of the dissimilarity g.sub.n (i, j), respectively, for the N reference patterns. For one column computation, on the other hand, the refernce pattern buffers need be provided for only one frame because the reference patterns are consecutively interchanged.
As has been described hereinbefore, the pattern matching system for executing the vertical algorithm can advance the computations in synchronism with the input of each frame of the input pattern so that the computed result can be obtained immediately after the input of the final frame of the input pattern. Moreover, the pattern buffer memories required for the distance computation may have a small capacity for one frame of the input pattern and one frame of the reference pattern. Since N reference patterns must be transferred for each frame of the input pattern, however, there arises a defect that the required transfer time of the reference patterns is I times as high as that of the horizontal algorithm. In order to cure this defect, therefore, it is necessary to drop the access time of the memories to 1/I; otherwise the circuitry is complex and expensive.
Summary of the Invention
It is, therefore, an object of the present invention to provide a pattern matching system which can have a reduced transfer of pattern data and a reduced buffer memory capacity for pattern storage.
Another object of the present invention is to provide a pattern matching system which can have a high-speed response compatible with the above features.
Still another object of the present invention is to provide a pattern matching system which is inexpensive while enjoying the above features.
According to the present invention, there is provided a pattern matching system comprising: a pattern matching control unit for gathering L time points i of the input pattern into a block to change the block number ii from 1 to I/L thereby to change signal j indicating the time point of the reference pattern for each block number ii from the lower limit L(ii) to the upper limit U(ii) of a matching region and to change a signal l indicating the time point in one block of the input pattern from 1 to L; a distance computation unit including: an input pattern buffer having its address specified by the signal of said control unit; and a reference pattern buffer for temporarily storing the vector b.sub.j.sup.n at the j-th frame of the reference pattern so that the input pattern a.sub.i and the reference pattern b.sub.j.sup.n may be read out from the input pattern buffer and the reference pattern buffer to derive the inter-vector distance d(a.sub.i, b.sub.j.sup.n); and an asymptotic equation computation unit including a difference memory G.sub.n (j), which has its address specified by the signals j and n of the control unit, so that the asymptotic equation of a dynamic programming operation is computed for the time point j of each reference pattern and for each time point l in one block of the input pattern with reference to the distance d(a.sub.i, b.sub.j.sup.n) under the connecting condition of the dissimilarity G.sub.n (j) at the time point (ii-1).multidot.L for the block number ii of the time point of the input pattern, thereby to derive the dissimilarity G.sub.n (j) at the time point ii.multidot.L of the input pattern.
Brief Description of the Drawings
FIG. 1 is a diagram showing the sequence of computing the pattern matching on the basis of the horizontal algorithm of the prior art;
FIG. 2 is a diagram showing the sequence of computing the pattern matching on the basis of the vertical algorithm of the prior art;
FIG. 3 is a diagram showing the sequence of computing the pattern matching on the basis of an algorithm according to the present invention;
FIGS. 4A and 4B are flow charts showing the fundamental principle of the present invention;
FIG. 5 is a block diagram showing the construction of a pattern matching system according to one embodiment of the present invention;
FIGS. 6 and 7 are block diagrams showing the detailed constructions of a distance computation unit and an asymptotic equation computation unit appearing in the block diagram of FIG. 5; and
FIGS. 8, 9 and 10 are time charts showing the operations of the pattern matching system of the present invention shown in FIG. 5.
Description of the Preferred Embodiment
First of all, the differences between the present invention and the conventional methods will be described with reference to FIGS. 1 to 3. FIGS. 1 and 2 show the orders of computing the pattern matchings of the horizontal and vertical algorithms. The former method requires large buffer memories and has a relatively long response time, whereas the latter method requires the transfer of N reference patterns for each frame of the input pattern, although the response time is reduced, so that a greater number of patterns can be transferred, as compared with the former horizontal algorithm.
According to the method of the present invention, the sequence of computing the asymptotic Equation (6) for solving the minimization problem of Equation (3) is different from those of the horizontal and vertical algorithms of the prior art. According to the method of the present invention, more specifically, as shown in the flow charts of FIGS. 4A and 4B, L time axes i of the input pattern are gathered into a block ii, in which: the dissimilarity G.sub.n (j) at i=(ii-1).multidot.L is read out to execute computation for fixed j from i=(ii-1).multidot.L+1 to ii.multidot.L (i.e., the computation of one line: the computations of blocks 702 and 703 of FIG. 4B) and to store the dissimilarity for i=ii.multidot.L in the G.sub.n (j); one line computation is executed from j=(ii-1).multidot.L+1-r (i.e., the computation of L columns: the computations of blocks 701, 702, 703 and 704 of FIGS. 4A and 4B) and the computations of those L columns are advanced from ii=1 to ii=I/L along the i-axis (i.e., the computation of block 705 of FIG. 4B), thus deriving the value g.sub.n (I, J), i.e., the normalized dissimilarity D(A, B.sup.n).
Since the computations of the L columns may be executed I/L times, according to the method of the present invention, the number of transfer of the N number of reference patterns is reduced to I/L so that the quantity of transfer is reduced to 1/L, as compared with the vertical algorithm. Since the computations of the L columns are advanced along the i-axis, moreover, the computation of the dissimilarity can be executed in synchronism with the input of the input pattern, and the computed result can be attained immediately after the input of the final frame of the input pattern so that the response time is shortened. Still further, the pattern buffers required for the computation of the one line in this invention are those for the L frames of the input pattern and one frame of the reference pattern so that they are reduced to (L+1)/(2r+2), as compared with that of the horizontal algorithm.
As has been described above, the pattern matching system according to the present invention has the following advantages: a small quantity of transfer of the pattern data; a small capacity of the pattern buffer memories; and a short response time.
Next, the present invention will be described in the following in connection with one embodiment thereof with reference to the accompanying drawings. The pattern matching system according to the present invention is composed of, as shown in FIG. 5, a distance computation unit 1, an asymptotic equation computation unit 2, and a pattern matching control unit 3. The distance computation unit 1 is composed of: an input pattern buffer 11 for storing L frames of the input pattern; a reference pattern buffer 12 for storing one frame of the reference pattern; and an inter-vector distance computation unit 13 for deriving the inter-vector distance .vertline..vertline.a.sub.i -b.sub.j.sup.n .vertline..vertline. between the i-th frame a.sub.i of the input pattern and the j-th frame b.sub.j.sup.n of the reference pattern. The asymptotic equation computation unit 2 is composed of a work memory 21, an arithmetic unit 22, an asymptotic equation arithmetic control unit 23 and a dissimilarity memory 24. The pattern matching control unit 3 controls the distance computation unit 1, the asymptotic equation computation unit 2, an input pattern memory 4 and a reference pattern memory 5 in accordance with the time chart shown in FIG. 8.
The value G.sub.n (0) in the dissimilarity memory 24 is cleared in response to a signal C l. Next, the ((ii-1).multidot.L+1)th to ii.multidot.L-th frames of the input pattern are transferred from the input pattern memory 4 to the input pattern buffer 11. Furthermore, the j-th frame of the n-th reference pattern, which is indicated by signals n and j, is transferred to the reference pattern buffer 12. Subsequently, the value G.sub.n (j) of the dissimilarity memory 24 is read out and stored in the g.sub.n ((ii-1).multidot.L, J) address of the work memory 21.
Subsequently, in response to a signal d.sub.st generated by the pattern matching control unit 3, the inter-vector distance arithmetic unit 13 conducts the computation of .vertline..vertline.a.sub.i -b.sub.j.sup.n .vertline..vertline..
The inter-vector distance is derived from the following equation, for example: ##EQU3## The inter-vector distance arithmetic unit 13 operates, as shown in FIGS. 6 and 9: first to clear an accumulator 135 in response to a signal d.sub.cl generated from an inter-vector distance arithmetic control unit 131; to read out the values a.sub.ik and b.sub.jk.sup.n from the input pattern buffer 11 and the reference pattern buffer 12 in response to a signal k varying from 1 to K, which is generated by the inter-vector distance arithmetic control unit 131; to derive the value .vertline.a.sub.ik -b.sub.jk.sup.n .vertline. by a subtractor 132 and an absolute value circuit 133; and to derive the summation of .vertline.a.sub.ik -b.sub.jk.sup.n .vertline. by an adder 134 and the accumulator 135. Here, the l-th frame of the input buffer 11 is stored with the ((ii-1) L+1)th frame of the input pattern.
Subsequently, the arithmetic unit 22 shown in FIG. 7 computes the asymptotic Equation (6) by the use of both the distance d(i, j) attained by the inter-vector distance arithmetic unit 13 and the value g.sub.n (i, j) of the work memory 21. The asymptotic equation arithmetic control unit 23 outputs signals j.sub.1, j.sub.2 and j.sub.3, as shown in the time chart of FIG. 10, in response to the signal i (i=(ii-1).multidot.L+1), which is generated by the pattern matching control unit 3, and reads out and sets the values g.sub.n (i-1, j-2), g.sub.n (i-1, j-1) and g.sub.n (i-1, j) in registers 221, 222 and 223, respectively. A comparator 224 compares the registers 221, 222 and 223 to output a minimum. An adder 225 adds the distance d(i, j) and the output of the comparator 224 so that the resultant summation is written as g.sub.n (i, j).
The pattern matching control unit 3 controls the distance computation unit 1 and the asymptotic equation computation unit 2 in accordance with the time chart shown in FIG. 8 to derive the computations of the asymptotic Equation (6) for the l from 1 to L thereby to conduct the computation of the one line. Subsequently, the pattern matching control unit 3 reads out the value g.sub.n (ii.multidot.L, j) from the work memory 21 and stores it in the G.sub.n (j) of the dissimilarity memory 24. Subsequently, the control unit 3 derives the value j from its lower limit L(ii) to its upper limit U(ii) to conduct computations of the L columns. Subsequently, the control unit 3 derives the value n from 1 to N to conduct computations the L of columns of the N reference patterns. The control unit 3 derives the value ii from 1 to I/L to attain the value g.sub.n (I, J). Here, the lower limit L(ii) and the upper limit U(ii) indicate the limits of the range for computing the asymptotic equation, as shown in FIG. 3, and are given by the following equations:
and
The present invention has been described hereinbefore in connection with the embodiment thereof but should not have its scope limited to the foregoing description. Especially in the description of the present invention, the work memory 21 can be replaced by a ring buffer comprising 3L memories. Specifically, if the computation of the j-th line uses g.sub.n (i, j).fwdarw.X, g.sub.n (i, j-1).fwdarw.Y, and g.sub.n (i, j-2).fwdarw.Z, the computation of the (j+1)th line can be conducted by using g.sub.n (i, j+1).fwdarw.Z, g.sub.n (i, j).fwdarw.X, and g.sub.n (i, j-1).fwdarw.Y.
On the other hand, the simple Equation (6) was used as the asymptotic equation but may be replaced by another arbitrary asymptotic equation. For example, it is conceivable to use a method using the following Equations: ##EQU4## In this case, however, 2.multidot.(2r+1) N memories for the two columns are required as the dissimilarity memories because of necessity of the dissimilarity data until the (i-2)th column.
Moreover, the distance between the input pattern a.sub.i and reference pattern b.sub.j.sup.n was described by using the distance measure of Equation (4) but may apparently be replaced by a Euclidean distance, as is expressed by the following Equation (11), or by an inner product, as is expressed by the following Equation (12): ##EQU5##
Claims
What is claimed is:
1. A pattern matching system for deriving the minimum of the dissimilarity defined by the sum of the inter-vector distances d (a.sub.1, b.sub.j.sup.n) of an input pattern A=a.sub.1, a.sub.2, - - - , a.sub.I expressed by a sequence of feature vectors and an n-th reference pattern B.sup.n =b.sub.1.sup.n, b.sub.2.sup.n, - - - , and b.sub.j.sup.n of a number N of reference patterns stored beforehand on a time function j(i) for establishing correspondence between a time axis i of the input pattern A and a time axis j of the reference pattern B.sup.n, said system comprising: a pattern matching control unit for gathering a number L of time points i of said input pattern into a block of feature vectors, 1<L<I, incrementing a block number ii from 1 to I/L, incrementing a signal S.sub.j, indicating the time point of said reference pattern for each block number ii, from a lower limit L(ii) to an upper limit U(ii) of a matching region, and incrementing a signal, indicating the time point in one block of said input pattern, from 1 to L; a distance computation unit including: an input pattern buffer having its address specified by the signal of said control unit; and a reference pattern buffer for temporarily storing the vector b.sub.j.sup.n at the j-th frame of said reference pattern so that said input pattern a.sub.i and said reference pattern b.sub.j.sup.n may be read out from said input pattern buffer and said reference pattern buffer to derive said inter-vector distance d(a.sub.i, b.sub.j.sup.n); and an asymptotic equation computation unit including a dissimilarity memory G.sub.n (j), which has its address specified by said signal j and a signal n of said control unit, so that the asymptotic equation of a dynamic programming is computed for the time point j of each reference pattern and for each time point in one block of said input pattern with reference to said distance d(a.sub.i, b.sub.j.sup.n) under the connecting condition of the dissimilarity G.sub.n (j) at a time point (ii-1).multidot.L for the block number ii of the time point i of said input pattern, thereby to derive the dissimilarity G.sub.n (j) at the time point ii.multidot.L of said input pattern.
2. A pattern matching system according to claim 1, wherein said dynamic programming asymptotic equation is expressed by the following equations: ##EQU6##
3. A pattern matching system according to claim 1, wherein said dynamic programming asymptotic equation is expressed by the following equations: ##EQU7##
4. A pattern matching system according to claim 1, wherein said distance computation unit derives the distance d(i, j) expressed by the following equation:
5. A pattern matching system according to claim 1, wherein said distance computation unit executes a computation on the basis of a Euclidean distance expressed by the following equation: ##EQU8##
6. A pattern matching system according to claim 1, wherein said distance computation unit executes a computation on the basis of an inner product expressed by the following equation: ##EQU9##
7. A method of pattern matching in which an input pattern A comprising a time sequence of feature vectors a.sub.1, a.sub.2, . . . , a.sub.I is compared with a number B of reference patterns B.sup.n, 1.ltoreq.n.ltoreq.N, each of said reference patterns comprising a time sequence of feature vectors b.sub.1, b.sub.2, . . . , b.sub.J along a second time axis j, feature vectors in each of said reference patterns being mapped onto the feature vectors of said input pattern according to a mapping j=j(i), said method comprising the steps of comparing sums of inter-vector distances d(a.sub.i,b.sub.j.sup.n) between said input pattern and each of said reference patterns according to a recursion algorithm, determining the smallest of said sums, and selecting one of said reference patterns in accordance with said determining step, said method further comprising the steps of: (1) inputting a number L of feature vectors of said input pattern into an input buffer, 1<L<I; (2) inputting a feature vector from an nth one of said reference patterns in accordance with a lower limit calculated as a first function of L and a positive number r; (3) computing an inter-vector distance between each of said L feature vectors and said reference pattern feature vector b.sub.j ; (4) computing a dissimilarity vector in accordance with said inter-vector distance and said recursion algorithm; (5) repeating steps (2)-(4) until an upper limit is reached, said upper limit being determined as a second function of L and said positive number r; (6) repeating steps (2)-(5) until step (2) has been performed for all of said reference patterns; and (7) performing steps (1)-(6) {I/L} times, where { } denotes a greatest integer function, said lower and upper limits being recomputed every time steps (1)-(6) are performed, wherein overall computation time is reduced as L is increased.
8. A method of pattern matching according to claim 7, wherein said recursion algorithm is ##EQU10## wherein g.sub.n (i, j) is a dissimilarity vector and d(i,j) is an inter-vector distance.
9. A method of pattern matching according to claim 7 wherein said recursion algorithm is ##EQU11## wherein g.sub.n (i,j) is a dissimilarity vector and d(i,j) is an inter-vector distance.
10. A method of patter matching according to claim 7, wherein said inter-vector distance d(i,j) is .vertline..vertline.a.sub.i -b.sub.j .vertline..vertline..
11. A method of pattern maching according to claim 7, wheein said intervector distance d(i,j) is ##EQU12##
12. A method of pattern matching according to claim 7, wherein said inter-vector distance d(i,j) is ##EQU13##
13. A pattern matching system according to claim 1, wherein L(ii)=max(1, (ii-1).multidot.L-r) and U(ii)=min (J, ii.multidot.L+r), wherein r is a positive number for determining a size of said matching region.