Method and device for identifying and extracting images of multiple users, and for recognizing user gestures

TECHNICAL FIELD

The invention relates to the field of interactive multimedia applications. More particularly, it relates to a method and a device for identifying, tracking, and extracting images of multiple users, as well as for recognizing the arms, hands and whole-body gestures of multiple users, in order to interact with a computer system.

DESCRIPTION OF RELATED ART

Nowadays, multimedia and virtual reality applications permit several and different interactions between a computer system and a user, and, as a consequence, require input devices with additional features. Traditionally, common desktop input devices, such as keyboards and mice, or specialized devices like trackballs, touch pads, joysticks and game pads, are firmly established as the classical means of interaction between a person and a computer system. Ideally, in particular applications, computer user interfaces should have on the one hand an intuitive interaction format, and on the other hand a large range of interaction capabilities. All the traditional devices fail to combine the above features. For example, a common computer keyboard has large range of interaction capabilities, but has not an intuitive interaction format. Vice versa, a common computer mouse has an intuitive interaction format, but has not a large range of interaction capabilities. Moreover, all these devices are frequently realized for contexts of single users and contexts wherein the human-computer interaction is reduced.

In some domains, as virtual reality, the traditional input devices suffer from unacceptable drawbacks, for example: <ul id="ul0001" list-style="bullet" compact="compact"><li>users are bound to the location of the keyboard and mouse, or other device;</li><li>keyboards and mice do not work well for controlling games, or other highly interactive applications, and even game pads only support a limited form of user interaction.</li></ul> In computer graphics today, there is a soaring necessity for alternative solutions that could overcome the above limitations, as well as provide additional functionalities and advantages as: <ul id="ul0002" list-style="bullet" compact="compact"><li>permitting users to freely move during interaction with the computer system;</li><li>allowing multiple users to compete or to collaborate in groupware collaborative systems;</li><li>interacting and experiencing without wearing special, obtrusive, or expensive instrumentation;</li><li>permitting whole body interactions for richer, more natural control;</li><li>distinguishing between the participants and the audience;</li></ul>

Some existing techniques use video cameras for recording the image of the users in order to provide input to the computer system, and sometimes include the image of the users in a graphical output generated by the computer system. Included among these techniques there are for example: <patcit id="pcit0001" dnum="US4843568A"><text>US patent 4,843,568 (Krueger et al.</text></patcit>) which discloses a technique for allowing a real time perception and response to the actions of a single participant/user; <patcit id="pcit0002" dnum="US5534917A"><text>US patent 5,534,917 (MacDougall</text></patcit>) which discloses a Video Image Based Control System. However, all these methods require the user to be in a precise location in front of the camera, with no other moving object, and in particular no spectator, in the field of view of said camera. Moreover, in order to distinguish the image of the user, a specially designed background must be additionally placed behind the users for image segmentation.

Segmentation based only on the color image information is a common technique in computer vision for separating foreground from the background. The most naive approach consists in storing an image of the background as a reference image, while a foreground object is segmented by a simple subtraction of this background reference from the current image. This simple technique is often used for post-production incrustation when the background is constant (commonly a uniform green or blue color) in perfectly controlled lighting conditions. Nevertheless, this approach suffers from problems, especially in natural lighting or when the objects to be segmented produce shadows on the floor or the background.

Other systems make use of devices that must be worn by the user (for example, the data glove: <nplcit id="ncit0001" npl-type="s"><text>Joseph Laviola, " Flex and Pinch: A Case Study Of Whole Hand Input Design For Virtual Environment Interaction ", Proc IASTED, pp.221-225, 1999</text></nplcit>), or special markers (like light-emitting diodes) attached to the body of the subject for limb tracking and gesture recognition, or pressure sensitive switches in the floor, to detect position of users. However, the pure scope of these techniques is limited to highly specialized applications and to dedicated users, and is too intrusive and cumbersome for the general public and generic applications.

No solution exists so far that allows multiple unencumbered users to move freely, and together interact with a computer system in real-time.

PRIOR ART DISCUSSION

The document <patcit id="pcit0003" dnum="US5534917A"><text>US 5,534,917</text></patcit> describes a video image based control system that allows a participant to interact with a computer based environment. This document provides a technique for creating areas of interest in the two-dimensional image wherein a participant interacts. Nevertheless, this apparatus does not permit a multiple user interaction, cannot recognize the gestures of a participant and cannot detect or track any part of the body of said participant. Moreover, it does not separate the image of a participant from the background image or from the image of the audience.

The document <patcit id="pcit0004" dnum="US6661918B"><text>US 6,661,918</text></patcit> discloses a method and a system for distinguishing between background and foreground objects in a sequence of video images, as well as for identifying these objects. This document provides a technique in which one creates a depth map and an intensity map (e.g. luminance, gray scale, UV chrominance value, etc...) by using a pair of digital video cameras. Depth and intensity values of a pixel in successive images are represented in a histogram and clustered for determining a background model. However, this apparatus does not recognize the body pose and users gestures, and does not track parts of the body. Moreover, it does not locate users in a two-dimension nor three-dimension space, and does not distinguish between several users, and between a participant and the audience.

The document <patcit id="pcit0005" dnum="US6950123B"><text>US 6,950,123</text></patcit> discloses a method and a system for tracking simultaneously multiple objects in a sequence of video frames by means of multiple cameras. This document provides a technique for extracting a region of interest (ROI) corresponding to a portion of a playing field. This region represents the foreground image which is separated from the background image. By means of different filters and a Monte Carlo technique, the apparatus tracks and segments all the objects and resolves all conflicts to estimate the objects positions. Nevertheless, it cannot recognize the body poses of users or the gestures of the users; and cannot track or detect any part of the body. Although the apparatus comprises several cameras, they have different fields of view, and it does not compute a depth map. As a consequence, the method assumes that the users move on a flat surface relatively far and below the camera in order to infer the three-dimensional position of the users. Lacking dense depth information, the system is not able to separate the images of different users, or distinguish between the participants and the audience, when they are on the same line of sight from the camera.

The document <patcit id="pcit0006" dnum="US6181343B"><text>US 6,181,343</text></patcit> describes a system and method for permitting three-dimensional navigation through a virtual reality by using camera-based gesture inputs of a single user. It processes the apparent distances in two-dimensional images to infer three-dimensional position to the user. Nevertheless, this approach has several drawbacks and limitations as follows: the apparatus relies on a fixed background and hence it cannot be used if there are moving objects or variable lighting behind the user; it cannot be used for several users if they are in the same line of sight from the camera(s). Furthermore, the system relies on biometric data and determination of the silhouettes in order to infer positions from apparent lengths of the limbs measured in the image. That can be very inaccurate as biometric data are only averages, and individual data can vary greatly; it may also not work if users wear loose clothing or carry items. The technique assumes that users' feet are on the floor to determine the three-dimensional location of the users. That will not work if users jump, for example when playing a game; if users' feet are not detected accurately in the image, for example because of shadows on the floor; or for more complex floors, for example not flat, with stairs or several levels, etc...

The document <patcit id="pcit0007" dnum="US7003134B"><text>US 7,003,134</text></patcit> discloses a method for estimating the three-dimensional position and orientation of an object. The apparatus provides a technique for estimating pose of an object by using depth data at real-time rates. However, the document does not disclose any apparatus for identifying, tracking and extracting the image of multiple users, or for separating the participants from the audience, or for recognizing gestures of users.

The document <patcit id="pcit0008" dnum="US7003136B"><text>US 7,003,136</text></patcit> discloses a method for estimating the three-dimensional position and orientation of an object. A three-dimensional point cloud is obtained from a time series of video frames and representing selected image pixels in a three-dimensional coordinate system spanned by a ground plane and a vertical axis. The three-dimensional point cloud is portioned into a set of vertically-oriented bins for producing "plan-view images". The objects are tracked based upon said plan-view images. Nevertheless, this document does not disclose any apparatus for identifying, tracking and extracting the image of multiple users, or for separating the participants from the audience. Moreover, no means for recognizing gestures of users are provided.

<patcit id="pcit0009" dnum="US20020041327A1"><text>U.S. Pat. Application No 2002/0041327A1</text></patcit> discloses a method for interfacing a computer system by using stereo vision. The apparatus captures and processes a stereo image for determining position information of an object held by a user. Each time a user moves an object into (or reaches with his hands) a fixed region of interest, the apparatus establishes the object's position by computing a depth map. Nevertheless, the technique, herein described, fails to identify, track and extract the image of multiple users when they do not stay at a pre-determined location. Moreover, it does not tolerate any other moving objects in the region of interest.

The document <patcit id="pcit0010" dnum="WO06022685A1"><text>WO06022685A1</text></patcit> describes a system and method for providing a functional virtual environment with real time extracted and transplanted images. The document mentions a method for extracting a foreground image from a background environment by using non-monochromatic, fixed background against which the users' images can be extracted. Nevertheless, the apparatus does not provide any technique for extracting the user image if there are moving objects or persons behind the user, and in general if there is not a fixed background. Moreover, the apparatus herein described does not recognize gestures, body pose of users and does not detect and track any body part of the participants.

It is an object of the present invention to provide a method and a device for identifying, tracking and extracting images of multiple users as well as recognizing the gestures and the objects of multi users in the scene of a groupware interactive environment, which aims to overcome the above discussed disadvantages of the prior art.

SUMMARY OF THE INVENTION

According to a first aspect of the invention, a method is provided for identifying and extracting images of one or more users in an interactive environment. The method comprises the steps of : <ul id="ul0003" list-style="dash" compact="compact"><li>obtaining a depth map of a scene in the form of an array of depth values, and an image of said scene in the form of a corresponding array of pixel values, said depth map and said image being registered;</li><li>applying a coordinate transformation to said depth map and said image for obtaining a corresponding array containing the 3D positions in a real-world coordinates system and pixel values points (pixel values may either be colour or grey level);</li><li>grouping said points according to their relative positions, by using a clustering process so that each group contains points that are in the same region of space and correspond to a user location;</li><li>defining individual volumes of interest each corresponding to one of said user locations (these individual volumes of interest may be fixed, and predefined);</li><li>selecting, from said array containing the 3D positions and pixel values, the points located in said volumes of interest for obtaining segmentation masks for each user;</li><li>and applying said segmentation masks to said image for extracting images of said users.</li></ul>

In a preferred embodiment of the method, the individual volumes of interest may be obtained by determining individual volumes of interest bounds separating said groups. These volumes of interest may vary according to user movements, and thereby be adaptative.

One may use said segmentation masks of said users for modifying existing elements or inserting virtual elements in said scene, and projecting an image showing these elements, and providing thereby a "magic mirror"

The method may comprise a registration process comprising the steps of: <ul id="ul0004" list-style="dash" compact="compact"><li>performing a calibration process for obtaining calibration parameters comprising the relative position of a depth perception device and a video camera, the focal length and optical centres of said depth perception device and said video camera;</li><li>obtaining a raw depth array from said depth perception device;</li><li>obtaining a raw pixel values array from said video camera;</li><li>computing the 3D coordinates for each element of said raw depth array, from the depth value itself, from the array indices of the element, and from the relevant calibration parameters of the devices;</li><li>computing the array indices where said 3D coordinates point is projected in the image;</li><li>repeating this process for each element of the raw depth array, for providing a depth map and image of the scene, said depth map and said image being registered.</li></ul> Registered depth map and image have same size (same number of pixels). More particularly, a pixel of the registered color pixel array and the corresponding pixel of the registered depth array correspond to the same physical scene element.

The method may also comprise a depth map refinement process. This process is desired when the depth map comprises gaps, where no depth value is available. This process may comprise the steps of: <ul id="ul0005" list-style="dash" compact="compact"><li>scanning said depth map row by row by executing a row interpolation comprising the steps of : <ul id="ul0006" list-style="dash" compact="compact"><li>identifying gaps in the depth map where no value of depth is provided;</li><li>if a gap is shorter than a preset threshold, and if the depth difference between the two sides of the gap is smaller than a preset threshold, and if the pixel values difference of the corresponding pixels in the image is smaller than a preset threshold, then the gap in the depth map is filled with depth values, said depth values being the average of the depths at each side of the gap or values which are linearly interpolated between these values;</li></ul></li><li>optionally scanning said depth map column by column and executing a column interpolation similar to said row interpolation;</li><li>optionally performing a second row interpolation.</li></ul>

The method may additionally comprise a mask filling process comprising one or more of the following steps: <ul id="ul0007" list-style="dash" compact="compact"><li>performing a morphological dilation step (this is done most effectively by repeating a "one-pixel dilation" D times, where D is the desired total size of the dilation);</li><li>performing a median filtering step (this step is executed for further smoothing the edges of each individual mask and removing very small holes and/or small disconnected segmented regions. The size M of the median filtering window can be adjusted depending on the characteristics of the depth perception method);</li><li>filling small holes in the individual masks;</li><li>removing small objects in the individual mask;</li><li>performing a morphological erosion process of a preset size;</li></ul> for obtaining filled masks.

The method may comprise an optional background segmentation process for separating foreground objects from background objects. The background segmentation process may comprise the steps of: <ul id="ul0008" list-style="dash" compact="compact"><li>obtaining successive images of said scene;</li><li>detecting motion of objects in said scene by subtracting two successive images and performing a thresholding;</li><li>computing a colour mean array containing for each pixel a mean value µ and a colour variance array containing for each pixel a variance var from corresponding pixel of said successive images of said scene;</li><li>determining pixels of said images that change between successive images;</li><li>masking the pixels that did not change for updating said colour mean array and colour variance array;</li><li>determining a background model from said colour mean array and colour variance array;</li><li>deciding that a pixel is part of the background if its pixel value x meets the condition <maths id="math0001"><math display="block"><mfenced><mi mathvariant="normal">x</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">μ</mi></mfenced><mo>⁢</mo><mn mathvariant="normal">2</mn><mo mathvariant="normal">&lt;</mo><mi mathvariant="normal">β</mi><mo mathvariant="normal">*</mo><mi>var</mi></math><img file="EP2584530A2_D0001.tif" /></maths> where β is a variable threshold;</li><li>determining a background-based segmentation mask by selecting all pixels in image that do not meet above criteria.</li></ul>

When using background segmentation the method of the invention may detect and treat the shadows on the background of an image. This process may comprise the steps of: <ul id="ul0009" list-style="dash" compact="compact"><li>dividing said image in non-overlapping rectangular blocks;</li><li>for each block, repeating the following steps:</li><li>extracting all pairs (x,y) of corresponding pixel values from said colour mean array and said image;</li><li>computing a monotone regression y = f(x), such as a linear regression y = ax+b with correlation coefficient ρ ;</li><li>using parameters of said regression (a, b, ρ, or others) to classify a block as a background or a foreground block, e.g. if ρ &lt;threshold then block is a foreground block;</li><li>if block is classified as a background block, adapting mean array values using regression parameters, e.g. µ' = a µ + b</li><li>if block is classified as foreground block but is neighbour of a block classified as a background block, optionally performing the preceding adapting step using regression parameters a, b of said neighbour block;</li><li>deciding that a pixel is part of the background if its pixel value x meets the condition <maths id="math0002"><math display="block"><mfenced><mi mathvariant="normal">x</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">μʹ</mi></mfenced><mo>⁢</mo><mn mathvariant="normal">2</mn><mo mathvariant="normal">&lt;</mo><mi mathvariant="normal">β</mi><mo mathvariant="normal">*</mo><mi>var</mi></math><img file="EP2584530A2_D0002.tif" /></maths></li></ul> where β is a variable threshold;

The method may also comprise a multiple step erosion process for improving a filled mask. This process may comprise the steps of: <ul id="ul0010" list-style="dash" compact="compact"><li>detecting video image edges from said image, by using said background-based segmentation mask for obtaining an "edge" map;</li><li>repeating the following two steps A times, where A is a preset parameter, t is the iteration counter, and mask(0) being the filled mask; <ul id="ul0011" list-style="dash" compact="compact"><li>performing a one-pixel erosion step on said filled mask "mask(t-1)" for obtaining a one-pixel eroded mask "mask_e(t)";</li><li>performing an edge restoration process for correcting said one-pixel eroded mask and obtaining an edge-restored mask "mask(t)";</li></ul></li><li>performing a final one-pixel erosion step on said edge-restored mask "mask(t)" for obtaining a final eroded mask;</li><li>combining the background-based segmentation mask and said final eroded mask via a logical AND operation in order to obtain a final mask.</li></ul>

Said multiple step erosion may comprises the step of performing the logical operation: <ul id="ul0012" list-style="none" compact="compact"><li>mask(t) = mask_e(t) OR ( (NOT mask_e(t)) AND mask(t-1) AND edge).</li></ul>

