Skip to main content
Conference ProceedingsOPEN ACCESS

Semidefinite programming heuristics for surface reconstruction ambiguities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5302 LNCS(PART 1) 127-140
DOI: 10.1007/978-3-540-88682-2_11
16Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the problem of reconstructing a smooth surface under constraints that have discrete ambiguities. These problems arise in areas such as shape from texture, shape from shading, photometric stereo and shape from defocus. While the problem is computationally hard, heuristics based on semidefinite programming may reveal the shape of the surface. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ecker, A., Jepson, A. D., & Kutulakos, K. N. (2008). Semidefinite programming heuristics for surface reconstruction ambiguities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5302 LNCS, pp. 127–140). Springer Verlag. https://doi.org/10.1007/978-3-540-88682-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free