Improved Convex Decomposition with Ensembling and Boolean Primitives
<|reference_start|>Improved Convex Decomposition with Ensembling and Boolean Primitives: Describing a scene in terms of primitives -- geometrically simple shapes that offer a parsimonious but accurate abstraction of structure -- is an established vision problem. This is a good model of a difficult fitting problem: different scenes require different numbers of primitives and primitives interact strongly, but any proposed solution can be evaluated at inference time. The state of the art method involves a learned regression procedure to predict a start point consisting of a fixed number of primitives, followed by a descent method to refine the geometry and remove redundant primitives. Methods are evaluated by accuracy in depth and normal prediction and in scene segmentation. This paper shows that very significant improvements in accuracy can be obtained by (a) incorporating a small number of negative primitives and (b) ensembling over a number of different regression procedures. Ensembling is by refining each predicted start point, then choosing the best by fitting loss. Extensive experiments on a standard dataset confirm that negative primitives are useful in a large fraction of images, and that our refine-then-choose strategy outperforms choose-then-refine, confirming that the fitting problem is very difficult.<|reference_end|>
@article{vavilala2024improved,
    title={Improved Convex Decomposition with Ensembling and Boolean Primitives},
    author={Vaibhav Vavilala, Florian Kluger, Seemandhar Jain, Bodo Rosenhahn,
  David Forsyth},
    journal={arXiv preprint arXiv:2405.19569},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.19569},
    primaryClass={cs.CV}
}