NEURAL NETWORK

PRIOR APPLICATION

[0001] This application claims the benefit of U.S. Provisional Patent Application Serial No. 62/833,085, filed on April 12, 2019, which is incorporated by reference in its entirety.

FIELD OF THE DISCLOSURE

[0002] The present disclosure relates generally to the task of estimating a human hand pose from a depth camera frame.

BACKGROUND

[0003] A number of depth camera technologies exist. Time of flight image sensors measure the phase of a uniform square wave infrared illuminator. Structured light image sensors project a pattern, such as a grid of dots. The location of the dots in the projected space are used to estimate depth. Stereo cameras use two image sensors with offset lenses. As an example, Figure 1 shows a single frame 100 from a time-of-flight camera where depth pixels are captured from the image sensor. Pixel intensity represents the distance between the sensor and the scene. (This figure 1 and figures 3, 4, 5 were plotted using Matplotlb: http s ://matpl otlib . or /#citi n -matplot lib.)

[0004] Recent hand pose estimation algorithms may be divided into two categories: generative iterative 3D spatial model fitting-based approaches and supervised-leaming based discriminative approaches. As stated by Oberweger, Wohlhart, Lepetit, 2015, Hands Deep in Deep Learning for Hand Pose Estimation (“Oberweger I”): “Here we will discuss only more recent work, which can be divided into two main approaches . . . The first approach is based on generative, model based tracking methods. . . . The second type of approach is discriminative, and aims at directly predicting the locations of the joints from RGB or RGB-D images.”

[0005] Iterative 3D model fitting algorithms tend to use the previous frame or a discriminative algorithm for initialization. An example of the combined discriminative approach is the work by Sharp et al. that uses a per-pixel decision jungle— trained on synthetic depth frames— to initialize a particle swarm optimization algorithm that iteratively attempts to minimize the error between the pixels of the captured frame and a rendered synthetic frame of the pose. (Sharp. 2015. Handpose Fully Articulated Hand Tracking). An issue with this approach is that it is heavy on computing resources and requires a GPU to run at real-time. However, Taylor et al. has shown in 2 articles that it is feasible to run an iterative 3D model fitting algorithm on a CPU by using a smooth differentiable surface model instead of rendering the hand model. (Jonathan Taylor. Efficient and Precise Interactive Hand Tracking Through Joint, Continuous Optimization of Pose and Correspondences; Jonathan Taylor. 2017. Articulated Distance Fields for Ultra-Fast Tracking of Hands Interacting).

[0006] With recent advances in convolutional neural network (CNN) models, it has also been shown that high accuracy can be achieved without an expensive iterative 3D model fitting stage. Rad et al (“Rad”) uses a CNN to achieve state-of-the-art accuracy hand pose estimation without the need for a generative fitting stage in the real-time pipeline. (Rad, Oberweger, Lepetit. 2017. Feature Mapping for Learning Fast and Accurate 3D Pose Inference from Synthetic Images.)

[0007] Training a CNN requires a large labeled dataset. (See, for example, Shanxin Yuan. 2017. BigHand2.2M Benchmark: Hand Pose Dataset and State of the Art Analysis (“Shanxin”)) (dataset includes 2.2 million depth maps with accurately annotated joint locations). Obtaining such a large labeled dataset is a major challenge. It is important that the depth frames in the training dataset represents the target domain of the depth frames used at inference time. The target domain is dependent on the model of depth camera, the surrounding environment, camera view, and the shape of the human hand. Human annotation of depth frames in 3D is unfeasibly labor intensive, and the process needs to be repeated each time the domain of the depth frame changes. A more feasible solution is to use an optical marker or electromagnetic based tracking system. (See Shanxin:“We propose a tracking system with six 6D magnetic sensors and inverse kinematics to automatically obtain 21 -joints hand pose annotations of depth maps captured with minimal restriction on the range of motion.”). These methods have their own limitations, however, such as the markers also being visible to the depth camera and drift of an

electromagnetic tracking system. Even if these limitations could be mitigated, capturing a large hand pose dataset would be time consuming and therefore limited to a small set of camera models, environments, and hands.

[0008] Another more practical solution is to use a semi-manual process where the pose annotation is initialized by either a human or the preceding frame, and then optimized using a iterative 3D model fitting optimization technique that minimizes error between the camera sampled point cloud and a synthetic 3D hand model. Examples include: [0009] A. Intel Realsense Hand Tracking Samples,

https://gith13b.com/IntelRealSense/band tracking samples Stan Melax. 2017. “This realtime- annotator utility application is provided for the purposes of recording real-time camera streams alongside auto-labeled ground-truth images of hand poses as estimated by the dynamics-based tracker. Sequences are recorded using a simple file-format consumable by other projects in this repository. . . . annotation-fixer. As CNNs require a volume of accurate, diverse data to produce meaningful output, this tool provides an interface for correcting anomalous hand poses captured using the hand- annotation utility.”

[0010] B. Dynamics Based 3D Skeletal Hand Tracking, Stan Melax. 2017:“Instead of using dynamics as an isolated step in the pipeline, such as the way an inverse kinematic solver would be applied only after placement of key features is somehow decided, our approach fits the hand to the depth data (or point cloud) by extending a physics system through adding additional constraints. Consequently, fitting the sensor data, avoiding interpenetrating fingers, preserving joint ranges, and exploiting temporal coherence and momentum are all constraints computed simultaneously in a unified solver”

[0011] C. Tompson et al. Real-Time Continuous Pose Recovery of Human Hands Using Convolutional Networks:“In this work, we present a solution to the difficult problem of inferring the continuous pose of a human hand by first constructing an accurate database of labeled ground-truth data in an automatic process, and then training a system capable of real time inference. Since the human hand represents a particularly difficult kind of articulable object to track, we believe our solution is applicable to a wide range of articulable objects.”

[0012] These semi-manual techniques are similar to the combined discriminative and generative techniques discussed above, except they are run offline without the real-time constraint.

[0013] It is possible to make use of a dataset in a domain where abundant labeled frames are available to train a neural network that performs well in a domain where limited labeled frames are available. One example is Ganin, Ajakan, Larochelle, Marchand. 2017. Domain-Adversarial Training of Neural Networks (“Ganin I”), which states:“We introduce a new representation learning approach for domain adaptation, in which data at training and test time come from similar but different distributions. Our approach is directly inspired by the theory on domain adaption suggesting that, for effective domain transfer to be achieved, predictions must be made based on features that cannot discriminate between the training (source) and test (target) domains. The approach implements this idea in the context of neural network architectures that are trained on labeled data from the source domain and unlabeled data from the target domain (no labeled target-domain data is necessary). As the training progresses, the approach promotes the emergence of features that are (I) discriminative for the main learning task on the source domain and (ii) indiscriminate with respect to the shift between the domains. We show that this adaption behavior can be achieved in almost any feed-forward model by augmenting it with few standard layers and a new gradient reversal layer. The resulting augmented architecture can be trained using standard backpropagation and stochastic gradient descent, and can thus be implemented with little effort using any of the deep learning packages.”

[0014] Another example is Ganin, Lempitsky. 2015. Unsupervised Domain Adaptation by Backpropagation (“Ganin II”), which states:“At training time, in order to obtain domain- invariant features, we seek the parameters of the feature mapping that maximize the loss of the domain classifier (by making the two feature distributions as similar as possible), while simultaneously seeking the parameters of the domain classifier that minimize the loss of the domain classifier. In addition, we seek to minimize the loss of the label predictor.”

[0015] Another example is Ashish Shrivastava. 2016. Learning from Simulated and

Unsupervised Images through Adversarial Training, which states:“With recent progress in graphics, it has become more tractable to train models on synthetic images, potentially avoiding the need for expensive annotations. However, learning from synthetic images may not achieve the desired performance due to a gap between synthetic and real image distributions. To reduce this gap, we propose Simulated+Unsupervised (S+U) learning, where the task is to learn a model to improve the realism of a simulator’s output using unlabeled real data, while preserving the annotation information from the simulator. We develop a method for S+U learning that uses an adversarial network similar to Generative Adversarial Networks (GANs), but with synthetic images as inputs instead of random vectors.”

[0016] Another example is Konstantinos Bousmalis. 2016. Domain Separation Networks, which states:“The cost of large scale data collection and annotation often makes the application of machine learning algorithms to new tasks or datasets prohibitively expensive. One approach circumventing this cost is training models on synthetic data where annotations are provided automatically. Despite their appeal, such models often fail to generalize from synthetic to real images, necessitating domain adaptation algorithms to manipulate these models before they can be successfully applied. Existing approaches focus either on mapping representations from one domain to the other, or on learning to extract features that are invariant to the domain from which they were extracted. However, by focusing only on creating a mapping or shared representation between the two domains, they ignore the individual characteristics of each domain. We suggest that explicitly modeling what is unique to each domain can improve a model’s ability to extract domain-invariant features.”

[0017] Another example is Eric Tzeng. 2017. Adversarial Discriminative Domain Adaptation, which states:“We propose an improved unsupervised domain adaptation method that combines adversarial learning with discriminative feature learning. Specifically, we learn a discriminative mapping of target images to the source feature space (target encoder) by fooling a domain discriminator that tries to distinguish the encoded target images from source examples.”

[0018] Computer graphics rendering techniques can be used to render a very large dataset of labeled synthetic depth frames. Training in only the synthetic frame domain does not necessarily generalize to a model that performs well in the real depth camera frame domain. However, it has been shown that it is possible to make use of a small labeled real frame dataset alongside a large synthetic frame dataset to achieve a model estimation accuracy in the real domain that is higher than achievable by training on each dataset alone. (See Rad).

SUMMARY

[0019] The solution proposed herein is to solve the large labeled dataset challenge by using a domain adaptation technique to train a discriminative model such as a convolutional neural network or“CNN” using an iterative 3D model fitting generative algorithm such as a genetic algorithm or“GA” at training time to refine target domain labels. The neural network supports the convergence of the genetic algorithm, and the genetic algorithm model provides refined labels that are used to train the neural network. During real-time inference, only the trained neural network is required. First, using a technique similar to Ganin I and Ganin II, a CNN is trained using labeled synthetic frames (source domain) in addition to unlabeled real depth frames (target domain). Next, the CNN initializes an offline iterative 3D model fitting algorithm that is capable of accurately labeling the hand pose in real depth frames (target domain). The labeled real depth frames are then used to continue training the CNN, improving accuracy beyond that achievable by using only unlabeled real depth frames for domain adaptation. The merits of this approach are that no manual effort is required to label depth frames and the 3D model fitting algorithm does not have any real-time constraints.

BRIEF DESCRIPTION OF THE FIGURES

[0020] The accompanying figures, where like reference numerals refer to identical or functionally similar elements throughout the separate views, together with the detailed description below, are incorporated in and form part of the specification, serve to further illustrate embodiments of concepts that include the claimed invention and explain various principles and advantages of those embodiments.

[0021] Figure 1 shows depth pixels captured from a time of flight image sensor.

[0022] Figure 2 shows a block diagram of the training process.

[0023] Figure 3 shows random samples of generated synthetic frames cropped on a region of interest (ROI).

[0024] Figure 4 shows a genetic algorithm converging to a good pose after 41 generations.

[0025] Figure 5 shows a random sample of real frames cropped on ROI.

[0026] Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of embodiments of the present invention.

[0027] The apparatus and method components have been represented where appropriate by conventional symbols in the drawings, showing only those specific details that are pertinent to understanding the embodiments of the present invention so as not to obscure the disclosure with details that will be readily apparent to those of ordinary skill in the art having the benefit of the description herein.

DETAILED DESCRIPTION

[0028] The offline model training system can be split into two main subsystems that support each other: The discriminative model (neural network) that infers a pose from a single depth frame, and the generative 3D model fitting algorithm (genetic algorithm) that iteratively refines the 3D pose. The neural network is used to initialize the genetic algorithm, and the genetic algorithm is used to provide accurate labels in the target domain that are used for training the neural network. This presents the problem where each subsystem requires the output from the other subsystem. This problem is solved by using synthetically rendered labeled frames to initially train the neural network. During real-time pose estimation, only the neural network is used for inference.

[0029] Model Training

[0030] Figure 2 shows the high-level system block diagram 200 of the training process using a depth camera 205. A neural network 207 is trained and the output from the neural network is used to initialize an iterative 3D model fitting process 230. The 3D model fitting process is used to update 291 the real frame key-point labels in the real depth frame database 225 that are used to train the neural network.

[0031] Figure 2 includes four types of interfaces as shown by arrow type: A) black line arrows represent depth frames, poses, domain classes, and activations; B) dashed line arrows represent back-propagation of error gradients; C) the dotted line arrow represents error feedback; and D) the dotted/dashed line arrow represents feedback of the refined real frame pose labels.

