Human Pose estimation with TensorFlow framework
In this paper we propose an approach for articulated tracking of multiple people in unconstrained videos. Our starting point is a model that resembles existing architectures for single-frame pose estimation but is substantially faster. We achieve this in two ways: (1) by simplifying and sparsifying the body-part relationship graph and leveraging recent methods for faster inference, and (2) by offloading a substantial share of computation onto a feed-forward convolutional architecture that is able to detect and associate body joints of the same person even in clutter. We use this model to generate proposals for body joint locations and formulate articulated tracking as spatio-temporal grouping of such proposals. This allows to jointly solve the association problem for all people in the scene by propagating evidence from strong detections through time and enforcing constraints that each proposal can be assigned to one person only. We report results on a public MPII Human Pose benchmark and on a new MPII Video Pose dataset of image sequences with multiple people. We demonstrate that our model achieves state-of-the-art results while using only a fraction of time and is able to leverage temporal information to improve state-of-the-art for crowded scenes.READ FULL TEXT VIEW PDF
Human Pose estimation with TensorFlow framework
Odin: People counting and classification in videos based on pose estimation
Exercise pose analyzer based on pose estimation Edit
human pose estimation based on pose tensorflow
This paper addresses the task of articulated human pose tracking in monocular video. We focus on scenes of realistic complexity that often include fast motions, large variability in appearance and clothing, and person-person occlusions. A successful approach must thus identify the number of people in each video frame, determine locations of the joints of each person and associate the joints over time.
One of the key challenges in such scenes is that people might overlap and only a subset of joints of the person might be visible in each frame either due to person-person occlusion or truncation by image boundaries (c.f. Fig. 1). Arguably, resolving such cases correctly requires reasoning beyond purely geometric information on the arrangement of body joints in the image, and requires incorporation of a variety of image cues and joint modeling of several persons.
The design of our model is motivated by two factors. We would like to leverage bottom-up end-to-end learning to directly capture image information. At the same time we aim to address a complex multi-person articulated tracking problem that does not naturally lend itself to an end-to-end prediction task and for which training data is not available in the amounts usually required for end-to-end learning.
To leverage the available image information we learn a model for associating a body joint to a specific person in an end-to-end fashion relying on a convolutional network. We then incorporate these part-to-person association responses into a framework for jointly reasoning about assignment of body joints within the image and over time. To that end we use the graph partitioning formulation that has been used for people tracking and pose estimation in the past [tang-2015, pishchulin16cvpr], but has not been shown to enable articulated people tracking.
To facilitate efficient inference in video we resort to fast inference methods based on local combinatorial optimization[levinkov16arxiv] and aim for a sparse model that keeps the number of connections between variables to a minimum. As we demonstrate, in combination with feed-forward reasoning for joint-to-person association this allows us to achieve substantial speed-ups compared to state-of-the-art [insafutdinov16eccv] while maintaining the same level of accuracy.
The main contribution of this work is a new articulated tracking model that operates by bottom-up assembly of part detections within each frame and over time. In contrast to [gkioxari16eccv, Pfister15] this model is suitable for scenes with an unknown number of subjects and reasons jointly across multiple people incorporating inter-person exclusion constraints and propagating strong observations to neighboring frames.
Our second contribution is a formulation for single-frame pose estimation that relies on a sparse graph between body parts and a mechanism for generating body-part proposals conditioned on a person’s location. This is in contrast to state-of-the-art approaches [pishchulin16cvpr, insafutdinov16eccv] that perform expensive inference in a full graph and rely on generic bottom-up proposals. We demonstrate that a sparse model with a few spatial edges performs competitively with a fully-connected model while being much more efficient. Notably, a simple model that operates in top-down/bottom-up fashion exceeds the performance of a fully-connected model while being x faster at inference time (cf. Tab. 3). This is due to offloading of a large share of the reasoning about body-part association onto a feed-forward convolutional architecture.
Finally, we contribute a new challenging dataset for evaluation of articulated body joint tracking in crowded realistic environments with multiple overlapping people.
Related work. Convolutional networks have emerged as an effective approach to localizing body joints of people in images [tompson14nips, wei16cvpr, newell16eccv, insafutdinov16eccv] and have also been extended for joint estimation of body configurations over time [gkioxari16eccv], and 3D pose estimation in outdoor environments in multi-camera setting [elhayek15cvpr, elhayek16pami].
Current approaches are increasingly effective for estimating body configurations of single people [tompson14nips, wei16cvpr, newell16eccv, bulat16eccv, gkioxari16eccv] achieving high accuracies on this task, but are still failing on fast moving and articulated limbs. More complex recent models jointly reason about entire scenes [pishchulin16cvpr, insafutdinov16eccv, Iqbal_ECCVw2016], but are too complex and inefficient to directly generalize to image sequences. Recent feed-forward models are able to jointly infer body joints of the same person and even operate over time [gkioxari16eccv] but consider isolated persons only and do not generalize to the case of multiple overlapping people. Similarly, [Charles16, Pfister15] consider a simplified task of tracking upper body poses of isolated upright individuals.
We build on recent CNN detectors [insafutdinov16eccv] that are effective in localizing body joints in cluttered scenes and explore different mechanisms for assembling the joints into multiple person configurations. To that end we rely on a graph partitioning approach closely related to [tang-2015, pishchulin16cvpr, insafutdinov16eccv]. In contrast to [tang-2015] who focus on pedestrian tracking, and [pishchulin16cvpr, insafutdinov16eccv] who perform single frame multi-person pose estimation, we solve a more complex problem of articulated multi-person pose tracking.
Earlier approaches to articulated pose tracking in monocular videos rely on hand-crafted image representations and focus on simplified tasks, such as tracking upper body poses of frontal isolated people [sapp11cvpr, weiss13nips, Tokola_ICCV2013, Cherian14], or tracking walking pedestrians with little degree of articulation [Andriluka:CVPR08, andriluka10]. In contrast, we address a harder problem of multi-person articulated pose tracking and do not make assumptions about the type of body motions or activities of people. Our approach is closely related to [iqbal17cvpr] who propose a similar formulation based on graph partitioning. Our approach differs from [iqbal17cvpr] primarily in the type of body-part proposals and the structure of the spatio-temporal graph. In our approach we introduce a person-conditioned model that is trained to associate body parts of a specific person already at the detection stage. This is in contrast to the approach of [iqbal17cvpr] that relies on the generic body-part detectors [insafutdinov16eccv].
Overview. Our model consists of the two components: (1) a convolutional network for generating body part proposals and (2) an approach to group the proposals into spatio-temporal clusters. In Sec. 2 we introduce a general formulation for multi-target tracking that follows [tang-2015] and allows us to define pose estimation and articulated tracking in a unified framework. We then describe the details of our articulated tracking approach in Sec. 3, and introduce two variants of our formulation: bottom-up (BU) and top-down/bottom-up (TD/BU). We present experimental results in Sec. 4.
Our body part detector generates a set of proposals for each frame of the video. Each proposal is given by , where denotes the index of the video frame, is the spatial location of the proposal in image coordinates,
is the probability of correct detection, andis the type of the body joint (e.g. ankle or shoulder).
Let be a graph whose nodes are the joint detections in a video and whose edges connect pairs of detections that hypothetically correspond to the same target.
The output of the tracking algorithm is a subgraph of , where is a subset of nodes after filtering redundant and erroneous detections and are edges linking nodes corresponding to the same target. We specify
via binary variablesand that define subsets of edges and nodes included in . In particular each track will correspond to a connected component in .
As a general way to introduce constraints on edge configurations that correspond to a valid tracking solution we introduce a set and define a combination of edge and node indicator variables to be feasible if and only if . An example of a constraint encoded through is that endpoint nodes of an edge included by must also be included by . Note that the variables and are coupled though . Moreover, assuming that we are free to set components of and independently to maximize the tracking objective.
Given image observations we compute a set of features for each node and edge in the graph. We denote such node and edge features as and
respectively. Assuming independence of the feature vectors the conditional probability of indicator functionsof nodes and of edges given features and and given a feasible set is given by
where assigns a constant non-zero probability to every feasible solution and is equal to zero otherwise. Minimizing the negative log-likelihood of Eq. 1
is equivalent to solving the following integer-linear program:
where is the cost of retaining as part of the solution, and is the cost of assigning the detections linked by an edge to the same track.
We define the set of constraints as in [tang-2015]:
Jointly with the objective in Eq. 2 the constraints (3)-(5) define an instance of the minimum cost subgraph multicut problem [tang-2015]. The constraints (3) and (4) ensure that assignment of node and edge variables is consistent. The constraint (5) ensures that for every two nodes either all or none of the paths between these nodes in graph are contained in one of the connected components of subgraph . This constraint is necessary to unambigously assign person identity to a body part proposal based on its membership in a specific connnected component of .
In Sec. 2 we introduced a general framework for multi-object tracking by solving an instance of the subgraph multicut problem. The subgraph multicut problem is NP-hard, but recent work [tang-2015, levinkov16arxiv] has shown that efficient approximate inference is possible with local search methods. The framework allows for a variety of graphs and connectivity patterns. Simpler connectivity allows for faster and more efficient processing at the cost of ignoring some of the potentially informative dependencies between model variables. Our goal is to design a model that is efficient, with as few edges as possible, yet effective in crowded scenes, and that allows us to model temporal continuity and inter-person exclusion. Our articulated tracking approach proceeds by constructing a graph that couples body part proposals within the same frame and across neighboring frames. In general the graph will have three types of edges: (1) cross-type edges shown in Fig. 2 (a) and Fig. 3 (b) that connect two parts of different types, (2) same-type edges shown in Fig. 2 (b) that connect two nodes of the same type in the same image, and (3) temporal edges shown in Fig. 2 (c) that connect nodes in the neighboring frames.
We now define two variants of our model that we denote as Bottom-Up (BU) and Top-Down/Bottom-Up (TD/BU). In the BU model the body part proposals are generated with our publicly available convolutional part detector [insafutdinov16eccv]222http://pose.mpi-inf.mpg.de/. In the TD/BU model we substitute these generic part detectors with a new convolutional body-part detector that is trained to output consistent body configurations conditioned on the person location. This alows to further reduce the complexity of the model graph since the task of associating body parts is addressed within the proposal mechanism. As we show in Sec. 4 this leads to considerable gains in performance and allows for faster inference. Note that the BU and TD/BU models have identical same-type and temporal pairwise terms, but differ in the form of cross-type pairwise terms, and the connectivity of the nodes in . For both models we rely on the solver from [levinkov16arxiv] for inference.
For each body part proposal the detector outputs image location, probability of detection , and a label that indicates the type of the detected part (e.g. shoulder or ankle). We directly use the probability of detection to derive the unary costs in Eq. 2 as . Image features in this case correspond to the image representation generated by the convolutional network.
We consider two connectivity patterns for nodes in the graph . We either define edges for every pair of proposals which results in a fully connected graph in each image. Alternatively we obtain a sparse version of the model by defining edges for a subset of part types only as is shown in Fig. 2 (a). The rationale behind the sparse version is to obtain a simpler and faster version of the model by omitting edges between parts that carry little information about each other’s image location (e.g. left ankle and right arm).
Edge costs. In our Bottom-Up model the cost of the edges connecting two body part detections and is defined as a function of the detection types and . Following [insafutdinov16eccv] we thus train for each pair of part types a regression function that predicts relative image location of the parts in the pair. The cost
is given by the output of the logistic regression given the features computed from offset and angle of the predicted and actual location of the other joint in the pair. We refer to[insafutdinov16eccv] for more details on these pairwise terms.
Note that our model generalizes [tang-2015] in that the edge cost depends on the type of nodes linked by the edge. It also generalizes [pishchulin16cvpr, insafutdinov16eccv] by allowing to be sparse. This is achieved by reformulating the model with a more general type of cycle constraint (5), in contrast to simple triangle inequalities used in [pishchulin16cvpr, insafutdinov16eccv]333See Sec. 2.1 in [pishchulin16cvpr].
We now introduce a version of our model that operates by first generating body part proposals conditioned on the locations of people in the image and then performing joint reasoning to group these proposals into spatio-temporal clusters corresponding to different people. We follow the intuition that it is considerably easier to identify and detect individual people (e.g. by detecting their heads) compared to correctly associating body parts such as ankles and wrists to each person. We select person’s head as a root part that is responsible for representing the person location, and delegate the task of identifying body parts of the person corresponding to a head location to a convolutional network.
The structure of TD/BU model is illustrated in Fig. 3 (b) for the simplified case of two distinct head detections. Let us denote the set of all root part detections as . For each pair of the root nodes we explicitly set the corresponding edge indicator variables . This implements a “must-not-link” constraint between these nodes, and in combination with the cycle inequality (5) implies that each proposal can be connected to one of the “person nodes” only. The cost for an edge connecting detection proposal and a “person node” is based on the conditional distribution generated by the convolutional network. The output of such network is a set of conditional distributions, one for each node type. We augment the graph with attractive/repulsive and temporal terms as described in Sec. 3.3 and Sec. 3.4 and set the unary costs for all indicator variables to a constant. Any proposal not connected to any of the root nodes is excluded from the final solution. We use the solver from [levinkov16arxiv] for consistency, but a simpler KL-based solver as in [tang-2015, keuper-2015a] could be used as well since the TD/BU model effectively ignores the unary variables . The processing stages of TD/BU model are shown in Fig. 3. Note that the body-part heatmaps change depending on the person-identity signal provided by the person’s neck, and that the bottom-up step was able to correct the predictions on the forearms of the front person.
Implementation details. For head detection, we use a version of our model that contains the two head parts (neck and head top). This makes our TD/BU model related to the hierarchical model defined in [insafutdinov16eccv] that also uses easier-to-detect parts to guide the rest of the inference process. However here we replace all the stages in the hierarchical inference except the first one with a convolutional network.
The structure of the convolutional network used to generate person-conditioned proposals is shown on Fig. 4. The network uses the ResNet-101 from [he2015deep]
that we modify to bring the stride of the network down to 8 pixels[insafutdinov16eccv]. The network generates predictions for all body parts after the conv4_4 block. We use the cross-entropy binary classification loss at this stage to predict the part heatmaps. At each training iteration we forward pass an image with multiple people potentially in close proximity to each other. We select a single person from the image and condition the network on the person’s neck location by zeroing out the heatmap of the neck joint outside the ground-truth region. We then pass the neck heatmap through a convolutional layer to match the dimensionality of the feature channels and add them to the main stream of the ResNet. We finally add a joint prediction layer at the end of the network with a loss that considers predictions to be correct only if they correspond to the body joints of the selected person.
Spatial propagation (SP). In our network the person identity signal is provided by the location of the head. In principle the receptive field size of the network is large enough to propagate this signal to all body parts. However we found that it is useful to introduce an additional mechanism to propagate the person identity signal. To that end we inject intermediate supervision layers for individual body parts arranged in the order of kinematic proximity to the root joint (Fig. 4). We place prediction layers for shoulders at conv4_8, for elbows and hips at conv4_14 and for knees at conv4_18. We empirically found that such an explicit form of spatial propagation significantly improves performance on joints such as ankles, that are typically far from the head in the image space (see Tab. 2 for details).
We use Caffe’s[jia2014caffe]
ResNet implementation and initialize from the ImageNet-pre-trained models. Networks are trained on the MPII Human Pose dataset[andriluka14cvpr] with SGD for 1M iterations with stepwise learning rate (lr=0.002 for 400k, lr=0.0002 for 300k and lr=0.0001 for 300k).
Attractive/repulsive edges are defined between two proposals of the same type within the same image. The costs of these edges is inversely-proportional to distance [insafutdinov16eccv]. The decision to group two nodes is made based on the evidence from the entire image, which is in contrast to typical non-maximum suppression based on the state of just two detections. Inversely, these edges prevent grouping of multiple distant hypothesis of the same type, e.g. prevent merging two heads of different people.
Regardless of the type of within frame model (BU or TD/BU) we rely on the same type of temporal edges that connect nodes of the same type in adjacent frames. We derive the costs for such temporal edges via logistic regression. Given the feature vector the probability that the two proposals and in adjacent frames correspond to the same body part is given by: , where , and - , is Euclidean distance between the SIFT descriptors computed at and , and and measure the agreement with the dense motion field computed with the DeepMatching approach of [weinzaepfelhal00873592].
For SIFT features we specify the location of the detection proposal, but rely on SIFT to identify the local orientation. In cases with multiple local maxima in orientation estimation we compute SIFT descriptor for each orientation and set to the minimal distance among all pairs of descriptors. We found that this makes the SIFT distance more robust in the presence of rotations of the body limbs.
We define the features and as in [tangbmtt]. Let be an squared image region centered on the part proposal . We define as a ratio of the number of point correspondences between the regions and and the total number of point correspondences in either of them. Specifically, let be a set of point correspondences between the two images computed with DeepMatching, where and and denote the corresponding points in the first and second image respectively. Using this notation we define:
The rationale behind computing
by aggregating across multiple correspondences is to make the feature robust to outliers and to inaccuracies in body part detection.is defined analogously, but using the DeepMatching correspondences obtained by inverting the order of images.
Discussion. As we demonstrate in Sec. 4, we found the set of features described above to be complementary to each other. Euclidean distance between proposals is informative for finding correspondences for slow motions, but fails for faster motions and in the presence of multiple people. DeepMatching is usually effective in finding corresponding regions between the two images, but occasionally fails in the case of sudden background changes due to fast motion or large changes in body limb orientation. In these cases SIFT is often still able to provide a meaningful measure of similarity due to its rotation invariance.
Single frame. We evaluate our single frame models on the MPII Multi-Person dataset [andriluka14cvpr]. We report all intermediate results on a validation set of images sampled uniformly at random (MPII Multi-Person Val), while major results and comparison to the state of the art are reported on the test set.
Video. In order to evaluate video-based models we introduce a novel “MPII Video Pose” dataset444Dataset is available at pose.mpi-inf.mpg.de/art-track.. To this end we manually selected challenging keyframes from MPII Multi-Person dataset. Selected keyframes represent crowded scenes with highly articulated people engaging in various dynamic activities. In addition to each keyframe, we include +/- neighboring frames from the corresponding publicly available video sequences, and annotate every second frame555The annotations in the original key-frame are kept unchanged.. Each body pose was annotated following the standard annotation procedure [andriluka14cvpr], while maintaining person identity throughout the sequence. In contrast to MPII Multi-Person where some frames may contain non-annotated people, we annotate all people participating in the activity captured in the video, and add ignore regions for areas that contain dense crowds (e.g. static spectators in the dancing sequences). In total, our dataset consists of sequences with over annotated poses.
Evaluation details. The average precision (AP) measure [pishchulin16cvpr] is used for evaluation of pose estimation accuracy. For each algorithm we also report run time of the proposal generation and of the graph partitioning stages. All time measurements were conducted on a single core Intel Xeon GHz. Finally we also evaluate tracking perfomance using standard MOTA metric [Bernardin:2008:CLE].
Evaluation on our “MPII Video Pose” dataset is performed on the full frames using the publicly available evaluation kit of [andriluka14cvpr]. On MPII Multi-Person we follow the official evaluation protocol666http://human-pose.mpi-inf.mpg.de/#evaluation and evaluate on groups using the provided rough group location and scale.
|TD/BU + SP||92.2||86.1||72.8||63.0||74.0||66.2||58.4||73.3||0.9477footnotemark: 7||0.08|
We compare the performance of different variants of our Bottom-Up (BU) and Top-Down/Bottom-Up (TD/BU) models introduced in Sec. 3.1 and Sec. 3.2. For BU we consider a model that (1) uses a fully-connected graph with up to detection proposals and jointly performs partitioning and body-part labeling similar to [insafutdinov16eccv] (BU-full, label); (2) is same as (1), but labeling of detection proposals is done based on detection score (BU-full); (3) is same as (2), but uses a sparsely-connected graph (BU-sparse). The results are shown in Tab. 1777Our current implementation of TD/BU operates on the whole image when computing person-conditioned proposals and computes the proposals sequentially for each person. More efficient implementation would only compute the proposals for a region surrounding the person and run multiple people in a single batch. Clearly in cases when two people are close in the image this would still process the same image region multiple times. However the image regions far from any person would be excluded from processing entirely. On average we expect similar image area to be processed during proposal generation stage in both TD/BU and BU-sparse, and expect the runtimes to be comparable for both models.. BU-full, label achieves % AP with a median inference run-time of s/f. BU-full achieves run-time reduction ( vs. s/f): pre-labeling detection candidates based on detection score significantly reduces the number of variables in the problem graph. Interestingly, pre-labeling also improves the performance ( vs. % AP): some of the low-scoring detections may complicate the search for an optimal labeling. BU-sparse further reduces run-time ( vs. s/f), as it reduces the complexity of the initial problem by sparsifying the graph, at a price of a drop in performance ( vs. % AP).
In Tab. 2 we compare the variants of the TD/BU model. Our TD approach achieves % AP, performing on par with a more complex BU-full. Explicit spatial propagation (TD+SP) further improves the results ( vs. % AP). The largest improvement is observed for ankles: progressive prediction that conditions on the close-by parts in the tree hierarchy reduces the distance between the conditioning signal and the location of the predicted body part and simplifies the prediction task. Performing inference (TD/BU+SP) improves the performance to % AP, due to more optimal assignment of part detection candidates to corresponding persons. Graph simplification in TD/BU allows to further reduce the inference time for graph partitioning ( vs. for BU-sparse).
|TD + SP||90.7||85.0||72.0||63.1||73.1||65.0||58.3||72.5|
|TD/BU + SP||92.2||86.1||72.8||63.0||74.0||66.2||58.4||73.3|
Comparison to the State of the Art. We compare the proposed single-frame approaches to the state of the art on MPII Multi-Person Test and WAF [eichner10eccv] datasets. Comparison on MPII is shown in Tab. 3. Both BU-full and TD/BU improve over the best published result of DeeperCut [insafutdinov16arxiv], achieving and % AP respectively vs. % AP by DeeperCut. For the TD/BU the improvements on articulated parts (elbows, wrists, ankles, knees) are particularly pronounced. We argue that this is due to using the network that is directly trained to disambiguate body parts of different people, instead of using explicit geometric pairwise terms that only serve as a proxy to person’s identity. Overall, the performance of our best TD/BU method is noticeably higher ( vs. % AP). Remarkably, its run-time of graph partitioning stage is orders of magnitude faster compared to DeeperCut. This speed-up is due to two factors. First, TD/BU relies on a faster solver [levinkov16arxiv] that tackles the graph-partitioning problem via local search, in contrast to the exact solver used in [insafutdinov16eccv]. Second, in the case of TD/BU model the graph is sparse and a large portion of the computation is performed by the feed-forward CNN introduced in Sec. 3.2. On WAF [eichner10eccv] dataset TD/BU substantially improves over the best published result ( vs. % AP by [insafutdinov16arxiv]). We refer to supplemental material for details.
Comparison of video-based models. Performance of the proposed video-based models is compared in Tab. 4. Video-based models outperform single-frame models in each case. BU-full+temporal slightly outperforms BU-full, where improvements are noticeable for ankle, knee and head. BU-sparse+temporal noticeably improves over BU-sparse ( vs. % AP). We observe significant improvements on the most difficult parts such as ankles (% AP) and wrists (% AP). Interestingly, BU-sparse+temporal outperforms : longer-range connections such as, e.g., head to ankle, may introduce additional confusion when information is propagated over time. Finally, TD/BU+temporal improves over TD/BU (% AP). Similarly to BU-sparse+temporal, improvement is most prominent on ankles (% AP) and wrists (% AP). Note that even the single-frame TD/BU outperforms the best temporal BU model. We show examples of articulated tracking on “MPII Video Pose” in Fig. 5. Temporal reasoning helps in cases when image information is ambiguous due to close proximity of multiple people. For example the video-based approach succeeds in correctly localizing legs of the person in Fig. 5 (d) and (h).
Temporal features. We perform an ablative experiment on the “MPII Video Pose” dataset to evaluate the individual contribution of the temporal features introduced in Sec. 3.4. The Euclidean distance alone achieves AP, adding DeepMatching features improves the resuls to AP, whereas the combination of all features achieves the best result of AP (details in supplemental material).
Tracking evaluation. In Tab. 5 we present results of the evaluation of multi-person articulated body tracking. We treat each body joint of each person as a tracking target and measure tracking performance using a standard multiple object tracking accuracy (MOTA) metric [Bernardin:2008:CLE] that incorporates identity switches, false positives and false negatives888Note that MOTA metric does not take the confidence scores of detection or track hypotheses into account. To compensate for that in the experiment in Tab. 5 we remove all body part detections with a score for BU-sparse and for TD/BU prior to evaluation.. We experimentally compare to a baseline model that first tracks people across frames and then performs per-frame pose estimation. To track a person we use a reduced version of our algorithm that operates on the two head joints only. This allows to achieve near perfect person tracking results in most cases. Our tracker still fails when the person head is occluded for multiple frames as it does not incorporate long-range connectivity between target hypothesis. We leave handling of long-term occlusions for the future work. For full-body tracking we use the same inital head tracks and add them to the set of body part proposals, while also adding must-link and must-cut constraints for the temporal edges corresponding to the head parts detections. The rest of the graph remains unchanged so that at inference time the body parts can be freely assigned to different person tracks. For the BU-sparse the full body tracking improves performance by and MOTA on wrists and ankles, and by and MOTA on elbows and knees respectively. TD/BU benefits from adding temporal connections between body parts as well, but to a lesser extent than BU-sparse. The most significant improvement is for ankles ( MOTA). BU-sparse also achieves the best overall score of compared to by TD/BU. This is surprising since TD/BU outperformed BU-sparse on the pose estimation task (see Tab. 1 and 3). We hypothesize that limited improvement of TD/BU could be due to balancing issues between the temporal and spatial pairwise terms that are estimated independently of each other.
|Head track + BU-sparse||70.5||71.7||53.0||41.7||57.0||52.4||41.9||55.5|
|Head track + TD/BU||64.8||69.4||55.4||43.4||56.4||52.2||44.8||55.2|
In this paper we introduced an efficient and effective approach to
articulated body tracking in monocular video. Our
approach defines a model that jointly groups body part proposals
within each video frame and across time. Grouping is formulated as a
graph partitioning problem that lends itself to efficient inference
with recent local search techniques. Our approach improves over
state-of-the-art while being substantially faster compared to other
Acknowledgements. This work has been supported by the Max Planck Center for Visual Computing and Communication. The authors thank Varvara Obolonchykova and Bahar Tarakameh for their help in creating the video dataset.
We perform qualitative comparison of the proposed single-frame based TD/BU and BU-full methods on challenging scenes containing highly articulated and strongly overlapping individuals. Results are shown in Fig. 6 and Figure 7. The BU-full works well when persons are sufficiently separated (images 11 and 12). However, it fails on images where people significantly overlap (images 1-3, 5-10) or exhibit high degree of articulation (image 4). This is due to the fact that geometric image-conditioned pairwise may get confused in the presence of multiple overlapping individuals and thus mislead post-CNN bottom-up assembling of body poses. In contrast, TD/BU performs explicit modeling of person identity via top-dop bottom-up reasoning while offloading the larger share of the reasoning about body-part association onto feed-forward convolutional architecture, and thus is able to resolve such challenging cases. Interestingly, TD/BU is able to correctly predict lower limbs of people in the back through partial occlusion (image 3, 5, 7, 10). TD/BU model occasionally incorrectly assembles body parts in kinematically implausible manner (image 12), as it does not explicitly model geometric body part relations. Finally, both models fail in presense of high variations in scale (image 13). We envision that reasoning over multiple scales is likely to improve the results.
We compare our proposed TD/BU model to the state-of-the-art methods on the “We Are Family” (WAF) [eichner10eccv] dataset and present results in Table 6. We use evaluation protocol from [insafutdinov16eccv] and report the AP evaluation measure. TD/BU model outperforms the best published results [insafutdinov16eccv] across all body parts ( vs % AP) as well improves on articulated parts such as wrists (% AP) and elbows (% AP). We attribute that to the ability of top-down model to better learn part associations compared to explicit modeling geometric pairwise relations as in [insafutdinov16eccv].
We evaluate the importance of combining temporal features introduced in Sec. 3.4 of the paper on our Multi-Person Video dataset. To that end, we consider BU-sparse+temporal model and compare results to BU-sparse in Tab. 7. Single-frame BU-sparse achieves % AP. It can be seen that using geometry based det-distance features slightly improves the results to % AP, as it enables the propagation of information from neighboring frames. Using deepmatch features slightly improves the performance further as it helps to link the same body part of the same person over time based on the body part appearance. It is especially helpful in the case of fast motion where det-distance may fail. The combination of both geometry and appearance based features further improves the performance to %, which shows their complementarity. Finally, adding the sift-distance feature improves the results to %, since it copes better with the sudden changes in background and body part orientations. Overall, using a combination of temporal features in BU-sparse+temporal results in a % AP improvement over the single-frame BU-sparse. This demonstrates the advantages of the proposed approach to improve pose estimation performance using temporal information.