Surface Reconstruction From Normals: A Robust DGP-Based Discontinuity Preservation Approach

Wuyuan Xie, Miaohui Wang, Mingqiang Wei, Jianmin Jiang, Jing Qin

Introduction

In computer vision, particularly in Photometric Stereo (PS), the goal is often to reconstruct a 3D surface from a "normal map"—a grid of vectors representing surface orientations at every pixel. Traditional methods typically treat this as a global integration problem in a continuous domain. However, these techniques struggle with real-world surfaces that contain sharp edges, occlusions, and noise. By enforcing global integrability everywhere, they often "smear" boundaries or propagate local errors across the entire model, leading to ghosting artifacts and smoothed-out features.

Reconstructing surfaces with discontinuities from a normal map.

The Discontinuity Challenge

The core issue is that standard algorithms assume the surface is continuous everywhere. When faced with a sharp edge or a depth jump, these methods produce mathematical errors that manifest as visual distortions. This paper proposes a shift toward Discrete Geometry Processing (DGP), where the surface is modeled as a mesh of micro-square facets. Instead of forcing continuity, the authors treat discontinuities as intentional "breaks" in the mesh, allowing for the recovery of complex shapes even in the presence of heavy noise.

Methodology

The proposed approach relies on three key pillars to ensure robust reconstruction and edge preservation:

1. Incompatibility Features

To detect where a surface should be "broken," the method introduces two metrics:

  • Absolute Depth Difference (ADD): This measures the potential depth gap between adjacent facets based on their normals.
  • Normal Angle Difference (NAD): This measures sharp changes in orientation. While ADD can be sensitive to noise, NAD helps distinguish between a true geometric edge and random sensor fluctuations.

2. Vertex Splitting

A fundamental innovation of this work is the removal of the "one-to-one" constraint between grid points and vertices. By allowing a mesh vertex to "split" into multiple independent nodes (up to four), the system can physically represent an occlusion boundary or a sharp fold naturally.

Illustration of vertex splitting and depth gap delta between adjacent facets.

3. Statistical Optimization

The reconstruction is modeled as an energy minimization problem. To maintain efficiency, the authors use the statistical distribution of ADD and NAD features to automatically determine optimal thresholds. This "parameter-tuning free" approach reduces the search space by approximately 85%, making the algorithm both robust and computationally efficient compared to brute-force optimization.

Experimental Results

The researchers evaluated the method using synthetic models (e.g., Stanford Bunny, Face) and real-world benchmarks from the Harvard and DiLiGenT datasets.

  • Accuracy: The proposed method consistently achieved the lowest Mean Angular Error (MAE) compared to five state-of-the-art techniques, including Mumford-Shah and Fourier-based approaches.
  • Robustness: The system maintained high fidelity even with 6° of Gaussian noise, where traditional methods often failed or produced significant global distortions.
  • Visual Fidelity: Qualitative results demonstrate clean, separated boundaries at complex areas like the fingers of a hand or the ears of the Stanford Bunny, avoiding the "smearing" common in other methods.

Conclusion

By moving from continuous integration to a discrete geometry framework with vertex splitting, this approach successfully preserves sharp discontinuities in surface reconstruction. While future work may address diagonal connections and multi-view integration, this method represents a significant step forward in robustly handling noise and complex geometry in 3D reconstruction from normals.

Summary updated

Abstract

In 3D surface reconstruction from normals, discontinuity preservation is an important but challenging task. However, existing studies fail to address the discontinuous normal maps by enforcing the surface integrability in the continuous domain. This paper introduces a robust approach to preserve the surface discontinuity in the discrete geometry way. Firstly, we design two representative normal incompatibility features and propose an efficient discontinuity detection scheme to determine the splitting pattern for a discrete mesh. Secondly, we model the discontinuity preservation problem as a light-weight energy optimization framework by jointly considering the discontinuity detection and the overall reconstruction error. Lastly, we further shrink the feasible solution space to reduce the complexity based on the prior knowledge. Experiments show that the proposed method achieves the best performance on an extensive 3D dataset compared with the state-of-the-arts in terms of mean angular error and computational complexity.
BibTeX
@inproceedings{xie2019surface,
  author = {Wuyuan Xie and Miaohui Wang and Mingqiang Wei and Jianmin Jiang and Jing Qin},
  title = {{Surface Reconstruction From Normals: A Robust DGP-Based Discontinuity Preservation Approach}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year = {2019},
  doi = {10.1109/cvpr.2019.00547},
}

Loading related content...

Figure