[0032] A) The following interfaces are related to depth frames, poses, domain classes, and activations:

[0033] The depth camera 205 interfaces with the depth frame and best fit pose database 225.

[0034] A random pose generator 209 interfaces with a forward kinematic model and hand Tenderer 211, which then interfaces with a real/synthetic multiplexer 213. Also interfacing with the real/synthetic multiplexer 213 is a depth frame and best fit pose database 225.

[0035] The real/synthetic multiplexer 213 interfaces with a ROI crop and resample submodule 215, which is part of a module 290 consisting of the ROI crop and resample submodule 215, a feature extractor neural network submodule 217, a pose key-point estimator neural network submodule 219 and an uncrop ROI and inverse projection transform submodule 223. Each of these submodules interfaces with the next.

[0036] Further, the ROI crop and resample submodule 215 and the pose key-point estimator neural network submodule 219 interface with a pose key-point loss function 221.

[0037] Further, the domain class from the real / synthetic multiplexer 213 interfaces with a domain discriminator’s loss function 229.

[0038] Further, the feature extractor neural network 217 interfaces with the domain discriminator neural network 227, which also interfaces with the domain discriminator loss function 229.

[0039] The uncrop ROI and inverse projection transform submodule 223 then interfaces with the iterative 3D model fitting process 230. This is accomplished by interfacing with a heuristic hand pose optimization submodule (genetic algorithm) 238, which interfaces with a pose angle estimator neural network (inverse kinematic model) 240, which interfaces with a pose angle loss function 236.

