DeepPose implementation on TensorFlow. Original Paper http://arxiv.org/abs/1312.4659
We propose a method for human pose estimation based on Deep Neural Networks (DNNs). The pose estimation is formulated as a DNN-based regression problem towards body joints. We present a cascade of such DNN regressors which results in high precision pose estimates. The approach has the advantage of reasoning about pose in a holistic fashion and has a simple but yet powerful formulation which capitalizes on recent advances in Deep Learning. We present a detailed empirical analysis with state-of-art or better performance on four academic benchmarks of diverse real-world images.READ FULL TEXT VIEW PDF
For the ECCV 2018 PoseTrack Challenge, we present a 3D human pose estima...
Like many computer vision problems, human pose estimation is a challengi...
This paper provides, to the best of our knowledge, the first comprehensi...
Human pose estimation using deep neural networks aims to map input image...
Direct prediction of 3D body pose and shape remains a challenge even for...
Contributions of recent deep-neural-network (DNN) based techniques have ...
A Bayesian framework for 3D human pose estimation from monocular images ...
DeepPose implementation on TensorFlow. Original Paper http://arxiv.org/abs/1312.4659
Core vision code
The problem of human pose estimation, defined as the problem of localization of human joints, has enjoyed substantial attention in the computer vision community. In Fig.1, one can see some of the challenges of this problem – strong articulations, small and barely visible joints, occlusions and the need to capture the context.
The main stream of work in this field has been motivated mainly by the first challenge, the need to search in the large space of all possible articulated poses. Part-based models lend themselves naturally to model articulations ([16, 8]) and in the recent years a variety of models with efficient inference have been proposed ([6, 19]).
The above efficiency, however, is achieved at the cost of limited expressiveness – the use of local detectors, which reason in many cases about a single part, and most importantly by modeling only a small subset of all interactions between body parts. These limitations, as exemplified in Fig. 1, have been recognized and methods reasoning about pose in a holistic manner have been proposed [15, 21] but with limited success in real-world problems.
In this work we ascribe to this holistic view of human pose estimation. We capitalize on recent developments of deep learning and propose a novel algorithm based on a Deep Neural Network (DNN). DNNs have shown outstanding performance on visual classification tasks  and more recently on object localization [23, 9]. However, the question of applying DNNs for precise localization of articulated objects has largely remained unanswered. In this paper we attempt to cast a light on this question and present a simple and yet powerful formulation of holistic human pose estimation as a DNN.
We formulate the pose estimation as a joint regression problem and show how to successfully cast it in DNN settings. The location of each body joint is regressed to using as an input the full image and a 7-layered generic convolutional DNN. There are two advantages of this formulation. First, the DNN is capable of capturing the full context of each body joint – each joint regressor uses the full image as a signal. Second, the approach is substantially simpler to formulate than methods based on graphical models – no need to explicitly design feature representations and detectors for parts; no need to explicitly design a model topology and interactions between joints. Instead, we show that a generic convolutional DNN can be learned for this problem.
Further, we propose a cascade of DNN-based pose predictors. Such a cascade allows for increased precision of joint localization. Starting with an initial pose estimation, based on the full image, we learn DNN-based regressors which refines the joint predictions by using higher resolution sub-images.
We show state-of-art results or better than state-of-art on four widely used benchmarks against all reported results. We show that our approach performs well on images of people which exhibit strong variation in appearance as well as articulations. Finally, we show generalization performance by cross-dataset evaluation.
The idea of representing articulated objects in general, and human pose in particular, as a graph of parts has been advocated from the early days of computer vision . The so called Pictorial Strictures (PSs), introduced by Fishler and Elschlager , were made tractable and practical by Felzenszwalb and Huttenlocher  using the distance transform trick. As a result, a wide variety of PS-based models with practical significance were subsequently developed.
The above tractability, however, comes with the limitation of having a tree-based pose models with simple binary potential not depending on image data. As a result, research has focused on enriching the representational power of the models while maintaining tractability. Earlier attempts to achieve this were based on richer part detectors [19, 1, 4]. More recently, a wide variety of models expressing complex joint relationships were proposed. Yang and Ramanan  use a mixture model of parts. Mixture models on the full model scale, by having mixture of PSs, have been studied by Johnson and Everingham . Richer higher-order spatial relationships were captured in a hierarchical model by Tian et al. 
. A different approach to capture higher-order relationship is through image-dependent PS models, which can be estimated via a global classifier[26, 20, 18].
Approaches which ascribe to our philosophy of reasoning about pose in a holistic manner have shown limited practicality. Mori and Malik  try to find for each test image the closest exemplar from a set of labeled images and transfer the joint locations. A similar nearest neighbor setup is employed by Shakhnarovich et al. , who however use locality sensitive hashing. More recently, Gkioxari et al.  propose a semi-global classifier for part configuration. This formulation has shown very good results on real-world data, however, it is based on linear classifiers with less expressive representation than ours and is tested on arms only. Finally, the idea of pose regression has been employed by Ionescu et al. , however they reason about 3D pose.
The closest work to ours uses convolution NNs together with Neighborhood Component Analysis to regress toward a point in an embedding representing pose . However, this work does not employ a cascade of networks. Cascades of DNN regressors have been used for localization, however of facial points . On the related problem of face pose estimation, Osadchy et al.  employ a NN-based pose embedding trained with a contrastive loss.
We use the following notation. To express a pose, we encode the locations of all body joints in pose vector defined as , where contains the and coordinates of the joint. A labeled image is denoted by where stands for the image data and
is the ground truth pose vector.
Further, since the joint coordinates are in absolute image coordinates, it proves beneficial to normalize them w. r. t. a box bounding the human body or parts of it. In a trivial case, the box can denote the full image. Such a box is defined by its center as well as width and height : . Then the joint can be translated by the box center and scaled by the box size which we refer to as normalization by :
Further, we can apply the same normalization to the elements of pose vector resulting in a normalized pose vector. Finally, with a slight abuse of notation, we use to denote a crop of the image by the bounding box b, which de facto normalizes the image by the box. For brevity we denote by normalization with being the full image box.
In this work, we treat the problem of pose estimation as regression, where the we train and use a function which for an image regresses to a normalized pose vector, where denotes the parameters of the model. Thus, using the normalization transformation from Eq. (1) the pose prediction in absolute image coordinates reads
Despite its simple formulation, the power and complexity of the method is in
, which is based on a convolutional Deep Neural Network (DNN). Such a convolutional network consists of several layers – each being a linear transformation followed by a non-linear one. The first layer takes as input an image of predefined size and has a size equal to the number of pixels times three color channels. The last layer outputs the target values of the regression, in our casejoint coordinates.
We base the architecture of the on the work by Krizhevsky et al.  for image classification since it has shown outstanding results on object localization as well . In a nutshell, the network consists of layers (see Fig. 2 left). Denote by a convolutional layer, by a local response normalization layer, a pooling layer and by a fully connected layer. Only and layers contain learnable parameters, while the rest are parameter free. Both and
layers consist of a linear transformation followed by a nonlinear one, which in our case is a rectified linear unit. Forlayers, the size is defined as , where the first two dimensions have a spatial meaning while the depth defines the number of filters. If we write the size of each layer in parentheses, then the network can be described concisely as . The filter size for the first two layers is and and for the remaining three is . Pooling is applied after three layers and contributes to increased performance despite the reduction of resolution. The input to the net is an image of
which via stride ofis fed into the network. The total number of parameters in the above model is about 40M. For further details, we refer the reader to .
The use of a generic DNN architecture is motivated by its outstanding results on both classification and localization problems. In the experimental section we show that such a generic architecture can be used to learn a model resulting in state-of-art or better performance on pose estimation as well. Further, such a model is a truly holistic one — the final joint location estimate is based on a complex nonlinear transformation of the full image.
Additionally, the use of a DNN obviates the need to design a domain specific pose model. Instead such a model and the features are learned from the data. Although the regression loss does not model explicit interactions between joints, such are implicitly captured by all of the hidden layers – all the internal features are shared by all joint regressors.
The difference to 
is the loss. Instead of a classification loss, we train a linear regression on top of the last network layer to predict a pose vector by minimizingdistance between the prediction and the true pose vector. Since the ground truth pose vector is defined in absolute image coordinates and poses vary in size from image to image, we normalize our training set using the normalization from Eq. (1):
Then the loss for obtaining optimal network parameters reads:
For clarity we write out the optimization over individual joints. It should be noted, that the above objective can be used even if for some images not all joints are labeled. In this case, the corresponding terms in the sum would be omitted.
The above parameters
are optimized for using Backpropagation in a distributed online implementation. For each mini-batch of size, adaptive gradient updates are computed . The learning rate, as the most important parameter, is set to . Since the model has large number of parameters and the used datasets are of relatively small size, we augment the data using large number of randomly translated image crops (see Sec. 3.2), left/right flips as well as DropOut regularization for the layers set to .
The pose formulation from the previous section has the advantage that the joint estimation is based on the full image and thus relies on context. However, due to its fixed input size of , the network has limited capacity to look at detail – it learns filters capturing pose properties at coarse scale. These are necessary to estimate rough pose but insufficient to always precisely localize the body joints. Note that we cannot easily increase the input size since this will increase the already large number of parameters. In order to achieve better precision, we propose to train a cascade of pose regressors. At the first stage, the cascade starts off by estimating an initial pose as outlined in the previous section. At subsequent stages, additional DNN regressors are trained to predict a displacement of the joint locations from previous stage to the true location. Thus, each subsequent stage can be thought of as a refinement of the currently predicted pose, as shown in Fig. 2.
Further, each subsequent stage uses the predicted joint locations to focus on the relevant parts of the image – sub-images are cropped around the predicted joint location from previous stage and the pose displacement regressor for this joint is applied on this sub-image. In this way, subsequent pose regressors see higher resolution images and thus learn features for finer scales which ultimately leads to higher precision.
We use the same network architecture for all stages of the cascade but learn different network parameters. For stage of total cascade stages, we denote by the learned network parameters. Thus, the pose displacement regressor reads . To refine a given joint location we will consider a joint bounding box capturing the sub-image around : having as center the -th joint and as dimension the pose diameter scaled by . The diameter of the pose is defined as the distance between opposing joints on the human torso, such as left shoulder and right hip, and depends on the concrete pose definition and dataset.
Using the above notation, at the stage we start with a bounding box which either encloses the full image or is obtained by a person detector. We obtain an initial pose:
At each subsequent stage , for all joints we regress first towards a refinement displacement by applying a regressor on the sub image defined by from previous stage . Then, we estimate new joint boxes :
We apply the cascade for a fixed number of stages , which is determined as explained in Sec. 4.1.
The network parameters are trained as outlined in Sec. 3.1, Eq. (4). At subsequent stages , the training is done identically with one important difference. Each joint from a training example is normalized using a different bounding box – the one centered at the prediction for the same joint obtained from previous stage – so that we condition the training of the stage based on the model from previous stage.
Since deep learning methods have large capacity, we augment the training data by using multiple normalizations for each image and joint. Instead of using the prediction from previous stage only, we generate simulated predictions. This is done by randomly displacing the ground truth location for joint
by a vector sampled at random from a 2-dimensional Normal distribution
with mean and variance equal to the mean and variance of the observed displacementsacross all examples in the training data. The full augmented training data can be defined by first sampling an example and a joint from the original data at uniform and then generating a simulated prediction based on a sampled displacement from :
The training objective for cascade stage is done as in Eq. (4) by taking extra care to use the correct normalization for each joint:
There is a wide variety of benchmarks for human pose estimation. In this work we use datasets, which have large number of training examples sufficient to train a large model such as the proposed DNN, as well as are realistic and challenging.
The first dataset we use is Frames Labeled In Cinema (FLIC), introduced by , which consists of 4000 training and 1000 test images obtained from popular Hollywood movies. The images contain people in diverse poses and especially diverse clothing. For each labeled human, upper body joints are labeled.
The second dataset we use is Leeds Sports Dataset  and its extension , which we will jointly denote by LSP. Combined they contain training and testing images. These are images from sports activities and as such are quite challenging in terms of appearance and especially articulations. In addition, the majority of people have 150 pixel height which makes the pose estimation even more challenging. In this dataset, for each person the full body is labeled with total joints.
For all of the above datasets, we define the diameter of a pose to be the distance between a shoulder and hip from opposing sides and denote it by . It should be noted, that the joints in all datasets are arranged in a tree kinematically mimicking the human body. This allows for a definition of a limb being a pair of neighboring joints in the pose tree.
In order to be able to compare with published results we will use two widely accepted evaluation metrics. Percentage of Correct Parts (PCP) measures detection rate of limbs, where a limb is considered detected if the distance between the two predicted joint locations and the true limb joint locations is at most half of the limb length. PCP was the initially preferred metric for evaluation, however it has the drawback of penalizing shorter limbs, such as lower arms, which are usually harder to detect.
To address this drawback, recently detection rates of joints are being reported using a different detection criterion – a joint is considered detected if the distance between the predicted and the true joint is within a certain fraction of the torso diameter. By varying this fraction, detection rates are obtained for varying degrees of localization precision. This metric alleviates the drawback of PCP since the detection criteria for all joints are based on the same distance threshold. We refer to this metric as Percent of Detected Joints (PDJ).
For all the experiments we use the same network architecture. Inspired by , we use a body detector on FLIC to obtain initially a rough estimate of the human body bounding box. It is based on a face detector – the detected face rectangle is enlarged by a fixed scaler. This scaler is determined on the training data such that it contains all labeled joints. This face-based body detector results in a rough estimate, which however presents a good starting point for our approach. For LSP we use the full image as initial bounding box since the humans are relatively tightly cropped by design.
Using a small held-out set of 50 images for both datasets to determine the algorithm hyperparameters. To measure optimality of the parameters we used average over PDJ atacross all joints. The scaler , which defines the size of the refinement joint bounding box as a fraction of the pose size, is determined as follows: for FLIC we chose after exploring values , for LSP we use after trying . The number of cascade stages is determined by training stages until the algorithm stopped improving on the held-out set. For both FLIC and LSP we arrived at .
To improve generalization, for each cascade stage starting at we augment the training data by sampling randomly translated crop boxes for each joint as explained in Sec. 3.2. Thus, for LSP with joints and after mirroring the images and sampling the number training examples is , which is essential for training a large network as ours.
The presented algorithm allows for an efficient implementation. The running time is approx. per image, as measured on a core CPU. This compares favorably to other approaches, as some of the current state-of-art approaches have higher complexity:  runs in approx. , while  runs in . The training complexity, however, is higher. The initial stage was trained within days on approx. workers, most of the final performance was achieved after hours though. Each refinement stage was trained for days since the amount of data was larger than the one for the initial stage due to the data augmentation in Sec. 3.2. Note that using more data led to increased performance.
We present comparative results to other approaches. We compare on LSP using PCP metric in Fig. 1. We show results for the four most challenging limbs – lower and upper arms and legs – as well as the average value across these limbs for all compared algorithms. We clearly outperform all other approaches, especially achieving better estimation for legs. For example, for upper legs we obtain up from for the next best performing method. It is worth noting that while the other approaches exhibit strengths for particular limbs, none of the other dataset consistently dominates across all limbs. In contrary, DeepPose shows strong results for all challenging limbs.
Using the PDJ metric allows us to vary the threshold for the distance between prediction and ground truth, which defines a detection. This threshold can be thought of as a localization precision at which detection rates are plotted. Thus one could compare approaches across different desired precisions. We present results on FLIC in Fig. 3 comparing against additional four methods as well is on LSP in Fig. 4. For each dataset we train and test according the protocol for each dataset. Similarly to previous experiment we outperform all five algorithms. Our gains are bigger in the low precision domain, in the cases where we detect rough pose without precisely localizing the joints. On FLIC, at normalized distance we obtain a an increase of detection rates by and for elbow and wrists against the next best performing method. On LSP, at normalized distance we get an absolute increase of . At low precision regime of normalized distance of
for LSP we show comparable performance for legs and slightly worse arms. This can be attributed to the fact that the DNN-based approach computes joint coordinates using 7 layers of transformation, some of which contain max pooling.
Another observation is that our approach works well for both appearance heavy movie data as well as string articulation such as the sports images in LSP.
|Dantone et al. ||0.45||0.25||0.65||0.61||0.49|
|Tian et al. ||0.52||0.33||0.70||0.60||0.56|
|Johnson et al. ||0.54||0.38||0.75||0.66||0.58|
|Wang et al. ||0.565||0.37||0.76||0.68||0.59|
A single DNN-based joint regressor gives rough joint location. However, to obtain higher precision the subsequent stages of the cascade, which serve as a refinement of the initial prediction, are of paramount importance. To see this, in Fig. 5 we present the joint detections at different precisions for the initial prediction as well as two subsequent cascade stages. As expected, we can see that the major gains of the refinement procedure are at high-precision regime of at normalized distances of . Further, the major gains are achieved after one stage of refinement. The reason being that subsequent stages end up using smaller sub-images around each joint. And although the subsequent stages look at higher resolution inputs, they have more limited context.
Examples of cases, where refinement helps, are visualized in Fig. 6. The initial stage is usually successful at estimating a roughly correct pose, however, this pose is not ”snapped” to the correct one. For example, in row three the pose has the right shape but incorrect scale. In the second row, the predicted pose is translated north from the ideal one. In most cases, the second stage of the cascade resolves this snapping problem and better aligns the joints. In more rare cases, such as in first row, further facade stages improve on individual joints.
To evaluate the generalization properties of our algorithm, we used the trained models on LSP and FLIC on two related datasets. The full-body model trained on LSP is tested on the test portion of the Image Parse dataset  with results presented in Table 2. The ImageParse dataset is similar to LSP as it contains people doing sports, however it contains a lot of people from personal photo collections involved in other activities. Further, the upper-body model trained on FLIC was applied on the whole Buffy dataset . We can see that our approach can retain state-of-art performance compared to other approaches. This shows good generalization abilities.
|Johnson et al. ||0.75||0.67||0.67||0.46||0.64|
|Yang et al. ||0.69||0.64||0.55||0.35||0.56|
To get a better idea of the performance of our algorithm, we visualize a sample of estimated poses on images from LSP in Fig. 8. We can see that our algorithm is able to get correct pose for most of the joints under variety of conditions: upside-down people (row 1, column 1), severe foreshortening (row1, column 3), unusual poses (row 3, column 5), occluded limbs as the occluded arms in row 3, columns 2 and 6, unusual illumination conditions (row 3, column 3). In most of the cases, when the estimated pose is not precise, it still has a correct shape. For example, in the last row some of the predicted limbs are not aligned with the true locations, however the overall shape of the pose is correct. A common failure mode is confusing left with right side when the person was photographed from the back (row 6, column 6). Results on FLIC (see Fig. 9) are usually better with occasional visible mistakes on lower arms.
We present, to our knowledge, the first application of Deep Neural Networks (DNNs) to human pose estimation. Our formulation of the problem as DNN-based regression to joint coordinates and the presented cascade of such regressors has the advantage of capturing context and reasoning about pose in a holistic manner. As a result, we are able to achieve state-of-art or better results on several challenging academic datasets.
Further, we show that using a generic convolutional neural network, which was originally designed for classification tasks, can be applied to the different task of localization. In future, we plan to investigate novel architectures which could be potentially better tailored towards localization problems in general, and in pose estimation in particular.
I would like to thank Luca Bertelli, Ben Sapp and Tianli Yu for assistance with data and fruitful discussions.
The Journal of Machine Learning Research, 8:1197–1215, 2007.
Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on, pages 3476–3483. IEEE, 2013.