Skip to main navigation Skip to search Skip to main content

Continuous ratio optimization via convex relaxation with applications to multiview 3D reconstruction

  • University of Bonn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

We introduce a convex relaxation framework to optimally minimize continuous surface ratios. The key idea is to minimize the continuous surface ratio by solving a sequence of convex optimization problems. We show that such minimal ratios are superior to traditionally used minimal surface formulations in that they do not suffer from a shrinking bias and no longer require the choice of a regularity parameter. The absence of a shrinking bias in the minimal ratio model is proven analytically. Furthermore we demonstrate that continuous ratio optimization can be applied to derive a new algorithm for reconstructing three-dimensional silhouette-consistent objects from multiple views. Experimental results confirm that our approach allows to accurately reconstruct deep concavities even without the specification of tuning parameters.

Original languageEnglish
Title of host publication2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2009
PublisherIEEE Computer Society
Pages1858-1864
Number of pages7
ISBN (Print)9781424439935
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009 - Miami, FL, United States
Duration: 20 Jun 200925 Jun 2009

Publication series

Name2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Conference

Conference2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009
Country/TerritoryUnited States
CityMiami, FL
Period20/06/0925/06/09

Fingerprint

Dive into the research topics of 'Continuous ratio optimization via convex relaxation with applications to multiview 3D reconstruction'. Together they form a unique fingerprint.

Cite this