US 8,295,546 B2Grant
Pose tracking pipeline
Issue Date:2012-10-23
•20 Claims
•8 Drawing Sheets
Abstract
A method of tracking a target includes receiving from a source an observed depth image of a scene including the target. Each pixel of the observed depth image is labeled as either a foreground pixel belonging to the target or a background pixel not belonging to the target. Each foreground pixel is labeled with body part information indicating a likelihood that that foreground pixel belongs to one or more body parts of the target. The target is modeled with a skeleton including a plurality of skeletal points, each skeletal point including a three dimensional position derived from body part information of one or more foreground pixels.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Robert Matthew Craig
- Tommer Leyvand
- Craig Peeper
- Momin M. Al-Ghosien
- Matt Bronder
- Oliver Williams
- Ryan M. Geiss
- Jamie Daniel Joseph Shotton
- Johnny Lee
- Mark Finocchio
Application Information
Application Number:US 12/603,437
Filing Date:2009-10-21
Priority Date:2009-01-30
Art Unit:2624
Classifications
IPC:
G06K9/00H04N11/02
Patent Drawings (8 sheets)
Description
Cross Reference to Related Applications
[0001] This application is a continuation-in-part of U.S. patent application Ser. No. 12/367,435, filed Feb. 6, 2009, which claims priority to U.S. Provisional Patent Application No. 61/148,892, filed Jan. 30, 2009. The above applications are hereby incorporated herein by reference in their entirety for continuity of disclosure.
Background
[0002] Many computer games and other computer vision applications utilize complicated controls to allow users to manipulate game characters or other aspects of an application. Such controls can be difficult to learn, thus creating a barrier to entry for many games or other applications. Furthermore, such controls may be very different from the actual game actions or other application actions for which they are used. For example, a game control that causes a game character to swing a baseball bat may not at all resemble the actual motion of swinging a baseball bat.
Summary
[0003] This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. Furthermore, the claimed subject matter is not limited to implementations that solve any or all disadvantages noted in any part of this disclosure.
[0004] A method of tracking a target is disclosed. The method includes receiving from a source an observed depth image of a scene including the target. Each pixel of the observed depth image is labeled as either a foreground pixel belonging to the target or a background pixel not belonging to the target. Each foreground pixel is labeled with body part information indicating a likelihood that that foreground pixel belongs to one or more body parts of the target. The target is modeled with a skeleton including a plurality of skeletal points, each skeletal point including a three dimensional position derived from body part information of one or more foreground pixels.
Brief Description of the Drawings
[0005] FIG. 1A shows an embodiment of an exemplary target recognition, analysis, and tracking system tracking a game player playing a boxing game.
[0006] FIG. 1B shows the game player of FIG. 1A throwing a punch that is tracked and interpreted as a game control that causes a player avatar to throw a punch in game space.
[0007] FIG. 2 schematically shows a computing system in accordance with an embodiment of the present disclosure.
[0008] FIG. 3 shows an exemplary body model used to represent a human target.
[0009] FIG. 4 shows a substantially frontal view of an exemplary skeletal model used to represent a human target.
[0010] FIG. 5 shows a skewed view of an exemplary skeletal model used to represent a human target.
[0011] FIG. 6 shows a pipeline for tracking a target.
[0012] FIG. 7 shows a scene as viewed by a depth camera with schematic data structures showing data used to track a target.
[0013] FIG. 8 schematically shows a progression of data through a target pose tracking pipeline.
Detailed Description
[0014] The present disclosure is directed to target recognition, analysis, and tracking. In particular, the use of a depth camera or other source for acquiring depth information for one or more targets is disclosed. Such depth information may then be used to efficiently and accurately model and track the one or more targets, as described in detail below. The target recognition, analysis, and tracking described herein provides a robust platform in which one or more targets can be consistently tracked at a relatively fast frame rate, even when the target(s) move into poses that have been considered difficult to analyze using other approaches (e.g., when two or more targets partially overlap and/or occlude one another; when a portion of a target self-occludes another portion of the same target, when a target changes its topographical appearance (e.g., a human touching his or her head), etc.).
[0015] FIG. 1A shows a nonlimiting example of a target tracking system 10. In particular, FIG. 1A shows a computer gaming system 12 that may be used to play a variety of different games, play one or more different media types, and/or control or manipulate non-game applications. FIG. 1A also shows a display 14 in the form of a high-definition television, or HDTV 16, which may be used to present game visuals to game players, such as game player 18. Furthermore, FIG. 1A shows a capture device in the form of a depth camera 20, which may be used to visually monitor one or more game players, such as game player 18. The example shown in FIG. 1A is nonlimiting. As described below with reference to FIG. 2 , a variety of different types of target tracking systems may be used without departing from the scope of this disclosure.
[0016] A target tracking system may be used to recognize, analyze, and/or track one or more targets, such as game player 18. FIG. 1A shows a scenario in which game player 18 is tracked using depth camera 20 so that the movements of game player 18 may be interpreted by gaming system 12 as controls that can be used to affect the game being executed by gaming system 12. In other words, game player 18 may use his movements to control the game. The movements of game player 18 may be interpreted as virtually any type of game control.
[0017] The example scenario illustrated in FIG. 1A shows game player 18 playing a boxing game that is being executed by gaming system 12. The gaming system uses HDTV 16 to visually present a boxing opponent 22 to game player 18. Furthermore, the gaming system uses HDTV 16 to visually present a player avatar 24 that gaming player 18 controls with his movements. As shown in FIG. 1B , game player 18 can throw a punch in physical/world space as an instruction for player avatar 24 to throw a punch in game/virtual space. Gaming system 12 and depth camera 20 can be used to recognize and analyze the punch of game player 18 in physical space so that the punch can be interpreted as a game control that causes player avatar 24 to throw a punch in game space. For example, FIG. 1B shows HDTV 16 visually presenting player avatar 24 throwing a punch that strikes boxing opponent 22 responsive to game player 18 throwing a punch in physical space.
[0018] Other movements by game player 18 may be interpreted as other controls, such as controls to bob, weave, shuffle, block, jab, or throw a variety of different power punches. Furthermore, some movements may be interpreted into controls that serve purposes other than controlling player avatar 24. For example, the player may use movements to end, pause, or save a game, select a level, view high scores, communicate with a friend, etc.
[0019] In some embodiments, a target may include a human and an object. In such embodiments, for example, a player of an electronic game may be holding an object, such that the motions of the player and the object are utilized to adjust and/or control parameters of the electronic game. For example, the motion of a player holding a racket may be tracked and utilized for controlling an on-screen racket in an electronic sports game. In another example, the motion of a player holding an object may be tracked and utilized for controlling an on-screen weapon in an electronic combat game.
[0020] Target tracking systems may be used to interpret target movements as operating system and/or application controls that are outside the realm of gaming. Virtually any controllable aspect of an operating system and/or application, such as the boxing game shown in FIGS. 1A and 1B , may be controlled by movements of a target, such as game player 18. The illustrated boxing scenario is provided as an example, but is not meant to be limiting in any way. To the contrary, the illustrated scenario is intended to demonstrate a general concept, which may be applied to a variety of different applications without departing from the scope of this disclosure.
[0021] The methods and processes described herein may be tied to a variety of different types of computing systems. FIGS. 1A and 1B show a nonlimiting example in the form of gaming system 12, HDTV 16, and depth camera 20. As another, more general, example, FIG. 2 schematically shows a computing system 40 that may perform one or more of the target recognition, tracking, and analysis methods and processes described herein. Computing system 40 may take a variety of different forms, including, but not limited to, gaming consoles, personal computing systems, public computing systems, human-interactive robots, military tracking and/or targeting systems, and character acquisition systems offering green-screen or motion-capture functionality, among others.
[0022] Computing system 40 may include a logic subsystem 42, a data-holding subsystem 44, a display subsystem 46, and/or a capture device 48. The computing system may optionally include components not shown in FIG. 2 , and/or some components shown in FIG. 2 may be peripheral components that are not integrated into the computing system.
[0023] Logic subsystem 42 may include one or more physical devices configured to execute one or more instructions. For example, the logic subsystem may be configured to execute one or more instructions that are part of one or more programs, routines, objects, components, data structures, or other logical constructs. Such instructions may be implemented to perform a task, implement a data type, transform the state of one or more devices, or otherwise arrive at a desired result. The logic subsystem may include one or more processors that are configured to execute software instructions. Additionally or alternatively, the logic subsystem may include one or more hardware or firmware logic machines configured to execute hardware or firmware instructions. The logic subsystem may optionally include individual components that are distributed throughout two or more devices, which may be remotely located in some embodiments.
[0024] Data-holding subsystem 44 may include one or more physical devices configured to hold data and/or instructions executable by the logic subsystem to implement the herein described methods and processes. When such methods and processes are implemented, the state of data-holding subsystem 44 may be transformed (e.g., to hold different data). Data-holding subsystem 44 may include removable media and/or built-in devices. Data-holding subsystem 44 may include optical memory devices, semiconductor memory devices (e.g., RAM, EEPROM, flash, etc.), and/or magnetic memory devices, among others. Data-holding subsystem 44 may include devices with one or more of the following characteristics: volatile, nonvolatile, dynamic, static, read/write, read-only, random access, sequential access, location addressable, file addressable, and content addressable. In some embodiments, logic subsystem 42 and data-holding subsystem 44 may be integrated into one or more common devices, such as an application specific integrated circuit or a system on a chip.
[0025] FIG. 2 also shows an aspect of the data-holding subsystem in the form of computer-readable removable media 50, which may be used to store and/or transfer data and/or instructions executable to implement the herein described methods and processes.
[0026] Display subsystem 46 may be used to present a visual representation of data held by data-holding subsystem 44. As the herein described methods and processes change the data held by the data-holding subsystem, and thus transform the state of the data-holding subsystem, the state of display subsystem 46 may likewise be transformed to visually represent changes in the underlying data. As a nonlimiting example, the target recognition, tracking, and analysis described herein may be reflected via display subsystem 46 in the form of a game character that changes poses in game space responsive to the movements of a game player in physical space. Display subsystem 46 may include one or more display devices utilizing virtually any type of technology. Such display devices may be combined with logic subsystem 42 and/or data-holding subsystem 44 in a shared enclosure, or such display devices may be peripheral display devices, as shown in FIGS. 1A and 1B .
[0027] Computing system 40 further includes a capture device 48 configured to obtain depth images of one or more targets. Capture device 48 may be configured to capture video with depth information via any suitable technique (e.g., time-of-flight, structured light, stereo image, etc.). As such, capture device 48 may include a depth camera, a video camera, stereo cameras, and/or other suitable capture devices.
[0028] For example, in time-of-flight analysis, the capture device 48 may emit infrared light to the target and may then use sensors to detect the backscattered light from the surface of the target. In some cases, pulsed infrared light may be used, wherein the time between an outgoing light pulse and a corresponding incoming light pulse may be measured and used to determine a physical distance from the capture device to a particular location on the target. In some cases, the phase of the outgoing light wave may be compared to the phase of the incoming light wave to determine a phase shift, and the phase shift may be used to determine a physical distance from the capture device to a particular location on the target.
[0029] In another example, time-of-flight analysis may be used to indirectly determine a physical distance from the capture device to a particular location on the target by analyzing the intensity of the reflected beam of light over time, via a technique such as shuttered light pulse imaging.
[0030] In another example, structured light analysis may be utilized by capture device 48 to capture depth information. In such an analysis, patterned light (i.e., light displayed as a known pattern such as grid pattern, a stripe pattern, a constellation of dots, etc.) may be projected onto the target. Upon striking the surface of the target, the pattern may become deformed, and this deformation of the pattern may be studied to determine a physical distance from the capture device to a particular location on the target.
[0031] In another example, the capture device may include two or more physically separated cameras that view a target from different angles to obtain visual stereo data. In such cases, the visual stereo data may be resolved to generate a depth image.
[0032] In other embodiments, capture device 48 may utilize other technologies to measure and/or calculate depth values. Additionally, capture device 48 may organize the calculated depth information into “Z layers,” i.e., layers perpendicular to a Z axis extending from the depth camera along its line of sight to the viewer.
[0033] In some embodiments, two or more different cameras may be incorporated into an integrated capture device. For example, a depth camera and a video camera (e.g., RGB video camera) may be incorporated into a common capture device. In some embodiments, two or more separate capture devices may be cooperatively used. For example, a depth camera and a separate video camera may be used. When a video camera is used, it may be used to provide target tracking data, confirmation data for error correction of target tracking, image capture, face recognition, high-precision tracking of fingers (or other small features), light sensing, and/or other functions.
[0034] It is to be understood that at least some target analysis and tracking operations may be executed by a logic machine of one or more capture devices. A capture device may include one or more onboard processing units configured to perform one or more target analysis and/or tracking functions. A capture device may include firmware to facilitate updating such onboard processing logic.
[0035] Computing system 40 may optionally include one or more input devices, such as controller 52 and controller 54. Input devices may be used to control operation of the computing system. In the context of a game, input devices, such as controller 52 and/or controller 54 can be used to control aspects of a game not controlled via the target recognition, tracking, and analysis methods and procedures described herein. In some embodiments, input devices such as controller 52 and/or controller 54 may include one or more of accelerometers, gyroscopes, infrared target/sensor systems, etc., which may be used to measure movement of the controllers in physical space. In some embodiments, the computing system may optionally include and/or utilize input gloves, keyboards, mice, track pads, trackballs, touch screens, buttons, switches, dials, and/or other input devices. As will be appreciated, target recognition, tracking, and analysis may be used to control or augment aspects of a game, or other application, conventionally controlled by an input device, such as a game controller. In some embodiments, the target tracking described herein can be used as a complete replacement to other forms of user input, while in other embodiments such target tracking can be used to complement one or more other forms of user input.
[0036] Computing system 40 may be configured to perform the target tracking methods described herein. However, it should be understood that computing system 40 is provided as a nonlimiting example of a device that may perform such target tracking. Other devices are within the scope of this disclosure.
[0037] Computing system 40, or another suitable device, may be configured to represent each target with a model. As described in more detail below, information derived from such a model can be compared to information obtained from a capture device, such as a depth camera, so that the fundamental proportions or shape of the model, as well as its current pose, can be adjusted to more accurately represent the modeled target. The model may be represented by one or more polygonal meshes, by a set of mathematical primitives, and/or via other suitable machine representations of the modeled target.
[0038] FIG. 3 shows a nonlimiting visual representation of an example body model 70. Body model 70 is a machine representation of a modeled target (e.g., game player 18 from FIGS. 1A and 1B ). The body model may include one or more data structures that include a set of variables that collectively define the modeled target in the language of a game or other application/operating system.
[0039] A model of a target can be variously configured without departing from the scope of this disclosure. In some examples, a model may include one or more data structures that represent a target as a three-dimensional model comprising rigid and/or deformable shapes, or body parts. Each body part may be characterized as a mathematical primitive, examples of which include, but are not limited to, spheres, anisotropically-scaled spheres, cylinders, anisotropic cylinders, smooth cylinders, boxes, beveled boxes, prisms, and the like.
[0040] For example, body model 70 of FIG. 3 includes body parts bp1 through bp14, each of which represents a different portion of the modeled target. Each body part is a three-dimensional shape. For example, bp3 is a rectangular prism that represents the left hand of a modeled target, and bp5 is an octagonal prism that represents the left upper-arm of the modeled target. Body model 70 is exemplary in that a body model may contain any number of body parts, each of which may be any machine-understandable representation of the corresponding part of the modeled target.
[0041] A model including two or more body parts may also include one or more joints. Each joint may allow one or more body parts to move relative to one or more other body parts. For example, a model representing a human target may include a plurality of rigid and/or deformable body parts, wherein some body parts may represent a corresponding anatomical body part of the human target. Further, each body part of the model may comprise one or more structural members (i.e., “bones” or skeletal parts), with joints located at the intersection of adjacent bones. It is to be understood that some bones may correspond to anatomical bones in a human target and/or some bones may not have corresponding anatomical bones in the human target.
[0042] The bones and joints may collectively make up a skeletal model, which may be a constituent element of the body model. In some embodiments, a skeletal model may be used instead of another type of model, such as model 70 of FIG. 3 . The skeletal model may include one or more skeletal members for each body part and a joint between adjacent skeletal members. Exemplary skeletal model 80 and exemplary skeletal model 82 are shown in FIGS. 4 and 5 , respectively. FIG. 4 shows a skeletal model 80 as viewed from the front, with joints j1 through j33. FIG. 5 shows a skeletal model 82 as viewed from a skewed view, also with joints j1 through j33.
[0043] Skeletal model 82 further includes roll joints j34 through j47, where each roll joint may be utilized to track axial roll angles. For example, an axial roll angle may be used to define a rotational orientation of a limb relative to its parent limb and/or the torso. For example, if a skeletal model is illustrating an axial rotation of an arm, roll joint j40 may be used to indicate the direction the associated wrist is pointing (e.g., palm facing up). By examining an orientation of a limb relative to its parent limb and/or the torso, an axial roll angle may be determined. For example, if examining a lower leg, the orientation of the lower leg relative to the associated upper leg and hips may be examined in order to determine an axial roll angle.
[0044] A skeletal model may include more or fewer joints without departing from the spirit of this disclosure.
[0045] As described above, some models may include a skeleton and/or other body parts that serve as a machine representation of a modeled target. In some embodiments, a model may alternatively or additionally include a wireframe mesh, which may include hierarchies of rigid polygonal meshes, one or more deformable meshes, or any combination of the two.
[0046] The above described body part models and skeletal models are nonlimiting example types of models that may be used as machine representations of a modeled target. Other models are also within the scope of this disclosure. For example, some models may include polygonal meshes, patches, non-uniform rational B-splines, subdivision surfaces, or other high-order surfaces. A model may also include surface textures and/or other information to more accurately represent clothing, hair, and/or other aspects of a modeled target. A model may optionally include information pertaining to a current pose, one or more past poses, and/or model physics. It is to be understood that a variety of different models that can be posed are compatible with the herein described target recognition, analysis, and tracking.
[0047] As mentioned above, a model serves as a representation of a target, such as game player 18 in FIGS. 1A and 1B . As the target moves in physical space, information from a capture device, such as depth camera 20 in FIGS. 1A and 1B , can be used to adjust a pose and/or the fundamental size/shape of the model so that it more accurately represents the target.
[0048] FIG. 6 shows a flow diagram of an example pipeline 100 for tracking one or more targets. In some embodiments, the target(s) may be human game players. Pipeline 100 may be executed by a computing system (e.g., gaming system 12 shown in FIG. 1A and/or computing system 40 shown in FIG. 2 ) to track one or more players interacting with an electronic game. As introduced above, tracking of the players allows physical movements of those players to act as real-time user controls that adjust and/or control parameters of the electronic game. It is to be understood that gaming is provided as a nonlimiting example, and the disclosed pipeline may be used to track human or nonhuman targets for a variety of other purposes.
[0049] The disclosed pipeline can be used to accurately and efficiently track one or more humans that are present in the field of view of a depth camera. The pipeline can model and track one or more humans in real time, thus providing a responsive, immersive, and realistic experience for a human being tracked. Furthermore, the pipeline is believed to be efficient, so as to limit the computing resources used to execute the pipeline.
[0050] Pipeline 100 includes six conceptual phases: depth image acquisition 102, background removal 104, foreground pixel assignment 106, model fitting 108, model resolution 110, and reporting 112.
[0051] Depth image acquisition 102 may include receiving an observed depth image of the target from a source. In some embodiments, the source may be a depth camera configured to obtain depth information about the target via a suitable technique such as time-of-flight analysis, structured light analysis, stereo vision analysis, or other suitable techniques. The observed depth image may include a plurality of observed pixels, where each observed pixel has an observed depth value. The observed depth value includes depth information of the target as viewed from the source.
[0052] The depth image may optionally be represented as a pixel matrix that includes, for each pixel address, a depth value indicating a world space depth from the plane of the depth camera, or another suitable reference plane, to a surface at that pixel address.
[0053] FIG. 7 schematically shows a scene 150 captured by a depth camera. The depth camera determines a Z-value of a surface at each pixel address. As an example, FIG. 7 schematically shows a data structure 152 used to represent pixel 154 at pixel address [1436, 502]. Data structure 152 may be an element of a pixel matrix, for example. Data structure 152 includes a Z-value of 425 for pixel 154, thus indicating that the surface at that pixel address, in this case a wall, is 425 units deep in world space. As another example, a data structure 156 is used to represent pixel 158 at pixel address [913, 693]. Data structure 156 includes a Z-value of 398 for pixel 158, thus indicating that the surface at that pixel address, in this case a door, is 398 units deep in world space. As another example, a data structure 160 is used to represent pixel 162 at pixel address [611, 597]. Data structure 160 includes a Z-value of 173 for pixel 162, thus indicating that the surface at that pixel address, in this case a human target, is 173 units deep in world space. While three pixels are provided as examples above, it is to be understood that every pixel captured by a capture device, or a downsampled set thereof, may be represented in this manner.
[0054] As shown at 114 of FIG. 6 , depth image acquisition 102 may optionally include downsampling the observed depth image to a lower processing resolution. Downsampling to a lower processing resolution may allow the observed depth image to be more easily utilized and/or more quickly processed with less computing overhead.
[0055] As shown at 116 of FIG. 6 , depth image acquisition 102 may optionally include removing and/or smoothing one or more high-variance and/or noisy depth values from the observed depth image. Such high-variance and/or noisy depth values in the observed depth image may result from a number of different sources, such as random and/or systematic errors occurring during the image capturing process, defects and/or aberrations resulting from the capture device, etc. Since such high-variance and/or noisy depth values may be artifacts of the image capturing process, including these values in any future analysis of the image may skew results and/or slow calculations. Thus, removal of such values may provide better data integrity and/or speed for future calculations.
[0056] Background removal 104 may include distinguishing targets that are to be tracked from non-target background elements in the observed depth image. As used herein, the term “background” is used to describe anything in the scene that is not part of the target(s) to be tracked. The background may include elements that are in front of (i.e., closer to the depth camera) than the target(s) to be tracked. Distinguishing foreground elements that are to be tracked from background elements that may be ignored can increase tracking efficiency and/or simplify downstream processing.
[0057] Background removal 104 may include assigning each data point (e.g., pixel) of the processed depth image a player index that identifies that data point as belonging to a particular target or to a non-target background element. When such an approach is used, pixels or other data points assigned a background index can be removed from consideration in one or more subsequent phases of pipeline 100.
[0058] As an example, pixels corresponding to a first player can be assigned a player index equal to one, pixels corresponding to a second player can be assigned a player index equal to two, and pixels that do not correspond to a target player can be assigned a player index equal to zero. Such player indices can be saved in any suitable manner. In some embodiments, a pixel matrix may include, at each pixel address, a player index indicating if a surface at that pixel address belongs to a background element, a first player, a second player, etc. For example, FIG. 7 shows data structure 152 including a player index equal to zero for wall pixel 154, data structure 156 including a player index equal to zero for door pixel 158, and data structure 160 including a player index equal to one for player pixel 162. While this example shows the player/background indices as part of the same data structure that holds the depth values, other arrangements are possible. In some embodiments, depth information, player/background indices, body part indices, body part probability distributions, and other information may be tracked in a common data structure, such as a matrix addressable by pixel address. In other embodiments, different masks may be used to track information through pipeline 100. The player index may be a discrete index or a fuzzy index indicating a probability that a pixel belongs to a particular target and/or the background.
[0059] A variety of different background removal techniques may be used. Some background removal techniques may use information from one or more previous frames to assist and improve the quality of background removal. For example, a depth history image can be derived from two or more frames of depth information, where the depth value for each pixel is set to the deepest depth value that pixel experiences during the sample frames. A depth history image may be used to identify moving objects in the foreground of a scene (e.g., a human game player) from the nonmoving background elements. In a given frame, the moving foreground pixels are likely to have depth values that are smaller than the corresponding depth values (at the same pixel addresses) in the depth history image. In a given frame, the nonmoving background pixels are likely to have depth values that match the corresponding depth values in the depth history image.
[0060] As one nonlimiting example, a connected island background removal may be used. Using a connected island approach, an input depth stream can be used to generate a set of samples (e.g., voxels) that can be conceptually unprojected back into world space. Foreground objects are then isolated from background objects using information from previous frames. In particular, the process can be used to determine whether one or more voxels in the grid are associated with a background by determining whether an object of the one or more objects in the grid is moving. This may be accomplished, at least in part, by determining whether a given voxel is close to or behind a reference plate that is a history of the minimum or maximum values observed for background objects. The output from this process can be used to assign each data point (e.g., pixel) a player index or a background index. Connected island background removal is described in U.S. patent application Ser. No. 12/575,363, filed Oct. 7, 2009, the entirety of which is hereby incorporated herein by reference.
[0061] Additional or alternative background removal techniques can be used to assign each data point a player index or a background index, or otherwise distinguish foreground targets from background elements. In some embodiments, particular portions of a background may be identified. For example, at 118 of FIG. 6 , a floor in a scene may be identified as part of the background. In addition to being removed from consideration when processing foreground targets, a found floor can be used as a reference surface that can be used to accurately position virtual objects in game space, stop a flood-fill that is part of generating a connected island, and/or reject an island if its center is too close to the floor plane.
[0062] A variety of different floor finding techniques may be used. In some embodiments, a depth image can be analyzed in screen space row by row. For selected candidate rows of the screen space depth image (e.g., rows near the bottom of the image), a straight depth line can be interpolated through two candidate points that are believed to be located on a floor surface. Boundary lines can then be fit to endpoints of the straight depth lines. The boundary lines can be averaged and used to define a plane that is believed to correspond to the floor surface. Screen space floor detection of this kind is described in U.S. patent application Ser. No. 12/563,456, filed Sep. 21, 2009, the entirety of which is hereby incorporated herein by reference.
[0063] In other embodiments, a floor finding technique may use three points from a depth image to define a candidate floor surface. The three points used to define the candidate can be randomly selected from a lower portion of the depth image, for example. If the normal of the candidate is substantially vertical in world space, the candidate is considered, and if the normal of the candidate is not substantially vertical, the candidate can be rejected. A candidate with a substantially vertical normal can be scored by counting how many points from the depth image are located below the candidate and/or what the average distance such points are below the candidate. If the number of points below the candidate exceeds a threshold and/or the average distance of points below the candidate exceeds a threshold, the candidate can be rejected. Different candidates are tested, and the candidate with the best score is saved. The saved candidate may be blessed as the actual floor if a predetermined number of candidates with lower scores are tested against the saved candidate.
[0064] Additional or alternative background removal techniques can be used to assign each data point a player index or a background index, or otherwise distinguish foreground targets from background elements. For example, in FIG. 6 pipeline 100 includes bad body rejection 120. In some embodiments, objects that are initially identified as foreground objects can be rejected because they do not resemble any known target. For example, an object that is initially identified as a foreground object can be tested for basic criteria that are to be present in any objects to be tracked (e.g., head and/or torso identifiable, bone lengths within predetermined tolerances, etc.). If an object that is initially identified as being a candidate foreground object fails such testing, it may be reclassified as a background element and/or subjected to further testing. In this way, moving objects that are not to be tracked, such as a chair pushed into the scene, can be classified as background elements because such elements do not resemble a human target.
[0065] After foreground pixels are distinguished from background pixels, pipeline 100 further classifies the pixels that are considered to correspond to the foreground objects that are to be tracked. In particular, at foreground pixel assignment 106 of FIG. 6 , each foreground pixel is analyzed to determine what part of a player target's body that foreground pixel is likely to belong.
[0066] A variety of different foreground pixel assignment techniques can be used to assess which part of a player target's body, or a machine representation of the body, a particular pixel is likely to belong. A pixel matrix or other data structure may include, for each pixel address, a body part index, confidence value, and/or body part probability distribution indicating the part, or parts, to which a pixel is likely to belong. For example, FIG. 7 schematically shows data structure 160 including a body part index equal to nine, which corresponds to an upper, right arm, for player pixel 162. In the simplified version of FIG. 7 , the body part index is resolved to a single candidate body part (i.e., body part nine). In practice, the body part information may be a soft labeling that is represented as a histogram over possible body parts for each pixel. In other words, a probability distribution of all likely body parts may be used in some embodiments, as described in more detail below.
[0067] As one nonlimiting example, machine-learning can be used to assign each foreground pixel a body part index and/or body part probability distribution. The machine-learning approach analyzes a foreground object using information learned from analyzing a prior-trained collection of known poses. This approach can be used to assign each foreground pixel a body part index or distribution without any prior context (i.e., knowledge of the prior frame is not needed).
[0068] In some embodiments, the machine-learning foreground pixel assignment may utilize one or more decision trees to analyze each foreground pixel of interest in an observed depth image. Such analysis can find a best-guess of the body part for that pixel and the confidence that the best-guess is correct. In some embodiments, the best-guess may include a probability distribution over two or more possible body parts, and the confidence may be represented by the relative probabilities of the different possible body parts.
[0069] At each node of the decision tree, an observed depth value comparison between two pixels is made, and, depending on the result of the comparison, a subsequent depth value comparison between two pixels is made at the child node of the decision tree. The result of such comparisons at each node determines the pixels that are to be compared at the next node. The terminal nodes of each decision tree result in a body part classification and associated confidence in the classification.
[0070] In some embodiments, subsequent decision trees may be used to iteratively refine the best-guess of the body part for each pixel and the confidence that the best-guess is correct. For example, once the pixels have been classified with the first classifier tree (based on neighboring depth values), a refining classification may be performed to classify each pixel by using a second decision tree that looks at the previous classified pixels and/or depth values. A third pass may also be used to further refine the classification of the current pixel by looking at the previous classified pixels and/or depth values. It is to be understood that virtually any number of iterations may be performed, with fewer iterations resulting in less computational expense and more iterations potentially offering more accurate classifications and/or confidences.
[0071] The decision trees may be constructed during a training mode in which a sample of known models in known poses are analyzed to determine the questions (i.e., tests) that can be asked at each node of the decision trees in order to produce accurate pixel classifications.
[0072] Turning back to FIG. 6 , after foreground pixels are labeled with body part information, pipeline 100 includes model fitting 108, which finds one or more possible skeletons that serve as machine representations of the player target.
[0073] A variety of different model fitting techniques may be used. During model fitting 108, a human target is modeled as a skeleton including a plurality of skeletal points, each skeletal point having a three-dimensional location in world space. The various skeletal points may correspond to actual joints of a human target, terminal ends of a human target's extremities, and/or points without a direct anatomical link to the human target. Each skeletal point has at least three degrees of freedom (e.g., world space x, y, z). As such, the skeleton can be fully defined by 3×λ values, where λ is equal to the total number of skeletal points included in the skeleton. A skeleton with 31 skeletal points can be defined by 93 values, for example. As described with reference to FIG. 5 above, some skeletal points may account for axial roll angles.
[0074] The various model fitting approaches compatible with pipeline 100 may use depth information, background information, body part information, and/or prior trained anatomical and kinetic information to deduce one or more skeleton(s) that closely model a human target.
[0075] As an example, the body part information that is assessed for the foreground pixels may be used to find one or more candidate locations (e.g., centroids) for one or more skeletal bones. Furthermore, a plurality of plausible skeletons may be assembled to include skeletal bones at different combinations of the plurality of candidate locations. The various plausible skeletons may then be scored, and the scored proposals can be combined into a final estimate.
[0076] Clumps of foreground pixels may individually include body part probability distributions indicating that a particular body part is probable for that clump. In some cases, two or more clumps that are spaced apart from one another may indicate that the same body part is probable. For example, the clumps of pixels actually showing the right and left hands of a target may both be labeled with body part information indicating a high probability for a right hand body part. As such, two or more centroid candidates may be calculated for each body part. Each centroid candidate for a parituclar body part may be represented in four dimensions—x, y, z and probability w that the candidate belongs to that body part. In other words, each centroid defines a location of a clump of neighboring foreground pixels individually having body part probability distributions indicating that that body part is probable for that clump of neighboring foreground pixels. Furthermore, each centroid defines a single probability representing all individual body part probability distributions within the clump.
[0077] Two or more different centroid candidates can be considered in finding a skeleton that closely models a human target. The various candidate centroids can be scored against one another (e.g., number of pixels in clump multiplied by average probability that pixels in the clump belong to a particular body part). The scores may be adjusted based on one or more constraints (e.g., apply a penalty when a distance between the highest scoring clump for a body part in a previous frame exceeds a threshold distance to the highest scoring clump for the same body part in the current frame). The scored centroids may be used to construct one or more plausible skeletons, from which a single skeleton can be derived.
[0078] Considering plural plausible skeletons employs a probabilistic principle of least commitment to deal with uncertainty. As such, many possibilities are considered throughout the model fitting phase of the pipeline, without making hard decisions until such decisions can no longer be avoided.
[0079] When the data is unambiguous, the plurality of plausible skeletons will be very similar to each other. If there are situations in which there are numerous possibilities for one or more parts of the skeleton, the sample set will be more diverse, thus capturing the uncertainty.
[0080] The accuracy of the approximation can improve as the number of plausible skeletons, n, increases. However, computational cost also increases as n increases. The model fitting phase of the pipeline can be restrained to focus on a relatively small number of samples (e.g., n<100). To improve results when working with fewer samples, information from foreground pixel assignment 106 and past skeletal motion information may be used to improve the intelligence of the search for a set of proposal skeletons. The plausible skeletons can be evaluated against the input data, and other sources of information, to arrive at a final approximation.
[0081] As shown in FIG. 6 , model fitting 108 may receive input from previous phases of pipeline 100. Model fitting 108 may receive one or more raw depth images from depth image acquisition 102, player/background information from background removal 104, and body part information from foreground pixel assignment 106.
[0082] With all available inputs, foreground regions of the depth image may be segmented into a set of patches, which are regions of roughly consistent depth. This effectively approximates the full depth image by a set of small planar regions. For a modest loss of fidelity, this can reduce the bandwidth requirements from millions of pixel accesses, to thousands of patch accesses.
[0083] Plausible skeletons may then be proposed from the previous foreground pixel assignments. The purpose of this phase is to convert pixel-wise body part probability distributions into proposals for full skeletons (e.g., 93 values for a λ=31 skeleton). In the spirit of the principle of least commitment, all likely locations for a body part are considered until global information can be brought to bear. Therefore, this phase may include two components: a body part proposer, which extracts candidate locations from foreground pixel assignment 106 for each body part independently (e.g., finding candidate centroids for each body part, as introduced above); and a skeleton generator, which combines these candidates into complete skeletons.
[0084] As discussed above, in at least some embodiments, model fitting can be used to find a plurality of different plausible skeletons. A proposed skeleton can be scored using a variety of different metrics. In FIG. 6 , pipeline 100 includes model resolution 110, in which a single skeleton is derived from the plurality of plausible skeletons. A variety of different model resolution techniques may be used. In some embodiments, two or more plausible skeletons may be scored against each other based on weight, observed motion over time, anticipated bone length, foreground/background crossing, and/or other factors. A proposed skeleton with a highest score may be selected; or the best scoring portions of two or more different proposed skeletons, from one or more different frames, may be combined into a selected skeleton. Furthermore, various constraints (e.g., bone length, joint angle, collision testing, etc.) may be applied to one or more skeletons to shift the proposed skeleton(s) into a better matching pose.
[0085] Pipeline 100 also includes reporting 112, where the selected skeleton is reported for use by other applications. Reporting can be performed in any suitable manner. As a nonlimiting example, an application programming interface (API) may be used to report the selected skeleton. Such an (API) may be configured to communicate the joint positions, joint velocities, joint accelerations, confidences in positions, velocities, and/or accelerations, and/or other information related to the selected skeleton for one or more targets. A content receiver (e.g., a gaming application) may then use the reported information as desired.
[0086] FIG. 8 graphically shows a progression of data through a pose tracking pipeline. On the left, a scene 170 includes a human target 172. At 174, scene 170 is imaged by a depth camera and background information is removed from the scene. Silhouette 176 schematically represents one or more data structures capturing the depth information and player index information (e.g., as captured during depth image acquisition 102 and background removal 104 of pipeline 100).
[0087] At 178, the depth information believed to belong to the player target is analyzed to determine what part of a player target's body each pixel is likely to belong. Map 180 schematically represents one or more data structures capturing the body part information (e.g., as deduced during foreground pixel assignment 106 of pipeline 100).
[0088] At 182, a set of plausible skeletons are proposed, where each skeleton is an attempt to model the human target as a machine representation. Skeleton set 184 schematically represents one or more data structures defining the proposed skeletons (e.g., as proposed during model fitting 108 of pipeline 100). It is to be understood that the graphical depictions of skeletons in FIGS. 4 , 5, and 8 is nonlimiting. Skeletons with a different number and/or configuration of skeletal points and skeletal bones may be used.
[0089] At 186, a skeleton is selected based on the set of plausible skeletons. Skeleton 188 schematically represents one or more data structures defining the selected skeleton (e.g., as selected during model resolution 110 of pipeline 100).
[0090] At 190, the selected skeleton is reported (e.g., as described with reference to model reporting 112 of pipeline 100). As indicated at 192, the reported skeleton may be used as an input by an operating system, one or more applications, or any other suitable receiver.
[0091] It is to be understood that the configurations and/or approaches described herein are exemplary in nature, and that these specific embodiments or examples are not to be considered in a limiting sense, because numerous variations are possible. The specific routines or methods described herein may represent one or more of any number of processing strategies. As such, various acts illustrated may be performed in the sequence illustrated, in other sequences, in parallel, or in some cases omitted. Likewise, the order of the above-described processes may be changed.
[0092] The subject matter of the present disclosure includes all novel and nonobvious combinations and subcombinations of the various processes, systems and configurations, and other features, functions, acts, and/or properties disclosed herein, as well as any and all equivalents thereof.
Claims
The invention claimed is:
1. A method of tracking a target, the method comprising:
receiving from a source one or more observed depth images of a scene including the target;
labeling each pixel of the one or more observed depth images as either a foreground pixel belonging to the target, a foreground pixel belonging to another target, or a background pixel not belonging to a target;
labeling each foreground pixel with body part information indicating a likelihood that that foreground pixel belongs to one or more body parts of the target; and
modeling the target with a virtual skeleton including a plurality of virtual skeletal points, each virtual skeletal point including a three dimensional position derived from body part information of one or more foreground pixels from the one or more observed depth images.
2. The method of claim 1, where the virtual skeleton is one of a plurality of plausible virtual skeletons derived from body part information of one or more foreground pixels from the one or more observed depth images.
3. The method of claim 2, where modeling the target with the virtual skeleton includes finding a plurality of candidate locations for each virtual skeletal bone defined by adjacent virtual skeletal points, and assembling the plurality of plausible virtual skeletons to include virtual skeletal bones at different combinations of the plurality of candidate locations.
4. The method of claim 3, where finding the plurality of candidate locations for each virtual skeletal bone includes finding a corresponding plurality of centroids for a body part corresponding to that virtual skeletal bone, each centroid defining a location of a clump of neighboring foreground pixels individually having body part probability distributions indicating that that body part is probable for that clump of neighboring foreground pixels, each centroid further defining a single probability representing all individual body part probability distributions within the clump.
5. The method of claim 3, further comprising deriving a single virtual skeleton from the plurality of plausible virtual skeletons.
6. The method of claim 5, where deriving a single virtual skeleton from the plurality of plausible virtual skeletons includes selecting one of the plurality of plausible virtual skeletons as the single virtual skeleton.
7. The method of claim 5, where deriving a single virtual skeleton from the plurality of plausible virtual skeletons includes combining parts of two or more of the plurality of plausible virtual skeletons into the single virtual skeleton.
8. The method of claim 5, where deriving a single virtual skeleton from the plurality of plausible virtual skeletons includes scoring two or more plausible virtual skeletons against one another based on one or more of weight, observed motion over time, anticipated bone length, and foreground/background crossing.
9. The method of claim 5, where deriving a single virtual skeleton from the plurality of plausible virtual skeletons includes applying one or more constraints to one or more of the plurality of plausible virtual skeletons.
10. The method of claim 1, where labeling each foreground pixel of an observed depth image with body part information includes applying to the observed depth image one or more decision trees trained from a collection of known poses to find a body part probability distribution indicating a likelihood that the foreground pixel belongs to each of one or more body parts.
11. The method of claim 1, where labeling each foreground pixel of an observed depth image with body part information includes applying to the observed depth image one or more decision trees trained from a collection of known poses and where a terminal node of each decision tree yields a best-guess of a body part for the foreground pixel and a confidence that the best-guess is correct.
12. The method of claim 1, where labeling each pixel as either a foreground pixel or a background pixel includes finding a floor in the observed depth image and labeling floor pixels as background pixels.
13. The method of claim 1, where labeling each pixel as either a foreground pixel or a background pixel includes creating a depth history image from two or more frames of depth information, and where a pixel is labeled as a foreground pixel if a depth value for that pixel is substantially smaller in the observed depth image than in the depth history image.
14. A method of tracking a target, the method comprising:
receiving from a depth camera one or more observed depth images of a scene including the target;
labeling each pixel of the one or more observed depth images as either a foreground pixel belonging to the target, a foreground pixel belonging to another target, or a background pixel not belonging to a target;
labeling each foreground pixel of the target with a body part probability distribution indicating a likelihood that that foreground pixel belongs to each of one or more body parts of the target; and
independently extracting a plurality of candidate locations for each of a plurality of virtual skeletal bones based on the body part probability distribution of each foreground pixel of the target; and
assembling a plurality of plausible virtual skeletons that include virtual skeletal bones at different combinations of the plurality of candidate locations, each plausible virtual skeleton including a plurality of virtual skeletal points, each virtual skeletal point defining a three dimensional position.
15. The method of claim 14, further comprising deriving a single virtual skeleton from the plurality of plausible virtual skeletons.
16. The method of claim 15, where deriving a single virtual skeleton from the plurality of plausible virtual skeletons includes selecting one of the plurality of plausible virtual skeletons as the single virtual skeleton.
17. The method of claim 14, where deriving a single virtual skeleton from the plurality of plausible virtual skeletons includes combining parts of two or more of the plurality of plausible virtual skeletons into the single virtual skeleton.
18. A computing system, comprising:
a source configured to capture depth information;
a logic subsystem in operative communication with the source; and
a data-holding subsystem holding instructions executable by the logic subsystem to:
receive from the source one or more observed depth images of a scene including a target;
label each pixel of the one or more observed depth images as either a foreground pixel belonging to the target, a foreground pixel belonging to another target, or a background pixel not belonging to a target;
label each foreground pixel of the target with body part information indicating a likelihood that that foreground pixel belongs to one or more body parts of the target; and
model the target with a virtual skeleton including a plurality of virtual skeletal points, each virtual skeletal point including a three dimensional position derived from body part information of one or more foreground pixels from the one or more observed depth images.
19. The computing system of claim 18, where the virtual skeleton is one of a plurality of plausible virtual skeletons derived from body part information of one or more foreground pixels from the one or more observed depth images.
20. The computing system of claim 19, where modeling the target with the virtual skeleton includes finding a plurality of candidate locations for each virtual skeletal bone defined by adjacent virtual skeletal points, and assembling the plurality of plausible virtual skeletons to include virtual skeletal bones at different combinations of the plurality of candidate locations.
Patent Citations (186)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4627620(A) | 1986-12-01 | Yang | Applicant |
| US4630910(A) | 1986-12-01 | Ross et al. | Applicant |
| US4645458(A) | 1987-02-01 | Williams | Applicant |
| US4695953(A) | 1987-09-01 | Blair et al. | Applicant |
| US4702475(A) | 1987-10-01 | Elstein et al. | Applicant |
| US4711543(A) | 1987-12-01 | Blair et al. | Applicant |
| US4751642(A) | 1988-06-01 | Silva et al. | Applicant |
| US4796997(A) | 1989-01-01 | Svetkoff et al. | Applicant |
| US4809065(A) | 1989-02-01 | Harris et al. | Applicant |
| US4817950(A) | 1989-04-01 | Goo | Applicant |
| US4843568(A) | 1989-06-01 | Krueger et al. | Applicant |
| US4893183(A) | 1990-01-01 | Nayar | Applicant |
| US4901362(A) | 1990-02-01 | Terzian | Applicant |
| US4925189(A) | 1990-05-01 | Braeunig | Applicant |
| US5101444(A) | 1992-03-01 | Wilson et al. | Applicant |
| US5148154(A) | 1992-09-01 | MacKay et al. | Applicant |
| US5184295(A) | 1993-02-01 | Mann | Applicant |
| US5229754(A) | 1993-07-01 | Aoki et al. | Applicant |
| US5229756(A) | 1993-07-01 | Kosugi et al. | Applicant |
| US5239463(A) | 1993-08-01 | Blair et al. | Applicant |
| US5239464(A) | 1993-08-01 | Blair et al. | Applicant |
| US5288078(A) | 1994-02-01 | Capper et al. | Applicant |
| US5295491(A) | 1994-03-01 | Gevins | Applicant |
| US5320538(A) | 1994-06-01 | Baum | Applicant |
| US5347306(A) | 1994-09-01 | Nitta | Applicant |
| US5385519(A) | 1995-01-01 | Hsu et al. | Applicant |
| US5405152(A) | 1995-04-01 | Katanics et al. | Applicant |
| US5417210(A) | 1995-05-01 | Funda et al. | Applicant |
| US5423554(A) | 1995-06-01 | Davis | Applicant |
| US5454043(A) | 1995-09-01 | Freeman | Applicant |
| US5469740(A) | 1995-11-01 | French et al. | Applicant |
| US5495576(A) | 1996-02-01 | Ritchey | Applicant |
| US5516105(A) | 1996-05-01 | Eisenbrey et al. | Applicant |
| US5524637(A) | 1996-06-01 | Erickson et al. | Applicant |
| US5534917(A) | 1996-07-01 | MacDougall | Applicant |
| US5563988(A) | 1996-10-01 | Maes et al. | Applicant |
| US5577981(A) | 1996-11-01 | Jarvik | Applicant |
| US5580249(A) | 1996-12-01 | Jacobsen et al. | Applicant |
| US5594469(A) | 1997-01-01 | Freeman et al. | Applicant |
| US5597309(A) | 1997-01-01 | Riess | Applicant |
| US5616078(A) | 1997-04-01 | Oh | Applicant |
| US5617312(A) | 1997-04-01 | Iura et al. | Applicant |
| US5638300(A) | 1997-06-01 | Johnson | Applicant |
| US5641288(A) | 1997-06-01 | Zaenglein | Applicant |
| US5682196(A) | 1997-10-01 | Freeman | Applicant |
| US5682229(A) | 1997-10-01 | Wangler | Applicant |
| US5690582(A) | 1997-11-01 | Ulrich et al. | Applicant |
| US5703367(A) | 1997-12-01 | Hashimoto et al. | Applicant |
| US5704837(A) | 1998-01-01 | Iwasaki et al. | Applicant |
| US5715834(A) | 1998-02-01 | Bergamasco et al. | Applicant |
| US5875108(A) | 1999-02-01 | Hoffberg et al. | Applicant |
| US5877803(A) | 1999-03-01 | Wee et al. | Applicant |
| US5913727(A) | 1999-06-01 | Ahdoot | Applicant |
| US5933125(A) | 1999-08-01 | Fernie | Applicant |
| US5980256(A) | 1999-11-01 | Carmein | Applicant |
| US5989157(A) | 1999-11-01 | Walton | Applicant |
| US5995649(A) | 1999-11-01 | Marugame | Applicant |
| US6005548(A) | 1999-12-01 | Latypov et al. | Applicant |
| US6009210(A) | 1999-12-01 | Kang | Applicant |
| US6054991(A) | 2000-04-01 | Crane et al. | Applicant |
| US6066075(A) | 2000-05-01 | Poulton | Applicant |
| US6072494(A) | 2000-06-01 | Nguyen | Applicant |
| US6073489(A) | 2000-06-01 | French et al. | Applicant |
| US6077201(A) | 2000-06-01 | Cheng et al. | Applicant |
| US6098458(A) | 2000-08-01 | French et al. | Applicant |
| US6100896(A) | 2000-08-01 | Strohecker et al. | Applicant |
| US6101289(A) | 2000-08-01 | Kellner | Applicant |
| US6128003(A) | 2000-10-01 | Smith et al. | Applicant |
| US6130677(A) | 2000-10-01 | Kunz | Applicant |
| US6141463(A) | 2000-10-01 | Covell et al. | Applicant |
| US6147678(A) | 2000-11-01 | Kumar et al. | Applicant |
| US6152856(A) | 2000-11-01 | Studor et al. | Applicant |
| US6159100(A) | 2000-12-01 | Smith | Applicant |
| US6173066(B1) | 2001-01-01 | Peurach et al. | Applicant |
| US6181343(B1) | 2001-01-01 | Lyons | Applicant |
| US6188777(B1) | 2001-02-01 | Darrell et al. | Applicant |
| US6205231(B1) | 2001-03-01 | Isadore-Barreca et al. | Examiner |
| US6215890(B1) | 2001-04-01 | Matsuo et al. | Applicant |
| US6215898(B1) | 2001-04-01 | Woodfill et al. | Applicant |
| US6226396(B1) | 2001-05-01 | Marugame | Applicant |
| US6229913(B1) | 2001-05-01 | Nayar et al. | Applicant |
| US6256033(B1) | 2001-07-01 | Nguyen | Applicant |
| US6256400(B1) | 2001-07-01 | Takata et al. | Applicant |
| US6283860(B1) | 2001-09-01 | Lyons et al. | Applicant |
| US6289112(B1) | 2001-09-01 | Jain et al. | Applicant |
| US6299308(B1) | 2001-10-01 | Voronka et al. | Applicant |
| US6308565(B1) | 2001-10-01 | French et al. | Applicant |
| US6316934(B1) | 2001-11-01 | Amorai-Moriya et al. | Applicant |
| US6363160(B1) | 2002-03-01 | Bradski et al. | Applicant |
| US6384819(B1) | 2002-05-01 | Hunter | Applicant |
| US6411744(B1) | 2002-06-01 | Edwards | Applicant |
| US6430997(B1) | 2002-08-01 | French et al. | Applicant |
| US6476834(B1) | 2002-11-01 | Doval et al. | Applicant |
| US6496598(B1) | 2002-12-01 | Harman | Applicant |
| US6503195(B1) | 2003-01-01 | Keller et al. | Applicant |
| US6539931(B2) | 2003-04-01 | Trajkovic et al. | Applicant |
| US6570555(B1) | 2003-05-01 | Prevost et al. | Applicant |
| US6633294(B1) | 2003-10-01 | Rosenthal et al. | Applicant |
| US6640202(B1) | 2003-10-01 | Dietz et al. | Applicant |
| US6661918(B1) | 2003-12-01 | Gordon et al. | Applicant |
| US6674877(B1) | 2004-01-01 | Jojic et al. | Examiner |
| US6681031(B2) | 2004-01-01 | Cohen et al. | Applicant |
| US6714665(B1) | 2004-03-01 | Hanna et al. | Applicant |
| US6731799(B1) | 2004-05-01 | Sun et al. | Applicant |
| US6738066(B1) | 2004-05-01 | Nguyen | Applicant |
| US6765726(B2) | 2004-07-01 | French et al. | Applicant |
| US6788809(B1) | 2004-09-01 | Grzeszczuk et al. | Applicant |
| US6801637(B2) | 2004-10-01 | Voronka et al. | Applicant |
| US6873723(B1) | 2005-03-01 | Aucsmith et al. | Applicant |
| US6876496(B2) | 2005-04-01 | French et al. | Applicant |
| US6937742(B2) | 2005-08-01 | Roberts et al. | Applicant |
| US6950534(B2) | 2005-09-01 | Cohen et al. | Applicant |
| US7003134(B1) | 2006-02-01 | Covell et al. | Applicant |
| US7036094(B1) | 2006-04-01 | Cohen et al. | Applicant |
| US7038855(B2) | 2006-05-01 | French et al. | Applicant |
| US7039676(B1) | 2006-05-01 | Day et al. | Applicant |
| US7042440(B2) | 2006-05-01 | Pryor et al. | Applicant |
| US7050606(B2) | 2006-05-01 | Paul et al. | Applicant |
| US7058204(B2) | 2006-06-01 | Hildreth et al. | Applicant |
| US7060957(B2) | 2006-06-01 | Lange et al. | Applicant |
| US7068842(B2) | 2006-06-01 | Liang et al. | Examiner |
| US7113918(B1) | 2006-09-01 | Ahmad et al. | Applicant |
| US7121946(B2) | 2006-10-01 | Paul et al. | Applicant |
| US7170492(B2) | 2007-01-01 | Bell | Applicant |
| US7184048(B2) | 2007-02-01 | Hunter | Applicant |
| US7202898(B1) | 2007-04-01 | Braun et al. | Applicant |
| US7222078(B2) | 2007-05-01 | Abelow | Applicant |
| US7227526(B2) | 2007-06-01 | Hildreth et al. | Applicant |
| US7227893(B1) | 2007-06-01 | Srinivasa et al. | Examiner |
| US7259747(B2) | 2007-08-01 | Bell | Applicant |
| US7308112(B2) | 2007-12-01 | Fujimura et al. | Applicant |
| US7317836(B2) | 2008-01-01 | Fujimura et al. | Applicant |
| US7348963(B2) | 2008-03-01 | Bell | Applicant |
| US7359121(B2) | 2008-04-01 | French et al. | Applicant |
| US7367887(B2) | 2008-05-01 | Watabe et al. | Applicant |
| US7379563(B2) | 2008-05-01 | Shamaie | Applicant |
| US7379566(B2) | 2008-05-01 | Hildreth | Applicant |
| US7389591(B2) | 2008-06-01 | Jaiswal et al. | Applicant |
| US7412077(B2) | 2008-08-01 | Li et al. | Applicant |
| US7421093(B2) | 2008-09-01 | Hildreth et al. | Applicant |
| US7430312(B2) | 2008-09-01 | Gu | Applicant |
| US7436496(B2) | 2008-10-01 | Kawahito | Applicant |
| US7450736(B2) | 2008-11-01 | Yang et al. | Applicant |
| US7452275(B2) | 2008-11-01 | Kuraishi | Applicant |
| US7460690(B2) | 2008-12-01 | Cohen et al. | Applicant |
| US7489812(B2) | 2009-02-01 | Fox et al. | Applicant |
| US7526101(B2) | 2009-04-01 | Avidan | Examiner |
| US7536032(B2) | 2009-05-01 | Bell | Applicant |
| US7555142(B2) | 2009-06-01 | Hildreth et al. | Applicant |
| US7560701(B2) | 2009-07-01 | Oggier et al. | Applicant |
| US7570805(B2) | 2009-08-01 | Gu | Applicant |
| US7574020(B2) | 2009-08-01 | Shamaie | Applicant |
| US7576727(B2) | 2009-08-01 | Bell | Applicant |
| US7590262(B2) | 2009-09-01 | Fujimura et al. | Applicant |
| US7593552(B2) | 2009-09-01 | Higaki et al. | Applicant |
| US7598942(B2) | 2009-10-01 | Underkoffler et al. | Applicant |
| US7607509(B2) | 2009-10-01 | Schmiz et al. | Applicant |
| US7620202(B2) | 2009-11-01 | Fujimura et al. | Applicant |
| US7668340(B2) | 2010-02-01 | Cohen et al. | Applicant |
| US7680298(B2) | 2010-03-01 | Roberts et al. | Applicant |
| US7683954(B2) | 2010-03-01 | Ichikawa et al. | Applicant |
| US7684592(B2) | 2010-03-01 | Paul et al. | Applicant |
| US7701439(B2) | 2010-04-01 | Hillis et al. | Applicant |
| US7702130(B2) | 2010-04-01 | Im et al. | Applicant |
| US7704135(B2) | 2010-04-01 | Harrison, Jr. | Applicant |
| US7710391(B2) | 2010-05-01 | Bell et al. | Applicant |
| US7729530(B2) | 2010-06-01 | Antonov et al. | Applicant |
| US7746345(B2) | 2010-06-01 | Hunter | Applicant |
| US7760182(B2) | 2010-07-01 | Ahmad et al. | Applicant |
| US7809167(B2) | 2010-10-01 | Bell | Applicant |
| US7834846(B1) | 2010-11-01 | Bell | Applicant |
| US7852262(B2) | 2010-12-01 | Namineni et al. | Applicant |
| USRE42256(E) | 2011-03-01 | Edwards | Applicant |
| US7898522(B2) | 2011-03-01 | Hildreth et al. | Applicant |
| US8035612(B2) | 2011-10-01 | Bell et al. | Applicant |
| US8035614(B2) | 2011-10-01 | Bell et al. | Applicant |
| US8035624(B2) | 2011-10-01 | Bell et al. | Applicant |
| US8072470(B2) | 2011-12-01 | Marks | Applicant |
| US2008/0026838(A1) | 2008-01-01 | Dunstan et al. | Applicant |
| US2008/0181499(A1) | 2008-07-01 | Yang et al. | Applicant |
| CN201254344(B) | 2010-06-01 | Applicant | |
| EP583061(A2) | 1994-02-01 | Applicant | |
| JP8044490(A1) | 1996-02-01 | Applicant | |
| WO93/10708(A1) | 1993-06-01 | Applicant | |
| WO97/17598(A1) | 1997-05-01 | Applicant | |
| WO99/44698(A1) | 1999-09-01 | Applicant |
Non-Patent Literature (30)
- Park, et al., “Segmentation and Tracking of Interacting Human Body Parts under Occlusion and Shadowing”, Retrieved at <<http://ftp.cs.rochester.edu/u/spark/papers/park—Aggarwal—WMVC02—segmentation—ref.pdf>>, Proceedings of the Workshop on Motion and Video Computing, Dec. 5-6, 2002, pp. 7.Applicant
- Moeslund, et al., “A Survey of Advances in Vision-Based Human Motion Capture and Analysis”, Retrieved at <<http://www.caip.rutgers.edu/˜meer/TEACHTOO/PAPERS/moeslund06.pdf>>, Computer Vision and Image Understanding, vol. 104, No. 2, Nov. 2006, pp. 90-126.Applicant
- Kehl, et al., “Full Body Tracking from Multiple Views Using Stochastic Sampling”, Retrieved at <<ftp://ftp.vision.ee.ethz.ch/publications/proceedings/eth—biwi—00359.pdf>>, Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), vol. 2, Jun. 20-Jun. 25, pp. 8.Applicant
- Kanade et al., “A Stereo Machine for Video-rate Dense Depth Mapping and Its New Applications”, IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1996, pp. 196-202,The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA.Applicant
- Miyagawa et al., “CCD-Based Range Finding Sensor”, Oct. 1997, pp. 1648-1652, vol. 44 No. 10, IEEE Transactions on Electron Devices.Applicant
- Rosenhahn et al., “Automatic Human Model Generation”, 2005, pp. 41-48, University of Auckland (CITR), New Zealand.Applicant
- Aggarwal et al., “Human Motion Analysis: A Review”, IEEE Nonrigid and Articulated Motion Workshop, 1997, University of Texas at Austin, Austin, TX.Applicant
- Shao et al., “An Open System Architecture for a Multimedia and Multimodal User Interface”, Aug. 24, 1998, Japanese Society for Rehabilitation of Persons with Disabilities (JSRPD), Japan.Applicant
- Kohler, “Special Topics of Gesture Recognition Applied in Intelligent Home Environments”, In Proceedings of the Gesture Workshop, 1998, pp. 285-296, Germany.Applicant
- Kohler, “Vision Based Remote Control in Intelligent Home Environments”, University of Erlangen-Nuremberg/Germany, 1996, pp. 147-154, Germany.Applicant
- Kohler, “Technical Details and Ergonomical Aspects of Gesture Recognition applied in Intelligent Home Environments”, 1997, Germany.Applicant
- Hasegawa et al., “Human-Scale Haptic Interaction with a Reactive Virtual Human in a Real-Time Physics Simulator”, Jul. 2006, vol. 4, No. 3, Article 6C, ACM Computers in Entertainment, New York, NY.Applicant
- Qian et al., “A Gesture-Driven Multimodal Interactive Dance System”, Jun. 2004, pp. 1579-1582, IEEE International Conference on Multimedia and Expo (ICME), Taipei, Taiwan.Applicant
- Zhao, “Dressed Human Modeling, Detection, and Parts Localization”, 2001, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA.Applicant
- He, “Generation of Human Body Models”, Apr. 2005, University of Auckland, New Zealand.Applicant
- Isard et al., “CONDENSATION—Conditional Density Propagation for Visual Tracking”, 1998, pp. 5-28, International Journal of Computer Vision 29(1), Netherlands.Applicant
- Livingston, “Vision-based Tracking with Dynamic Structured Light for Video See-through Augmented Reality”, 1998, University of North Carolina at Chapel Hill, North Carolina, USA.Applicant
- Wren et al., “Pfinder: Real-Time Tracking of the Human Body”, MIT Media Laboratory Perceptual Computing Section Technical Report No. 353, Jul. 1997, vol. 19, No. 7, pp. 780-785, IEEE Transactions on Pattern Analysis and Machine Intelligence, Caimbridge, MA.Applicant
- Breen et al., “Interactive Occlusion and Collusion of Real and Virtual Objects in Augmented Reality”, Technical Report ECRC-95-02, 1995, European Computer-Industry Research Center GmbH, Munich, Germany.Applicant
- Freeman et al., “Television Control by Hand Gestures”, Dec. 1994, Mitsubishi Electric Research Laboratories, TR94-24, Caimbridge, MA.Applicant
- Hongo et al., “Focus of Attention for Face and Hand Gesture Recognition Using Multiple Cameras”, Mar. 2000, pp. 156-161, 4th IEEE International Conference on Automatic Face and Gesture Recognition, Grenoble, France.Applicant
- Pavlovic et al., “Visual Interpretation of Hand Gestures for Human-Computer Interaction: A Review”, Jul. 1997, pp. 677-695, vol. 19, No. 7, IEEE Transactions on Pattern Analysis and Machine Intelligence.Applicant
- Azarbayejani et al., “Visually Controlled Graphics”, Jun. 1993, vol. 15, No. 6, IEEE Transactions on Pattern Analysis and Machine Intelligence.Applicant
- Granieri et al., “Simulating Humans in VR”, The British Computer Society, Oct. 1994, Academic Press.Applicant
- Brogan et al., “Dynamically Simulated Characters in Virtual Environments”, Sep./Oct. 1998, pp. 2-13, vol. 18, Issue 5, IEEE Computer Graphics and Applications.Applicant
- Fisher et al., “Virtual Environment Display System”, ACM Workshop on Interactive 3D Graphics, Oct. 1986, Chapel Hill, NC.Applicant
- “Virtual High Anxiety”, Tech Update, Aug. 1995, pp. 22.Applicant
- Sheridan et al., “Virtual Reality Check”, Technology Review, Oct. 1993, pp. 22-28, vol. 96, No. 7.Applicant
- Stevens, “Flights into Virtual Reality Treating Real World Disorders”, The Washington Post, Mar. 27, 1995, Science Psychology, 2 pages.Applicant
- “Simulation and Training”, 1994, Division Incorporated.Applicant