Encoding of motion picture signal

Abstract: A valid/invalid detection section 1 generates an original valid block map based on a difference between frames. The current and previous valid block maps are weighted within weight sections 2 and 3 respectively and are thereafter summed up to compose them. After isolated valid blocks are removed from the composed valid block map within a segmentation section 5, it is determined whether or not a moving object exists and the direction of the moving object is determined based on the distribution of the valid block map. If a significant movement is detected, then blocks around the object are weighted at the movement direction side. Another segmentation section 7 determines valid blocks with reference to interest blocks and neighbor blocks, and isolated invalid block section 8 removes isolated invalid blocks to generate a complete valid block map. Encoding is performed based on the complete valid block map.

Description: The present invention relates to encoding a motion picture signal using band compression techniques, and more particularly to detecting an interest image region, for example the image of a speaker using a video telephone, and then encoding only the interest image region. As a prior approach for encoding a motion picture signal using band compression techniques, "A Color Motion Videophone for the ISDN", Report No.D-233, 1989 Spring Grand Conference, The Institute of Electronics, Information and Communication Engineers of Japan is known. According to this approach, a facial region is detected to generate a map representing the facial region, and an image encoding section performs interframe/ inframe adaptive predictive encoding of picture elements of the current frame, using picture elements of the previous frame and current adjacent picture elements. When a picture element to be encoded is in the facial region, the encoding is repeated to the final stage, and otherwise the encoding is stopped at the stage immediately before the final stage. However, the prior approach still performs coarse encoding of a background part or a part other than the facial region, and then noise related to the background part causes unnecessary information. Further when picture elements are converted from the background part to the facial region between consecutive frames, the coarse encoding is switched to the fine encoding, and then considerable predictive error signals are generated, which result much more in unnecessary information. Accordingly the encoding efficiency deteriorates. Another prior approach is disclosed in "A method for facial region detection on a color video phone", Report No.D-92, 1989 Spring Grand Conference, The Institute of Electronics, Information and Communication Engineers of Japan. According to the prior approach, a facial region is detected using histograms of picture elements having values larger than a threshold value in a differential image between consecutive frames. At first a vertical histogram is generated by counting significant picture elements in the differential image horizontally, and used for determination of the top of the face. Also the image is divided into horizontal band sub-areas and then horizontal histograms are generated for the sub-areas by counting significant picture elements in the sub-areas vertically. The width of the face is determined based on the several horizontal histograms for the sub-areas beneath the top position of the face, and the height of the face is determined proportional to the face width. However this approach does not directly detect the outline of the face, and does not extract correctly the facial region for fine encoding. Further this article does not suggest encoding only the facial part to reduce unnecessary information caused by noise in the background part. U.S. Patent US-A-4667233 discloses apparatus which bridges across different portions of a region of a picture signal to avoid spurious responses, and also discriminates between a region which does not contain motion from a region that contains motion. An article in SIGNAL PROCESSING, vol 15, No. 3, October 1988, Pages 315-334, discloses a segmentation algorithm based on the hypothesis that an area should be defined by eight "mapping" parameters denoting uniform motion and position. Embodiments of the present invention to be described below, as examples, provide more detailed weighting according to detected differences. As with video telephones, while a speaker is in motion, the background part is still. In a particular embodiment to be described below as an example, a moving interest part such as the face of a speaker is detected by using the consequent differential image between frames. Further this detection is corrected based on the movement direction of the interest part. Responsive to the corrected detection, only a part of a motion picture signal corresponding to the interest part is extracted exactly and encoded. As a result, unnecessary encoding information generated by noise in the background can be obviated and the efficiency can be improved. To explain how to extract an interest part in this embodiment, for example, a speaker part will be described with reference to the drawings. Suppose a speaker moves as shown in FIG. 2 from time "t0" to time "t1", and from time "t1" to time "t2". At first, regions having a difference between the frames at the times tl and t2 are detected as illustrated in FIG. 3 with hatching. Hatching portions in the background are caused by differential signals generated from noise in the background. Next, the frame is divided into blocks of picture elements in m rows x n columns, and each block is determined as a valid if the sum of the absolute values of differential signals in the block is larger than or equal to a predetermined first threshold value, and the block is determined as invalid if the sum is less than the threshold value. A valid block map thus obtained is illustrated in FIG.4B, in which valid blocks are indicated with hatching. Now suppose a valid block map obtained for frames at times t0 and t1 is illustrated in FIG.4A and the block is hereinafter referred to as a fifth valid block map or complete valid block map. And while the valid block map for the current frame, or the first valid block value is weighted with a first weight value, the valid block for the previous frame or the fifth valid block map is weighted with a second weight value. An example of the weighting is described as follows. Suppose for example the weight value for valid blocks of the previous frame is "1" and that for its invalid blocks is "0", and the weight value for valid blocks of the current frame is "2" and that for its invalid blocks is "0" like that for the invalid blocks of the previous blocks. After weighting the valid block maps of the current and previous frames as mentioned above, the valid block maps are summed up to obtain a second valid block map. The second valid block map is illustrated in FIG.5. Next, segmentation is performed based on the composed valid block map. An example of the segmentation is described with reference to FIG's 5, 6, 7, and 8. In the valid block map, each block to be processed is set as valid if the sum of the values of the block and the eight neighbor blocks, that is, a block "k" and blocks "a", "b", "c", "d", "e", "f", "g", and "h" in FIG.7, is larger than or equal to a predetermined threshold value, and the block to be processed is set as invalid if the sum value is less than the threshold value. A third valid block map is accordingly obtained as illustrated in FIG's.6A and 6B. However, the above segmentation which uses the same threshold for all the blocks may make some blocks in the moving direction side area to be set as valid, changed to invalid and some portions of the person figure is dropped off as shown in FIG.6B, and an encoded image is degraded. For avoiding that deterioration, values of the most left side valid blocks along horizontal block lines in the third valid block map are summed up, and likewise values of the most right side valid blocks along the horizontal block lines in the map are summed up. The difference between the left side valid block sum value and the right side valid block sum value is then calculated, and if the absolute value of the difference is larger than a predetermined third threshold value, then the valid blocks on the side having the larger sum value are weighted with a third weight value to avoid the valid area from dropping off. As seen from the illustration of FIG.6A, the sum of the values of the most left side valid blocks along the horizontal block lines is "6" and the sum of the values of the most right side valid blocks along the horizontal block lines is "13". Suppose the absolute value of the difference between the left and right side sums "7" (=13-6) is larger than the threshold. Then, the valid blocks on the right side are weighted with the third weight. In this case, the most right side valid blocks along the horizontal block lines are added by one and another valid block map is obtained as illustrated in FIG.8A. After the weighting with the third weight as shown in FIG. 8A, each block in the third valid block map is set as valid with reference to the neighbor blocks if the sum value of the block and the neighbor blocks is larger than or equal to a predetermined fourth threshold value, and the block is set as invalid if the sum is less than the fourth threshold value. As a result, a fourth valid block map is obtained as illustrated in FIG.8B in which valid areas are indicated with hatching. If the absolute value of the difference between the sums of the values of the blocks on the left and right sides is less than the third threshold value, there is no significant movement direction. Accordingly, the weighting with the third weight is not performed. And each block in the third valid block map is set as valid with reference to the neighbor blocks if the sum value of the block and the neighbor blocks is larger than or equal to a predetermined fifth threshold value, and the block is set as invalid if the sum is less than the fifth threshold value. As a result, the fourth valid block map is obtained. As shown in FIG.8B, there can be isolated invalid blocks in the valid region. If encoding is applied to only valid blocks in the fourth valid block map, the isolated invalid blocks in the valid region are not encoded, and an image of the previous frame remains at the isolated invalid blocks and causes discontinuation with the surrounding blocks. This may result in significant deterioration of the encoded image. For resolving the issue, the same processing is applied to the isolated invalid blocks as used for the segmentation above mentioned. More particularly, in the fourth valid block map, each invalid block is checked with reference to the neighbor blocks, and if the sum of the values of the neighbor blocks is larger than or equal to a predetermined sixth threshold value, then the invalid block is filled with a value indicating validity. By this operation, the area of isolated invalid blocks in FIG.8B is removed, and a fifth valid block map is obtained. FIG.9 illustrate the fifth valid block map wherein the valid blocks are indicated with hatching. Thereafter, the area of valid blocks or the speaker area of FIG.9 is encoded by using interframe and/or inframe correlations, and unnecessary information caused by the noise in the background is accordingly reliably removed. Therefore coding efficiency is improved. The above threshold and weighting values are determined based on statistical experiments. The arrangement of reference picture elements for the segmentation and the isolated block removal can be varied from the above. The following description and drawings disclose, by means of examples, the invention which is characterised in the appended claims, whose terms determine the extent of the protection conferred hereby. In the drawings:- FIG. 1 is a block diagram illustrating an embodiment of the present invention. FIG. 2 is a drawing for illustrating the principles of the present invention, in which a speaker is shown as moving from a time "t0" to "t1", from the time "t1" to "t2". FIG. 3 is a drawing for illustrating the principles of the present invention, which shows areas having a significant difference between the frames at the times "t1" and "t2". FIG. 4 is a drawing for illustrating the principles of the present invention, which shows a first valid block map (B) and a fifth valid block map of the previous frame (A). FIG.5 is a drawing for illustrating the principles of the present invention, which shows a second valid block map. FIG.6 is a drawing for illustrating the principles of the present invention, which shows a third valid block map (A), and an example incomplete encoding image caused by the third valid block map (B). FIG.7 is a drawing for illustrating the principles of the present invention, which shows a block to be processed and neighbor blocks for segmentation. FIG.8 is a drawing for illustrating the principles of the present invention, which shows a fourth valid block map (A), and the valid area in the fourth valid block map (B). FIG.9 is a drawing for illustrating the principles of the present invention, which shows the valid area in a fifth valid block map. DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT One embodiment of the present invention is now described with reference to the drawings. FIG.1 shows the embodiment, in which an inputted motion picture signal is fed to a valid/invalid detection section 1 and a delay element 10 via a line 11. The valid/invalid detection section 1 stores a motion picture signal of a previous frame, and acquires the frame differential signal between the motion picture signal of the previous frame and that newly inputted via the line 11, and divides the frame differential signal into blocks of picture elements in m rows and n columns, and then calculates for each block the absolute value of the sum of frame differential values in the block. The valid/invalid detection section 1 further labels each block with "valid block" if the absolute value of the sum of the frame differential values in the block is larger than or equal to a predetermined first threshold value, and labels the block with "invalid block" if the absolute value of the sum of the differential values is less than the first threshold value, and accordingly obtains a first valid block map. The absolute value of the sum of the differential values can be replaced with a sum of squares, or the number of picture elements having values exceeding a threshold value. The valid block signal obtained through the valid/invalid detection section 1 is fed to a weight section 2 which in turn performs a predetermined first weighting operation on valid blocks in the valid block map fed from the valid/invalid detection section 1 to modify the values of the valid blocks. The first valid block map weighted within the weight section 2 is fed to a sum section 4 which sums the first valid block map thus fed and a fifth valid block map to generate a second valid block map thus weighted. The second valid block map obtained in the sum section 4 is fed to a segmentation section 5. The segmentation section 5 calculates for every block in the second valid block map the sum of the values of the block and neighbor blocks, and makes the block an invalid block if its sum is less than a predetermined third threshold value to obtain a third valid block map. The values in the third valid block map fed from the segmentation section 5 are checked along each horizontal block line in the map , from the left to the right, and the value of the first coming valid block is determined as the value at the left edge of the block line. Likewise, the values in the block map are checked along each horizontal block line, from the right to the left, and the value of the first coming valid block is determined as the value of the right edge of the block line. Thereafter, the sum of the values of the valid block on the left edges and that on the right edges are obtained, and the difference between the sums of the values of the valid blocks on the left edges and right edges is then calculated. If the absolute value of the difference is larger than or equal to a predetermined third threshold, then the valid blocks on the edge having a larger sum are weighted in a weight section 6 by addition of a predetermined value. The third valid block map which has undergone the third weighting operation is fed to a another segmentation section 7 in which each block is made a valid block if the sum of the values of the block and neighbor blocks is larger than or equal to a predetermined fourth threshold and the block is made an invalid block if the sum is less than the fourth threshold to generates a fourth valid block map. When the difference between the sums of values of the valid blocks on the left and right sides is less than the third threshold value, in the segmentation section 7, each block is made a valid block if the sum of the values of the block and neighbor blocks is larger than or equal to a predetermined fifth threshold and the block is made an invalid block if the sum is less than the fifth threshold to generates the fourth valid block map. As illustrated in FIG. 6, suppose that a block "k" is a block to be processed and that neighbor blocks are for example blocks "a", "b", "c", "d", "e", "f", "g", and "h". If the sum of the their values is larger than or equal to the predetermined threshold value, then the block "k" is made a valid block, and the sum is less that the threshold value, then the block "k" is made an invalid block. The fourth valid block map obtained through the segmentation section 7 is supplied to an isolated invalid block removal section 8. The removal block section 8 removes isolated invalid blocks or invalid blocks in a valid block area to connect valid blocks. This process is performed with reference to neighbor blocks like the segmentation, by changing an invalid block to be processed into a valid block if the sum of values of the block and neighbor blocks is larger than or equal to a predetermined sixth threshold value. Thus, a fifth valid block map in which isolated invalid blocks have been removed is obtained. The fifth valid block map thus obtained is supplied to another weight section 3 which performs a predetermined second weighting operation on valid blocks in the fifth valid block map to modify the values of the valid blocks, and supplies the modified fifth valid block map to the sum section 4 upon the next frame processing. The delay section 10 compensates an inputted motion picture signal for the time delay from the time when the motion picture signal is inputted to the time the fifth valid block map is supplied to an encoding section 9, and arraigns the timing of the fifth valid block map and the inputted signal. The time compensated signal outputted from the delay section 10 is fed to the encoding section 9. The encoding section 9 does encode only a part of the motion picture signal inputted from the delay section 10 corresponding to the valid blocks of the fifth valid block map fed from the isolated invalid block removal section 8, that is, corresponding to a portion indicated as a speaker area, but doesn't encode the background part indicated with the invalid blocks. For the encoding, methods utilizing a correlation between frames, such as motion compensation, methods utilizing a correlation in a frame such as orthoganal conversion, and methods utilizing correlations between frames and/or in a frame can be used. The above threshold values are determined according to values statistically obtained beforehand. As seen from the above detailed description of the preferred embodiment, according to the present invention, only a speaker area obtained by segmentation is encoded, and unnecessary information caused by noise in the background is removed, and the encoding efficiency is accordingly improved. Although the present invention has been illustrated with reference to particular examples, by way of example, it will be understood that variations and modifications thereof, as well as other embodiments may be made within the scope of the appended claims.

