Fast and accurate surface normal integration on non-rectangular domains
Publication:2287959
DOI10.1007/s41095-016-0075-zzbMath1428.68309arXiv1610.06049OpenAlexW2537104680WikidataQ59528657 ScholiaQ59528657MaRDI QIDQ2287959
Martin Bähr, Ali Sharifi Boroujerdi, Jean-Denis Durou, Yvain Quéau, Michael Breuß
Publication date: 16 January 2020
Published in: Computational Visual Media (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.06049
preconditioningconjugate gradient methodKrylov subspace methods3D reconstructionphotometric stereofast marching methodPoisson integrationsurface normal integration
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Machine vision and scene understanding (68T45)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preconditioned conjugate gradients for solving singular systems
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Comparison of different Krylov subspace methods embedded in an implicit finite volume scheme for the computation of viscous and inviscid flow fields on unstructured grids
- Nonlinearities and noise reduction in 3-source photometric stereo
- Preconditioning techniques for large linear systems: A survey
- Regularized reconstruction of a surface from its measured gradient field
- Noise reduction in surface reconstruction from a given gradient field
- O(\(N\)) implementation of the fast marching algorithm
- Can Local Single-Pass Methods Solve Any Stationary Hamilton--Jacobi--Bellman Equation?
- Edge-Preserving Integration of a Normal Field: Weighted Least-Squares, TV and $$L^1$$ Approaches
- Direct analytical methods for solving Poisson equations in computer vision problems
- The variational approach to shape from shading
- A method for enforcing integrability in shape from shading algorithms
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Efficient algorithms for globally optimal trajectories
- A fast marching level set method for monotonically advancing fronts.
- The Lanczos and Conjugate Gradient Algorithms
- Methods of conjugate gradients for solving linear systems
- Optimal algorithm for shape from shading and path planning
This page was built for publication: Fast and accurate surface normal integration on non-rectangular domains