Jean Denis Durou

Mr. Jean Denis Durou


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 September 2017 in Journal of Mathematical Imaging and Vision
Verified
Journal Article
Closed access
PDF file
YQYvain Quéau
Yvain Quéau
BDBastien Durix
Bastien Durix
TWTao Wu
Tao Wu
DCDaniel Cremers
Daniel Cremers
FLFrançois Lauze
François Lauze
JDJean Denis Durou
Jean Denis Durou

15 March 2017 in Computational Visual Media
Verified
Journal Article
Open access
PDF file
MBMartin Bähr
Martin Bähr
MBMichael Breuß
Michael Breuß
YQYvain Quéau
Yvain Quéau
ABAli Sharifi Boroujerdi
Ali Sharifi Boroujerdi
JDJean Denis Durou
Jean Denis Durou
The integration of surface normals for the purpose of computing the shape of a surface in 3D space is a classic problem in computer vision. However, even nowadays it is still a challenging task to devise a method that is flexible enough to work on non-trivial computational domains with high accuracy, robustness, and computational efficiency. By uniting a classic approach for surface normal integration with modern computational techniques, we construct a solver that fulfils these requirements. Building upon the Poisson integration model, we use an iterative Krylov subspace solver as a core step in tackling the task. While such a method can be very efficient, it may only show its full potential when combined with suitable numerical preconditioning and problem-specific initialisation. We perform a thorough numerical study in order to identify an appropriate preconditioner for this purpose. To provide suitable initialisation, we compute this initial state using a recently developed fast marching integrator. Detailed numerical experiments illustrate the benefits of this novel combination. In addition, we show on real-world photometric stereo datasets that the developed numerical framework is flexible enough to tackle modern computer vision applications.


1 January 2017 in Image and Vision Computing
Verified
Journal Article
Open access
YQYvain Quéau
Yvain Quéau
RMRoberto Mecca
Roberto Mecca
JDJean Denis Durou
Jean Denis Durou
XDXavier Descombes
Xavier Descombes
This work tackles the problem of two-image photometric stereo. This problem constitutes the intermediate case between conventional photometric stereo with at least three images, which is well-posed, and shape-from-shading, which is ill-posed. We first provide a theoretical study of ambiguities arising in this intermediate case. Based on this study, we show that when the albedo is known, disambiguation can be formulated as a binary labeling problem, using integrability and a nonstationary Ising model. The resulting optimization problem is solved efficiently by resorting to the graph cut algorithm. These theoretical and numerical contributions are eventually validated in an application to three-image photometric stereo with shadows. We provide a theoretical study of ambiguities arising in two-image photometric stereo.Disambiguation is formulated as a binary labeling problem, using integrability and a nonstationary Ising model.Resolution is achieved efficiently by resorting to the graph cut algorithm.An application to three-image photometric stereo with shadows is presented.


17 September 2020
Verified
Book Chapter
Closed access
PDF file
JDJean Denis Durou
Jean Denis Durou
MFMaurizio Falcone
Maurizio Falcone
YQYvain Quéau
Yvain Quéau
STSilvia Tozza
Silvia Tozza