The present disclosure relates to systems and techniques for pose generation. More specifically, this disclosure relates to machine learning techniques for pose generation.
Electronic games are increasingly becoming more realistic due to an increase in available processing resources. This increase in realism may allow for more realistic gameplay experiences. For example, elements that form an in-game world, such as characters, may be more realistically presented. In this example, the elements may be increasingly rendered at higher resolutions, with more detailed textures, with more detailed underlying meshes, and so on. While this added realism may be beneficial to an end-user of an electronic game, it may place a substantial burden on electronic game designers. As an example, electronic game designers may be required to create very rich, and detailed, models of characters. As another example, electronic game designers may be required to create fluid, lifelike, movements of the characters
With respect to the example of movement, characters may be designed to realistically adjust their arms, legs, and so on, while traversing an in-game world. In this way, the characters may walk, run, jump, and so on, in a lifelike manner. To enable this realistic movement, electronic game designers may be required to spend substantial time fine-tuning movements of an underlying character model. Movement of a character model may be, at least in part, implemented based on movement of an underlying skeleton. For example, a skeleton may include a multitude of objects (e.g., joints) which may represent a portion of the character model. As an example, a first object may be a finger while a second object may correspond to a wrist. The skeleton may therefore represent an underlying form on which the character model is built. In this way, movement of the skeleton may cause a corresponding adjustment of the character model.
To create realistic movement, an electronic game designer may therefore adjust positions of the above-described objects included in the skeleton. For example, the electronic game designer may create realistic running movements via adjustment of specific objects which form a character model's legs. This hand-tuned technique to enable movement of a character results in substantial complexity and usage of time. Certain techniques to reduce a complexity associated with enabling movement of a character, such as via motion capture, may introduce their own complexities. For example, actors may need to be hired to perform different movements. As another example, complex motion capture stages may be required to monitor movement of the actors.
Particular embodiments of the subject matter described in this specification can be implemented so as to realize one or more of the following advantages. Utilizing the techniques described herein, realistic motion may be rapidly generated for arbitrary character models configured for use in electronic games. As will be described, machine learning techniques may be employed to learn representations of distinct human poses. For example, a pose may be defined, at least in part, based on positions of a multitude of joints on a human. Example joints may include a wrist, a shoulder, a knee, joints on a hip, and so on. As may be appreciated, these joints may indicate locations on a person which can rotate or otherwise adjust position. In this way, poses may be analyzed by the machine learning techniques. Advantageously, the machine learning techniques may, in some embodiments, be generative models. Thus, the generative models may allow for generation of realistic motion based on learned poses of humans.
At present, techniques to generate realistic motion for character models may rely upon designers adjusting character models to define different types of motion. For example, to define running, a designer may string together certain adjustments of joints on a skeleton of a character model. In this example, the designer may adjust the knees, cause a movement of the arms, and so on. While this may allow for motion to be generated, it may also involve a substantial burden on the designer.
A first example technique to, at least in part, automate motion, may include using software to automatically adjust a skeleton. For example, templates of running may be pre-defined. A designer may therefore select a running template which may cause adjustment of the joints on a skeleton. In this way, the designer may more rapidly generate motion for characters in an in-game world. However, this first example technique may lack the realism of real-world movement. For example, since different templates are being selected, the lifelike differences in movement between real-world persons is lost.
A second example technique may use motion capture techniques. For example, an actor may be placed in a motion capture studio. The actor may then perform different movements, and movement of different portions of the actor (e.g., joints) may be stored by a system. Thus, realistic movement for the specific actor may be translated onto a skeleton of an in-game character model. However, this second example technique may be similarly time-intensive. Additionally, due to the amount of time it takes to perform motion capture, and associated costs, it may typically be limited for a subset of the characters in an electronic game. Thus, motion of remaining characters may be less realistic. Furthermore, the motion capture techniques may limit an extent to which lifelike motion may be generated. For example, the actor may perform particular movements in the motion capture studio. While these movements may be imported onto a skeleton, other movement may have to be generated by designers. This may limit a flexibility of a range of realistic motion.
Furthermore, certain types of electronic games (e.g., sports games) may benefit from realistic movement of its characters. With respect to a wrestling or mixed martial arts electronic game, the playable characters in the game may correspond to real-life persons. Users of the electronic game may watch matches with the real-life persons, such that any deviations of their movement, mannerisms, and so on, may be apparent to the users.
As will be described below, machine learning techniques may be used to analyze poses of real-life persons. For example, and with respect to wrestling, poses of a real-life wrestler may be analyzed. In this example, a video clip of the wrestler may be obtained. Location information of features to be learned may be labeled. For example, positions of joints may be labeled for a pose depicted in a frame of the video clip. As another example, velocity information of the joints for the pose may be labeled. In this way, poses of the real-life wrestler may be analyzed. Since the wrestler may move about a ring in a highly stylized, and personal, style, the machine learning techniques may learn this style. In this way, certain wrestling moves may be realistically learned by the machine learning techniques.
It may be appreciated that the machine learning techniques may analyze a threshold number of features for each pose. For example, there may be 20, 30, and so on, joints for each pose. In this example, there may be features defining locations of each joint, velocity information for each joint, and so on. These features may therefore form a high-dimensional feature space. Advantageously, the machine learning techniques may employ dimensionality reduction techniques. Thus, information defined for each pose may be encoded into a lower-dimensional latent feature space. As an example, there may be a plurality of latent variables (e.g., 7, 10, 14, etc.) which learn to encode the above-described feature information. Each latent variable may therefore learn different information associated with the input features. For example, certain latent variables may learn complex movements of an upper portion of a person's body. As another example, certain latent variables may learn movement information for a hand.
As will be described, generative machine learning models may be used (e.g., autoencoders, variational autoencoders, and so on). Thus, new poses may be generated based on sampling the latent feature space. Advantageously, a designer may indicate a preferred initial pose for a character and a preferred ending pose. The generative machine learning models may then generate intermediate output poses which represent a realistic motion between these poses. For example, the initial pose may represent an in-game wrestler moving towards a combatant. In this example, an ending pose may represent the wrestler grabbing the combatant. Based on the learned latent feature space, a generative model may output poses which are determined to represent a transition between the initial pose and ending pose. These output poses may then be blended, or otherwise combined, to arrive at realistic resultant motion for the in-game wrestler.
In this way, the machine learning techniques described herein may learn representations of motion of persons. Based on these learned representations, realistic motion for arbitrary in-game characters may be rapidly generated. Since this motion is generated based on analyzing real-world persons, the motion may be substantially more realistic as compared to prior techniques. Additionally, the motion may be highly customizable. For example, motion of real-life persons may be separately analyzed to learn their particular movement styles.
The techniques described herein therefore improve upon the functioning of prior software-based techniques to generate movement of in-game character models. As described above, prior techniques relied upon by designers to adjust positions of joints on a skeleton underlying a character model. In contrast, the techniques described herein may allow for automated adjustment. Advantageously, the automated adjustment may be based on a latent feature space which encodes complex pose information. Using generative modeling techniques, complicated animations may be quickly generated.
The systems, methods, and devices of this disclosure each have several innovative aspects, no single one of which is solely responsible for the all of the desirable attributes disclosed herein.
Although certain embodiments and examples are disclosed herein, inventive subject matter extends beyond the examples in the specifically disclosed embodiments to other alternative embodiments and/or uses, and to modifications and equivalents thereof.
The details, including optional details, of one or more embodiments of the subject matter of this specification are set forth in the accompanying drawings and the description below. Other optional features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.
Throughout the drawings, reference numbers are re-used to indicate correspondence between referenced elements. The drawings are provided to illustrate embodiments of the subject matter described herein and not to limit the scope thereof.
Like reference numbers and designations in the various drawings indicate like elements.
Overview
This specification describes, among other things, technical improvements with respect to generation of motion for characters configured for use in electronic games. As will be described a system described herein (e.g., the motion representation system 100) may generate realistic motion based on analyzing pose information of real-world persons. Advantageously, the system may allow for substantially automated pose generation and animation blending, motion generation, inverse kinematics, and so on. While electronic games are described, it may be appreciated that the techniques described herein may be applied generally to movement of character models. For example, animated content (e.g., TV shows, movies) may employ the techniques described herein.
Motion for an in-game character may be defined, at least in part, based on distinct poses of the in-game character. The distinct poses, for example, may be blended together to generate the motion. As an example, each pose may represent a discrete sample of the motion to be performed by the in-game character. Thus, if motion is to depict running, each pose may represent a snapshot of the running. The system may advantageously learn a latent feature space which encodes observable features defining these poses (e.g., positions of joints). As an example, the system may obtain a multitude of poses of real-life persons. For example, there may be thousands, hundreds of thousands, and so on, obtained poses. These poses may, in some embodiments, be obtained from video of the real-life persons. Thus, certain poses may represent discrete snapshots of a real-life person during a particular movement.
Each of the above-described poses may be provided as an input to the system. For example, observable features of the pose may be provided as an input. Example observable features may include positions of locations on the real-life person (e.g., three-dimensional coordinates). These positions are referred to herein as joints and may represent portions of the person which can rotate (e.g., knees, wrists, neck or portions thereof, and so on). Additional observable features may include velocity information for the joints. For example, a movement speed of portions the person may be determined.
The system may use machine learning techniques, such as an autoencoder, to reduce a dimensionality associated with the input features. In some embodiments, principle component analysis may be used as a dimensionality reduction technique. With respect to an autoencoder, the system may learn a latent feature space of a lower-dimension than the input features. The latent feature space may comprise a multitude of latent variables, such as 7, 9, 12, and so on. In some embodiments, a variational autoencoder may be used. Thus, the latent feature space may be (substantially) continuous and each latent variable may be defined, at least in part, as a distribution (e.g., a Gaussian). In this way, the input features defining a pose may be encoded in the latent feature space.
With respect to an autoencoder, an encoder may learn to map input features of poses to the latent feature space. A decoder may then learn to map the latent feature space to an output defining features of poses. Thus, the autoencoder may be trained to generate an output pose which reproduces an input pose. The learned latent feature space may represent a bottleneck, which causes each latent variable in the latent feature space to encode complex information associated with poses. In this way, the autoencoder may learn a latent feature space representing human poses.
It may be appreciated that this learned latent feature space may be used to generate poses. For example, the latent feature space for a variational autoencoder may be continuous. In this example, the latent variables may be defined as respective distributions with associated mean and variance. To generate a pose, the system may sample these latent variables. For example, the system may select values for these latent variables. This sample may then be provided to the decoder to generate an output pose, for example as a vector associated with the latent feature space. In this way, and as illustrated in
Advantageously, realistic motion may be generated by the system using the above-described generative modeling technique. It may be appreciated that the learned latent feature space may encode input features according to different loss terms used during training of a variational autoencoder. A first loss term may cause an output of the autoencoder to be similar to that of the input. A second loss term, such as a Kullback-Leibler divergence (KL divergence) term, may represent a difference between two distributions. For example, a first distribution may be associated with a learned latent variable (e.g., a posterior distribution q(z|x), where x is an input). As another example, a second distribution may represent a prior distribution which may have mean of ‘0’ and standard deviation of ‘1’. These two loss terms may allow for the learned feature space to encode meaningful pose information, such that generated poses may be realistic in output.
As will be described, realistic motion may be generated via interpolating between an initial pose and an end pose. For example, a user (e.g., a designer) may select an initial pose which an in-game character is to assume. In this example, a skeleton of the in-game character may adjust its joints according to the initial pose. Similarly, the user may select an end pose which the in-game character is to assume. The system may map the initial pose to the latent feature space and also map the end pose to the latent feature space. Thus, locations within the lower-dimensional latent feature space may be identified. The system may then determine a transition between the two locations. For example, the system may determine a line connecting the locations. Along this line, the system may sample values in the latent feature space. As described above, the sampled values may correspond to output generated by the decoder. Thus, the system may generate a multitude of output poses via sampling the line. Advantageously, these output poses may represent a realistic transition between the initial pose and the end pose. In this way, the designer may very rapidly generate complex movement based on learned representations of poses.
In some embodiments, the techniques described herein may be performed during in-game gameplay of an electronic game. For example, an electronic game may generate information indicating that an in-game character is to assume an end pose. In this example, the end pose may represent a final pose of certain movement the in-game character is to perform. As an example, the in-game character may represent a wrestler. Thus, the end pose may represent a punching of a combatant by the wrestler. The electronic game may therefore obtain a present pose of the wrestler. The game may then perform the interpolation process described above in real-time. Output poses may be generated and rendered by the electronic game for presentation to a user. In this way, realistic movement of the in-game wrestler may be generated in (substantially) real-time.
Example Block Diagrams—Latent Feature Space
Two poses 102A-102B are illustrated as being included in the pose information 102. While two poses are illustrated, it may be appreciated that thousands, hundreds of thousands, millions, and so on, poses may be input to the pose representation system 100. The pose information 102 may be obtained via analyzing images and/or video of real-life persons. For example, video of wrestlers may be analyzed. In this example, each frame of the video may depict one or more wrestlers. As another example, motion capture information may be obtained. In this example, real-life wrestlers may be placed into motion capture studios.
Each image and/or frame of video may be analyzed to identify features to be input into the pose representation system 100. For example, the features may include locations of joints. Example joints may include a wrist, joints on a finger, an elbow, a knee, one or more joints on a hip, and so on. Thus, a joint may represent a portion of real-life person which is capable of being rotated or otherwise controlled by the real-life person. The locations of the joints may be defined, in some embodiments, as three-dimensional coordinates. For example, a coordinate reference frame may be defined. Each image and/or frame of video may be analyzed to map joints of a real-life person onto the coordinate reference frame. As an example, movement of a wrestler in a video clip may be analyzed to determine relative movement of each of the joints. This relative movement may be translated to the coordinate reference frame for use by the pose representation system 100. In some embodiments, deep learning techniques (e.g., convolutional neural networks) may be utilized to extract locations of the joints. For example, a deep learning model may be trained to identify specific joints depicted in an image or video frame.
Similarly, motion capture information may be analyzed to identify features to be input into the pose representation system 100. Motion capture information may, in some embodiments, allow for rapid importation of locations of joints on a real-life person. For example, the motion capture information may indicate locations of the person's joints at discrete times. Each discrete time may be defined as a particular pose of the person. Thus, the location of the joints may be identified for each pose.
In addition to locations of joints, in some embodiments the pose representation system 100 may obtain additional information as inputs. For example, positions of the joints, orientations of the joints, root linear and angular velocity information, and so on, may be used. In this example, velocity information may be associated with a speed associated with each joint. This speed may, as an example, be extracted from a speed of movement of a portion of a real-life person connected to a joint. As an example with respect to an elbow, a speed may be identified based on a speed of movement of the forearm. Velocity may be extracted from video based on measures of movement of each joint. Thus, velocity information may represent a substantially instantaneous velocity of movement of each joint. Velocity may also be obtained based on motion capture of real-life persons.
In
In some embodiments, a multitude of poses (e.g., hundreds, thousands, and so on) may be provided to the pose representation system 100. As will be described below, the pose representation system 100 may train a machine learning model (e.g., an autoencoder) based on the multitude of poses. Thus, the multitude of poses may represent a batch of poses. In some embodiments, there may be a multitude of batches. For each batch, the pose representation system 100 may update the machine learning model. With respect to an autoencoder, the pose representation system 100 may learn to reproduce a same output pose as provided in an input to the system 100.
For example, subsequent to training, reconstructed pose information 112 may be generated by the pose representation system 100. An example input pose 114 is illustrated in
As may be appreciated, an autoencoder is an unsupervised machine learning technique capable of learning efficient representations of input data. The encoder engine 118 and decoder engine 122 may represent neural networks, such as dense (e.g., fully connected) neural networks. As described above, the output of the encoder engine 118 may be provided into the decoder engine 122 through a shared layer of variables (e.g., hidden variables) which may be referred to as the latent feature representation of the input. As may be appreciated, the output of the encoder engine 118 may be obtained via a forward pass of input pose information 102 through layers forming the encoder engine 118. Advantageously, the latent feature representation 120 may be of lower-dimensions than the input pose information 102. Thus, the latent feature representation 120 may be an encoding of input pose information 102 with respect to a latent feature space. The encoding may comprise values for a multitude of latent variables.
In some embodiments, the autoencoder may represent a variational autoencoder. Thus, the latent feature space may be (substantially) continuous and the latent variables may be distributions (e.g., Gaussian distributions). A variational autoencoder may be a generative model which may therefore learn a probabilistic model for the input pose information 102. In this way, once the pose representation system 100 learns the distributions of the latent variables, the system 100 may generate new poses based on sampling the distributions.
The new poses 128A-128D may be generated, as described above, based on samples 130 of the latent feature distributions. For example, one or more values of each latent feature distribution may be obtained. In some embodiments, the pose representation system 100 may respond to user input via an interactive user interface. The user input may indicate the samples 130 to be obtained. These samples may be provided to a variational decoder engine 126 for use in generating new poses.
Advantageously, one or more of these new poses 128A-128D may be newly generated as compared to input pose information. For example, the latent feature distributions 124 may be generated based on the input pose information. Once generated, for example when the variational autoencoder is trained, the resulting latent feature distributions 124 may be substantially continuous. Thus, samples of the distributions 124 may be obtained which do not precisely correspond with mappings of input pose information onto the latent feature space. In this way, the variational decoder engine 126 may generate new poses based on the samples. These poses may advantageously represent realistic poses of persons.
As will be described, generating poses may be utilized to perform blending between two poses. For example, a user may specify a first pose and a second pose. The pose representation system 100 may then generate intermediate poses which allow for a substantially seamless transition between the first pose and the second pose.
While variational autoencoders are described above, it may be appreciated that other generative models may be used and fall within the scope of the disclosure herein. For example, LSTM-based autoencoders may be used. As another example, generative adversarial networks (GANs) may, in some embodiments, be utilized.
Example Flowchart/Block Diagrams—Generating Output Pose(s)
Blending between poses is of great importance to electronic game designers. For example, blending may allow for in-game character animation between distinct poses. As will be described, the techniques described herein may allow for rapid blending between two poses (e.g., an initial pose and an end pose). For example, intermediate output poses may be generated by the system 100 based on the two poses.
At block 202, the system obtains an initial pose and an end pose. A user, such as a designer, may define the initial pose and the end pose via an interactive user interface. For example, the user interface may allow for a specification of each pose via adjustment of joints on an underlying skeleton. The user may prefer that the initial pose and end pose be blended together, such that a smooth transition between the poses be obtained.
At block 204, the system determines feature encodings for the poses based on a generative model. As described in
In some embodiments, the system may receive information identifying a particular real-world person from which the system is to generate encodings. For example, there may be a multitude of latent feature spaces corresponding to respective real-world persons. In this example, each latent feature space may be generated based on pose information for a specific real-world person. As another example, a conditional variational autoencoder may be used. In this example, the autoencoder may be trained with names of real-world persons as a condition (e.g., as a label). In some embodiments, the user may specify more than one real-world person and the resulting feature encodings may be based on these real-world persons.
At block 206, the system generates transition information between the feature encodings. The system may determine a line which connects the locations in the latent feature space corresponding to the feature encodings. Thus, in some embodiments the transition information may define the line passing through the feature encodings in the latent feature space.
At block 208, the system generates output poses via interpolation of the transition information. The system may sample points along the line, with each point being a feature encoding in the latent feature space. For each sample point, the associated feature encoding may be provided to a decoder. Since the decoder performs a nonlinear transformation of the feature encoding, such as via a forward pass of a neural network, the line in the latent feature space may represent meaningful transformation in the observed space (e.g., the output poses). In this way, the system may generate output poses based on the line.
In some embodiments, the system may sample a threshold number of points based on a length associated with the line. For example, longer lines may result in a greater number of output poses. In some embodiments, the system may sample in discrete steps each with a same measure of length apart from each other.
In some embodiments, the generated output poses may be provided to the user described above. For example, generated output poses may be represented as locations of joints of a skeleton. In this example, a data structure (e.g., a JavaScript Object Notation structure) may be used to store the locations for each generated pose. As another example, the generated output poses may be provided to the user in the interactive user interface. For example, graphical representations of the skeleton adjusted according to the poses, or a character model adjusted according to the poses, may be presented in the user interface.
The output poses may be blended together by the system, or an outside system. For example, the initial pose may be used as a key-frame. In this example, the generated output poses may follow the initial pose. With respect to the poses defining locations of joints, the system may adjust the joints from an initial pose to a first generated output pose. Similarly, the system may adjust the joints from the first generated output pose to a second generated output pose. Thus, the skeleton of an in-game character may be adjusted. The mesh, textures, and so on, which overlay the skeleton may be similarly adjusted. Thus, resulting movement of the in-game character may be generated.
Example output poses 316 are illustrated in
Example Computing System
As shown, the computing device 410 includes a processing unit 420 that interacts with other components of the computing device 410 and also external components to computing device 410. A game media reader 422 is included that communicates with game media 412. The game media reader 422 may be an optical disc reader capable of reading optical discs, such as CD-ROMs or DVDs, or any other type of reader that can receive and read data from game media 412. One or more of the computing devices may be used to implement one or more of the systems disclosed herein.
Computing device 410 may include a separate graphics processor 424. In some cases, the graphics processor 424 may be built into the processing unit 420. In some such cases, the graphics processor 424 may share Random Access Memory (RAM) with the processing unit 420. Alternatively, or additionally, the computing device 410 may include a discrete graphics processor 424 that is separate from the processing unit 420. In some such cases, the graphics processor 424 may have separate RAM from the processing unit 420. Computing device 410 might be a handheld game application device, a dedicated game console computing system, a general-purpose laptop or desktop computer, a smart phone, a tablet, a car console, or other suitable system.
Computing device 410 also includes various components for enabling input/output, such as an I/O 432, a user I/O 434, a display I/O 436, and a network I/O 438. I/O 432 interacts with storage element 440 and, through a device 442, removable storage media 444 in order to provide storage for computing device 410. Processing unit 420 can communicate through I/O 432 to store data, such as game state data and any shared data files. In addition to storage 440 and removable storage media 444, computing device 410 is also shown including ROM (Read-Only Memory) 446 and RAM 448. RAM 448 may be used for data that is accessed frequently, such as when a video game is being played.
User I/O 434 is used to send and receive commands between processing unit 420 and user devices, such as game controllers. In some embodiments, the user I/O 434 can include a touchscreen input. The touchscreen can be capacitive touchscreen, a resistive touchscreen, or other type of touchscreen technology that is configured to receive user input through tactile inputs from the player. Display I/O 436 provides input/output functions that are used to display images from the game being played. Network I/O 438 is used for input/output functions for a network. Network I/O 438 may be used during execution of a game, such as when a game is being played online or being accessed online, application of fraud detection, and/or generation of a fraud detection model.
Display output signals produced by display I/O 436 comprise signals for displaying visual content produced by computing device 410 on a display device, such as graphics, user interfaces, video, and/or other visual content. Computing device 410 may comprise one or more integrated displays configured to receive display output signals produced by display I/O 436. According to some embodiments, display output signals produced by display I/O 436 may also be output to one or more display devices external to computing device 410.
The computing device 410 can also include other features that may be used with a video game, such as a clock 440, flash memory 442, and other components. An audio/video player 456 might also be used to play a video sequence, such as a movie. It should be understood that other components may be provided in computing device 410 and that a person skilled in the art will appreciate other variations of computing device 410.
Program code can be stored in ROM 446, RAM 448 or storage 440 (which might comprise a hard disk, other magnetic storage, optical storage, other non-volatile storage or a combination or variation of these). Part of the program code can be stored in ROM that is programmable (ROM, PROM, EPROM, EEPROM, and so forth), and part of the program code can be stored in storage 440, and/or on removable media such as game media 412 (which can be a CD-ROM, cartridge, memory chip or the like, or obtained over a network or other electronic channel as needed). In general, program code can be found embodied in a tangible non-transitory signal-bearing medium.
Random access memory (RAM) 448 (and possibly other storage) is usable to store variables and other game and processor data as needed. RAM 448 is used and holds data that is generated during the execution of an application and portions thereof might also be reserved for frame buffers, application state information, and/or other data needed or usable for interpreting user input and generating display outputs. Generally, RAM 448 is volatile storage and data stored within RAM 448 may be lost when the computing device 410 is turned off or loses power.
As computing device 410 reads game media 412 and provides an application, information may be read from game media 412 and stored in a memory device, such as RAM 448. Additionally, data from storage 440, ROM 446, servers accessed via a network (not shown), or removable storage media 444 may be read and loaded into RAM 448. Although data is described as being found in RAM 448, it will be understood that data does not have to be stored in RAM 448 and may be stored in other memory accessible to processing unit 420 or distributed among several media, such as game media 412 and storage 440.
It is to be understood that not necessarily all objects or advantages may be achieved in accordance with any particular embodiment described herein. Thus, for example, those skilled in the art will recognize that certain embodiments may be configured to operate in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other objects or advantages as may be taught or suggested herein.
All of the processes described herein may be embodied in, and fully automated, via software code modules executed by a computing system that includes one or more computers or processors. The code modules may be stored in any type of non-transitory computer-readable medium or other computer storage device. Some or all the methods may be embodied in specialized computer hardware.
Many other variations than those described herein will be apparent from this disclosure. For example, depending on the embodiment, certain acts, events, or functions of any of the algorithms described herein can be performed in a different sequence or can be added, merged, or left out altogether (for example, not all described acts or events are necessary for the practice of the algorithms). Moreover, in certain embodiments, acts or events can be performed concurrently, for example, through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially. In addition, different tasks or processes can be performed by different machines and/or computing systems that can function together.
The various illustrative logical blocks and modules described in connection with the embodiments disclosed herein can be implemented or performed by a machine, such as a processing unit or processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A processor can be a microprocessor, but in the alternative, the processor can be a controller, microcontroller, or state machine, combinations of the same, or the like. A processor can include electrical circuitry configured to process computer-executable instructions. In another embodiment, a processor includes an FPGA or other programmable device that performs logic operations without processing computer-executable instructions. A processor can also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. Although described herein primarily with respect to digital technology, a processor may also include primarily analog components. For example, some or all of the signal processing algorithms described herein may be implemented in analog circuitry or mixed analog and digital circuitry. A computing environment can include any type of computer system, including, but not limited to, a computer system based on a microprocessor, a mainframe computer, a digital signal processor, a portable computing device, a device controller, or a computational engine within an appliance, to name a few.
Conditional language such as, among others, “can,” “could,” “might” or “may,” unless specifically stated otherwise, are understood within the context as used in general to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
Disjunctive language such as the phrase “at least one of X, Y, or Z,” unless specifically stated otherwise, is understood with the context as used in general to present that an item, term, etc., may be either X, Y, or Z, or any combination thereof (for example, X, Y, and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y, or at least one of Z to each be present.
Any process descriptions, elements or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or elements in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown, or discussed, including substantially concurrently or in reverse order, depending on the functionality involved as would be understood by those skilled in the art.
Unless otherwise explicitly stated, articles such as “a” or “an” should generally be interpreted to include one or more described items. Accordingly, phrases such as “a device configured to” are intended to include one or more recited devices. Such one or more recited devices can also be collectively configured to carry out the stated recitations. For example, “a processor configured to carry out recitations A, B and C” can include a first processor configured to carry out recitation A working in conjunction with a second processor configured to carry out recitations B and C.
It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure.
Number | Name | Date | Kind |
---|---|---|---|
5274801 | Gordon | Dec 1993 | A |
5548798 | King | Aug 1996 | A |
5982389 | Guenter et al. | Nov 1999 | A |
5999195 | Santangeli | Dec 1999 | A |
6064808 | Kapur et al. | May 2000 | A |
6088040 | Oda et al. | Jul 2000 | A |
6253193 | Ginter et al. | Jun 2001 | B1 |
6556196 | Blanz et al. | Apr 2003 | B1 |
6961060 | Mochizuki et al. | Nov 2005 | B1 |
7006090 | Mittring | Feb 2006 | B2 |
7403202 | Nash | Jul 2008 | B1 |
7415152 | Jiang et al. | Aug 2008 | B2 |
7944449 | Petrovic et al. | May 2011 | B2 |
8100770 | Yamazaki et al. | Jan 2012 | B2 |
8142282 | Canessa et al. | Mar 2012 | B2 |
8154544 | Cameron et al. | Apr 2012 | B1 |
8207971 | Koperwas et al. | Jun 2012 | B1 |
8267764 | Aoki et al. | Sep 2012 | B1 |
8281281 | Smyrl et al. | Oct 2012 | B1 |
8395626 | Millman | Mar 2013 | B2 |
8398476 | Sidhu et al. | Mar 2013 | B1 |
8406528 | Hatwich | Mar 2013 | B1 |
8540560 | Crowley et al. | Sep 2013 | B2 |
8599206 | Hodgins et al. | Dec 2013 | B2 |
8624904 | Koperwas et al. | Jan 2014 | B1 |
8648863 | Anderson et al. | Feb 2014 | B1 |
8860732 | Popovic et al. | Oct 2014 | B2 |
8914251 | Ohta | Dec 2014 | B2 |
9067097 | Lane et al. | Jun 2015 | B2 |
9117134 | Geiss et al. | Aug 2015 | B1 |
9177409 | Rennuit et al. | Nov 2015 | B2 |
9208613 | Mukai | Dec 2015 | B2 |
9256973 | Koperwas et al. | Feb 2016 | B2 |
9317954 | Li et al. | Apr 2016 | B2 |
9483860 | Hwang et al. | Nov 2016 | B2 |
9616329 | Szufnara et al. | Apr 2017 | B2 |
9741146 | Nishimura | Aug 2017 | B1 |
9811716 | Kim et al. | Nov 2017 | B2 |
9826898 | Jin et al. | Nov 2017 | B1 |
9827496 | Zinno | Nov 2017 | B1 |
9858700 | Rose et al. | Jan 2018 | B2 |
9928663 | Eisemann et al. | Mar 2018 | B2 |
9947123 | Green | Apr 2018 | B1 |
9984658 | Bonnier et al. | May 2018 | B2 |
9987749 | Nagendran et al. | Jun 2018 | B2 |
9990754 | Waterson et al. | Jun 2018 | B1 |
10022628 | Matsumiya et al. | Jul 2018 | B1 |
10096133 | Andreev | Oct 2018 | B1 |
10118097 | Stevens | Nov 2018 | B2 |
10163001 | Kim et al. | Dec 2018 | B2 |
10198845 | Bhat et al. | Feb 2019 | B1 |
10297066 | Brewster | May 2019 | B2 |
10314477 | Goodsitt et al. | Jun 2019 | B1 |
10388053 | Carter, Jr. et al. | Aug 2019 | B1 |
10403018 | Worsham | Sep 2019 | B1 |
10535174 | Rigiroli et al. | Jan 2020 | B1 |
10726611 | Court | Jul 2020 | B1 |
10733765 | Andreev | Aug 2020 | B2 |
10755466 | Chamdani et al. | Aug 2020 | B2 |
10792566 | Schmid | Oct 2020 | B1 |
10810780 | Hutchinson et al. | Oct 2020 | B2 |
10818065 | Saito et al. | Oct 2020 | B1 |
10856733 | Anderson et al. | Dec 2020 | B2 |
10860838 | Elahie et al. | Dec 2020 | B1 |
10878540 | Stevens | Dec 2020 | B1 |
10902618 | Payne et al. | Jan 2021 | B2 |
11062494 | Orvalho et al. | Jul 2021 | B2 |
11113860 | Rigiroli et al. | Sep 2021 | B2 |
11217003 | Akhoundi et al. | Jan 2022 | B2 |
11232621 | Akhoundi et al. | Jan 2022 | B2 |
11295479 | Andreev | Apr 2022 | B2 |
20020054054 | Sanbe | May 2002 | A1 |
20020089504 | Merrick et al. | Jul 2002 | A1 |
20020180739 | Reynolds et al. | Dec 2002 | A1 |
20030038818 | Tidwell | Feb 2003 | A1 |
20040027352 | Minakuchi | Feb 2004 | A1 |
20040227760 | Anderson et al. | Nov 2004 | A1 |
20040227761 | Anderson et al. | Nov 2004 | A1 |
20050237550 | Hu | Oct 2005 | A1 |
20060036514 | Steelberg et al. | Feb 2006 | A1 |
20060061574 | Ng-Thow-Hing et al. | Mar 2006 | A1 |
20060149516 | Bond et al. | Jul 2006 | A1 |
20060217945 | Leprevost | Sep 2006 | A1 |
20060262113 | Leprevost | Nov 2006 | A1 |
20060262114 | Leprevost | Nov 2006 | A1 |
20070085851 | Muller et al. | Apr 2007 | A1 |
20070097125 | Xie et al. | May 2007 | A1 |
20080049015 | Elmieh et al. | Feb 2008 | A1 |
20080111831 | Son et al. | May 2008 | A1 |
20080152218 | Okada | Jun 2008 | A1 |
20080268961 | Brook | Oct 2008 | A1 |
20080316202 | Zhou et al. | Dec 2008 | A1 |
20090066700 | Harding et al. | Mar 2009 | A1 |
20090315839 | Wilson et al. | Dec 2009 | A1 |
20100134501 | Lowe et al. | Jun 2010 | A1 |
20100251185 | Pattenden | Sep 2010 | A1 |
20100277497 | Dong et al. | Nov 2010 | A1 |
20110012903 | Girard | Jan 2011 | A1 |
20110074807 | Inada et al. | Mar 2011 | A1 |
20110086702 | Borst et al. | Apr 2011 | A1 |
20110119332 | Marshall et al. | May 2011 | A1 |
20110128292 | Ghyme et al. | Jun 2011 | A1 |
20110164831 | Van Reeth et al. | Jul 2011 | A1 |
20110187731 | Tsuchida | Aug 2011 | A1 |
20110269540 | Gillo et al. | Nov 2011 | A1 |
20110292055 | Hodgins et al. | Dec 2011 | A1 |
20120083330 | Ocko | Apr 2012 | A1 |
20120115580 | Hornik et al. | May 2012 | A1 |
20120220376 | Takayama et al. | Aug 2012 | A1 |
20120244941 | Ostergren et al. | Sep 2012 | A1 |
20120303343 | Sugiyama et al. | Nov 2012 | A1 |
20120313931 | Matsuike et al. | Dec 2012 | A1 |
20130050464 | Kang | Feb 2013 | A1 |
20130063555 | Matsumoto et al. | Mar 2013 | A1 |
20130120439 | Harris et al. | May 2013 | A1 |
20130121618 | Yadav | May 2013 | A1 |
20130222433 | Chapman et al. | Aug 2013 | A1 |
20130235045 | Corazza et al. | Sep 2013 | A1 |
20130263027 | Petschnigg et al. | Oct 2013 | A1 |
20130311885 | Wang et al. | Nov 2013 | A1 |
20140002463 | Kautzman et al. | Jan 2014 | A1 |
20140066196 | Crenshaw | Mar 2014 | A1 |
20140198106 | Sumner et al. | Jul 2014 | A1 |
20140198107 | Thomaszewski et al. | Jul 2014 | A1 |
20140267312 | Powell | Sep 2014 | A1 |
20140327694 | Cao et al. | Nov 2014 | A1 |
20140340644 | Haine et al. | Nov 2014 | A1 |
20150113370 | Flider | Apr 2015 | A1 |
20150126277 | Aoyagi | May 2015 | A1 |
20150187113 | Rubin et al. | Jul 2015 | A1 |
20150235351 | Mirbach et al. | Aug 2015 | A1 |
20150243326 | Pacurariu et al. | Aug 2015 | A1 |
20150381925 | Varanasi et al. | Dec 2015 | A1 |
20160026926 | Yeung et al. | Jan 2016 | A1 |
20160042548 | Du et al. | Feb 2016 | A1 |
20160071470 | Kim et al. | Mar 2016 | A1 |
20160078662 | Herman et al. | Mar 2016 | A1 |
20160217723 | Kim et al. | Jul 2016 | A1 |
20160307369 | Freedman et al. | Oct 2016 | A1 |
20160314617 | Forster et al. | Oct 2016 | A1 |
20160354693 | Yan et al. | Dec 2016 | A1 |
20170132827 | Tena et al. | May 2017 | A1 |
20170301310 | Bonnier et al. | Oct 2017 | A1 |
20170301316 | Farell | Oct 2017 | A1 |
20180024635 | Kaifosh | Jan 2018 | A1 |
20180122125 | Brewster | May 2018 | A1 |
20180165864 | Jin et al. | Jun 2018 | A1 |
20180211102 | Alsmadi | Jul 2018 | A1 |
20180239526 | Varanasi et al. | Aug 2018 | A1 |
20190121306 | Kaifosh | Apr 2019 | A1 |
20190325633 | Miller, IV et al. | Oct 2019 | A1 |
20190392587 | Nowozin et al. | Dec 2019 | A1 |
20200051304 | Choi et al. | Feb 2020 | A1 |
20200226811 | Kim et al. | Jul 2020 | A1 |
20200258280 | Park et al. | Aug 2020 | A1 |
20200294299 | Rigiroli et al. | Sep 2020 | A1 |
20200302668 | Guo et al. | Sep 2020 | A1 |
20200306640 | Kolen et al. | Oct 2020 | A1 |
20200310541 | Reisman | Oct 2020 | A1 |
20200364303 | Liu | Nov 2020 | A1 |
20210019916 | Andreev | Jan 2021 | A1 |
20210074004 | Wang et al. | Mar 2021 | A1 |
20210097266 | Mangalam | Apr 2021 | A1 |
20210217184 | Payne et al. | Jul 2021 | A1 |
20210252403 | Stevens | Aug 2021 | A1 |
20210255304 | Fontijne | Aug 2021 | A1 |
20210308580 | Akhoundi | Oct 2021 | A1 |
20210312688 | Akhoundi et al. | Oct 2021 | A1 |
20210312689 | Akhoundi et al. | Oct 2021 | A1 |
20210335039 | Jones et al. | Oct 2021 | A1 |
20210390789 | Liu et al. | Dec 2021 | A1 |
20220020195 | Kuta et al. | Jan 2022 | A1 |
20220051003 | Niinuma et al. | Feb 2022 | A1 |
20220138455 | Nagano et al. | May 2022 | A1 |
20220198733 | Akhoundi et al. | Jun 2022 | A1 |
Number | Date | Country |
---|---|---|
102509272 | Jun 2012 | CN |
103546736 | Jan 2014 | CN |
105405380 | Mar 2016 | CN |
105825778 | Aug 2016 | CN |
2018-520820 | Aug 2018 | JP |
2019-162400 | Sep 2019 | JP |
Entry |
---|
Habibie et al., “A Recurrent Variational Autoencoder for Human Motion Synthesis”, 2017, in 12 pages. |
Anagnostopoulos et al., “Intelligent modification for the daltonization process”, International Conference on Computer Vision Published in 2007 by Applied Computer Science Group of digitized paintings. |
Andersson, S., Goransson, J.: Virtual Texturing with WebGL. Master's thesis, Chalmers University of Technology, Gothenburg, Sweden (2012). |
Avenali, Adam, “Color Vision Deficiency and Video Games”, The Savannah College of Art and Design, Mar. 2013. |
Badlani et al., “A Novel Technique for Modification of Images for Deuteranopic Viewers”, May 2016. |
Belytschko et al., “Assumed strain stabilization of the eight node hexahedral element,” Computer Methods in Applied Mechanics and Engineering, vol. 105(2), pp. 225-260 (1993), 36 pages. |
Belytschko et al., Nonlinear Finite Elements for Continua and Structures, Second Edition, Wiley (Jan. 2014), 727 pages (uploaded in 3 parts). |
Blanz V, Vetter T. A morphable model for the synthesis of 3D faces. In Proceedings of the 26th annual conference on Computer graphics and interactive techniques Jul. 1, 1999 (pp. 187-194). ACM Press/Addison-Wesley Publishing Co. |
Blanz et al., “Reanimating Faces in Images and Video” Sep. 2003, vol. 22, No. 3, pp. 641-650, 10 pages. |
Chao et al., “A Simple Geometric Model for Elastic Deformations”, 2010, 6 pgs. |
Cook et al., Concepts and Applications of Finite Element Analysis, 1989, Sections 6-11 through 6-14. |
Cournoyer et al., “Massive Crowd on Assassin's Creed Unity: AI Recycling,” Mar. 2, 2015, 55 pages. |
Dick et al., “A Hexahedral Multigrid Approach for Simulating Cuts in Deformable Objects”, IEEE Transactions on Visualization and Computer Graphics, vol. X, No. X, Jul. 2010, 16 pgs. |
Diziol et al., “Robust Real-Time Deformation of Incompressible Surface Meshes”, to appear in Proceedings of the 2011 ACM SIGGRAPH/Eurographics Symposium on Computer Animation (2011), 10 pgs. |
Dudash, Bryan. “Skinned instancing.” NVidia white paper(2007). |
Fikkan, Eirik. Incremental loading of terrain textures. MS thesis. Institutt for datateknikk og informasjonsvitenskap, 2013. |
Geijtenbeek, T. et al., “Interactive Character Animation using Simulated Physics”, Games and Virtual Worlds, Utrecht University, The Netherlands, The Eurographics Association 2011, 23 pgs. |
Georgii et al., “Corotated Finite Elements Made Fast and Stable”, Workshop in Virtual Reality Interaction and Physical Simulation VRIPHYS (2008), 9 pgs. |
Halder et al., “Image Color Transformation for Deuteranopia Patients using Daltonization”, IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) vol. 5, Issue 5, Ver. I (Sep.-Oct. 2015), pp. 15-20. |
Han et al., “On-line Real-time Physics-based Predictive Motion Control with Balance Recovery,” Eurographics, vol. 33(2), 2014, 10 pages. |
Hernandez, Benjamin, et al. “Simulating and visualizing real-time crowds on GPU clusters.” Computaci6n y Sistemas 18.4 (2014): 651-664. |
Hu G, Chan CH, Yan F, Christmas W, Kittier J. Robust face recognition by an albedo based 3D morphable model. In Biometrics (IJCB), 2014 IEEE International Joint Conference on Sep. 29, 2014 (pp. 1-8). IEEE. |
Hu Gousheng, Face Analysis using 3D Morphable Models, Ph.D. Thesis, University of Surrey, Apr. 2015, pp. 1-112. |
Irving et al., “Invertible Finite Elements for Robust Simulation of Large Deformation”, Eurographics/ACM SIGGRAPH Symposium on Computer Animation (2004), 11 pgs. |
Kaufmann et al., “Flexible Simulation of Deformable Models Using Discontinuous Galerkin FEM”, Oct. 1, 2008, 20 pgs. |
Kavan et al., “Skinning with Dual Quaternions”, 2007, 8 pgs. |
Kim et al., “Long Range Attachments—A Method to Simulate Inextensible Clothing in Computer Games”, Eurographics/ACM SIGGRAPH Symposium on Computer Animation (2012), 6 pgs. |
Klein, Joseph. Rendering Textures Up Close in a 3D Environment Using Adaptive Micro-Texturing. Diss. Mills College, 2012. |
Komura et al., “Animating reactive motion using momentum-based inverse kinematics,” Computer Animation and Virtual Worlds, vol. 16, pp. 213-223, 2005, 11 pages. |
Lee, Y. et al., “Motion Fields for Interactive Character Animation”, University of Washington, Bungie, Adobe Systems, 8 pgs, obtained Mar. 20, 2015. |
Levine, S. et al., “Continuous Character Control with Low-Dimensional Embeddings”, Stanford University, University of Washington, 10 pgs, obtained Mar. 20, 2015. |
Macklin et al., “Position Based Fluids”, to appear in ACM TOG 32(4), 2013, 5 pgs. |
Mcadams et al., “Efficient Elasticity for Character Skinning with Contact and Collisions”, 2011, 11 pgs. |
McDonnell, Rachel, et al. “Clone attack! perception of crowd variety.” ACM Transactions on Graphics (TOG). vol. 27. No. 3. ACM, 2008. |
Muller et al., “Meshless Deformations Based on Shape Matching”, SIGGRAPH 2005, 29 pgs. |
Muller et al., “Adding Physics to Animated Characters with Oriented Particles”, Workshop on Virtual Reality Interaction and Physical Simulation VRIPHYS (2011), 10 pgs. |
Muller et al., “Real Time Dynamic Fracture with Columetric Approximate Convex Decompositions”, ACM Transactions of Graphics, Jul. 2013, 11 pgs. |
Muller et al., “Position Based Dymanics”, VRIPHYS 2006, Oct. 21, 2014, Computer Graphics, Korea University, 23 pgs. |
Musse, Soraia Raupp, and Daniel Thalmann. “Hierarchical model for real time simulation of virtual human crowds.” IEEE Transactions on Visualization and Computer Graphics 7.2 (2001): 152-164. |
Nguyen et al., “Adaptive Dynamics With Hybrid Response,” 2012, 4 pages. |
O'Brien et al., “Graphical Modeling and Animation of Brittle Fracture”, GVU Center and College of Computing, Georgia Institute of Technology, Reprinted from the Proceedings of ACM SIGGRAPH 99, 10 pgs, dated 1999. |
Orin et al., “Centroidal dynamics of a humanoid robot,” Auton Robot, vol. 35, pp. 161-176, 2013, 18 pages. |
Parker et al., “Real-Time Deformation and Fracture in a Game Environment”, Eurographics/ACM SIGGRAPH Symposium on Computer Animation (2009), 12 pgs. |
Pelechano, Nuria, Jan M. Allbeck, and Norman I. Badler. “Controlling individual agents in high-density crowd simulation.” Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation. Eurographics Association, 2007. APA. |
Rivers et al., “FastLSM: Fast Lattice Shape Matching for Robust Real-Time Deformation”, ACM Transactions on Graphics, vol. 26, No. 3, Article 82, Publication date: Jul. 2007, 6 pgs. |
Ruiz, Sergio, et al. “Reducing memory requirements for diverse animated crowds.” Proceedings of Motion on Games. ACM, 2013. |
Rungjiratananon et al., “Elastic Rod Simulation by Chain Shape Matching withTwisting Effect” SIGGRAPH Asia 2010, Seoul, South Korea, Dec. 15-18, 2010, ISBN 978-1-4503-0439-9/10/0012, 2 pgs. |
Seo et al., “Compression and Direct Manipulation of Complex Blendshape Models”, Dec. 2011, in 10 pgs. |
Sifakis, Eftychios D., “FEM Simulations of 3D Deformable Solids: A Practioner's Guide to Theory, Discretization and Model Reduction. Part One: The Classical FEM Method and Discretization Methodology”, SIGGRAPH 2012 Course, Version 1.0 [Jul. 10, 2012], 50 pgs. |
Stomakhin et al., “Energetically Consistent Invertible Elasticity”, Eurographics/ACM SIGRAPH Symposium on Computer Animation (2012), 9 pgs. |
Thalmann, Daniel, and Soraia Raupp Musse. “Crowd rendering.” Crowd Simulation. Springer London, 2013. 195-227. |
Thalmann, Daniel, and Soraia Raupp Musse. “Modeling of Populations.” Crowd Simulation. Springer London, 2013. 31-80. |
Treuille, A. et al., “Near-optimal Character Animation with Continuous Control”, University of Washington, 2007, 7 pgs. |
Ulicny, Branislav, and Daniel Thalmann. “Crowd simulation for interactive virtual environments and VR training systems.” Computer Animation and Simulation 2001 (2001 ): 163-170. |
Vaillant et al., “Implicit Skinning: Real-Time Skin Deformation with Contact Modeling”, (2013) ACM Transactions on Graphics, vol. 32 (n°4). pp. 1-11. ISSN 0730-0301, 12 pgs. |
Vigueras, Guillermo, et al. “A distributed visualization system for crowd simulations.” Integrated Computer-Aided Engineering 18.4 (2011 ): 349-363. |
Wu et al., “Goal-Directed Stepping with Momentum Control,” Eurographics/ ACM SIGGRAPH Symposium on Computer Animation, 2010, 6 pages. |
Number | Date | Country | |
---|---|---|---|
20210308580 A1 | Oct 2021 | US |