Method for segmenting and estimating a moving object motion

Abstract: A method for use in an object-oriented analysis-synthesis coder, for segmenting an image of a current frame into moving objects and describing each motion of the moving objects with a set of motion parameters, which comprises the steps of: (a) comparing the current frame with a preceding frame to detect a motion vector field; (b) sliding window blocks on the motion vector field, and computing the degree of homogeneity for each of the window blocks to produce a seed block; (c) determining a set of initial values for the set of motion parameters based on the seed block; (d) evaluating whether each motion vector contained in and around the seed block is describable with the set of initial values or not, to thereby detect a revised region; (e) determining a set of revised values for the set of motion parameters from the revised region; (f) evaluating whether each motion vector contained in and around the revised region is describable with the set of revised values or not, to thereby detect a newly revised region; and (g) repeating the steps (e) and (f) until the difference between a current revised region and a previous revised region is less than a predetermined value, to thereby determine a set of final values for the set of motion parameters.

Description: Field of the Invention The present invention relates to an objected-oriented analysis-synthesis coding technique for encoding image signals; and, more particularly, to a method for segmenting an image according to moving objects therein and estimating each motion of the moving objects. Description of the Prior Art In digital television systems such as video-telephone, teleconference and high definition television systems, a large amount of digital data is needed to define each video frame signal since a video line signal in the video frame signal comprises a sequence of digital data referred to as pixel values. Since, however, the available frequency bandwidth of a conventional transmission channel is limited, in order to transmit the large amount of digital data therethrough, it is inevitable to compress or reduce the volume of data through the use of a data compression technique, especially in the case of such low bit-rate video signal encoder as video-telephone or teleconference system. One of such methods for encoding video signals for a low bit-rate encoding system is the so-called object-oriented analysis-synthesis coding technique, wherein an input video image containing moving objects therein is divided according to the moving objects; and each object is described by three sets of parameters defining the motion, contour(or shape) and pixel data of the object. In order to achieve the primary goal of the object-oriented analysis-synthesis coding technique, i.e., the task of exactly dividing the input video image into the moving objects and precisely estimating each motion of the moving objects, there have been proposed several approaches. One of them is a hierarchically structured segmentation technique( see Michael Hotter et al., "Image Segmentation Based on Object Oriented Mapping Parameter Estimation", Signal Processing, 15 , No. 3, pp 315-334 (October 1988)). From SUK BYUNG CHAE ET AL: 'VIDEO CODING BY SEGMENTING MOTION VECTORS AND FRAME DIFFERENCES' OPTICAL ENGINEERING, vol. 32, no. 4, 1 April 1993, pages 870-876, XP000364010, a segmentation-based video coding technique is known. A change detector is used to find the regions of interest, i.e., moving areas, and then the moving areas are segmented based on the motion vector information. For the regions where the prediction error, defined by the difference between the original image and the motion-compensated image reconstructed by the motion vector, is large, the frame difference signal is used to supplement the segmentation results. Depending on the region characteristics, each region is represented by the motion vector and the frame difference signal. In GOH W B ET AL: 'MODEL-BASED MULTIRESOLUTION MOTION ESTIMATION IN NOISY IMAGES' CVGIP IMAGE UNDERSTANDING, vol. 59, no. 3, 1 May 1994, pages 307-319, XP000454805, a multiresolution region-growing algorithm is proposed. This algorithm consists of a region-growing process which is able to segment the flow field in an image into homogeneous regions which are consistent with a linear affine flow model. To ensure stability and robustness in the presence of noise, this region-growing process is implemented within the hierarchical framework of a spatial lowpass pyramid. According to the hierarchically structured segmentation technique, an area of the input video image to be segmented is defined by a set of uniform motion and position parameters denoted as mapping parameters. For instance, eight parameters are used to describe an arbitrary three-dimensional motion of a planar rigid object. In a first step, a change detector distinguishes between temporally changed and unchanged regions of two successive fields. Each changed image region is interpreted as one object. The motion and position of each object is described by one set of mapping parameters. Based on the mapping parameters and the information on a temporally preceding field, reconstruction of a temporally ensuing field can be achieved. In a next step of hierarchy, those regions of the image, which are not correctly described in their mapping, are again detected by the change detector and treated according to the changed parts detected at the first step of hierarchy. However, in this technique, if a large number of moving objects is included within one changed area, it may be difficult to properly segment them. Summary of the Invention It is, therefore, a primary object of the invention to provide an improved method for exactly segmenting an image according to the moving objects therein and precisely estimating each motion of the moving objects. In accordance with the invention, there is provided a method and apparatus for use in an object-oriented analysis-synthesis coder, for segmenting an image of a current frame into moving objects and describing each motion of the moving objects with a set of motion parameters, which comprises the features defined in claims 1 and 3, respectively. Brief Description of the Drawings The above and other objects and features of the present invention will become apparent from the following description of preferred embodiments given in conjunction with the accompanying drawings, in which: Fig. 1 is a block diagram of segmenting an image into moving objects and describing each motion of the moving objects with a set of motion parameters in accordance with the present invention; and Fig. 2 shows a flow chart illustrating an operational flow of the seed block detection and region growing circuit shown in Fig. 1. Detailed Description of the Preferred Embodiments Fig. 1 describes a block diagram of segmenting moving objects and describing each motion of the moving objects with a set of motion parameters in accordance with the present invention. As shown in Fig. 1, two input signals, i.e., a current frame signal and a reconstructed previous frame signal are fed to a change detector 100 and a motion estimator 102, respectively. The change detector 100 compares the current frame signal with the reconstructed previous frame signal to detect a changed area from the background in the current frame. The detected changed area information is sent to the motion estimator 102 and a motion vector field detector 103. The motion estimator 102 detects motion vectors for a set of selected pixels, i.e., feature points, in the changed area, wherein each of the feature points is a pixel capable of representing its neighboring pixels. That is, a number of feature points are first selected from all of the pixels contained in the changed area. Then, motion vectors for each of the selected feature points are determined by forming a block of a predetermined size at each of the selected feature points and by using a block matching algorithm( see , e.g., J. R. Jain et al., "Displacement Measurement and Its Application in Interframe Image Coding", IEEE Transactions on Communications, COM-29, No. 12 pp 1799-1808(December 1981)), wherein each of the motion vectors represents a spatial displacement between one feature point in the current frame and a corresponding matching point, i.e., a most similar pixel, in the reconstructed previous frame. The motion vector field detector 103 determines motion vectors for non-feature points in the changed area by averaging the motion vectors for the feature points, to thereby detect motion vectors for all of the pixels in the changed area. The changed area defined by motion vectors for all of the pixels therein is called a motion vector field. The information on the motion vector field is sent to a seed block detection and region growing circuit 104. The seed block detection and region growing circuit 104 segments the motion vector field into moving objects and describes each motion of the moving objects with a set of motion parameters. In accordance with the present invention, in order to describe each motion of the moving objects, there is employed an 8-parameter motion model( see , e.g., Gilad Adiv, "Determining Three-Dimensional Motion and Structure from Optical Flow Generated by Several Moving Objects", IEEE Transactions on Patent Analysis and Machine Intelligence , PAMI-7, No. 4, pp 384-401(July 1985)), which may be represented as follows: V x (x,y) = a 1 + a 2 x + a 3 y + a 7 x 2 + a 8 xy V y (x,y) = a 4 + a 5 x + a 6 y + a 7 xy + a 8 y 2 wherein V x (x,y) is the horizontal component of a motion vector at a position (x,y) and V y (x,y) is the vertical component of the motion vector at the position (x,y). Referring to Fig. 2, the eight motion parameters for each of the moving objects in the motion vector field are determined through two processes: a seed block detection process 10 and a region growing process 20. The seed block detection process 10 detects a seed block in order to determine a set of initial values for the eight motion parameters, and the region growing process 20 increases the size of the seed block through the use of an iterative region growing algorithm, to thereby estimate a set of actual values for the eight motion parameters. In the seed block detection process 10, there are two steps 10 and 12. In the step 10, a W x W pixel size of window block slides on the motion vector field; and the degree of homogeneity for each position of the window block is computed. Thereafter, in the step 12, a most homogeneous window block is selected as a seed block. The degree of homogeneity may be determined as follows: D ( m,n ) = 1 E ( a * 1 ,···, a * 8 ) Eq . (3) ∈( x,y;a 1 ,···, a 8 )=( V x ( x,y )- V x ( x,y )) 2 +( V y ( x,y )- V y ( x,y )) 2 Eq . (5) V x ( x,y ) = a 1 + a 2 x + a 3 y + a 7 x 2 + a 8 xy Eq . (6) V y ( x,y ) = a 4 + a 5 x + a 6 y + a 7 xy + a 8 y 2 Eq. (7) wherein D(m,n) represents the degree of homogeneity at a window position (m,n), W is a window size and {a 1 *, a 2 *, ..., a 8 *} is an optimal set of motion parameters for a window block. The optimal set of motion parameters is a solution for a set of eight equations, each of which is derived by taking partial derivatives of Eq. (4) with respect to a 1 , a 2 , ..., a 8 and equating them to 0. As shown in Eqs. (3) to (7), the degree of homogeneity for a window block is determined through the use of an error function between a given set of motion vectors in a window block and an estimated set of motion vectors obtained from the optimal set of motion parameters. After detecting the seed block, the process 20 begins to determine a set of initial values for a set of motion parameters. And then, in order to correct the initial values to an actual set of motion parameters, a convergence process is taken through the use of a region growing technique described below. In step 14, a set of initial values for a set of motion parameters is determined based on the seed block detected in step 12 or a set of revised values for the set of motion parameters is determined based on a revised region detected in step 16 below. The set of initial values for the set of motion parameters are determined by fetching the optimal set of motion parameters for the seed block. And, the set of revised values for the set of motion parameters is determined based on all of the motion vectors contained in the revised region as in the case of detecting the optimal set of motion vectors for the seed block. In step 16, in order to correct the initial values or the revised values to an actual set of motion parameters, a region growing process is carried out by evaluating whether each motion vector contained in and around the seed block or the revised region is capable of being described or not with the initial values or the revised values, to thereby detect the revised region or define a newly revised region. In step 18, the difference between a current revised region and a previous revised region is compared with a predetermined value, to decide whether a region growing iteration is to be continued. The region growing iteration is repeated until the difference between the current revised region and the previous revised region is less than the predetermined value, to thereby determine a set of final values for the set of motion parameters. After detecting the final values for the set of motion parameters, another set of motion parameters is detected by repeating the steps 10 to 18 until each set of motion parameters for each of the moving objects is determined. While the present invention has been shown and described with respect to the particular embodiments, it will be apparent to those skilled in the art that many changes and modifications may be made without departing from scope of the invention as defined in the appended claims.

