File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Variational 3D shape segmentation for bounding volume computation

TitleVariational 3D shape segmentation for bounding volume computation
Authors
Issue Date2007
PublisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGF
Citation
Computer Graphics Forum, 2007, v. 26 n. 3, p. 329-338 How to Cite?
AbstractWe propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-tightness, the resemblance to ellipsoid, a novel functional is formulated that governs an optimization process to obtain a partition with multiple components. Refinement of segmentation is driven by application-specific error measures, so that the final bounding volume meets pre-specified user requirement. We present examples to demonstrate the effectiveness of our method and show that it works well for computing ellipsoidal bounding volumes as well as oriented bounding boxes. © 2007 The Eurographics Association and Blackwell Publishing Ltd.
Persistent Identifierhttp://hdl.handle.net/10722/152375
ISSN
2015 Impact Factor: 1.542
2015 SCImago Journal Rankings: 0.960
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLu, Len_US
dc.contributor.authorChoi, YKen_US
dc.contributor.authorWang, Wen_US
dc.contributor.authorKim, MSen_US
dc.date.accessioned2012-06-26T06:37:44Z-
dc.date.available2012-06-26T06:37:44Z-
dc.date.issued2007en_US
dc.identifier.citationComputer Graphics Forum, 2007, v. 26 n. 3, p. 329-338en_US
dc.identifier.issn0167-7055en_US
dc.identifier.urihttp://hdl.handle.net/10722/152375-
dc.description.abstractWe propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-tightness, the resemblance to ellipsoid, a novel functional is formulated that governs an optimization process to obtain a partition with multiple components. Refinement of segmentation is driven by application-specific error measures, so that the final bounding volume meets pre-specified user requirement. We present examples to demonstrate the effectiveness of our method and show that it works well for computing ellipsoidal bounding volumes as well as oriented bounding boxes. © 2007 The Eurographics Association and Blackwell Publishing Ltd.en_US
dc.languageengen_US
dc.publisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/CGFen_US
dc.relation.ispartofComputer Graphics Forumen_US
dc.rightsComputer Graphics Forum: the international journal of the Eurographics Association. Copyright © Blackwell Publishing Ltd.-
dc.titleVariational 3D shape segmentation for bounding volume computationen_US
dc.typeArticleen_US
dc.identifier.emailChoi, YK:ykchoi@cs.hku.hken_US
dc.identifier.emailWang, W:wenping@cs.hku.hken_US
dc.identifier.authorityChoi, YK=rp00106en_US
dc.identifier.authorityWang, W=rp00186en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1111/j.1467-8659.2007.01055.xen_US
dc.identifier.scopuseid_2-s2.0-35349027851en_US
dc.identifier.hkuros141111-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-35349027851&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume26en_US
dc.identifier.issue3en_US
dc.identifier.spage329en_US
dc.identifier.epage338en_US
dc.identifier.isiWOS:000249660500014-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridLu, L=18133849600en_US
dc.identifier.scopusauthoridChoi, YK=7404777348en_US
dc.identifier.scopusauthoridWang, W=35147101600en_US
dc.identifier.scopusauthoridKim, MS=34975058900en_US
dc.identifier.citeulike1796041-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats