Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities

Authors:
Ady Ecker;Allan D. Jepson;Kiriakos N. Kutulakos
Affiliations:
Department of Computer Science, University of Toronto,;Department of Computer Science, University of Toronto,;Department of Computer Science, University of Toronto,
Venue:
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Year:
2008

Citing 19
Cited 4

A New Sense for Depth of Field

IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape from random planar features

Computer Vision, Graphics, and Image Processing
Integrability disambiguates surface recovery in two-image photometric stereo

International Journal of Computer Vision
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
Shape from Chebyshev Nets

ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume II - Volume II
Shape from Texture without Boundaries

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
On Non-Approximability for Quadratic Programs

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem

Computational Optimization and Applications
Combining Cues: Shape from Shading and Texture

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Shape from Shading: Recognizing the Mountains through a Global View

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Algorithm 875: DSDP5—software for semidefinite programming

ACM Transactions on Mathematical Software (TOMS)
Statistical approach to shape from shading: Reconstruction of three-dimensional face surfaces from single two-dimensional images

Neural Computation
Graph seriation using semi-definite programming

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Probabilistic subgraph matching based on convex relaxation

EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Multiclass image labeling with semidefinite programming

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II

Exploring ambiguities for monocular non-rigid shape estimation

ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
3D structure refinement of nonrigid surfaces through efficient image alignment

ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
Monocular Template-based Reconstruction of Inextensible Surfaces

International Journal of Computer Vision
Laplacian meshes for monocular 3d shape recovery

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

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.