Claims: A motion picture signal encoding method utilizing a correlation between images, including the following steps of generating a first valid block map for each frame, by dividing images of the frame and of a respective reference frame to be correlated, into blocks of a plurality of picture elements, detecting for each of the blocks a difference between the images of the frame and the reference frame, making each of the blocks a valid block if the difference of the block is larger than or equal to a predetermined first threshold value, and making the block an invalid block if the difference of the block is less than the first threshold value, generating a second valid block map for each of the frames, by weighting the first valid block map with a first weighting factor, weighting a complete valid block map generated for a previous frame with a second weighting factor, and composing thus weighted first and thus weighted complete valid block maps by sum operations, generating a third value block map for each of the frames, by making each valid block of the second valid block map an invalid block if a sum of values of the valid block of the second valid block map and its neighbour blocks is less than a predetermined second threshold value, and generating a fourth valid block map for each of the frames, and characterised by the further steps of, obtaining a sum of values of valid blocks at the most left locations along horizontal block lines in the third valid block map, obtaining a sum of values of valid blocks at the most right locations along horizontal block lines in the third valid block map, if a difference between the sums is larger than or equal to a third threshold value then weighting valid blocks at the most left or right locations having the greater sum with a third weighting factor and further making each block of the third valid block map thus weighted a valid block provided that a sum of values of the block and neighbour blocks is larger than or equal to a fourth threshold value and making each of the block of the third valid block map thus weighted an invalid block provided that a sum of values of the block and neighbour blocks is less than the fourth threshold value to generate the fourth valid block map, if the difference between the sums is less than the third threshold value then making each block of the third valid block map a valid block provided that a sum of values of the block and its neighbour blocks is larger than or equal to a fifth threshold value and making each of the blocks of the third valid block map an invalid block provided that a sum of values of the block and neighbour blocks is less than the fifth threshold value to generate the fourth valid block map, generating the complete valid block map for each of the frames, by making each of the invalid blocks of the fourth valid block map a valid block if a sum of values of neighbour blocks is larger than or equal to a predetermined sixth threshold value, and encoding only a part of the image of the frame corresponding to valid blocks of the complete valid block map by using correlations between images and/or in an image. A motion picture signal encoding method according to claim 1, wherein the threshold values are determined statistically. A motion picture signal encoding method according to claim 2 wherein the neighbour blocks are eight blocks adjacent to a block to be processed. A motion picture signal encoding apparatus utilizing a correlation between images, including means (1) for generating a first valid block map for each frame, by dividing images of the frame and of a respective reference frame to be correlated, into blocks of a plurality of picture elements, detecting for each of the blocks a difference between the images of the frame and the reference frame, making each of the blocks a valid block if the difference for the block is larger than or equal to a predetermined first threshold value, and making the block an invalid block if the difference for the block is less than the first threshold value, means (2,3,4) for generating a second valid block map for each of the frames, by weighting the first valid block map with a first weighting factor, weighting a complete valid block map generated for a previous frame with a second factor, and composing (4) the thus weighted first and the thus weighted complete valid block maps by sum operations, means (5) for generating a third valid block map for each of the frames, by making each valid block of the second valid block map an invalid block if a sum of values of the valid block of the second valid block map and its neighbour blocks is less than a predetermined second threshold value, and means (6) for generating a fourth valid block map for each of the frames, the generating means (6) being characterised by means for obtaining a sum of values of valid blocks at the most left locations along horizontal block lines in the third valid block map, means for obtaining a sum of values of valid blocks at the most right locations along horizontal block lines in the third valid block map, means effective if a difference between the sums is larger than or equal to a third threshold value for then weighting valid blocks at the most left or right locations having the greater sum with a third weighting factor and further making each block of the third valid block map thus weighted a valid block provided that a sum of values of the block and its neighbour blocks is larger than or equal to a fourth threshold value and for making each of the blocks of the third valid block map thus weighted an invalid block provided that a sum of values of the block and its neighbour blocks is less than the fourth threshold value to generate the fourth valid block map, and, if the difference between the sums is less than the third threshold value for then making each block of the third valid block map a valid block provided that a sum of values of the block and its neighbour blocks is larger than or equal to a fifth threshold value and for making each of the blocks of the third valid block map an invalid block provided that a sum of values of the block and its neighbour blocks is less than the fifth threshold value to generate the fourth valid block map, means (8) for generating the complete valid block map for each of the frames, by making each of the invalid blocks of the fourth valid block map a valid block if a sum of values of neighbour blocks is larger than or equal to a predetermined sixth threshold value, and means (9) for encoding only a part of the image of the frame corresponding to valid blocks of the complete valid block map by using correlations between images and/or in an image.

Inventors: MURATA ERI, MURATA, ERI, Murata, Eri, c/o NEC Corporation
Applicants: NIPPON ELECTRIC CO, NEC CORPORATION
Application year: 1992
Main classification: H04N7
IPC codes: H04N7, H04N11, H03M7, G06T9