Abstract:
An encoding apparatus wherein a difference between an input signal to be encoded and a prediction value is quantized, the quantized signal is generated, the quantized differential signal is inversely quantized, the sum of the inversely quantized reproduction differential signal and the prediction value is stored, the stored signal is read out on the basis of an address signal regarding the input signal, the read-out signal and the input signal are received as inputs and the prediction value is obtained. When the prediction value is derived, an evaluation function to obtain the prediction value is determined in accordance with chromaticity statistics of the input signal.

Description:
This application is a division of application Ser. No. 08/452,859, filed May 30, 1995, which is a Continuation of application Ser. No. 07/902,827 filed Jun. 23, 1992, now abandoned. 
    
    
     BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The invention relates to movement vector detecting method/apparatus for detecting a movement vector of an object between frames and also relates to encoding method/apparatus using such vector detecting method/apparatus. 
     2. Related Background Art 
     What is called a block matching type is known as a movement vector detecting system. 
     According to the movement vector detecting system of the block matching type, one block is formed by extracting pixels of (8×8), (16×16), or the like between the previous frame and the present frame, a matching is performed for every block of data, and a movement vector is assigned to each block of the present frame. 
     A fundamental idea of the movement vector detecting system will now be described in detail hereinbelow. 
     A block in which the pixel position at the left upper corner on the present frame is set to (i, j) and which is constructed by m pixels in the lateral direction and n pixels in the vertical direction assumes a vector value B ij  (m, n). A block at the same position on the previous frame as that of the block B ij  (m, n) assumes a vector value P ij  (m, n). In this instance, an evaluation function of an error between B and P is defined as follows: ##EQU1## 
     The movement vector is defined by using deviations x and y from i and j such as to obtain the minimum value of f when x and y are changed within a range from ±0 to s (s is a parameter of a retrieving area). 
     Generally, a color moving image is constructed in a form such that one frame is divided into luminance data (Y) and color difference data (C r , C b , etc.). The luminance data (Y) including much structure information is used to retrieve the movement vector. There is also known a method of retrieving a new vector by using the block just before or the vector obtained in the peripheral block as a center, a method of estimating a movement of the whole picture plane by obtaining a correlation between the vectors which are generated from the individual blocks and the block positions, or the like. 
     However, an actual meaning image (not a mere set of RGB luminance data but an image having information as what is ordinarily called a picture, such as person, scenery, test pattern, or the like) contains many colors and a set of points of the same hue inherently mean one collected object. 
     In the usual matching by the blocks using the luminance data, although an error value on calculation can be locally minimized, it is difficult to detect the same object in the image. 
     Therefore, when a movement of the whole picture plane is obtained from the vectors or when the vectors generated in the previous block or the peripheral blocks which have been processed are, used to retrieve the vector in the present block, then on the contrary a large error is caused. 
     According to the block matching system, since the an amount of calculation is very large, an averly wide range cannot be retrieved. Therefore, when a movement of an object is large, the movement width of the block can easily exceed the retrieval range, and the matching cannot be effectively executed. 
     SUMMARY OF THE INVENTION 
     Under such circumstances, it is an object of the invention to provide a movement vector detecting apparatus which can certainly radically extract the same object as an object in the present picture plane from picture planes close to the present picture plane and can detect a reliable movement vector and also to provide an encoding apparatus using such a movement vector detecting apparatus. 
     To accomplish the above object, according to an embodiment of the invention, there is provided a movement vector detecting apparatus for detecting a movement vector of an object between frames which are close to each other, wherein the apparatus comprises: memory means for storing a signal of the second frame close to the first frame to detect a new movement vector; operating means for receiving an input signal supplied on a block unit basis and a signal read out from the memory means on a block unit basis on the basis of address data regarding the input signal and for detecting the block in the second frame which matches with the block in the first frame by using an evaluation function; evaluating means for determining the evaluation function in accordance with the input signal; and output means for generating movement vector data on the basis of the result of the calculation of the operating means. 
     According to an embodiment of the invention, there is also provided an encoding apparatus comprising: subtracting means for subtracting a prediction value from an input signal to be encoded; quantizing means for quantizing a differential signal which is generated from the subtracting means; encoding means for receiving an output of the quantizing means and encoding; inverse quantizing means for receiving an output of the quantizing means and inversely quantizing; adding means for adding a reproduction differential signal which is generated from the inverse quantizing means and the prediction value; memory means for storing a decoding signal which is generated from the adding means; and predicting means for receiving a signal read out from the memory means on the basis of an address signal regarding the input signal and the input signal and for generating the prediction value, wherein in the predicting means, an evaluation function to detect the prediction value is determined in accordance with data information of the input signal. 
    
    
     Other objects and advantages of the invention will become apparent from the following detailed description taken in conjunction with the accompanying drawings. 
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a block diagram of a moving image compressing encoding apparatus in the first to third embodiments according to the invention; 
     FIG. 2 is a block diagram of a vector detection circuit in FIG. 1 according to the first and second embodiments; 
     FIG. 3 is a diagram showing functions f 1  and f ab  to determine parameters of an evaluation function which is used in an operation circuit in FIG. 2 according to the second embodiment; 
     FIG. 4 is a block diagram of a vector detection circuit in FIG. 1 according to the third embodiment; and 
     FIGS. 5A to 5C are diagrams for explaining a movement vector retrieving method of the third embodiment. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     The first embodiment according to the invention will be described in detail hereinbelow with reference to FIGS. 1 and 2. 
     FIG. 1 is a block diagram of a moving image compressing encoding apparatus using a vector detection circuit according to the first embodiment of the invention. FIG. 2 is a block diagram showing a construction of the vector detection circuit. 
     In FIG. 1, reference numeral 1 denotes a vector detection circuit, which will be explained in detail hereinlater; 2 indicates a frame memory to store the previous frame; 3 a subtracting circuit; 4 a buffer memory; 5 a quantization circuit; 6 a reversible encoding circuit; 7 an inverse quantization circuit which performs the operation substantially opposite to that of the quantization circuit 3; and 8 an adding circuit. 
     The compressing operation of the moving image compressing encoding apparatus with the above construction will now be described in detail. 
     Image data (brightness L* and chromaticities a* and b* are each expressed by eight bits) of the present frame is supplied to the vector detection circuit 1 on a block unit basis through signal lines 101 and 102 in a form such that one frame is divided into a plurality of blocks. 
     A block address signal of the block supplied to the vector detection circuit 1 is given to the frame memory 2 through a signal line 103. 
     The image data in a vector retrieval range around the block is read out from the frame memory 2 in accordance with the block address signal and is sent to the vector detection circuit 1 through a signal line 104. 
     The vector detection circuit 1 generates the block data which is evaluated to be optimum in a predetermined retrieval range and outputs that to signal lines 105 and 106. 
     The present image block which has been delayed by a predetermined time by the buffer memory 4 is supplied to the subtracting circuit 3 through a signal line 107. The value of the optimum block is also given to the subtracting circuit 3 through the signal line 105. 
     The subtracting circuit 3 executes the subtraction between the values of the present image block and the optimum block supplied. Differential value data of the subtracting circuit 3 is supplied to the quantization circuit 5 and is quantized. 
     The quantized data is supplied to the encoding circuit 6 and the inverse quantization circuit 7. 
     The encoding circuit 6 assigns a reversible code to the quantization data and the encoded data is transferred to a signal line 108. 
     The inverse quantization circuit 7 reproduces a differential value and supplies that value to the adding circuit 8. The optimum block data is also supplied to the adding circuit 8 through a signal line 109. Those two input data are added. The added data is stored into the frame memory 2. 
     The vector detection circuit 1 shown in FIG. 1 will now be described in detail with reference to FIG. 2. 
     The previous frame image data of a predetermined retrieval area is supplied from the frame memory 2 (refer to FIG. 1) to a memory 20 through the signal line 104 on the basis of an address signal of the block received through the signal line 103. The image data of the present frame is supplied to an evaluation circuit 21 from the signal line 102 on a block unit basis. 
     On the basis of the data distribution of the original image block data, the evaluation circuit 21 discriminates (evaluates) whether the block matching is executed in a brightness block matching mode in which it is executed by reference to the brightness (L*), which will be explained in detail hereinbelow, or in a chromaticity block matching mode in which it is executed by the chromaticities (a*, b*), which will be explained in detail hereinbelow. The result of the evaluation is sent to an operation circuit 22 through a signal line 201. An evaluating method of discriminating whether the block matching is performed in the brightness mode or the chromaticity mode will be explained hereinbelow. 
     A vector to a target block to be matched is sent from the operation circuit 22 to an MPX (multi-plexer) 23 through a signal line 202. 
     The MPX 23 generates an address signal in accordance with the input vector. The address signal is transmitted to the memory 20 through a signal line 203. The MPX 23 receives the block data read out from the memory 20 by means of the address data, through a signal line 204. The block data is supplied to the operation circuit 22 through a signal line 205. 
     The operation circuit 22 receives the above two block data and calculates an error between the blocks using the following evaluation function equations. 
     In the case of the L* mode, ##EQU2## 
     In the case of the a*, b* mode, ##EQU3## In the above equations, L denotes an L* block; A indicates an a* block; B a b* block: i, j coordinates in the block; and x, y movement vector components. Each reference character provided with a dash (&#39;) denotes the corresponding block on the previous frame. 
     The error value between the blocks and the vector data of the matched block are supplied from the operation circuit 22 to a comparison circuit 24 through a signal line 206. 
     The comparison circuit 24 selects the minimum one of the data of a number of block matching errors which are calculated for one present block and the vector in this instance and stores them. At the time of the completion of the block matching for one present block, the operation circuit 22 sends notification of the end of block matching to a vector output circuit 25 through a signal line 208. In response to that notification, the vector output circuit 25 reads out the vector data stored in the comparison circuit 24 and generates the vector data to the outside of circuit 1 through the signal line 106 and also supplies the read-out signal of the block data to the MPX 23 through a signal line 209. The MPX 23 reads out the block data of the best matching from the memory 20 in accordance with the read-out signal and outfits that block data to the outsides of circuit 1 through the signal line 105. 
     Explanation will now be made with respect to an evaluating method of discriminating whether the block matching in the evaluation circuit 21 shown in FIG. 2 is to be executed by reference to the brightness data (brightness mode) or to the chromaticity data (chromaticity mode). 
     As for the input block, the brightness (L*=255) denotes white and the chromaticity (a*=127) indicates an achromatic color (the same shall also apply to the case of b*) in the axial direction. It is assumed that when a*=0 and a*=255, the saturations are highest in the two respective directions along axis (the same shall also apply to b*). The block is constructed of (m×n) pixels. It is now assumed that the block position in the frame is expressed by (i, j) and the pixel position in the block is expressed by (p, q). The data blocks of L*, a*, and b* which are supplied are referred to as L ij , A ij , and B ij . Particularly, in order to describe the pixel position among them, for instance, expressions like L ij  (p, q) will be employed. 
     In the evaluation circuit 21, powers in which a data value 127 is used as a reference are calculated with respect to the pixels in the blocks A (a* block) and B (b* block) in accordance with the following equations the values of powers are set to PA and PB: ##EQU4## The value of (PA+RB) is compared with a predetermined threshold value, which will be explained hereinbelow when that value is larger than the predetermined threshold value, it is determined that block matching by reference to the chromaticity block is to be executed for the above blocks. A &#34;1&#34; signal is supplied to the operation circuit 22 through the signal line 201 in FIG. 2. On the other hand, when the value of (PA+PB) is equal to or less than the threshold value, it is determined that block matching by reference to the brightness block is to be executed for the above blocks. A &#34;0&#34; signal is supplied to the operation circuit 22 through the signal line 201 in FIG. 2. 
     That is, the operation circuit 22 automatically switches the block matching mode by means of an output signal of &#34;1&#34; or &#34;0&#34; which is supplied through the signal line 201. 
     A setting method for setting the threshold value, will now be explained in detail. 
     Generally, the saturation of the color which appears in a natural image is not extremely high and is nearly equal to or lower than the half of the dynamic range of each axis a* and b*. 
     Therefore, it is determined that any saturation which is equal to or less than 1/4 of the dynamic range is weak and that any saturation larger than 1/4 of the dynamic range is strong. When the block exists in an image area having some certain uniform chromaticity, all of the pixels in the block exhibit the same (a*, b*) values. However, in the edge portion of the image area, only parts of the pixels in the block exhibit those (a*, b*) values and the remaining pixels indicate (a*, b*) values corresponding to the background. 
     It is, accordingly, considered that, on the assumption that all of the portions of the block are filled with the pixels having certain (a*, b*) values, when its power is obtained, it is proper to set a value which is about 1/2 of that power value to be the threshold value. In this embodiment, a value of about (1024×m×n) is used as a threshold value for (PA+PB). 
     The second embodiment according to the invention will now be described. 
     Since the construction of the moving image compressing encoding apparatus and the construction of the vector detection circuit are similar to those in FIGS. 1 and 2 described in the first embodiment, their descriptions are omitted here. 
     In the second embodiment, the processing operation of the vector detection circuit differs from that described in the first embodiments; and 
     will now be described in detail by reference to FIG. 2. 
     The previous frame image data of the retrieval area is first supplied from the frame memory 2 (refer to FIG. 1) to the memory 20 through the signal line 104. The present image data is supplied to the evaluation circuit 21 through the signal line 102. 
     On the basis of the data distribution of the original image blocks, the evaluation circuit 21 determines parameters of the evaluation function in the block matching and sends the result to the operation circuit 22 through the signal line 201. A determining method for the parameters of the evaluation function will be explained hereinbelow. 
     The vector to the target block to be matched is sent from the operation circuit 22 to the MPX 23 through the signal line 202. 
     The MPX 23 generates the address signal in accordance with the input vector. The address signal is supplied to the memory 20 through the signal line 203. The MPX 23 receives the block data read out from the memory 20 by means of the address data, through the signal line 204. The block data is sent to the operation circuit 22 through the signal line 205. 
     The operation circuit 22 receives the above two sets of block data and calculates an error between the blocks by means of the following evaluation function equations: ##EQU5## In the above equation, l, a, and b denote parameters which are determined by the evaluation circuit 21 and will be explained hereinbelow. L denotes an L* block; A an a* block; B a b* block; i, j coordinates in the block; and x, y movement vector components. A reference character provided with a dash (&#39;) denotes the block on the previous frame. 
     The error value between the blocks and the vector data of the matched block are supplied from the operation circuit 22 to the comparison circuit 24 through the signal line 206. 
     The comparison circuit 24 selects the minimum one of the data of a number of block matching errors which are calculated for one present block and the vector in this instance. At the time of the end of the block matching for one present block, the operation circuit 22 sends a signal indicative of the end of the block matching to the vector output circuit through the signal line 208. In response to that end signal, the vector output circuit 25 reads out the vector data stored in the comparison circuit 24, generates the vector data to the outside of circuit 1 through the signal line 106 and supplies the read-out signal of the block data to the MPX 23 through the signal line 209. In accordance with the read-out signal, the MPX 23 reads out the block data of the best matching from the memory 20 and outputs the block data to the outside of circuit 1 through the signal line 105. 
     The evaluating method in the evaluation circuit 21 shown in FIG. 2 will now be described. 
     As for the input block, L*, a*, and b*, are each expressed by eight bits. In the case of L*, L*=255 denotes white. In the case of a* and b*, a*=127 indicates an achromatic color in the axial direction (the same shall also apply to b*). It is assumed that when a*=0 and a*=255, the saturation is highest in the two respective directions along the axis (the same shall also apply to b*). The block is constructed of (m×n) pixels. It is assumed that the block position in the frame is expressed by (i, j) and the pixel position in the block is expressed by (p, q). The blocks of L*, a*, and b* which are supplied are referred to as L ij , A ij , and B ij . Particularly, to describe the pixel position among them, for instance, expressions expressed like L ij  (p, q) are employed. 
     In the evaluation circuit 21, distribution values in which the data value 127 is used as a reference are calculated with respect to the pixels in the blocks of A (a* block) and B (b* block) in accordance with the following equations, and the calculated values are set to VA and VB: ##EQU6## 
     From these results of the calculations, the larger one of the values of VA and VB is set to VC. The coefficients a, b, and l in the foregoing evaluation function equations are determined by using VA, VB and VC. The relations between (VA, VB, VC) and (a, b, l) satisfy the following equations: 
     
         a=f.sub.ab (VA) 
    
     
         b=f.sub.ab (VB) 
    
     
         l=f.sub.al (VC) 
    
     f l  and f ab  denote predetermined functions, and FIG. 3 shows forms of the functions f l  and f ab . 
     The values of the parameters a, b, and l determined as mentioned above are generated from the signal line 201 in FIG. 2 and supplied to the operation circuit 22. 
     A detailed construction of the vector detection circuit 1 in the third embodiment will now be described with reference to FIG. 4. In FIG. 4, the same or similar parts and components as those in FIG. 2 are designated by the same reference numerals and their descriptions are omitted. 
     As shown in FIG. 4, the third embodiment differs from FIG. 2 in point that the evaluation circuit is omitted. The other constructions are substantially the same as those in FIG. 2. 
     The processing operation of the vector detection circuit 1 shown in FIG. 4 will now be described. 
     The third embodiment according to the invention will be described in detail hereinbelow. 
     In the third embodiment, an outline of a movement vector detecting system for detecting a movement amount of an object between the previous frame and the present frame on a block unit basis will now be described. 
     Generally, various objects included in a certain picture plane or a portion of an object are/is colored by colors of almost the same hue and any change in hue in the same color area is not extremely large. 
     In the third embodiment, therefore, attention is paid to this point, and the block matching is divided into two stages. That is, color data is used in the block matching at the first stage and the retrieval and matching are executed in a wide range by coarse steps. The retrieval of the second stage is performed around the location at which the best matching is derived in the first of stage. In the matching in the second stage, brightness (lightness, luminance, etc.) data is used and the retrieval and matching are executed by fine steps, thereby enabling both retrieval from a wide range, and retrieval in consideration of the color, to be executed. 
     There is no need to set the retrieval range to be large the second stage because it is already in the right color area. 
     The movement vector detecting system will now be described with respect to the moving image compressing encoding apparatus using the vector detection circuit according to the third embodiment as an example. L*, a*, and b* similar to those in the first and second embodiments are used as input signals. 
     Since the construction of the moving image compressing encoding apparatus in the third embodiment is similar to that of FIG. 1 described in the first embodiment, its description is omitted here. 
     As mentioned above, the previous frame image data of the retrieval area is loaded into the memory 20 from the previous frame memory 2 through the signal line 104. On the other hand, the present image data is supplied to the operation circuit 22 via the signal line 102. The vector to the target block to be matched is sent from the operation circuit 22 to the MPX 23 through the signal line 202. In response to the vector being received, the MPX 23 generates an address and sends the address to the memory 20 through the signal line 203, receives the block data from the signal line 204 and transmits the block data, to the operation circuit 22 by the signal line 205. The operation circuit 22 receives the above two sets of block data and calculates an error between the blocks by the following evaluation function equations, after which the error values and the vector at the block position are sent to the comparison circuit 24 through the signal lines 206 and 207: ##EQU7## 
     L denotes a block of L*; A a block of a*; B a block of b*; i, j coordinates in the block; and x, y movement vector components. A reference character provided with a dash (&#39;) denotes the block on the previous frame. The equation (1) is used in the matching of the first stage. The equation (2) is used in the matching of the second stage. 
     As shown in FIG. 5A, the comparison circuit 24 selects the minimum one of the data of a number of block matching errors by a plurality of (a*, b*) values which are calculated for one present block and the vector in this instance. When the block matching by all of the (a*, b*) values is finished for one present block, as shown in FIG. 5B, the block matching by L* of the second stage is executed, in which the vector that gives the best matching is used as a center. 
     At the time of the completion of the block matching by L* mentioned above, the operation circuit 22, send notification of the end of the block matching to the vector output circuit 25 through the signal line 208. In response to that end signal, the vector output circuit 25 reads out the vector data stored in the comparison circuit 24 and generates the vector data to the outside of circuit 1 by the signal line 106, and sends a read-out request signal for the block data to the MPX 23, by the signal line 209. In response to the read-out signal, the MPX 23 reads out the block data of the best matching from the memory 20 and outputs that block data to the outside of circuit 1 through the signal line 105. The vector which is generated here is the movement vector which it is desired to obtain. 
     According to this embodiment as mentioned above, a wide retrieval range can be provided. Even when the luminance of the background is close to the luminance of the object or a motion of the object is large, the correct movement vector can be captured. There is also an effect that the number of calculations can be reduced. 
     FIG. 5C shows a conventional retrieving system of all-searching type as an example. Now, assuming that the block size is set to (n×n) and the retrieval range is set to (2m×2n), the number of times the error must be calculated, is equal to (4×n 2  ×m 2 ). In the system of the invention, when it is now assumed that the retrieval range of the first stage is set to (4m×4m) and the retrieval range of the second stage is set to (m×m) and one matching is executed for every four pixels in each of the vertical and lateral directions in the first stage in such a range, and that the matching is performed for every pixel in the second stage, the number of times the error has to be calculated in each of the first and stage is equal to (n 2  ×m 2 ), so that the total number of error calculating is equal to (2×n 2  ×m 2 ). Therefore, the retrieval of the range of (4m×4m) can be performed with half as many calculations as are required to retrieve the range of (2m×2m) coventionally. 
     As described in detail above, in the movement vector detecting apparatus according to the invention, in the case of the first embodiment, the apparatus has a first mode to detect the movement vector by using color data as the color image information and a second mode to detect the movement vector by using the luminance data as the color image information, and executes the detection of the movement vector in either of the first and second modes. 
     In the second embodiment, the color data and the luminance data are adaptively weighted and the movement vector is detected accordingly. 
     In the third embodiment, after retrieval by means of color data is performed, retrieval by means of luminance data is executed, thereby detecting the movement vector. 
     By the movement vector detecting method in each of the embodiments described mentioned above, even when the luminance of the background is close to the luminance of the object or the motion of the object is large, the correct movement vector can be detected. 
     Therefore, in the case where the motion of a whole picture plane is presumed from the movement vector of each block or the movement vector of a new block is presumed from the past movement vectors or the movement vectors of the blocks around the target block, the movement vector can be accurately presumed. 
     On the other hand, by performing a predictive encoding to an image by using the above movement vector detecting apparatus, the image can be obviously efficiently compressed. 
     The present invention can be embodied by various forms without departing from the spirit and main features of the invention. 
     For instance, although the brightness data (L*) and chromaticity data (a*, b*) have been used in the above embodiments, the invention obviously can also be obviously realized by using the luminance data and color difference data (Y, Cr, Cb;, Y, I, Q; L, U, V; etc.). 
     Further, the present invention can be applied to a system comprising a plurality of apparatuses or to an to a single apparatus. Or, the invention obviously also be can applied to a case where it is accomplished by supplying a program to the system or apparatus. 
     In other words, the foregoing description of the preferred embodiments has been given for illustrative purposes only and not to be construed as imposing any limitation in every respect. 
     The scope of the invention is, therefore, to be determined solely by the following claims and not limited by the text of the specifications and alternations made within a scope equivalent to the scope of the claims fall within the true spirit and scope of the invention.