Alternatively, said multiple step erosion may comprises the steps of: <ul id="ul0013" list-style="dash" compact="compact"><li>computing masks Eb and Nb, for each successive execution of the edge restoration process (23b), according to E_b = mask_e(t) OR ((NOT mask_e(t)) AND mask(t-1)) N_b = mask_e(t) OR ((NOT mask_e(t)) AND mask(t-1) AND edge);</li><li>dividing masks Eb and Nb in blocks i having a preset size;</li><li>at each successive execution, and for each block of masks Eb and Nb, counting the number of pixels equal to '1', for obtaining the numbers Σ Eb i (t) and ΣNbi (t), respectively;</li><li>for each block i, compare the numbers ΣEbi (t) and ΣNbi (t) and their ratio to the values computed at the previous iterations ΣEbi (t-1) and ΣNbi (t-1);</li><li>stopping the edge restoration process for block i when said ratio approaches '1' within a preset margin.</li></ul>

The method preferably comprises a process for recognizing a gesture of one of said users. Said process may comprise the following steps: <ul id="ul0014" list-style="dash" compact="compact"><li>dividing the individual volume of interest of said user in small elementary volumes of pre-determined size;</li><li>allocating each pixel of the mask of said user to the elementary volume wherein it is located;</li><li>counting the number of pixels within each elementary volume, and selecting the elementary volumes containing at least one pixel;</li><li>determining the centres of said selected elementary volumes, said centres being either the geometric centre or centre of gravity of the pixels within said elementary volumes;</li><li>performing a graph construction step, wherein each centre of said selected elementary volumes is a node, edges linking two nodes n, m are given a weight w(n,m) equal to the Euclidian distance between the centres of said nodes;</li><li>performing a centre estimation step, wherein an elementary volume is determined that is closest to the centre of gravity of all pixels is named "source cube" and the corresponding node in the graph is named the "source node";</li><li>computing a curvilinear distance D(v) from the source node to all nodes v that are connected to it;</li><li>performing an extremity detection step by checking for all nodes u, whether D (u) is greater or equal to D (v) for all nodes v connected to u, and if it is the case, marking node u as an extremity node;</li><li>performing a body part labelling step for obtaining the locations of body parts comprising head, hands, feet, by allocating body parts to extremity nodes using rules;</li><li>determining a sequence of body parts locations, by performing the above steps on successive depth maps and images of the scene;</li><li>performing a tracking of said body parts, and</li><li>performing gesture recognition step by using a hidden Markov model method.</li></ul>

In the process of gesture recognition, the computation of a curvilinear distance D(v) may be performed by using a modified Dijkstra's algorithm wherein the computation of a best weight W(n) for a node n is performed by adding the weight w(n,n-1) of the edge linking nodes n and n-1, raised to a power p, to the weight W(n-1) of a preceding node n-1, p being an integer larger than 1.

According to a second aspect of the invention, a device is provided for identifying and extracting images of multiple users in an interactive environment scene comprising: <ul id="ul0015" list-style="dash" compact="compact"><li>a video camera for capturing an image from the scene;</li><li>a depth perception devices for providing depth information about said scene;</li><li>at least one computer processor for processing said depth information and said image information; wherein means are provided for using individual volumes of interest from said scene for each user.</li></ul>

In a preferred embodiment, the device comprises means for obtaining adaptive volumes of interest for each user. By "adaptative" one must understand that said volumes of interest are determined dynamically, and follow the movements of the users.

The device preferably comprises: <ul id="ul0016" list-style="dash" compact="compact"><li>means for dividing the individual volume of interest of said user in small elementary volumes of pre-determined size;</li><li>means for allocating each pixel of the mask of said user to the elementary volume wherein it is located;</li><li>means for counting the number of pixels within each elementary volume, and selecting the elementary volumes containing at least one pixel;</li><li>means for determining the centres of said selected elementary volumes, said centres being either the geometric centre or centre of gravity of the pixels within said elementary volumes;</li><li>means for performing a graph construction step, wherein each centre of said selected elementary volumes is a node, edges linking two nodes n, m are given a weight w(n,m) equal to the Euclidian distance between the centres of said nodes;</li><li>means for performing a centre estimation step, wherein an elementary volume is determined that is closest to the centre of gravity of all pixels is named "source cube" and the corresponding node in the graph is named the "source node";</li><li>means for computing a curvilinear distance D(v) from the source node to all nodes v that are connected to it;</li><li>means for performing an extremity detection step by checking for all nodes u, whether D (u) is greater or equal to D (v) for all nodes v connected to u, and if it is the case, marking node u as an extremity node;</li><li>means for performing a body part labelling step for obtaining the locations of body parts comprising head, hands, feet, by allocating body parts to extremity nodes using rules;</li><li>means for determining a sequence of body parts locations, by performing the above steps on successive depth maps and images of the scene;</li><li>means for performing a tracking of said body parts;</li><li>means for performing gesture recognition step by using a hidden Markov model method.</li></ul> All these means are components of a software residing in said computer.

According to a third aspect, the invention covers the use of a method according to the invention and/or a device according to the invention for providing an interactive virtual reality game wherein images of a plurality of users are separated from each other and from a background.

Preferably, gestures and/or body poses of individual users are recognized and used for controlling said game.

Images or partial images of the users may be shown in a virtual-game world

One can determine the location of a user and use said location for directing one or more light beams.

Users may be directed to catch or to escape one of said light beams.

Users may also be directed to point at each other or to give each other virtual objects or to point at each other to establish links between them in the game.

An avatar in a virtual reality may replicate a gesture or a visual characteristic of a user such as clothes colors, hair color, skin color.

Real-world elements may react to user locations and gestures by floor shifts, animatronics figures move and talk, etc.

The device and method of the invention may be used for performing or for buying/selling items in a virtual marketplace...

According to a last aspect of the invention, one or more computer-readable media having stored thereon a computer program for performing the method and/or for using the device of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

<figref idref="f0001">FIG. 1</figref> is a pictorial representation of a device according to the invention.

<figref idref="f0001">FIG. 1</figref> a is a general flowchart diagram of a method according to the invention.

<figref idref="f0003">FIGs. 2</figref>, <figref idref="f0004">3</figref>, <figref idref="f0005">4</figref>, <figref idref="f0006 f0007">5</figref>, <figref idref="f0007">5b</figref>, <figref idref="f0009">6a</figref>, <figref idref="f0010">7</figref>, <figref idref="f0011">8</figref> and <figref idref="f0012">9</figref> are detailed flowchart diagrams of parts of a method according to the invention.

<figref idref="f0006">FIG. 5a</figref> is a pictorial representation of individual volume of interest bounds, separating multiple users.

<figref idref="f0008">FIG. 6</figref> is a schematic representation illustrating the processing and flow of different data and masks.

<figref idref="f0013">FIG. 9a</figref> is a schematic data representation used in body pose recognition.

<figref idref="f0014">FIGs. 10</figref> and <figref idref="f0015">11</figref> are pictorial representations of two embodiments of devices according to the invention.

DETAILED DESCRIPTION OF THE INVENTION

