Unsupervised Geometry-Aware Representation for 3D Human Pose Estimation

Rhodin, Helge; Salzmann, Mathieu; Fua, Pascal

doi:10.1007/978-3-030-01249-6_46

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 11214))

Included in the following conference series:

European Conference on Computer Vision

2866 Accesses
104 Citations

Abstract

Modern 3D human pose estimation techniques rely on deep networks, which require large amounts of training data. While weakly-supervised methods require less supervision, by utilizing 2D poses or multi-view imagery without annotations, they still need a sufficiently large set of samples with 3D annotations for learning to succeed.

In this paper, we propose to overcome this problem by learning a geometry-aware body representation from multi-view images without annotations. To this end, we use an encoder-decoder that predicts an image from one viewpoint given an image from another viewpoint. Because this representation encodes 3D geometry, using it in a semi-supervised setting makes it easier to learn a map** from it to 3D human pose. As evidenced by our experiments, our approach significantly outperforms fully-supervised methods given the same amount of labeled data, and improves over other semi-supervised methods while using as little as 1% of the labeled data.

You have full access to this open access chapter, Download conference paper PDF

Self-supervised method for 3D human pose estimation with consistent shape and viewpoint factorization

Article 03 June 2022

Unsupervised Human Pose Estimation on Depth Images

Self6D: Self-supervised Monocular 6D Object Pose Estimation

Keywords

1 Introduction

Most current monocular solutions to 3D human pose estimation rely on methods based on convolutional neural networks (CNNs). With networks becoming ever more sophisticated, the main bottleneck now is the availability of sufficiently large training datasets, which typically require a large annotation effort. While such an effort might be practical for a handful of subjects and specific motions such as walking or running, covering the whole range of human body shapes, appearances, and poses is infeasible.

