Shape from Shading: Recognizing the Mountains through a Global View

Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities still exist. Therefore, we formulate the global disambiguation problem to resolve these ambiguities. Intuitively, it can be interpreted as flipping patches and adjusting heights such that the result surface has no kinks. The problem is intractable because exponentially many possible configurations need to be checked. Alternatively, we solve the integrability testing problem closely related to the original one. It can be viewed as finding a surface which satisfies the global integrability constraint. To encode the constraints, we introduce a graph formulation called configuration graph. Searching the solution on this graph can be reduced to a Max-cut problem and its solution is computable using semidefinite programming (SDP) relaxation. Tests carried out on synthetic and real images show that the global disambig...

• Type: Conference
• Year: 2006
• Where: CVPR
• Authors: Qihui Zhu, Jianbo Shi
• Keywords: Computer Vision, CVPR 2006, Global Disambiguation Problem, Global Integrability Constraint, Integrability Testing Problem, Local Ambiguities, Pixel Ambiguities