According to a preferred embodiment, <figref idref="f0001">FIG. 1</figref> shows a pictorial representation of a device according to the invention. The apparatus 1 comprises a computer system 2; a depth perception device 3 connected to the computer system 2; a video camera 4 (or stereoscopic or tri-focal cameras that serve both purposes) also connected to said computer system 2; a computer-controlled display 5 such as projection, flat screen or other; a variety of computer-connected output devices 5', such as light projection systems, loudspeakers, displays etc..., for providing rich audio-visual feedback in order to react to the location and the movements and gestures of all the users 6, 6' in a scene. The depth perception device 3 may be, for example, a stereoscopic camera (see e.g. <nplcit id="ncit0002" npl-type="s"><text>D. Scharstein and R. Szeiiski.: "A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms" IJCV 47(1/2/3):7-42, April-June 2002</text></nplcit>., for a survey of stereo vision technology); or a laser or infrared range sensor (see http://www.swissranger.ch/: for an example of a commercial product, and the paper: <nplcit id="ncit0003" npl-type="s"><text>JW Weingarten, G Gruener, R Siegwart, A state-of-the-art 3D sensor for robot navigation, Proceedings Intelligent Robots and Systems, 2004</text></nplcit>); or other. Optionally, the video camera 4 may be a stereoscopic camera or a tri-focal camera, and in this case it can replace the depth perception device 3 and function as both. A global region of interest can be defined for automatically distinguishing the participants 6 from the spectators 6' and from other objects 6", even if they are all in the field of view of the cameras 4, without using any physical opaque separator. The present invention can also comprise loudspeakers and other computer-controlled devices and sensors (spotlights and gobos, smoke screens, buttons, joysticks, game controllers, wheels, musical instruments, etc.).

It should be noted that not all types of devices may be part of each given setup. For example, in a variant of this preferred embodiment the physical setup may comprise a stereoscopic camera and a display, or, alternatively, in another variant of the said embodiment it may comprise a depth perception sensor and a computer-controlled gobo. The physical setups, according to the invention, can also be located indoors or outdoors. Alternatively, the area covered by the cameras and sensors (the scene) can be empty (except for the active users of the system), or occupied by furniture, props, natural elements or other unrelated objects.

The depth perception device 3 and the video camera 4 provide the computer system 2 with raw data about the content of the scene. In particular, the depth perception device 3 provides a map of distances (depth map) in the form of a depth array 7; and the video camera 4 provides a color pixel array 8. All these data are processed and used to choose and/or drive the output of the computer-controlled devices 5'.

It should be noted that the depth information is used for several, independent, non-exclusive, purposes as follows: <ul id="ul0017" list-style="bullet" compact="compact"><li>to locate and track the users 6, 6' in the scene;</li><li>to locate objects 6" in the scene (and track them if they are mobile, e.g. a mobile robot), objects that users manipulate, or objects that are part of the interactive setup;</li><li>to determine the general body pose (e.g. standing, sitting, lying down, etc.) of the users 6;</li><li>to recognize hand or whole body gestures (e.g. pointing, grabbing, throwing, kicking, jumping, leaning, etc.) made by users 6;</li><li>to separate (segment) and discriminate, in the video streams provided by the cameras 4, the image of each user 6 from the background scene. If the image of a user 6 is partly occluded, only the visible part is segmented, and the nature of that part (e.g. the head and shoulders) is identified;</li><li>to identify and label the various body parts and clothing items (e.g. head, arms, hands, legs, hats, shoes, etc...) in the images of the users 6.</li></ul>

<figref idref="f0002"><b>FIG. 1a</b></figref> shows a flowchart of a preferred embodiment according to the invention. The depth perception device 3 and the video camera 4, which are previously synchronized, provide the computer system 2 with a raw depth array 3' and with a raw color pixel array 4', respectively. Typically, those arrays are not corresponding in size and array elements depending on the relative position of devices and so on. Therefore, with a registration process, which uses some devices parameters, the system transforms said two acquired raw arrays 3' and 4' into a registered depth array 7 and color-pixel array 8 i.e. arrays having same sizes (number or rows and columns), and where corresponding pixels relate to a given scene element. Due to depth perception device technical limitations, it frequently happens that missing parts or errors appear in the depth map. These missing parts or errors are repaired by using a depth array refinement process. Afterwards, by applying a coordinate transform to the two arrays, the system computes a 3D positions and color points array 15 (a array wherein corresponding elements contain the 3D coordinates X, Y, Z associated with a color or other pixel value). Once said 3D position and color points array 15 is established, it is used for performing a user separation process which provides users positions 19 and individual volume of interest 20 for each participant 6. By using an individual mask computation process and a mask filling process, the system establishes, from the individual volumes of interest 20 and from the 3D position and color points array 15, a filled mask 21 for each user. The latter, due to the filling process, may be wider than the actual image of the user. In order to adjust the dimensions of this filled mask 21, an erosion process, in combination with a background-based segmentation process 32, is then performed. Finally, by means of the logical operator AND, the system provides a final individual mask 35 for each user 6 in the scene. The final individual mask 35, the individual volume of interest 20 and the 3D position and color points array 15 are taken as input for the body pose and body parts recognition and tracking process, as well as for the gesture recognition process.

We refer now to <figref idref="f0003"><b>FIG.2</b></figref><b>.</b> The depth perception devices 3 provide a raw depth values array 3' corresponding to different lines of sight originating at said depth perception device 3; and the video camera 4 provides an image acquisition in the form of a raw color pixel array 4'. If, optionally, the depth perception device 3 is a stereoscopic or a tri-ocular video camera, then the depth map corresponds to the pixels of the image provided by one of the image sensors. Therefore, in that case, the apparatus knows the depth values of each object corresponding to each pixel of the image. A synchronization process is performed by controlling the different devices with a common external trigger in such a way that all data are captured by all devices at the same moment. As above introduced, registration establishes a correspondence between the raw color pixel array 4' provided by the camera 4, and the raw depth array 3' provided by the depth perception device 3. More precisely registration establishes a correspondence between the elements of each array. The registration action can be executed by a two-step process as follows: <ol id="ol0001"><li>1. The first one is the calibration step which is performed only once, off-line, after the video camera 4 and the depth perception device 3 have been positioned. It consists in placing an object of known shape and dimensions (like a cube or a rectangular pane with a printed checkerboard pattern) in front of both devices 3, 4. The known object can either be placed once in the scene, or can be moved to various locations. For each location of the calibration object, one image and one depth map are captured simultaneously by the depth perception device 3 and the video camera 4. By locating the features of the object (like edges or corners) in both the image and the depth map (or the sequence of images and depth maps), several calibration parameters 13 are stored. Those parameters comprise: <ul id="ul0018" list-style="bullet" compact="compact"><li>the relative position of the two devices 3 and 4 expressed by a rotation matrix and a translation vector;</li><li>the focal length and optical center of the two devices 3 and 4;</li><li>the image distortion (relative to the ideal pinhole model) introduced by the video camera 4;</li><li>other parameters describing the operation of the depth perception device 3.</li></ul> The calibration step is very similar in principle to the calibration of stereoscopic imaging devices. However, an important difference is that, in the present case, the two devices 3 and 4 are not identical; in fact they operate very differently, and do not produce at all the same kind of data. The video camera 4 produces an array of pixels, while the depth perception device 3 produces an array of depth measurements.</li><li>2. The second step of the registration uses the calibration parameters 13 computed during the calibration step in order to register the content of each new pair of color pixel array 4' and depth array 3' at run time. For each element of the raw depth array 3', the 3D coordinates of the real-world point that gave rise to that measurement are computed. Said coordinates are calculated from the depth value itself, from the array indices of the element, and from the relevant calibration parameters of the devices which have been obtained during the first step of the registration (for example, a pseudo optical center and a pseudo focal length). Subsequently, coordinate transforms (rotation and translation) are applied to the coordinates of the same real-world point in the coordinate system of the video camera 4. Finally, the parameters of the video camera 4, such as focal length, optical center, distortion parameters, baseline, rectification parameters or other..., are used to compute the coordinate wherein said real-world point is projected in the image. By repeating this process for each element of the raw depth array 3', the apparatus establishes correspondences between the entire depth array 3' and the color pixel array 4'. This process provides a registered depth array 7 and a registered color pixel array 8 which have the same size. More particularly, a pixel of the registered color pixel array 7 and the corresponding pixel of the registered depth array 8, correspond to the same physical scene element.</li></ol>

It is a well known problem in the prior art that the depth map provided by depth perception devices may contain errors or missing parts. In fact, by using a stereoscopic camera, it frequently happens that no depth data are computed for low-detail areas of the image. Referring now to <figref idref="f0004"><b>FIG.3</b></figref>, the above-discussed problem of gaps in the depth map is addressed as follows. Once the color pixel array 8 and the depth array 7 are provided, said depth array 7 is scanned row by row and afterwards column by column by executing a row interpolation 9 and a column interpolation 10, and optionally a second row interpolation 11. On each row, all the gaps contained in the depth array 7 are identified. If a gap is shorter than a preset threshold, and if the depth difference between the two sides of the gap is smaller than a preset threshold, the color of the corresponding pixels in the color array 8 is examined. More particularly, in this case the process examines the color of the two pixels on each side of the gap and the color of the pixels inside this gap. If those are almost constant (within some preset tolerance) then the gap in the depth array 7 is filled with depth values. This depth value may be: the (almost) constant one on each side of the gap; their average; or values which are linearly interpolated from the values on both side of the gap. After the process has been completed on all rows, it is done on the columns of the depth array 7; hence values that were initially missing and have been filled in during the horizontal scan, can in turn frame gaps in the vertical direction. The procedure can be carried out in the other order: columns first, then rows; or a third step in the same direction as the initial pass can also be added. At this point it should be noted that, in all cases wherein the depth map refinement process is required and performed, for the clarity of the description we will refer, hereinafter, to the depth array 7 as the interpolated depth array 12 provided at the end of this process.

We refer now to <figref idref="f0005"><b>FIG.4</b></figref><b>.</b> The calibration parameters 13, obtained by the calibration step, are used to compute the coordinate transformations which have to be applied to any new pixel color array 8 and new depth array 7, that are captured by the video camera 4 and the depth perception device 3. This transformation is required to obtain coordinates (X, Y, Z) in a more convenient three-dimensional real-world coordinate system 14, wherein, typically, the Y-axis is the vertical axis and the X- or Z-axis is parallel to a display or a wall of the room. Such a coordinate transformation (R, T) is applied as follows: <maths id="math0003"><math display="block"><mi mathvariant="normal">Zʹ</mi><mo mathvariant="normal">=</mo><mi mathvariant="normal">z</mi></math><img file="EP2584530A2_D0003.tif" /></maths><maths id="math0004"><math display="block"><mi mathvariant="normal">Xʹ</mi><mo>=</mo><mfenced><mi mathvariant="normal">x</mi><mo>-</mo><mi>cx</mi></mfenced><mo>/</mo><mi>fx</mi></math><img file="EP2584530A2_D0004.tif" /></maths><maths id="math0005"><math display="block"><mi mathvariant="normal">Yʹ</mi><mo>=</mo><mfenced><mi mathvariant="normal">y</mi><mo>-</mo><mi>cy</mi></mfenced><mo>/</mo><mi>fy</mi></math><img file="EP2584530A2_D0005.tif" /></maths> where x, y denote the coordinates of the pixel in the color array 8 and the depth array 7; z is the depth value at coordinates x, y; cx and cy are the coordinates of the optical center of the color array 8; fx and fy are the focal lengths of the color array 8 (fx=fy for square pixels); and <maths id="math0006"><math display="block"><mfenced open="[" close="]"><mi>X Y Z</mi></mfenced><mo>=</mo><mi mathvariant="normal">R</mi><mfenced open="[" close="]"><mi>Xʹ Yʹ Zʹ</mi></mfenced><mo>+</mo><mi mathvariant="normal">T</mi><mo>;</mo></math><img file="EP2584530A2_D0006.tif" /></maths> where R is the rotation matrix between the video camera 4 and the world coordinate systems and T is the translation between both origins. This coordinate transformation (R, T) is determined by using a calibration object such a planar or non-planar target facing a check board to the camera; or by using the depth perception of the camera in order to compute the mathematical representation of a plan of the scene (usually the floor but it could be a wall of the room) relatively with the camera position and orientation. Finally, the three-dimensional world coordinate system 14 provides a 3D positions and color points array 15. As a consequence, any reference to a pixel (real world coordinate) in the remainder of this document should be understood as the association of an image element of the color pixel array 8 with its position expressed in world coordinates.

<figref idref="f0006 f0007"><b>FIG.5</b></figref> and <figref idref="f0006"><b>FIG.5a</b></figref> show in detail the users separation method according to a preferred embodiment of the present invention. Once the 3D position and color points array 15 is computed, the process for separating users 6 in the scene is performed as follows: active volume bounds 16 are predetermined at the time of the setup. They are virtual 3D frontiers with arbitrary shape that are defined either in order to bound some global regions of interest, outside of which no interaction is possible; or in order to reject some parts of the detected objects, such as walls or furniture. They define the space where users are expected to be interacting with the systems. In the embodiment of <figref idref="f0001">Fig. 1</figref> the active volume bounds may conveniently be defined as the cuboid delimited by the vertical and horizontal posts delimiting the scene. Therefore, people outside that space are treated as non-participating spectators and are not detected by the system. Once the active volume bounds are enforced, by means of a Global ROI Filtering 17, a clustering process 18 is performed for establishing each user location 19 in the scene. This is done as follows: the basic principle of this process is the grouping, in a three-dimensional space, of the points contained in the 3D position and color points array 15. The points are grouped (clustered) according to their relative positions, so that each group contains points that are in the same region of space. There are several well-known iterative algorithms capable of achieving this task. For example, the k-means algorithm (<nplcit id="ncit0004" npl-type="s"><text>JA Hartigan, MA Wong: "A K-Means Clustering Algorithm" - Applied Statistics, 1979</text></nplcit>); or the Expectation-Maximization algorithm (<nplcit id="ncit0005" npl-type="s"><text>A Dempster, N Laird and D Rubin: "Maximum likelihood from incomplete data via the EM algorithm" - Journal of the Royal Statistical Society, Series B, 39(1):1-38, 197</text></nplcit>); and many other clustering techniques (<nplcit id="ncit0006" npl-type="b"><text>AK Jain, RC Dubes: "Algorithms for clustering data" - 1988 - Prentice-Hall, Inc. Upper Saddle River, NJ, USA</text></nplcit>). Each group (cluster) is usually identified by its center 19 and represents the location of one object or person in the scene. The clustering process 18 further establishes individual volumes of interest 20 corresponding to each user location 19. This can be done as follows: once each group of points has been identified by its center 19, the process establishes median planes with respect to segments linking said centers. These median planes divide up the entire global ROI volume, determining individual volumes of interest 20, separated by individual volumes of interest bounds 16'. By performing this clustering process for successive frames in the acquired data, one can tracks each individual volume of interest 20 as it evolves over time. This can be used for analyzing gestures and behaviors of the corresponding users. An important alternative is when the clustering process 18 uses predefined individual volumes of interest 20 wherein users are supposed to remain. In that case, the number and the shape of the individual volumes of interest 20 are predetermined when the setup is installed.

We refer now to <figref idref="f0006 f0007"><b>FIG.5</b></figref><b>b.</b> Given the boundaries of the individual volume of interest 20 and the three-dimensional real-world 3D positions and color points array 15 (computed previously in section <b>[29]</b>), wherein each user has been identified, the individual mask 21 is computed as follows: into the 3D positions and color points array 15, wherein the X, Y, Z 3D coordinates of each pixel in the 3D space are contained, all points that fall inside each individual volume of interest 20 are selected. In the Individual Mask Computation process, one performs a reverse transformation from X, Y, Z point contained in an individual volume of interest 20 in 3D space to x,y pixel elements in the depth array 7 and color pixel array 8. Therefore, the process provides an individual mask 21 which is an array of the same size as the depth array 7 and the color-pixel array 8. More precisely, it is a binary array with 1's at the location of the pixels whose 3D coordinates are contained in the individual volume of interest 20, and 0's elsewhere. The following equation 100 is an example of equation that may be used for determining an individual mask 21 for each user (assuming for example that the volume of interest is a cuboid): <maths id="math0007"><math display="block"><mi>mask</mi><mo mathvariant="normal">=</mo><mfenced><mfenced><mi mathvariant="normal">X</mi><mo mathvariant="normal">&gt;</mo><mo mathvariant="normal">=</mo><mi>Xmin</mi></mfenced><mspace width="1em" /><mi>AND</mi><mspace width="1em" /><mfenced><mi mathvariant="normal">X</mi><mo mathvariant="normal">&lt;</mo><mo mathvariant="normal">=</mo><mi>Xmax</mi></mfenced><mo>⁢</mo><mfenced><mi mathvariant="normal">Y</mi><mo mathvariant="normal">&gt;</mo><mo mathvariant="normal">=</mo><mi>Ymin</mi></mfenced><mspace width="1em" /><mi>AND</mi><mspace width="1em" /><mfenced><mi mathvariant="normal">Y</mi><mo mathvariant="normal">&lt;</mo><mo mathvariant="normal">=</mo><mi>Ymax</mi></mfenced><mo>⁢</mo><mfenced><mi mathvariant="normal">Z</mi><mo mathvariant="normal">&gt;</mo><mo mathvariant="normal">=</mo><mi>Zmin</mi></mfenced><mspace width="1em" /><mi>AND</mi><mspace width="1em" /><mfenced><mi mathvariant="normal">Z</mi><mo mathvariant="normal">&lt;</mo><mo mathvariant="normal">=</mo><mi>Zmax</mi></mfenced></mfenced><mn mathvariant="normal">.</mn></math><img file="EP2584530A2_D0007.tif" /></maths>

We now refer to <figref idref="f0008"><b>FIG.6</b></figref><b>.</b> When the depth perception device 3 or the registration process provide an image with missing depth values, corresponding to the 3D positions and color points array 15, then the individual mask 21 is an individual mask with missing depth values 22. In that case, the values X, Y and Z of the points corresponding to the missing depth values, are set to a very large conventional value so that the corresponding points are guaranteed to be outside the individual volume of interest 20. The individual mask with missing parts 22 is then processed for obtaining a filled individual mask 23. Consequently, this mask filling process provides a filled individual mask 23 which has some parts with larger than the original image. If the volume of interest is not a cuboid, another appropriate test must be carried out to determine whether each pixel is comprised within the volume of interest or not.

Referring now to <figref idref="f0009"><b>FIG.6a</b></figref><b>,</b> the accuracy and general quality of the above-discussed mask filling process is additionally improved by the following steps: <ol id="ol0002" compact="compact"><li>1. A morphological dilation 22a with a preset dilatation size is carried out. This is done most effectively by repeating a "one-pixel dilation" D times, where D is the desired total size of the dilation;</li><li>2. A median filtering 22b is subsequently applied. This step is executed for: further smoothing the edges of each individual mask 21; and removing very small holes and/or small disconnected segmented regions. The size M of the median filtering window can be adjusted depending on the characteristics of the depth perception method;</li><li>3. Small holes filling 22c is applied to the individual mask 21. Said small holes are, in fact, connected un-segmented areas of maximum size H, measured in number of pixels of area, surrounded by segmented regions;</li><li>4. Small objects removal 22d is then applied in the individual mask 21. Said small object are, in fact, connected segmented areas of maximum size O, measured in number of pixels of area, surrounded by un-segmented regions;</li><li>5. A morphological erosion process 22e of a preset size is also carried out. This is obtained by repeating "one-pixel" erosion" E times, where E is the desired total size of the erosion.</li></ol> Steps 3 and 4 can be realized by labeling and computing the area of all the disconnected regions in the individual mask 21 (for step 4), or on its negative (for step 3), then by filling all said regions below the size limit O or H with "1" (for step 4) or "0" (for step 3).

Once the mask filling process is ended, as already mentioned, the filled mask 23 has some parts with larger dimension in contrast with the previous individual mask 21. Evidently, said filled mask 23 must be treated for having the same size as the individual mask 21. The mathematical morphology erosion tool is a well-known technique for reducing the size of a binary image mask while preserving its shape, by removing a constant number of pixels along the edge of the mask. However, that technique is not applicable in this case because the border that should be removed does not have a constant thickness: in some parts of the image, for example, the edge of the mask follows closely the actual object boundary, while in other parts it is significantly outside the actual object boundary. A standard erosion technique would either leave too wide a mask in some areas, or cut inside the object in other areas. The present invention uses a multi-step erosion technique that stops at the edge of the object to be segmented. This multi-step technique requires, in particular, the background-based segmentation process, not yet described. In order to facilitate the comprehension of the description, we discuss at first, in the following section, the background-based segmentation and continue, later in section <b>[064],</b> the multi-step erosion technique description.

<figref idref="f0010"><b>Fig.7</b></figref> shows the background-based segmentation process of an image that can be used in the invention. This process is used for separating foreground objects from background objects by analyzing color pixel arrays 8 captured by the video camera 4. This process aims to build and maintain an adaptive background model 24 by updating regularly its color mean array 25 and its color variance array 26 by means of a motion mask 27. Said motion mask 27 gives, in fact, the portion of the image where the background model 24 can be updated for each frame of the images captured by the video camera 4. The background-based segmentation process is realized as follows: The motion of objects in the scene is detected by subtracting two successive images followed by a thresholding. Pixels in movement are accumulated in a binary buffer over a pre-determined period of time. During the same period of time, the successive images of the video flow are also accumulated in order to compute the average image and the variance image over this interval. The accumulated binary image establishes whether each pixel has moved during the period of time or not. Used as a mask, the background model 24 can be partially updated by means of the color mean array 25 and the color variance array 26 computed over the same period of time; In order to detect shadows on the background, an algorithm computes a block-based linear monotone regression for providing a sort of block-based foreground detector 28. This algorithm assumes that a shadowed portion of the background keeps its physical structure while the ranking of intensity of pixels between shadowed block x and a non-shadowed block x' is preserved (if pixel P is darker than pixel Q in shadowed block x, then pixel P is darker than pixel Q in non-shadowed block x'). For example, the monotone regression can be a linear regression that follows a linear (x'=ax+b) law. Other parametric laws that express x' as a monotone function of x can be used. The statistical information computed by block classifies each block as a foreground or a background one. In the special case where an edge of the foreground is crossing a block, the fraction of background pixels inside the block is removed using the shadow model of background block in its neighborhood; Given the background model 24 and the color pixel array 8, the segmentation decision is taken using a pixel-based Gaussian thresholding of a pixel x as following: <maths id="math0008"><math display="block"><msup><mfenced><mi mathvariant="normal">x</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">μ</mi></mfenced><mn>2</mn></msup><mo mathvariant="normal">&lt;</mo><mi mathvariant="normal">β</mi><mo mathvariant="normal">*</mo><mi>var</mi><mo>;</mo></math><img file="EP2584530A2_D0008.tif" /></maths> where: µ and var are, respectively, the model mean and the model variance, both adapted with the linear regression of the shadow model; and β is the variable threshold. A pixel which fulfils the above condition is considered as belonging to the background, otherwise it belongs to the foreground and consequently, it is segmented from the raw image, providing pixel-based foreground segmentation 29. At the end of the above described steps, a background-based segmentation mask 30 is obtained. It should be noted that in order to improve said process, some well-know morphological operations (dilation, erosion, closing, opening,...), as well as hole filling and noise removing techniques are used as described previously in section <b>[058].</b>

We refer now to <figref idref="f0008"><b>FIG.6</b></figref> and <figref idref="f0011"><b>FIG.8</b></figref> wherein the multi-step erosion process is illustrated. Said process is performed as follows: <ol id="ol0003" compact="compact"><li>1. By means of standard techniques, such as the Canny edge detector, video image edges 31 are detected from the color pixel array 8. Background-based segmentation mask edges 32 are, instead, computed by using, for example, the following formula: <ul id="ul0019" list-style="none" compact="compact"><li>EB := backseg AND (NOT erosion(backseg));</li><li>where "backseg" refers to the background-based segmentation mask 30 and</li><li>"erosion(backseg)" refers to a "one-pixel" morphological erosion of the background-based segmentation mask 30. By applying the logical operator OR to the video image edges 31 and the background-based segmentation mask edges 32, an (augmented) edge map 33 is obtained. This result is, in fact, a binary map of the same size as the background-based segmentation mask 30 and the color pixel array 8. Edges are represented by '1' pixels, non-edges by '0' pixels;</li></ul></li><li>2. A "one-pixel" erosion 22e is performed on the filled mask 23 for obtaining a one-pixel eroded mask 23a, mask_e(t), where t is the counter in the iteration loop: <maths id="math0009"><math display="block"><mi>mask_e</mi><mfenced><mi mathvariant="normal">t</mi></mfenced><mo mathvariant="normal">=</mo><mi>OnePixelErosion</mi><mo>⁢</mo><mfenced><mi>mask</mi><mo>⁢</mo><mfenced><mi mathvariant="normal">t</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mfenced></mfenced></math><img file="EP2584530A2_D0009.tif" /></maths></li><li>3. Said one-pixel eroded mask 23a is then corrected according to the following formula for performing an edge restoration process 23b: <maths id="math0010"><math display="block"><mi>mask</mi><mfenced><mi mathvariant="normal">t</mi></mfenced><mo mathvariant="normal">=</mo><mi>mask_e</mi><mfenced><mi mathvariant="normal">t</mi></mfenced><mspace width="1em" /><mi>OR</mi><mspace width="1em" /><mfenced><mfenced><mi>NOT mask_e</mi><mfenced><mi mathvariant="normal">t</mi></mfenced></mfenced><mspace width="1em" /><mi>AND mask</mi><mo>⁢</mo><mfenced><mi mathvariant="normal">t</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mfenced><mspace width="1em" /><mi>AND edge</mi></mfenced></math><img file="EP2584530A2_D0010.tif" /></maths> The logical operation OR operates on all the binary values of the filled mask 23 and of the edge map 33 in parallel. Mask(t) represents one-pixel eroded mask 23a, Mask(t-1) represents the filled mask 23 before erosion, and edge is the (augmented) edge map 33. The result of this operation is an eroded mask 23d if the mask locations where an image edge has been detected have not been set to '0';</li><li>4. Steps 2 and 3 are repeated A times, where A is a preset parameter that is the maximum number of pixels that should be removed from the border of the filled mask 23 in order to provide an optimal erosion level 23c;</li><li>5. A final "one-pixel" erosion 22e is performed on the eroded mask 23d in order to remove spurious pixel-wide structures that have been created by step 3. The result is a final eroded mask 34.</li></ol> Hence, the background-based segmentation mask 30 and the final eroded mask 34 are combined via a logical operation in order to obtain a final mask 35 as follows: <maths id="math0011"><math display="block"><mi>final mask</mi><mo>=</mo><mi>mask AND background</mi><mo>;</mo></math><img file="EP2584530A2_D0011.tif" /></maths> which means that the final mask 35 consists of those pixels that are segmented as foreground objects by both the background-based segmentation mask 30 and the final eroded mask 34.

The following adaptive variation could also be applied during step 3 of the erosion process above-described : <maths id="math0012"><math display="block"><msub><mi mathvariant="normal">E</mi><mi mathvariant="normal">b</mi></msub><mo mathvariant="normal">=</mo><mi>mask_e</mi><mfenced><mi mathvariant="normal">t</mi></mfenced><mspace width="1em" /><mi>OR</mi><mspace width="1em" /><mfenced><mfenced><mi>NOT mask_e</mi><mfenced><mi mathvariant="normal">t</mi></mfenced></mfenced><mspace width="1em" /><mi>AND mask</mi><mo>⁢</mo><mfenced><mi mathvariant="normal">t</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mfenced></mfenced></math><img file="EP2584530A2_D0012.tif" /></maths><maths id="math0013"><math display="block"><msub><mi mathvariant="normal">N</mi><mi mathvariant="normal">b</mi></msub><mo mathvariant="normal">=</mo><mi>mask_e</mi><mfenced><mi mathvariant="normal">t</mi></mfenced><mspace width="1em" /><mi>OR</mi><mspace width="1em" /><mfenced><mfenced><mi>NOT mask_e</mi><mfenced><mi mathvariant="normal">t</mi></mfenced></mfenced><mspace width="1em" /><mi>AND mask</mi><mo>⁢</mo><mfenced><mi mathvariant="normal">t</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mfenced><mspace width="1em" /><mi>AND edge</mi></mfenced></math><img file="EP2584530A2_D0013.tif" /></maths> wherein: E_b is a binary map that shows all the mask pixels that would be set to zero by regular erosion; N_b is a binary map that shows all the mask pixels that would be set to zero by regular erosion, but are located on an image edge, and therefore, will remain at one; and t is the number of the iteration. The maps E_b and N_b are divided in non-overlapping blocks of a preset size. Within each block, and at each iteration, the number of values of E_b and N_b found equal to '1' are counted (that can be done efficiently by summing all mask values within the block) to yield the numbers ΣE_bi (t) and ΣN_bi (t), respectively. For each block i, those two values and their ratio are compared to the values computed at the previous iterations ΣE_bi (1) through ΣE_bi (t-1) and ΣN_bi (1) through ΣN_bi (t-1). The ΣN_bi values usually increase and become closer to the ΣE_bi values. By monitoring the evolution over the sequences ΣN_bi (t) and ΣE_bi (t) within block i, one can detect when the adaptive erosion has reached the edge of the object in the region of the image covered by block i. When that happens, the iteration is stopped for that block. That can be done simply by carrying out steps 2-3 on the entire image as above-discussed in section <b>[061],</b> then by copying the previous values of the mask to the new mask within every block for which iterations have stopped. The value of A (section <b>[062]),</b> D, M, H, E and O (section <b>[058]),</b> are chosen together to obtain a segmentation mask that closely follows the borders of the objects being segmented.

<figref idref="f0012"><b>Fig. 9</b></figref> and <figref idref="f0013"><b>Fig. 9a</b></figref> show the process for body pose recognition as well as arms and legs detection and tracking. The limbs position detection process comprises the following steps: <ul id="ul0020" list-style="none" compact="compact"><li>1. (Quantization) The individual volume of interest 20 where each user is located is divided in small elementary volumes (for example cubes) of pre-determined size. The size of the elementary volumes should be comprised between a few centimeters and about 10 centimeters. The size of the elementary volume will determine the trade-off between speed and accuracy in the detection of the limbs. Each pixel of the final mask 35 is allocated to one elementary volume by means of its X, Y, and Z real-world coordinates of the 3D positions and color points array 15. Within each elementary volume, the process performs a pixel selection 36, wherein the number of pixels is counted. If within said elementary volume there is at least one pixel, either the center of gravity (average pixel position) or, alternatively, the center of the elementary volume of the set of pixels is computed. Therefore, the elementary volumes that do not hold any pixel are discarded, establishing volume quantification 37. It should be noted that the elementary volumes can be defined in many ways, for example by a uniform grid of cubes, or by setting the centers of the elementary volumes as a subset of all pixels (randomly determined or not) or alternatively, a clustering procedure, like the well-known k-means algorithm, can be performed to find the centers of the elementary volumes. In these two variants, it may not be necessary to refer to elementary volumes or cubes at all, as the centers of them represent the only information used in the following steps. We refer to cubes in the steps below for the sake of simplicity;</li><li>2. (Noise removal- optional)The cubes that contain less than a preset number of pixels are discarded. Additionally, and optionally, the cubes that only have empty neighbors are discarded (regardless of the number of pixels they contain) in order to perform a noise removal 38 within each volume. The neighborhood of a cube on a uniform grid is defined either as the 6 cubes that have one facet in common with the cube, or as the 18 cubes that have at least one edge in common with it, or as the 26 cubes that have at least one corner in common with it. If the cubes are not on a uniform grid (as above-described), the neighborhood is defined as a sphere of given radius;</li><li>3. (Graph construction) For the clarity of the following description we also refer now to <figref idref="f0013">FIG. 9a</figref>, wherein, as indicated in the legend, the square symbol represents a source node; thin empty circles represent nodes; thick empty circles represent nodes on the best path from the source node to extremities; full circles represent extremities; thin straight line represent edges; and thick straight line represent edges on the best path weight. A weighted non-oriented graph 39 is constructed from the remaining cubes. Each cube is then represented as a node, and weighted edges connect nodes that represent cubes that are located within a preset distance from each other. Distance between cubes is computed by using the center of gravity of the pixels they contain, or their geometrical center. The weight of the edge is set to the Euclidian distance between the cubes. We denote w (u, v) the weight of the edge between node u and node v. Optionally, links that would have a weight larger than a preset value are not inserted in the graph;</li><li>4. (Center estimation) This process step aims to perform center estimation 40 among the cubes making part of the weighted non-oriented graph 39. On the one hand the cube that is closest to the center of gravity of all pixels or all cubes is then found and named "source cube"; on the other hand the corresponding node in the graph is named the source node;</li><li>5. (Fast approximate curvilinear distance computation) A special best path weight is computed in order to obtain an approximate curvilinear distance 41 from the source nodes to all nodes in the graph 39. This best path weight is defined as the minimum of path weights over all the paths which are connecting the source node to an extremity (target node). The weight of a path is obtained by raising the edge weights to a given power p, then summing all these raised weights for all edges comprised in the path. This is not the conventional definition of the weight of a path in a graph, which would be a sum of weights, instead of a sum of weights raised to a power. The power to which the weights are raised, denoted p hereinafter, should be larger than one in order to penalize the large weights more than they would be if a plain sum were used. This feature is critical to ensure that the best path follows the surface of the 3D volume by making small "local" hops, rather than jumping straight from the source node to the extremity (target node). The procedure used to compute the minimum weight from the source node to all nodes, and record additional information about the minimum weight path is detailed below. The additional recorded information is the sum of link weights along the best path, which is an approximation of the curvilinear distance, and it is used in the next step. The procedure is similar to the well-known Dijkstra algorithm, but modified to handle the non-conventional path weight definition, and the additional information to be recorded. The nodes of the graph are contained in two sets: S and F. W(n) is the best weight (sum of link weights raised to the power p), so far found to reach node n from the source node; H(n) is the number of hops of the best path so far found from the source node to node n; D(n) is the sum of link weights along the best path so far found from the source node to node n; B(n) is the identifier of the node that is immediately before node n on the best path from the source node. Initially, set S contains all nodes, and set F is empty. For all nodes, except the source node, W(n) is set to +∞, and W (source node) is set to zero. An iterative procedure is subsequently carried out: <ol id="ol0004" compact="compact"><li>a) Picking the node u from S that has the smallest W(u) and moving it to F. The source node is the first node to be selected;</li><li>b) Performing, for each node v that has a connection with node u, the following test: <maths id="math0014"><math display="block"><mi mathvariant="normal">W</mi><mfenced><mi mathvariant="normal">v</mi></mfenced><mo mathvariant="normal">&gt;</mo><mi mathvariant="normal">W</mi><mfenced><mi mathvariant="normal">u</mi></mfenced><mo mathvariant="normal">+</mo><mi mathvariant="normal">w</mi><mo>⁢</mo><msup><mfenced><mi mathvariant="normal">u</mi><mo>⁢</mo><mi mathvariant="normal">v</mi></mfenced><mrow><mi mathvariant="normal">p</mi><mspace width="1em" /><mo mathvariant="normal">?</mo></mrow></msup><mo mathvariant="normal">;</mo></math><img file="EP2584530A2_D0014.tif" /></maths> if it is true, the following operations are carried out: <maths id="math0015"><math display="block"><mi mathvariant="normal">W</mi><mfenced><mi mathvariant="normal">v</mi></mfenced><mo mathvariant="normal">&gt;</mo><mi mathvariant="normal">W</mi><mfenced><mi mathvariant="normal">u</mi></mfenced><mo mathvariant="normal">+</mo><mi mathvariant="normal">w</mi><mo>⁢</mo><msup><mfenced><mi mathvariant="normal">u</mi><mo>⁢</mo><mi mathvariant="normal">v</mi></mfenced><mi mathvariant="normal">p</mi></msup><mo mathvariant="normal">;</mo></math><img file="EP2584530A2_D0015.tif" /></maths><maths id="math0016"><math display="block"><mi mathvariant="normal">H</mi><mfenced><mi mathvariant="normal">v</mi></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">H</mi><mfenced><mi mathvariant="normal">u</mi></mfenced><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">;</mo></math><img file="EP2584530A2_D0016.tif" /></maths><maths id="math0017"><math display="block"><mi mathvariant="normal">D</mi><mfenced><mi mathvariant="normal">v</mi></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">D</mi><mfenced><mi mathvariant="normal">u</mi></mfenced><mo mathvariant="normal">+</mo><mi mathvariant="normal">w</mi><mfenced><mi mathvariant="normal">u</mi><mo>⁢</mo><mi mathvariant="normal">v</mi></mfenced><mo mathvariant="normal">;</mo></math><img file="EP2584530A2_D0017.tif" /></maths><maths id="math0018"><math display="block"><mi mathvariant="normal">B</mi><mfenced><mi mathvariant="normal">v</mi></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">u</mi><mo mathvariant="normal">;</mo></math><img file="EP2584530A2_D0018.tif" /></maths></li><li>c) Going back to step a) until S is empty. At the end of the process, D (v) holds an approximation of the curvilinear distance from the source node, for all nodes that are connected to it;</li></ol></li><li>6. For all nodes u, check whether D (u) is greater or equal to D (v) for all nodes v connected to u. If it is the case, u is marked as an extremity and the extremity detection 42 is then performed;</li><li>7. The body parts labeling step 43 is performed, wherein i.e. the extremities detected in previous step are labeled as the head, the left hand, the right hand, the left foot and the right foot. This step provides the body parts location 44 for each user. If, for example, the participant is standing up, the extremity that is in higher elevation and is within a certain horizontal distance of the center of gravity of the set of pixels is labeled as the head. Next, one or two hands are identified as the one or two extremities that are in the upper half of the height of the body, as defined by the location of the head arms and hands in resting position may not be detected. Finally, one or two feet are identified as the one or two extremities that are in the lower half of the height of the body. Similar rules may be devised if the person is sitting, crouching, or lying down. Other body parts can be identified by a similar technique. For example, the position of knee can be obtained by backtracking a certain distance along the best path from the source node to the node that has been previously labeled as a foot, using the information contained in D(u) and B(v). The distance measured along the path (the linear sum of weights) should be a fixed fraction of the Euclidian distance between head and foot, or of the height of the head relative to floor level. If there are several extremities that fulfill the conditions described above (for example because of errors in the depth map, bulky clothing, other objects mistakenly included in the region of interest), and therefore labeling is ambiguous, pattern recognition techniques can be used for identifying body parts. An image block around the candidate location of the body part (expressed in image coordinates) is extracted and matched against stored models or templates of the image body part. The candidate that obtains the best match obtains the labeling. A well known technique to perform such an image classification is described in "<nplcit id="ncit0007" npl-type="s"><text>Rapid Object Detection Using a Boosted Cascade of Simple Features" by Paul Viola, Michael Jones in Proceedings IEEE Conf. on Computer Vision and Pattern Recognition (2001</text></nplcit>), although many others are available;</li><li>8. For each incoming image and associated depth map, steps 1 to 7 are carried out in order to obtain a sequence of body parts locations 45. A body parts tracking process 46 ensures that the locations of the head, hands, feet and other body parts are consistent in the sequences of body parts locations 45. This problem has been extensively studied in the scientific literature, and an early example is "<nplcit id="ncit0008" npl-type="s"><text>An algorithm for tracking multiple targets" by D. Reid in EEE Transactions on Automatic Control, 1979</text></nplcit>. This tracking process 46 is also used for recording the trajectories of the body parts 47 over time, which are used in the next step;</li><li>9. (Gesture recognition)The sequence of head, hand and/or feet positions over time is used to derive velocity and acceleration estimates. These sequences of numbers are used as input of multiple hidden Markov model classifiers that have been statistically trained for the gesture recognition 48. More details of this well known technique can be found in "<nplcit id="ncit0009" npl-type="s"><text>Parametric hidden Markov models for gesture recognition" by Wilson, A.D and Bobick, A.F in IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 21, Issue 9, Date: Sep 1999, Pages: 884 - 900</text></nplcit>.</li></ul>

