We consider a category-level perception problem, where one is given 2D or 3D sensor data picturing an object of a given category (e.g., a car), and has to reconstruct the 3D pose and shape of the object despite intra-class variability (i.e., different car models have different shapes). We consider an active shape model, where -- for an object category -- we are given a library of potential CAD models describing objects in that category, and we adopt a standard formulation where pose and shape are estimated from 2D or 3D keypoints via non-convex optimization. Our first contribution is to develop PACE3D* and PACE2D*, the first certifiably optimal solvers for pose and shape estimation using 3D and 2D keypoints, respectively. Both solvers rely on the design of tight (i.e., exact) semidefinite relaxations. Our second contribution is to develop outlier-robust versions of both solvers, named PACE3D# and PACE2D#. Towards this goal, we propose ROBIN, a general graph-theoretic framework to prune outliers, which uses compatibility hypergraphs to model measurements' compatibility. We show that in category-level perception problems these hypergraphs can be built from winding orders of the keypoints (in 2D) or their convex hulls (in 3D), and many outliers can be pruned via maximum hyperclique computation. The last contribution is an extensive experimental evaluation. Besides providing an ablation study on simulated datasets and on the PASCAL dataset, we combine our solver with a deep keypoint detector, and show that PACE3D# improves over the state of the art in vehicle pose estimation in the ApolloScape datasets, and its runtime is compatible with practical applications.
翻译:我们考虑一个类级感知问题, 其中给某人提供 2D 或 3D 传感器数据, 显示给给定类别对象( 如汽车) 的 2D 或 3D 传感器数据, 并且必须重建对象的 3D 形状和形状, 尽管类内变异( 不同的汽车模型有不同的形状) 。 我们考虑一个活跃的形状模型, 其中给于我们一个描述该类对象的潜在 CAD 模型的库, 并且我们采用一种标准配方, 通过非 convex 优化来估计 2D 或 3D 键点的形状和形状。 我们的第一个贡献是开发 PACE3 和 3D 的 对象。 我们的第一个贡献是开发 PACE3 和 3D 。 我们的第一个贡献是开发 PACE3 和 PACE2D 的外点, 用于开发PACE, 用于开发 PACE3 和 PRED 的 。 我们提议在 CROB 类 中, 一个可以使用直径直径解 数据 的直径解 数据框架 。