[0040] Further, a random pose generator 232 interfaces with a forward kinematic model 234 and the pose angle loss function 236. [0041] Further, the forward kinematic model 234 interfaces with the pose angle estimator (inverse kinematic model) 240.

[0042] Further, the pose angle estimator (inverse kinematics model) 240 interfaces with a render generative error function 242.

[0043] Finally, the depth frame and best fit database 225 interfaces with the render generative error function 242.

[0044] B) The following interfaces are related to back-propagation of error gradients:

[0045] The domain discriminator 227 interfaces with the feature extractor neural network 217.

[0046] The pose key-point loss function 221 interfaces with the pose key-point estimator neural network 219.

[0047] The domain discriminator loss function 229 interfaces with the domain discriminator 227.

[0048] The pose angle loss function 236 interfaces with the pose angle estimator (inverse kinematic model) 240.

[0049] C) The following interface is related to error feedback: The render generative error function 242 interfaces with the heuristic hand pose optimization (genetic algorithm) 238.

[0050] D) The following interface is related to feedback of refined pose label: The heuristic hand pose optimization (genetic algorithm) 238 interfaces with the depth frame and best fit database 225.

[0051] The stages of training the pose estimator and feature extractor neural networks are:

[0052] Using backpropagation, optimize pose estimator and feature extractor CNNs to minimize key-point error when using only synthetic depth frames. Synthetic frames are cropped using hand-center key-point (with a small random offset) during training.