Weakly-supervised methods that reduce the amount of annotation required to achieve a desired level of performance are therefore valuable. For example, methods based on articulated 3D skeletons can be trained not only with actual 3D annotations but also using 2D annotations [21, Full size image

In this paper, we propose to use images of the same person taken from multiple views to learn a latent representation that, as shown on the left side of Fig. 1(a), captures the 3D geometry of the human body. Learning this representation does not require any 2D or 3D pose annotation. Instead, we train an encoder-decoder to predict an image seen from one viewpoint from an image captured from a different one. As sketched on the right side of Fig. 1(a), we can then learn to predict a 3D pose from this latent representation in a supervised manner. The crux of our approach, however, is that because our latent representation already captures 3D geometry, the map** to 3D pose is much simpler and can be learned using much fewer examples than existing methods that rely on multiview supervision [31, 31, 55] exploit multi-view geometry in sequences acquired by synchronized cameras, thus removing the need for 2D annotations. However, in practice, they still require a large enough 3D training set to initialize and constrain the learning process. We will show that our geometry-aware latent representation learned from multi-view imagery but without annotations allows us to train a 3D pose estimation network using much less labeled data.

Geometry-Aware Representations. Multi-view imagery has long been used to derive volumetric representations of 3D human pose from silhouettes, for example by carving out the empty space. This approach can be used in conjunction with learning-based methods [44], by defining constraints based on perspective view rays [15, 45], orthographic projections [50], or learned projections [29]. It can even be extended to the single-view training-scenario if the distribution of the observed shape can be inferred prior to reconstruction [8, 56]. The main drawback of these methods, however, is that accurate silhouettes are difficult to automatically extract in natural scenes, which limits their applicability.

Another approach to encoding geometry relies on a renderer that generates images from a 3D representation [9, 16, 35, 52] and can function as a decoder in an autoencoder setup [1, 39]. For simple renderers, the rendering function can even be learned [5, 6] and act as an encoder. When put together, such learned encoders and decoders have been used for unsupervised learning, both with GANs [3, 43, 46] and without them [17]. In [40, 41], a CNN was trained to map to and from spherical mesh representations without supervision. While these methods also effectively learn a geometry-aware representation based on images, they have only been applied to well-constrained problems, such as face modeling. As such, it is unclear how they would generalize to the much larger degree of variability of 3D human poses.

Novel View Synthesis. Our approach borrows ideas from the novel view synthesis literature, which is devoted to the task of creating realistic images from previously unseen viewpoints. Most recent techniques rely on encoder-decoder architectures, where the latent code is augmented with view change information, such as yaw angle, and the decoder learns to reconstruct the encoded image from a new perspective [36, 37]. Large view changes are difficult. They have been achieved by relying on a recurrent network that performs incremental rotation steps [51]. Optical flow information [23, 53] and depth maps [7] have been used to further improve the results. While the above-mentioned techniques were demonstrated on simple objects, methods dedicated to generating images of humans have been proposed. However, most of these methods use additional information as input, such as part-segmentations [18] and 2D poses [19]. Here, we build on the approaches of [4, 49] that have been designed to handle large viewpoint changes. We describe these methods and our extensions in more detail in Sect. 3.

3 Unsupervised Geometry-Aware Latent Representation

Our goal is to design a latent representation $\mathbf {L}$ that encodes 3D pose, along with shape and appearance information, and can be learned without any 2D or 3D pose annotations. To achieve this, we propose to make use of sequences of images acquired from multiple synchronized and calibrated cameras. To be useful, such footage requires care during the setup and acquisition process. However, the amount of effort involved is negligible compared to what is needed to annotate tens of thousands of 2D or 3D poses.

For $\mathbf {L}$ to be practical, it must be easy to decode into its individual components. To this end, we learn from the images separate representations for the body’s 3D pose and geometry, its appearance, and that of the background. We will refer to them as $\mathbf {L}^{\text {3D}}$, $\mathbf {L}^\text {app}$, and $\mathbf {B}$, respectively.

Let us assume that we are given a set, $\mathcal U= \{ (\mathbf {I}_t^i,\mathbf {I}_t^j )\}_{t=1}^{N_u}$, of $N_u$ image pairs without annotations, where the i and j superscripts refer to the cameras used to capture the images, and the subscript t to the acquisition time. Let $\mathbf {R}^{i \rightarrow j}$ be the rotation matrix from the coordinate system of camera i to that of camera j. We now turn to the learning of the individual components of $\mathbf {L}$.

Learning to Encode Multi-view Geometry. For individual images, autoencoders such as the one shown on the right side of Fig. 2 have become standard tools to learn latent representations in unsupervised settings. Let such an autoencoder comprise an encoder $\mathcal E_{\theta _e}$ and a decoder $\mathcal D_{\theta _d}$, where $\theta _e$ and $\theta _d$ are the weights controlling their behaviors. For image representation purposes, an autoencoder can be used to encode an image $\mathbf {I}$ into a latent representation $\mathbf {L}=\mathcal E_{\theta _e}(\mathbf {I})$, which can then be decoded into a reconstructed image $\hat{\mathbf {I}}=\mathcal D_{\theta _d}(\mathbf {L})$. $\theta _e$ and $\theta _d$ are learned by minimizing $\Vert \mathbf {I}-\hat{\mathbf {I}} \Vert ^2$ on average over a training set $\mathcal U$.

To leverage multi-view geometry, we take our inspiration from Novel View Synthesis methods [4, 11, 36, 37, 49] that rely on training encoder-decoders on multiple views of the same object, such as a car or a chair. Let $(\mathbf {I}_t^i, \mathbf {I}_t^j) \in \mathcal U$ be two images taken from different viewpoints but at the same time t. Since we are given the rotation matrix $\mathbf {R}^{i \rightarrow j}$ connecting the two viewpoints, we could feed this information as an additional input to the encoder and decoder and train them to encode $\mathbf {I}_t^i$ and resynthesize $\mathbf {I}_t^j$, as in [36, 37]. Then, novel views of the object could be rendered by varying the rotation parameter $\mathbf {R}^{i \rightarrow j}$. However, this does not force the latent representation to encode 3D information explicitly. To this end, we model the latent representation $\mathbf {L}^{\text {3D}}\in \mathbb {R}^{3\times N}$ as a set of N points in 3D space by designing the encoder $\mathcal E_{\theta _e}$ and decoder $\mathcal D_{\theta _e}$ so that they have a three channel output and input, respectively, as shown on the left side of Fig. 2. This enables us to model the view-change as a proper 3D rotation by matrix multiplication of the encoder output by the rotation matrix before using it as input to the decoder. Formally, the output of the resulting autoencoder $\mathcal A_{\theta _e,\theta _d}$ can be written as

$$\begin{aligned} \mathcal A_{\theta _e,\theta _d}(\mathbf {I}_t^i, \mathbf {R}^{i \rightarrow j}) = \mathcal D_{\theta _d}(\mathbf {R}^{i \rightarrow j} \mathbf {L}^{\text {3D}}_{i,t} ) \text {, with } \mathbf {L}^{\text {3D}}_{i,t} = \mathcal E_{\theta _e}(\mathbf {I}_t^i) \; , \end{aligned}$$

(1)

and the weights $\theta _d$ and $\theta _e$ are optimized to minimize $\Vert \mathcal A_{\theta _e,\theta _d}( \mathbf {I}_t^i, \mathbf {R}^{i \rightarrow j}) - \mathbf {I}_t^j \Vert $ over the training set $\mathcal U$. In this setup, which was also used in [4, 49] and is inspired by [11], the decoder $\mathcal D$ does not need to learn how to rotate the input to a new view but only how to decode the 3D latent vector $\mathbf {L}^{\text {3D}}$. This means that the encoder is forced to map to a proper 3D latent space, that is, one that can still be decoded by $\mathcal D$ after an arbitrary rotation. However, while $\mathbf {L}^{\text {3D}}$ now encodes multi-view geometry, it also encodes the background and the person’s appearance. Our goal now is to isolate them from $\mathbf {L}^{\text {3D}}$ and to create two new vectors $\mathbf {B}$ and $\mathbf {L}^\text {app}$ that encode the latter two so that $\mathbf {L}^{\text {3D}}$ only represents geometry and 3D pose.

Factoring out the Background. Let us assume that we can construct background images $\mathbf {B}_j$, for example by taking the median of all the images taken from a given viewpoint j. To factor them out, we introduce in the decoder a direct connection to the target background $\mathbf {B}_j$, as shown in Fig. 2. More specifically, we concatenate the background image with the output of the decoder and use an additional $1\times 1$ convolutional layer to synthesize the decoded image. This frees the rest of the network from having to learn about the background and ensures that the $\mathbf {L}^{\text {3D}}$ vector we learn does not contain information about it anymore.

Factoring out Appearance. To separate appearance from geometry in our latent representation, we break up the output of the encoder $\mathcal E$ into two separate vectors $\mathbf {L}^{\text {3D}}$ and $\mathbf {L}^\text {app}$ that should describe pose and appearance, respectively. To enforce this separation, we train simultaneously on two frames $\mathbf {I}_t$ and $\mathbf {I}_{t'}$ depicting the same subject at different times, t and $t'$, as depicted in Fig. 3. While the decoder uses $\mathbf {L}^{\text {3D}}_t$ and $\mathbf {L}^{\text {3D}}_{t'}$, as before, it swaps $\mathbf {L}^\text {app}_t$ and $\mathbf {L}^\text {app}_{t'}$. In other words, the decoder uses $\mathbf {L}^{\text {3D}}_t$ and $\mathbf {L}^\text {app}_{t'}$ to resynthesize frame t and $\mathbf {L}^{\text {3D}}_{t'}$ and $\mathbf {L}^\text {app}_t$ for frame $t'$. Assuming that the person’s appearance does not change drastically between t and $t'$ and that differences in the images are caused by 3D pose changes, this results in $\mathbf {L}^{\text {3D}}$ encoding pose while $\mathbf {L}^\text {app}$ encodes appearance.

In practice, the encoder $\mathcal E$ has two outputs, that is, $\mathcal E_{\theta _e}: \mathbf {I}_t^i \rightarrow (\mathbf {L}^{\text {3D}}_{i,t},\mathbf {L}^\text {app}_{i,t})$ and the decoder $\mathcal D_{\theta _d}$ accepts these plus the background as inputs, after swap** appearance and rotating the geometric representation for two views i and j. We therefore write the output of our encoder-decoder as

$$\begin{aligned} \mathcal A_{\theta _e,\theta _d}(\mathbf {I}_t^i, \mathbf {R}^{i \rightarrow j},\ \mathbf {L}^\text {app}_{k,t'}, \mathbf {B}_{j}) = \mathcal D_{\theta _d}(\mathbf {R}^{i \rightarrow j} \mathbf {L}^{\text {3D}}_{i,t}, \mathbf {L}^\text {app}_{k,t'}, \mathbf {B}_{j}) \;. \end{aligned}$$

(2)

The viewpoint k can be arbitrary. The critical point is that it was acquired at time $t' \ne t$ such that the poses at t and $t'$ are uncorrelated. Thus, only time-invariant appearance features are encoded into $\mathbf {L}^\text {app}$. A similar exchange of information has been performed before in [28] for analogy transformations. It is related to works that separate facial identity, pose and illumination [17, 26, 51].

Combined Optimization. To train $\mathcal A$ with sequences featuring several people and backgrounds, we randomly select mini-batches of Z triplets $(\mathbf {I}_t^i,\mathbf {I}_t^j,\mathbf {I}_{t'}^k)$ in $\mathcal U$, with $t \ne t'$, from individual sequences. In other words, all three views feature the same person. The first two are taken at the same time but from different viewpoints. The third is taken at a different time and from an arbitrary viewpoint k. For each such mini-batch, we compute the loss

$$\begin{aligned} E_{\theta _d,\theta _e} = \frac{1}{Z} \sum _{\begin{array}{c} \mathbf {I}_t^i,\mathbf {I}_t^j,\mathbf {I}_{t'}^k \in \mathcal U\\ t \ne t' \end{array}} \Vert \mathcal A_{\theta _e,\theta _d}(\mathbf {I}_t^i, \mathbf {R}^{i \rightarrow j}, \mathbf {L}^\text {app}_{k,t'},\ \mathbf {B}_{j}) - \mathbf {I}_t^j \Vert \;, \end{aligned}$$

(3)

where $\mathbf {L}_{k,t'} = (\mathbf {L}^{\text {3D}}_{k,t'},\mathbf {L}^\text {app}_{k,t'})$ is the output of encoder $\mathcal E_{\theta _e}$ applied to image $\mathbf {I}_{t'}^k$, $\mathbf {B}_{j}$ is the background in view j, and $\mathbf {R}^{i \rightarrow j}$ denotes the rotation from view i to view j. Note that we apply $\mathcal E$ twice, to obtain $\mathbf {L}^{\text {3D}}_{i,t}$ and $\mathbf {L}^\text {app}_{k,t'}$ in Eq. 3 while ignoring $\mathbf {L}^\text {app}_{i,t}$ and $\mathbf {L}^{\text {3D}}_{k,t'}$ with the swap discussed above.

At training time, we minimize a total loss that is the sum of the pixel-wise error $E_{\theta _d,\theta _e}$ of Eq. 3 and a second term obtained by first applying a Resnet with 18 layers trained on ImageNet on the output and target image and then computing the feature difference after the second block level, as previously done with VGG by [23]. All individual pixel and feature differences are averaged and their influence is balanced by weighting the feature loss by two. We experiment with L1 and L2 norms. The L1 norm in combination with the additional feature term allows for crisper decodings and improved pose reconstruction.

Translation and Augmentation. Object scale and translation in depth direction are inherently ambiguous for monocular reconstruction and NVS. To make our model invariant instead of ambiguous to these effects, we use the crop information provided in the training datasets. We compute the rotation between two views with respect to the crop center instead of the image center and shear the cropped image so that it appears as if it were taken from a virtual camera pointing in the crop direction. With the human in the same position and scale, these crops remove the need to model object and camera translation. We also apply random in-plane rotations to increase view diversity. As a result, $\mathbf {R}^{i \rightarrow j}$ and $\mathbf {B}_j$ depend on time t, but we neglect this in our notation for readability.

4 3D Human Pose Estimation

Recall that our ultimate goal is to infer the 3D pose of a person from a monocular image. Since $\mathbf {L}^{\text {3D}}$ can be rotated and used to generate novel views, we are already part way there. Being a $3 \times N$ matrix, it can be understood as a set of N 3D points, but these do not have any semantic meaning. However, in most practical applications, one has to infer a pre-defined representation, such as a skeleton with K major human body joints, encoded as a vector $\mathbf {p}\in \mathbb {R}^{3 K}$.

To instantiate such a representation, we need a map** $\mathcal F: \mathbf {L}^{\text {3D}}\rightarrow \mathbb {R}^{3K}$, which can be thought as a different decoder that reconstructs 3D poses instead of images. To learn it, we rely on supervision. However, as we will see in the results section, the necessary amount of human annotations is much smaller than what would have been required to learn the map** directly from the images, as in many other recent approaches to human pose estimation.

Let $\mathcal L= \{(\mathbf {I}_t, \mathbf {p}_t)\}_{t=1}^{N_s}$ be a small set of $N_s$ labeled examples made of image pairs and corresponding ground-truth 3D poses. We model $\mathcal F$ as a deep network with parameters $\theta _f$. We train it by minimizing the objective function

$$\begin{aligned} E_{\theta _f} = \frac{1}{N_s} \sum _{t=1}^{N_s} \Vert \mathcal F_{\theta _f}(\mathbf {L}^{\text {3D}}_t) - \mathbf {p}_t \Vert \;, \text { with } (\mathbf {L}^{\text {3D}}_{t}, \cdot ) = \mathcal E_{\theta _e}(\mathbf {I}_t) \;. \end{aligned}$$

(4)

Because our latent representation $\mathbf {L}^{\text {3D}}$ already encodes human 3D pose and shape, $\mathcal F$ can be implemented as a simple two-layer fully-connected neural network. Together with the encoder-decoder introduced in Sect. 3, which is trained in an unsupervised manner, they form the semi-supervised setup depicted by Fig. 1(b). In other words, our unsupervised representation does a lot of the hard-work in the difficult task of lifting the image to a 3D representation, which makes the final map** comparatively easy.

5 Evaluation

In this section, we first evaluate our approach on the task of 3D human pose estimation, which is our main target application, and show that our representation enables us to use far less annotated training data than state-of-the-art approaches to achieve better accuracy. We then evaluate the quality of our latent space itself and show that it does indeed encode geometry, appearance, and background separately.

Dataset. We use the well-known Human3.6M (H36M) [12] dataset. It is recorded in a calibrated multi-view studio and ground-truth human poses are available for all frames. This makes it easy to compare different levels of supervision, unsupervised, semi-supervised, or fully supervised. As in previous approaches [22, 27, 31, 42, 54], we use the bounding boxes provided with the dataset to crop images.

5.1 Semi-supervised Human Pose Estimation

Our main focus is semi-supervised human pose estimation. We now demonstrate that, as shown in Fig. 4, recent state-of-the-art methods can do better than us when large amounts of annotated training data are available. However, as we use fewer and fewer of these annotations, the accuracy of the baselines suffers greatly whereas ours does not, which confers a significant advantage in situations where annotations are hard to obtain. We now explain in detail how the graphs of Fig. 4 were produced and further discuss their meaning.

Metrics. We evaluate pose prediction accuracy in terms of the mean per joint prediction error (MPJPE), and its normalized variants N-MPJPE and P-MPJPE, where poses are aligned to the ground truth in the least-square sense either in scale only or in scale, rotation and translation, respectively, before computing the MPJPE. The latter is also known as Procrustes alignment. We do this over 16 major human joints and all positions are centered at the pelvis, as in [54]. Our results are consistent across all metrics, as shown in Fig. 4(b).

Baselines. We compare our approach against the state-of-the-art semi-supervised method of [31], which uses the same input as ours and outputs normalized poses. We will refer to it as RhodinCVPR. We also use the popular ResNet-based architecture [22] to regress directly from the image to the 3D pose, as shown in Fig. 1(c), we will refer to this as Resnet.

Note that even higher accuracies on H36M than those of RhodinCVPR and Resnet have been reported in the literature [20, 24, 27, 38, 54] but they depend both on more complex architectures and using additional information such as labeled 2D poses [20, 22, 38, 54] or semantic segmentation [27], which is not our point here. We want to show that when using only 3D annotations and not many of them are available, our representation still allows us to perform well.

Implementation. We base our encoder-decoder architecture on the UNet [34] network, which was used to perform a similar task in [19]. We simply remove the skip connections to force the encoding of all information into the latent spaces and reduce the number of feature channels by half.

Concretely the encoder $\mathcal E$ consists of four blocks of two convolutions, where each two convolutions are followed by max pooling. The resulting convolutional features are of dimension $512\times 16\times 16$ for an input image resolution of $128\times 128$ pixels. These are mapped to $\mathbf {L}^\text {app}\in \mathbb {R}^{128}$ and $\mathbf {L}^{\text {3D}}\in \mathbb {R}^{200\times 3}$ by a single fully-connected layer followed by dropout with probability 0.3. The decoder $\mathcal D$ maps $\mathbf {L}^{\text {3D}}$ to a feature map of dimension $(512-128)\times 16\times 16$ with a fully-connected layer followed by ReLU and dropout and duplicates $\mathbf {L}^\text {app}$ to form a spatial uniform map of size $128\times 16\times 16$. These two maps are concatenated and then reconstructed by four blocks of two convolutions, where the first convolution is preceded by bilinear interpolation and all other pairs by up-convolutions. Each convolution is followed by batch-normalization and ReLU activation functions. We also experimented with a variant in which the encoder $\mathcal E$ is an off-the shelf Resnet with fifty layers [10], pre-trained on ImageNet, and the decoder is the same as before. We will refer to these two versions as OursUnet and OursResnet, respectively.

The pose decoder $\mathcal F$ is a fully-connected network with two hidden layers of dimension 2048. The ground-truth poses in the least-squares loss of Eq. 4 are defined as root-centered 3D poses. Poses and images are normalized by their mean and standard deviation on the training set. We use mini-batches of size 32 and the Adam optimizer with learning rate ${10}^{-3}$ for optimization of $\theta _e$, $\theta _d$ and $\theta _f$.

Dataset Splits. On H36M, we take the unlabeled set $\mathcal U$ used to learn our representation to be the complete training set—S1, S5, S6, S7 and S8, where SN refers to all sequences of the N$^{th}$ subject—but without the available 3D labels. To provide the required supervision to train the shallow network of Fig. 1(b), we then define several scenarios.

Fully supervised training with the 3D annotation of all five training subjects.
We use all the 3D annotations for S1; S1 and S5; or S1, S5 and S6.
We use only 50%, 10%, 5%, 1% or 0.1% of the 3D annotations for S1.

In all cases we used S9 and S11 for testing. We subsampled the test and training videos at 10ps to reduce redundancy and validation time. The resulting numbers of annotated images we used are shown along the x-axis of Fig. 4.

Comparison to the State of the Art. RhodinCVPR is the only method that is designed to leverage unlabeled multi-view footage without using a supplemental 2D dataset [31]. OursUnet outperforms it significantly, e.g., on labeled subject S1 by 13.6 mm (8.9% relative improvement) and OursResnetL1 even attains a gain of 35.7 mm (23.3% relative improvement). The fact that the Resnet architecture, training procedure, and dataset split is the same for our method and RhodinCVPR evidences that this gain is due to our new way of exploiting the unlabeled examples, thus showing the effectiveness of learning a geometry-aware latent representation in an unsupervised manner.

Discussion and Ablation Study. As shown in Fig. 4, when more than 300,000 annotated images are used the baselines outperform us. However, their accuracy decreases rapidly when fewer are available and our approach then starts dominating. It only loses accuracy very slowly down to 5,000 images and still performs adequately given only 500.

We used the L2 loss in Eq. 3 by default since our main goal is 3D pose estimation, not NVS quality. Interestingly, however, using the L1 loss makes reconstructions not only crisper but also 3D poses estimates more accurate. It improves pose accuracy consistently by about 5%, shown as OursResnetL1 in Fig. 4. Unless indicated otherwise, all results are produced with the L2 metric.

To better evaluate different aspects of our approach, we use the OursUnet version to conduct an ablation study whose results we report in Table 1. In short, not separating the background and appearance latent spaces reduces N-MPJPE by 14 mm and P-MPJPE by more than 12 mm. Using two hidden layers in $\mathcal F$ instead of one increases accuracy by 12 mm. The loss term based on ResNet-18 features not only leads to crisper NVS results but also improves pose estimation by 9 mm. Using bilinear upsampling instead of deconvolution for all decoding layers reduces performance by 4 mm. The largest decrease in accuracy by far, 46.1 mm, occurs when we use our standard OursUnet architecture but without our geometry-aware 3D latent space. It appears in the last line of the table on the left and strongly suggests that using our latent representation has more impact than tweaking the architecture in various ways.

Table 1. Ablation study, using S1 for semi-supervised training. The extensions to the NVS methods [36, 37] and [4, 49] as well as further model choices improve accuracy.

Full size table

5.2 Evaluating the Latent Representation Qualitatively

We now turn to evaluating the quality of our latent representation as such with a number of experiments on OursUnet. We show that geometry can be separated from appearance and background and that this improves results. The quality of the synthesized images is best seen in the supplemental videos.

Novel View Synthesis. Recall from Sect. 3 that $\mathcal E$ encodes the image into variables $\mathbf {L}^{\text {3D}}$ and $\mathbf {L}^\text {app}$, which are meant to represent geometry and appearance, respectively. To check that this is indeed the case, we multiply $\mathbf {L}^{\text {3D}}$ by different rotation matrices $\mathbf {R}$ and feed the result along with the original $\mathbf {L}^\text {app}$ to $\mathcal D$. Figure 5 depicts such synthesized novel views.

For comparison purposes, in Fig. 6, we synthesize rotated images without using our geometry-aware latent space, that is, as in [37]. The resulting images are far blurrier than those of OursResnet. Figure 6 further shows that results degrade without the background handling, that is, as in [4, 11, 49]. Using the L1 instead of L1 loss further improves reconstruction quality. Test subjects wear clothes that differ in color and shape from those seen in the training data. As a result, the geometry in the synthesized images remains correct, but the appearance ends up being a mixture of training appearances that approximates the unseen appearance. Arguably, using more than the five subjects that appear in the training set should result in a better encoding of appearance, which is something we plan to investigate in future work.

Appearance and Background Switching. Let $\mathbf {I}_j$ and $\mathbf {I}_g$ be two images of subjects j and g and $(\mathbf {L}^{\text {3D}}_j,\mathbf {L}^\text {app}_j,\mathbf {B}_j)=\mathcal E(\mathbf {I}_j)$ and $(\mathbf {L}^{\text {3D}}_g,\mathbf {L}^\text {app}_g,\mathbf {B}_g)=\mathcal E(\mathbf {I}_g)$ their encodings. Re-encoding using $\mathbf {L}^{\text {3D}}$ of one and $\mathbf {L}^\text {app}$ of the other yields results such as those depicted by Fig. 7. Note that the appearance of one is correctly transferred to the pose of the other while the geometry remains intact under rotation. This method could be used to generate additional training data, by changing the appearance of an existing multi-view sequence to synthesize images of the same motion being performed by multiple actors.

Similarly, we can switch backgrounds instead of appearances before decoding the latent vectors, as shown in Fig. 8. In one case, we make the background white and in the other we use a natural scene. In the first case, dark patches are visible below the subject, evidently modeling shadowing effects that were learned implicitly. In the second case, the green trees tend to be rendered as orange because our training scenes were mostly reddish—problem a larger training database would almost certainly cure.

5.3 Generalization and Limitations

To analyze the scalability of the unsupervised training we tested using only four out of the five unsupervised training subjects. The additional subject improves OurResnet drastically by 16 N-MPJPE. This indicates that training is not yet saturated and much higher accuracies seem possible by leveraging huge unsupervised sets. These, be it indoors or outdoors, are relatively easy to obtain.

In the data we used, some of the images contain a chair on which the subject sits. Interestingly, as shown in Fig. 9, the chair appearance and 3D position is faithfully reconstructed by our method. This suggests that it is not specific to human poses and can generalize to rigid objects as well as multiple object classes. In future work, we intend to apply it to such more generic problems.

We further tested our method on the MPI-INF-3DHP (3DHP) [21] dataset, which features more diverse clothing and viewpoints, such as low-hanging and ceiling cameras, and is therefore well suited to probe extreme conditions for NVS. Without changing any parameter, OursResnet is able to synthesis view transformations in roll, yaw and pitch, as shown in Fig. 10. On H36M, pitch transformation could not be learned due to the solely chest-height training views.

6 Conclusion

We have introduced an approach to learning a geometry-aware representation of the human body in an unsupervised manner, given only multi-view imagery. Our experiments have shown that this representation is effective both as an intermediate one for 3D pose estimation and for novel view synthesis. For pose estimation, our semi-supervised approach performs much better than state-of-the-art methods when only very little annotated data is available. In future work, we will extend its range by learning an equivalent latent representation for much larger multi-view datasets but still in an unsupervised manner.

Unsupervised Geometry-Aware Representation for 3D Human Pose Estimation

Abstract

Similar content being viewed by others

Self-supervised method for 3D human pose estimation with consistent shape and viewpoint factorization

Unsupervised Human Pose Estimation on Depth Images

Self6D: Self-supervised Monocular 6D Object Pose Estimation

Keywords

1 Introduction

3 Unsupervised Geometry-Aware Latent Representation

4 3D Human Pose Estimation

5 Evaluation

5.1 Semi-supervised Human Pose Estimation

5.2 Evaluating the Latent Representation Qualitatively

5.3 Generalization and Limitations

6 Conclusion

References

Acknowledgment

Author information

Authors and Affiliations

Corresponding author

Editor information

Editors and Affiliations

Rights and permissions

Copyright information

About this paper

Cite this paper

Download citation

Publish with us

Navigation

Unsupervised Geometry-Aware Representation for 3D Human Pose Estimation

Abstract

Similar content being viewed by others

Self-supervised method for 3D human pose estimation with consistent shape and viewpoint factorization

Unsupervised Human Pose Estimation on Depth Images

Self6D: Self-supervised Monocular 6D Object Pose Estimation

Keywords

1 Introduction

3 Unsupervised Geometry-Aware Latent Representation

4 3D Human Pose Estimation

5 Evaluation

5.1 Semi-supervised Human Pose Estimation

5.2 Evaluating the Latent Representation Qualitatively

5.3 Generalization and Limitations

6 Conclusion

References

Acknowledgment

Author information

Authors and Affiliations

Corresponding author

Editor information

Editors and Affiliations

Rights and permissions

Copyright information

About this paper

Cite this paper

Download citation

Share this paper

Publish with us

Search

Navigation