Show simple item record

dc.contributor.authorFranco, Jean-Sebastienen_US
dc.contributor.authorPetit, Benjaminen_US
dc.contributor.authorBoyer, Edmonden_US
dc.contributor.editorMichael Bronstein and Jean Favre and Kai Hormannen_US
dc.date.accessioned2014-02-01T16:26:03Z
dc.date.available2014-02-01T16:26:03Z
dc.date.issued2013en_US
dc.identifier.isbn978-3-905674-51-4en_US
dc.identifier.urihttp://dx.doi.org/10.2312/PE.VMV.VMV13.065-072en_US
dc.description.abstractWe introduce shape cropping as the segmentation of a bounding geometry of an object as observed by sensors with different modalities. Segmenting a bounding volume is a preliminary step in many multi-view vision applications that consider or require the recovery of 3D information, in particular in multi-camera environments. Recent vision systems used to acquire such information often combine sensors of different types, usually color and depth sensors. Given depth and color images we present an efficient geometric algorithm to compute a polyhedral bounding surface that delimits the region in space where the object lies. The resulting cropped geometry eliminates unwanted space regions and enables the initialization of further processes including surface refinements. Our approach exploits the fact that such a region can be defined as the intersection of 3D regions identified as non empty in color or depth images. To this purpose, we propose a novel polyhedron combination algorithm that overcomes computational and robustness issues exhibited by traditional intersection tools in our context. We show the correction and effectiveness of the approach on various combination of inputs.en_US
dc.publisherThe Eurographics Associationen_US
dc.title3D Shape Croppingen_US
dc.description.seriesinformationVision, Modeling & Visualizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • VMV13
    ISBN 978-3-905674-51-4

Show simple item record