COMPOSE: Hypergraph Cover Optimization for Multi-view 3D Human Pose Estimation
Tony Danjun Wang, Tolga Birdal, Nassir Navab, Lennart Bastian
TL;DR
COMPOSE tackles 3D multi-view human pose estimation with sparse camera setups by moving beyond pairwise associations to a higher-order hypergraph formulation. It models detections across multiple views as hyperedges and casts correspondence as a weighted exact-cover problem, solved efficiently via ILP with a geometry-driven pruning strategy. The approach achieves state-of-the-art results among optimization-based methods and competitive performance relative to self-supervised learning on standard benchmarks, demonstrating strong robustness to occlusions and detection noise. This higher-order, geometry-guided framework offers practical benefits for accurate 3D pose reconstruction without requiring extensive 3D supervision, with potential downstream impact on tracking and activity understanding in multi-camera setups.
Abstract
3D pose estimation from sparse multi-views is a critical task for numerous applications, including action recognition, sports analysis, and human-robot interaction. Optimization-based methods typically follow a two-stage pipeline, first detecting 2D keypoints in each view and then associating these detections across views to triangulate the 3D pose. Existing methods rely on mere pairwise associations to model this correspondence problem, treating global consistency between views (i.e., cycle consistency) as a soft constraint. Yet, reconciling these constraints for multiple views becomes brittle when spurious associations propagate errors. We thus propose COMPOSE, a novel framework that formulates multi-view pose correspondence matching as a hypergraph partitioning problem rather than through pairwise association. While the complexity of the resulting integer linear program grows exponentially in theory, we introduce an efficient geometric pruning strategy to substantially reduce the search space. COMPOSE achieves improvements of up to 23% in average precision over previous optimization-based methods and up to 11% over self-supervised end-to-end learned methods, offering a promising solution to a widely studied problem.