A particular embodiment according to the invention is shown in <figref idref="f0014">FIG.10</figref> wherein the image captured by the video camera 4 is displayed on a screen 102 by a projector 5'. The projector 5' may be located near the camera 4, hence creating a mirror-like effect. The location of users or objects in 3D space is used to modify the scene in a highly realistic way, by modifying existing elements or inserting virtual elements in the scene. Some users, for example, may be replaced by imaginary characters, or may wear different clothes than in reality, or may have their appearance transformed. Additional characters or objects are inserted in the scene and move or behave according to the users' movements and gestures. Because the positions of the elements of the scene are known in three-dimensions, special effects can be realized with the correct perspective effect and occlusions. This application is called the "magic mirror".

Another particular embodiment according to the invention is shown in <figref idref="f0015"><b>FIG.11</b></figref><b>,</b> wherein the locations of all participants 6 in 3D space are used to direct one or more tracking lights 5". One objective in a game can be to follow a light or alternatively to escape a light beam. The participants 6 point towards each other either in order to establish links (e.g. teams in a game) or to pass a virtual object to another or to send the tracking light towards the participant 6 pointed at. As the participants 6 move around the room and they are tracked by the system, an avatar 101 moves accordingly in the virtual world that is projected on one or more displays 102. The avatars 101 may replicate the body pose and gestures made by the users 6, or transform them in some way (e.g. exaggerated). The avatars 101 may be pure synthetic figures, or they may be composed from the image, or part of the image (e.g. just the head), of the participants 6 captured by the video camera 4. Their image may be used unaltered, or may be transformed in several ways depending on the theme of the setup, or on the way the game unfolds. If the avatars 101 are synthetic figures, they could be given with the skin color, or hair color, or clothes color of the participant 6. Depending on the location and the gestures made by participants 6, real world elements react: the floor shifts, and physical objects 6" in the room move or activate in some way, animatronics figures move and talk, etc.

Using this invention, a voting system may be set up. Several participants can point at various items on a display showing selectable objects such as pictures of several persons, or other choices. The users can also be directed to execute specific gestures (hands up or other) in response to an item displayed by the system. The items can be sorted and displayed by increasing/decreasing popularity according to the users that have voted so far. Optionally, the pictures of the users that have voted for/against a given item can be displayed next to it. Instead of voting, the pointing gestures can be used to buy/sell items in a virtual market place or exchange.

In another variant of this embodiment, several users control a game through their body poses. For example, they can lean left/right to control objects such as a skate-board, or a bike, or a free fall/parachute. Therefore, the users' images are inserted in the game display 102 and the latter simulates the image taken by the video camera that follows the players through the streets or in their parachute fall.