Claims: A method, for use in an object-orientated analysis-synthesis coder, for segmenting moving objects of a current frame, the method comprising the steps of: (a) detecting a changed area in the current frame by comparing the current frame with a preceding frame; (b) detecting motion vectors ((V x (x,y),V y (x,y))) for all of the pixels in the changed area, to thereby generate a motion vector field, the motion vector field representing the changed area defined by motion vectors ((V x (x,y),V y (x,y))) for all the pixels in the changed area; (c) carrying out a motion vector segmentation for the motion vector field characterised in that the motion vector detecting step comprises the steps of (b1) detecting motion vectors for selected pixels in the changed area, and (b2) obtaining motion vectors ((V x (x,y), V y (x,y))) of the non-selected pixels in the changed area by using the motion vectors ((V x (x,y), V y (x,y))) of the selected pixels to thereby generate the motion vector field; the motion vector segmentation step comprises the following steps: (d) sliding window blocks on the motion vector field and computing the degree of homogeneity (D(m,n)) for each of the window blocks to select a most homogeneous window block as a seed block, wherein the degree of homogeneity (D(m,n)) for a window block is computed in accordance with an error function (F(a 1 , ... a 8 )) between a given set of motion vectors ((V x (x,y),V y (x,y))) in the window block and an estimated motion vector (( V and x (x,y), V and y (x,y))) represented by an optimal set of motion parameters ({a 1 *, ... a 8 *}) for the window block, the degree of homogeneity (D(m,n)) representing the similarity between the given set of motion vectors ((V x (x,y),V y (x,y))) and the estimated motion vector (( V and x (x,y), V and y (x,y))) and x and y components of the estimated motion vector (( V and x (x,y), V and y (x,y))) being respectively defined by a subset of the motion parameters ({a 1 *, ... a 8 *}) in the optimal set; (e) determining a revised region in the motion vector field, wherein motion vectors ((V x (x,y),V y (x,y))) of the revised region are describable with the optimal set of motion parameters ({a 1 *, ... a 8 *}); (f) determining a revised set of motion parameters ({a 1 *, ... a 8 *}) from the revised region; (g) repeating the steps (e) and (f) using the revised set of motion parameters ({a 1 *, ... a 8 *}) determined in step (f) until the difference between a current revised region and a previous revised region is less than a predetermined value, to thereby determine a final set of motion parameters ({a 1 *, ... a 8 *}) ; and (h) repeating the steps (d) to (g) in the remaining region of the motion vector field to determine a set of motion parameters ({a 1 *, ... a 8 *}) for each of the remaining moving objects. The method of claim 1, wherein the degree of homogeneity (D(m,n)) is represented as: D ( m,n ) = 1 E ( a * 1 ,···, a * 8 ) ; ∈( x , y , a 1 , ..., a 8 ) = ( V x ( x , y ) - V x ( x , y )) 2 + ( V y ( x , y )- V y ( x , y )) 2 ; V x ( x , y )= a 1 + a 2 x + a 3 y + a 7 x 2 + a 8 xy ; V y ( x,y )= a 4 + a 5 x + a 6 y + a 7 xy + a 8 y 2 ; wherein D (m,n) represents the degree of homogeneity at a window position (m,n) ; W represents the window size; and {a 1 *, a 2 *, ... a 8 *} is the optimal set of motion parameters for the window block; V x (x,y) is a horizontal component of a motion vector at a position (x,y); V y (x,y) is a vertical component of the motion vector at the position (x,y); and V and x (x,y) and V and y (x,y) are horizontal and vertical components of a motion vector derived from the optimal set of motion parameters. An apparatus, for use in an object-oriented analysis-synthesis coder, for segmenting moving objects of a current frame, the apparatus comprising: means (100) for detecting a changed area in the current frame by comparing the current frame with a preceding frame; means (102, 103) for detecting motion vectors ((V x ( x,y ),V y ( x,y ))) for all of the pixels in the changed area to thereby generate a motion vector field, the motion vector field representing the changed area defined by motion vectors ((V x (x,y),V y (x,y))) for all the pixels in the changed area; means (104) for carrying out a motion vector segmentation for the motion vector field; characterised in that the motion vector detecting means (102, 103) comprise means (102) for detecting motion vectors ((V x (x,y),V y (x,y))) for selected pixels in the changed area, and means (103) for obtaining motion vectors ((V x (x,y),V y (x,y))) of the non-selected pixels in the changed area by using the motion vectors ((V x (x,y), V y (x,y))) of the selected pixels to thereby generate the motion vector field; the motion vector segmentation means (104) comprise: means (104) for selecting a most homogeneous window block as a seed block by sliding window blocks on the motion vector field and computing the degree of homogeneity (D(m,n)) for each of the window blocks, wherein the degree of homogeneity (D(m,n)) for a window block is computed in accordance with an error function (E(a 1 , ... a 8 )) between a given set of motion vectors ((V x (x,y),V y (x,y))) in the window block and an estimated motion vector (( V and x (x,y), V and y (x,y))) represented by an optimal set of motion parameters ({a a *,...a 8 *}) for the window block, the degree of homogeneity (D(m,n)) representing the similarity between the given set of motion vectors ((V x (x,y), V y (x,y))) and the estimated motion vector (( V and x (x,y), V and y (x,y))) and x and y components of the estimated motion vector (( V and x ( x,y ), V and y ( x,y ))) being respectively defined by a subset of the motion parameters ({a 1 , ... a 8 }) in the optimal set; and means for determining a final set of motion parameters ({a 1 , ... a 8 }) for a moving object by using the optimal set of motion parameters ({a 1 , ... a 8 }) of the seed block, wherein the final set of motion parameters ({a 1 , ... a 8 }) is determined by detecting a revised region in a motion vector field wherein motion vectors of the revised region are describable with the optimal set of motion parameters ({a 1 , ... a 8 }), finding a revised set of motion parameters ({a 1 , ... a 8 }) from the revised region, and obtaining a newly revised region and a newly revised set of motion parameters ({a 1 , ... a 8 }) by using the revised set of motion parameters ({a 1 , ... a 8 }) until the difference between a current revised region and a previous revised region is less than a predetermined value. The apparatus of claim 3, wherein the degree of homogeneity (D(m,n)) is represented as: D ( m,n ) = 1 E ( a * 1 ,···, a * 8 ) ; ∈( x,y,a 1 ,..., a 8 )=( V x ( x,y )- V x ( x,y )) 2 +( V y ( x,y )- V y ( x,y )) 2 ; V x ( x,y )= a 1 + a 2 x + a 3 y + a 7 x 2 + a 8 xy ; V y ( x,y )= a 4 + a 5 x + a 6 y + a 7 xy + a 8 y 2 ; wherein D(m,n) represents the degree of homogeneity at a window position (m,n); W represents the window size; and {a 1 *, a 2 *, ... a 8 *} is the optimal set of motion parameters for the window block; V x (x,y) is a horizontal component of a motion vector at a position (x,y); V y (x,y) is a vertical component of the motion vector at the position (x,y); and V and x (x,y) and V and y (x,y) are horizontal and vertical components of a motion vector derived from the optimal set of motion parameters ({a 1 , ... a 8 }).

Inventors: CHANG GYU-HWAN, CHOI JAE-GARK, JUNG HAE-MOOK, KIM SEONG-DAE, LEE SI-WOONG, CHANG, GYU-HWAN, CHOI, JAE-GARK, JUNG, HAE-MOOK, KIM, SEONG-DAE, LEE, SI-WOONG, Chang, Gyu-Hwan, Daewoo Electronics Co., Ltd., Jung, Hae-Mook, Daewoo Electronics Co., Ltd.
Applicants: DAEWOO ELECTRONICS CO LTD, DAEWOO ELECTRONICS CO., LTD
Application year: 1995
Main classification: H04N7
IPC codes: H04N7