[0053] 2. Estimate center of hand in unlabeled real depth frames using pose estimation and feature extractor CNNs so that real frames can be cropped.

[0054] 3. Using backpropagation, optimize domain discriminator CNN to estimate if the output from feature extractor CNN is generated from a real or synthetic depth frame.

[0055] 4. Continue to train pose estimation and feature extractor CNNs with both real and synthetic depth frames. Optimize to minimize key-point error for frames with known key-point labels. Optimize the feature extractor CNN so that features extracted from real frames are classified as synthetic by the domain discriminator. By doing this, features that are mostly domain invariant are extracted. [0056] 5. Use pose estimator and feature extractor CNNs with injected noise to generate a pose ensemble for each real depth frame. Use the pose ensemble to initialize a GA. Iteratively update the pose key-point positions to minimize a pose fitness function. To compute the pose fitness, use inverse kinematics to compute the joint angles and then render a synthetic depth frame in a similar pose. The error between the rendered frame and the real frame is used as the pose fitness. Using additional checks, determine if pose converges successfully. For each pose that successfully converges, add the pose label to the real frame database.

[0057] 6. Repeat from step 4, using the labeled real depth frames.

[0058] Random pose Tenderer

[0059] The open-source LibHand library is used for rendering a 3D model of a human hand. LibHand consists of a human hand realistic mesh and an underlying kinematic skeletal model. LibHand is then modified to use the dual quaternion skinning vertex shader of Kavan et ah, which discloses:“Skinning of skeletally deformable models is extensively used for real-time animation of characters, creatures and similar objects. The standard solution, linear blend skinning, has some serious drawbacks that require artist intervention. Therefore, a number of alternatives have been proposed in recent years. All of them successfully combat some of the artifacts, but none challenge the simplicity and efficiency of linear blend skinning. As a result, linear blend skinning is still the number one choice for the majority of developers. In this paper, we present a novel GPU-friendly skinning algorithm based on dual quaternions. We show that this approach solves the artifacts of linear blend skinning at minimal additional cost. Upgrading an existing animation system (e.g., in a videogame) from linear to dual quaternion skinning is very easy and had negligible impact on run-time performance.” (Ladislav Kavan et al. 2007. Skinning with Dual Quaternions. Implementation downloaded from:

https://giihiib.com/t)GRECave/ogre/tree/7de80a748/Sampies /Media/materiais)·

[0060] Accordingly, dual quaternion skinning is used to compute the deformation of the hand mesh vertices as the kinematic skeletal model is articulated. A fragment shader is used to set the pixel color to the depth of the mesh surface. The projection matrix used in the computer graphics pipeline is set to match the intrinsics of the real depth camera that is being modeled.

[0061] To generate realistic poses for the synthetic hand either a rule-based approach or a data- driven approach could be used. It is important that the distribution of sampled poses is similar to the distribution of real poses of a human user. An example of a simple data driven approach could be to sample from a pre-recorded hand pose dataset captured using a mo-cap system. Interpolation could be used to further extend the recorded dataset. An example of a rule-based approach is to model the angle of each joint with a uniform distribution with hard-coded maximum and minimum limits. With both the interpolation and uniform distribution of joint angle approaches, impossible poses could be generated where the hand self-intersects. A mesh collision technique similar to Shome Subhra Das, 2017, Detection of Self Intersection in

Synthetic Hand Pose Generators is used to reject poses that result in the mesh self-intersecting. This reference states:“We propose a method to accurately detect intersections between various hand parts of a synthesized handpose. The hand mesh and the segmented texture image. . . are loaded into the rendering engine . . . . From the vertex buffer of the rendering engine we extract the 3D location of the vertices (V) and the corresponding texture coordinates (T) after the locations of vertices have been modified according to the input joint angles (using LBS

[Location-based services]). We segment the vertices using color label corresponding to each part and find the convex hulls for all the segmented hand parts . . . . The penetration depth between these convex hulls are calculated using GJK-EPA [Gilbert-Johnson-Keerthi expanding polytope] algorithm. We label pairs of hand parts as intersecting if they have negative penetration depth.”

[0062] Accordingly, first, a candidate pose is rendered with a low polygon mesh. For each part of the hand where self-intersection should be checked, a convex polytope is formed from the corresponding vertices. Pairs of polytopes are checked for intersection using the GJK + EPA algorithm that is implemented within Daniel Fiser. libccd: Library for collision detection between two convex shapes tip s ://gi shuh corn/d an fi s/libccd . libccd is library for a collision detection between two convex shapes and implements variation on Gilbert-Johnson-Keerthi algorithm plus Expand Polytope Algorithm (EPA). If any of the checked pairs intersect by more than a fixed threshold the pose is rejected and the process is repeated until a valid pose is found. The valid pose can then be used to render a high polygon mesh.

[0063] Figure 3 shows a random sample 300 of 16 synthetic frames cropped on ROI 301a-301p. Poses are generated using the rule-based approach discussed above, with self-intersecting poses rejected. Gray markers 302a-302p show key-points calculated using the forward kinematic model.

[0064] Region of interest (ROI) cropping

[0065] In order to provide a depth frame input to the CNN that is mostly invariant to hand center location, a ROI cropping technique similar to that implemented by Oberweger I is used.

Oberweger I states:“We extract from the depth map a fixed-size cube centered on the center of mass of this object, and resize it to a 128x128 patch of depth values normalized to [-1, 1]. Points for which the depth is not available— which may happen with structured light sensors for example— or are deeper than the back face of the cube, are assigned a depth of 1. This normalization is important for the CNN in order to be invariant to different distances from the hand to the camera.” First, the ROI center in normalized pixel coordinates, [cu,cv], and depth in world units, cz, is estimated. Next, a fixed size, [b _x ,b _y ], cropping rectangle in world units at the ROI center depth, c _z , is projected to a cropping rectangle in normalized pixels, [b _u ,b _v ]:

[b _u b _v ]— [b _x b _y ]

where / = [f _x ,f _y ] is the camera focal length in normalized pixels. The focal length is determined by the camera optics. Then, depth frame pixels are cropped using the cropping rectangle in normalized pixel space, [b _u , b _v ], centered at [c _u , c _v ]. The cropped frame is resized to a fixed number of pixels using bilinear interpolation. The depth pixel values are normalized by subtracting c and then dividing by a constant, y. Depth pixel values are then clipped to the range [—1,1]. The resized frames are 128 X 128 pixels, and b _x = b _y = b _z = 25 cm.

[0066] It is important that the location of joints, [u, v, z], are also normalized using the same cropping frustum defined by [b _u , b _v , b _z ] and [c _u , c _v , c _z ] :

After the normalized pose key-points, [u _n ,v _n ,z _n ], have been inferred by the CNN, [u,v,z] are calculated using the inverse of the foregoing equation. Figure 2 shows these operations with the module 290 as crop 215 and uncrop 223 blocks at the input and output of the feature extractor 217 and pose estimation neural networks 219.

[0067] Depth frame database

[0068] Depth frames are captured from the target camera and saved, for example, to a HDF5 file. Since this process does not require ground truth pose labels to be captured, the process is very simple. The simplicity of this process will allow a large dataset to be captured in the future. The depth frames are stored in sequential order along with camera metadata including optical intrinsics. [0069] Initially, the unlabeled real frames are used for domain adaptation of the neural network. When the genetic algorithm, that is initialized by the neural network, converges on a good pose for a depth frame, the labels are added to the database. The labeled frames are used for training of the neural network.

[0070] Feature extractor and pose key-point neural networks

[0071] Together, the feature extractor and pose key-point CNNs compute pose key-points from a depth frame ROI. The feature extractor CNN extracts features that contain pose information, while also being mostly domain invariant. The feature extractor CNN input is a 128 x 128 frame and the output is a 31 ^c 31 ^c 64 tensor. An architecture with shortcut connections, similar to the Residual Networks introduced by He et al and applied to hand pose estimation by Oberweger et al (“Oberweger II”) is used.

[0072] He et al. states:“We present a residual learning framework to ease the training of networks that are substantially deeper than those used previously. We explicitly reformulate the layers as learning residual functions with reference to the layer inputs, instead of learning unreferenced functions. We provide comprehensive empirical evidence showing that these residual networks are easier to optimize, and can gain accuracy from considerably increased depth.” (He et al., Deep Residual Learning for Image Recognition.)

[0073] Oberweger II states:“Here we show that with simple improvements: adding ResNet layers, data augmentation, and better initial hand localization, we achieve better or similar performance than more sophisticated recent methods on the three main benchmarks (NYU, ICVL, MSRA) while keeping the simplicity of the original method.” (Oberweger, Lepetit, 2018, Deep Prior Improving Fast and Accurate 3D Hand Pose Estimation.)

[0074] A residual convolution block {Ml, M2, M3, Nl, N2} is defined as: A Ml ^c 1 ^c 1 2D convolution layer with a stride of N2 followed by a batch normalization (BN) layer and a rectified linear unit (ReLU) activation. This is connected to M 2 ^c N 1 ^c N 1 2D convolution layer, followed by BN, ReLU layers, then a M3 ^c 1 ^c 1 2D convolution layer followed BN. The output from this is added to either the input of the block, to form an identity residual convolution block, or a M 3 x 1 x 1 convolution layer connected to the input. The sum layer is followed by a ReLU layer. The architecture of the feature extractor is: 2D convolution 64 x 7 x 7, BN, ReLU, max pooling 3 x 3 with stride of 2, residual convolution block {32, 32, 64, 3, 1}, followed by a 2 identity residual convolution blocks {32, 32, 64, 3, 1}. [0075] BN is discussed in Ioffe, Szegedy. 2015. Batch Normalization Accelerating Deep Network Training by Reducing Internal Covariate Shift, which states:“Our proposed method draws its power from normalizing activations, and from incorporating this normalization in the network architecture itself. This ensures that the normalization is appropriately handled by any optimization method that is being used to train the network.”

[0076] The architecture of the pose estimator CNN may be: Residual convolution block

{64,64,128,3,2}, 3 identity residual convolution blocks {64, 64, 128, 3, 1}, residual convolution block {256, 256, 512, 3, 2}, 4 identity residual convolution blocks {256, 256, 512, 3, 1}, residual convolution block {64, 128, 128, 3, 2}, 2 identity residual convolution blocks {64,128,128,3,1}, 2 fully connected layers each with 1024 neurons and a ReLU activation function, followed by a fully connected output layer with a neuron for each key-point and a linear activation function.

[0077] The feature domain discriminator may have the following architecture: 2D convolution 64 x 1 x 1, BN, leaky ReLU, 2D global average pooling, followed by a single output neuron with a sigmoid activation function. The global average pooling is important to prevent the

discriminator over-fitting to pose information in the features. Over-fitting to pose information is possible because the pose distribution of synthetic and real frames do not match. Alternative network architectures could be used, including extracting features for the domain discriminator at more than one layer.

[0078] The error function of the estimated pose batch needs to be valid for training batches that contain unknown key-points. For this, the pose error function, E _p (y,m,y"), is a masked mean squared error of the key-point positions, yy E R ³ where y' is an estimated key-point position and the mask, my E {0, 1}, indicates if the key-point position error yy - y' y , should not be excluded. This is shown in the following equation

where N is the number training poses within a batch and M is the number of key-points in a pose.

[0079] The error function of the estimated domain E _d (d,d) is defined as the binary cross-entropy, where d e {0, 1} is the domain, and 0 < d < 1 is the estimated domain. In this equation, the value 1 is used to represent the real domain, and 0 is used to represent the synthetic domain: [0080] Regarding cross-entropy, C.M. Bishop (2006). Pattern Recognition and Machine

Learning. Springer, p. 206, teaches that“As usual, we can define an error function by taking the negative logarithm of the likelihood, which gives the cross-entropy error function in the form:

[0081] The feature extractor and pose estimation layers are trained together with a loss function, Lf(d, d ,y, m, y) defined as:

Lf(d, d ,y, m, y ) = kE _d (0 , d) + E _p (y, m, y )

where k is a hyper-parameter that weights the importance of domain error over pose error. And the domain discriminator layers are trained with a loss function, L _d (d, d) defined as:

L _d (d, d) ⁼ E _d (d, d)

[0082] The feature extractor and pose estimation layers are optimized using the backpropagation of gradients algorithm with the Adam optimizer disclosed in Kingma, Ba. 2014. Adam A

Method for Stochastic Optimization. This reference discloses: “We propose Adam, a method for efficient stochastic optimization that only requires first-order gradients with little memory requirement. The method computes individual adaptive learning rates for different parameters from estimates of first and second moments of the gradients; the name Adam is derived from adaptive moment estimation.” The domain discriminator layers are optimized with a stochastic gradient descent optimizer. This optimization approach is similar to the approach described by Ganin II, which states:“Rather than using the gradient reversal layer, the construction introduces two different loss functions for the domain classifier. Minimization of the first domain loss (Ld+) should lead to a better domain discrimination, while the second domain loss (Ld-) is minimized when the domains are distinct.”“In that case‘adversarial’ loss is easily obtained by swapping domain labels.”

[0083] The model, consisting of feature extractor and pose estimation layers, is first trained using only synthetic frames. The model is then used to infer key-points on a set of real depth frames. First a real depth frame is cropped centered on the center of mass. Subsequent frames are cropped using the key-points from the previous frame. Once the key-points for all frames has been inferred, each frame is cropped using its own key-points. The discriminator model is now trained using batches of both real and synthetic frames. The trained feature, pose, and

discriminator layers are now trained together. This adversarial process resulting in domain specific features being suppressed by the feature extractor layers while maintaining a low synthetic pose estimation error. The model is now used again to infer key-point positions of real depth frames. The inferred key-point positions are used to initialize an iterative 3D model fitting GA. For each real depth frame that the GA converges, a pose label is obtained and added to a database. The real depth frames with labels that are stored in the database are used to continue training the model. During training, a small random offset is added to the ROI center before cropping and resampling.

[0084] The upper half 207 of Figure 2 shows how the neural network blocks (feature extractor neural network 217, pose key-point estimator neural network 219, and discriminator 227) fit into the system during training.

[0085] Inverse kinematic model

[0086] The 3D model fitting algorithm requires a depth frame to be reconstructed from the input key-points. To do this, joint angles are estimated from key-points using an inverse kinematics (IK) algorithm. Once the angles are known, a synthetic hand can be rendered in the matching pose. Although possible to use trigonometry to compute angles, a neural network is used instead. One advantage of the neural network is that key-points need not be at the rotation point. This is disclosed in Richard Bellon. 2016. Model Based Augmentation and Testing of an Annotated Hand Pose Dataset, which states:“We paired the ICVL marker positions and LibHand angle vectors. We used these pairs for training a deep learning of architecture made of four dense layers and rectified linear units. 3D marker point positions of the fitted ICVL model served as the input and skeleton angles were the outputs during training.”

[0087] Using a neural network for IK has a number of other advantages when the key-points do not exactly fit the forward kinematic model. Gaussian noise is added to the key-point positions generated by the forward kinematic model during training so that inverse kinematics inference performs well when key-points do not exactly fit the kinematic model.

[0088] Figure 2 shows that the IK block (pose angle estimator (inverse kinematic model) 240) is trained using a forward kinematic model and used to provide a pose to the hand Tenderer generative error function 242.

[0089] Before key-point positions are input to the neural network, they are made invariant to hand position and orientation. The orientation expressed as a rotation matrix, R _h = [ Ui, u ₂ , u ] G R ^3x3 , of a pose, expressed as key-points, is defined as:

y mr y wr

lil =

¹ I 1I1 y mr - Jyw wrr |1|1 ^ ₂

U ₃ = 1ί _c X U ₂

where y _mr , y _ir , y _lr , and y _wr are the Cartesian coordinates of the key-points representing the middle finger root, index finger root, little finger root, and the wrist respectively.

[0090] The center v _h of a pose is defined as: yir ⁺ y _m r ⁺ yrr ⁺ yir

¾ = 4

where y _rr is the coordinate of the key-point representing the ring finger root. The hand center is subtracted from the key-points, before rotating to a constant orientation. Next, the normalized key points for each finger and the wrist are input to separate dense neural networks that compute the angles of the joints as quaternions. The neural networks are trained using a forward kinematic model in randomly generated poses. The Adam optimizer is used. Once the joint angles have been computed by the neural network, the forward kinematic model is used to compute key-point positions of the synthetic hand. The transformation to set to the orientation and center of the synthetic hand to match the input key-points is then computed and applied. Using the synthetic hand, a synthetic frame can now be rendered.

[0091] Iterative hand pose optimization

[0092] The iterative 3D model fitting process attempts to minimize the error between the pose of a synthetic hand model and the real depth frame. Either the joint angles, or key-point positions can be optimized. It is thought that optimizing the key-point positions before the IK has the advantage that the parameters more separately affect the pose error, therefore making

convergence to a good pose more likely. Unlike David Joseph Tan, Fits Like a Glove, which attempts to estimate gradients, a gradient free heuristic optimization algorithm is used. A GA is used to find a set of key-points that minimize the pose error. Figure 2 shows the GA block as the heuristic hand pose optimization (genetic algorithm) 238.

[0093] The pose error is defined as the error of a rendered frame of a pose computed using the inverse kinematics described above. The error of rendered frame A E R ^NxM given a real frame B E RM M j _s d _e fi _ne d as:

where /(x) is defined as: x < a

otherwise

and the masking function, m(x, y), is defined as:

[0094] The GA is initialized by sampling from the pose estimation CNN. There are a number of ways to obtain a distribution from a regression neural network. For example, Gal, Ghahramani, 2015, Dropout as a Bayesian Approximation Representing Model Uncertainty in Deep Learning, uses Dropout at training and inference time to obtain a distribution. (“In this paper we develop a new theoretical framework casting dropout training in deep neural networks (NNs) as approximate Bayesian inference in deep Gaussian processes.”)

[0095] It was found that it was difficult not to over regularize with Dropout in a CNN, therefore for this work Gaussian noise was injected at multiple layers after Batch Normalization to obtain samples of pose key-points. Variation to the key-point pose output of the neural network is also added by adding a Gaussian random variable to the hand center that is obtained from the previous input to the model with the same depth frame when centering on ROI. First the population of poses is scored using the error function, Er(A, B), the top scoring poses are used to generate the next generation of poses: In the next generation, the top scoring poses are kept, key- points as a result of the inverse and then forward kinematic operations are added to force key- points onto the hand kinematic constraints, crossover is applied between pairs of poses by randomly selecting key-points from each, and new poses are sampled from the CNN using the new best hand center.

[0096] The GA is repeated for a fixed number of iterations. Figure 4 shows the GA converging to a good pose after 41 generations. The pose cost evaluation is computed on the GPU without copying the rendered synthetic frame using an OpenGL to CUDA interop and sharing texture memory. To determine if the GA has converged, a more expensive fit evaluation is run on the CPU using a number of metrics including the difference in the signed distance function of the synthetic and real pose. If the pose has converged, the key-point labels are added to the real depth frame database that is used to train the feature extractor and pose estimation CNNs.

[0097] Turning to Figure 4, shown is a schematic 400 where a population of pose key-point markers is initialized by sampling from the CNN 410 with a real depth frame input. The GA iteratively improves the fit of the pose 420 (here, after 41 generations). Also shown is the difference between the rendered synthetic frame and the real frame for the best fit pose in the population at generation 1 440, and at generation 41 450. Also shown is the refined rendered synthetic depth frame with key-point markers 430, and a real depth frame with the refined key- point markers 460.

[0098] Turning to Figure 5, shown is that the error in the pose estimated from both the genetic algorithm and the CNN is low after the training process. Figure 5 shows a random sample real frames 501a-501p cropped on ROI. Black markers 502a-502p show key-points from a synthetic hand that has been iteratively fitted to the real frame using the GA. White markers 503a-503p show the key-points inferred from the depth frame by the CNN. The error between the black markers 502a-502p and white markers 502a-502p is quite small.

[0099] Future Applications

[00100] In the future, it may be possible to combine this technique with a much faster iterative 3D model fitting algorithm that is able to run real-time to further increase accuracy at the cost higher compute requirements. Alternatively, it may be possible to use the large CNN and automatically labeled dataset to train a simpler model, such as a smaller CNN or random forest that is less computationally expensive at the trade-off of accuracy. It is also possible to extend this method to other sensor types by simulating the forward function that maps from pose to sensor output, in the same way that a synthetic depth frame can be rendered from a pose to simulate the forward function of a depth camera.

[00101] Additional Disclosure

[00102] Additional disclosure is as follows:

[00103] 1. An algorithm for CNN domain adaptation to an unlabeled target domain by using a GA to refine inferred target domain labels. A feedback loop is introduced where; the CNN infers key-point labels, the key-point labels are refined using a GA, the refined labels are used to update CNN weights using backpropagation.

[00104] 2. Using an inverse kinematics neural network, trained using a forward kinematic model with Gaussian noise added to key-point positions, as part of an iterative 3D model fitting algorithm.

[00105] 3. Using global average pooling in the domain discriminator so that only small-scale domain-invariant features are learned. This allows successful domain adaptation when source domain and target domain pose distributions don’t match.

[00106] Conclusion [00107] While the foregoing descriptions disclose specific values, any other specific values may be used to achieve similar results. Further, the various features of the foregoing embodiments may be selected and combined to produce numerous variations of improved haptic systems.

[00108] In the foregoing specification, specific embodiments have been described. However, one of ordinary skill in the art appreciates that various modifications and changes can be made without departing from the scope of the invention as set forth in the claims below. Accordingly, the specification and figures are to be regarded in an illustrative rather than a restrictive sense, and all such modifications are intended to be included within the scope of present teachings.

[00109] Moreover, in this document, relational terms such as first and second, top and bottom, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The terms“comprises,”“comprising,”“has”,“having,� �“includes”, “including,”“contains”,“containing” or any other variation thereof, are intended to cover a non exclusive inclusion, such that a process, method, article, or apparatus that comprises, has, includes, contains a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by“comprises ...a”,“has ...a”,“includes ...a”,“contains ...a” does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises, has, includes, contains the element. The terms“a” and“an” are defined as one or more unless explicitly stated otherwise herein. The terms “substantially”,“essentially”,“approximately”,� �about” or any other version thereof, are defined as being close to as understood by one of ordinary skill in the art. The term“coupled” as used herein is defined as connected, although not necessarily directly and not necessarily

mechanically. A device or structure that is“configured” in a certain way is configured in at least that way but may also be configured in ways that are not listed.

[00110] The Abstract of the Disclosure is provided to allow the reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, various features are grouped together in various embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separately claimed subject matter.