Original: Geo-Neus: Geometry-Consistent Neural Implicit Surfaces Learning for Multi-view Reconstruction
Revised: Geo-Neus: Geometry-Consistent Neural Implicit Surfaces Learning for Multi-view Reconstruction

Original: Abstract
Revised: Abstract

Original: Recently, neural implicit surfaces learning by volume rendering has become popular for multi-view reconstruction.
Revised: Recently, neural implicit surfaces learning by volume rendering has become popular for multi-view reconstruction.

Original: However, one key challenge remains: existing approaches lack explicit multi-view geometry constraints, hence usually fail to generate geometry-consistent surface reconstruction.
Revised: However, one key challenge remains: existing approaches lack explicit multi-view geometry constraints, hence usually fail to generate geometry-consistent surface reconstruction.

Original: To address this challenge, we propose geometry-consistent neural implicit surfaces learning for multi-view reconstruction.
Revised: To address this challenge, we propose geometry-consistent neural implicit surfaces learning for multi-view reconstruction.

Original: We theoretically analyze that there exists a gap between the volume rendering integral and point-based signed distance function (SDF) modeling.
Revised: We theoretically analyze that there exists a gap between the volume rendering integral and point-based signed distance function (SDF) modeling.

Original: To bridge this gap, we directly locate the zero-level set of SDF networks and explicitly perform multi-view geometry optimization by leveraging the sparse geometry from structure from motion (SFM) and photometric consistency in multi-view stereo.
Revised: To bridge this gap, we directly locate the zero-level set of SDF networks and explicitly perform multi-view geometry optimization by leveraging the sparse geometry from structure from motion (SFM) and photometric consistency in multi-view stereo.

Original: This makes our SDF optimization unbiased and allows the multi-view geometry constraints to focus on the true surface optimization.
Revised: This makes our SDF optimization unbiased and allows the multi-view geometry constraints to focus on the true surface optimization.

Original: Extensive experiments show that our proposed method achieves high-quality surface reconstruction in both complex thin structures and large smooth regions, thus outperforming the state-ofthe-arts by a large margin.
Revised: Extensive experiments show that our proposed method achieves high-quality surface reconstruction in both complex thin structures and large smooth regions, thus outperforming the state-ofthe-arts by a large margin.

Original: Code: https://github.com/GhiXu/Geo-Neus .
Revised: Code: https://github.com/GhiXu/Geo-Neus .

Original:  Introduction
Revised:  Introduction

Original: Reconstructing surfaces from calibrated multi-view images is a long-standing problem in computer vision and graphics.
Revised: Reconstructing surfaces from calibrated multi-view images is a long-standing problem in computer vision and graphics.

Original: In the past years, traditional methods [30, 37, 15, 17] have adopted a multi-step pipeline to achieve impressive reconstruction results.
Revised: In the past years, traditional methods [30, 37, 15, 17] have adopted a multi-step pipeline to achieve impressive reconstruction results.

Original: Such a pipeline requires depth maps or point clouds to generate surface meshes.
Revised: Such a pipeline requires depth maps or point clouds to generate surface meshes.

Original: These intermediate representations inevitably introduce accumulated errors for the final reconstructed geometry.
Revised: These intermediate representations inevitably introduce accumulated errors for the final reconstructed geometry.

Original: Recently, directly reconstructing surfaces from images [25, 43, 35, 42, 26] has attracted great interest for its potential to alleviate the accumulated errors and produce high-quality reconstructions.
Revised: Recently, directly reconstructing surfaces from images [25, 43, 35, 42, 26] has attracted great interest for its potential to alleviate the accumulated errors and produce high-quality reconstructions.

Original: To achieve this, existing approaches represent surfaces as neural implicit representations and leverage volume rendering [21] to optimize them.
Revised: To achieve this, existing approaches represent surfaces as neural implicit representations and leverage volume rendering [21] to optimize them.

Original: Inspired by neural volume rendering [23, 45] that simultaneously learns volume density and radiance field from input images, recent works [35, 42] use signed distance functions (SDF) [27] for surface representation and introduce the SDF-induced density function to enable the volume rendering to learn an implicit SDF representation.
Revised: Inspired by neural volume rendering [23, 45] that simultaneously learns volume density and radiance field from input images, recent works [35, 42] use signed distance functions (SDF) [27] for surface representation and introduce the SDF-induced density function to enable the volume rendering to learn an implicit SDF representation.

Original: In essence, these works still focus on direct color field modeling by volume rendering integral rather than explicit multi-view geometry optimization.
Revised: In essence, these works still focus on direct color field modeling by volume rendering integral rather than explicit multi-view geometry optimization.

Original: Therefore, existing approaches usually fail to generate geometry-consistent surface reconstruction.
Revised: Therefore, existing approaches usually fail to generate geometry-consistent surface reconstruction.

Original: Intuitively, volume rendering samples multiple points along each ray and expresses the output pixel colors as the integral of the radiance field, or the weighted sum of sampled colors along the ray (cf.
Revised: Intuitively, volume rendering samples multiple points along each ray and expresses the output pixel colors as the integral of the radiance field, or the weighted sum of sampled colors along the ray (cf.

Original: Fig.
Revised: Fig.

Original: 1(a)).
Revised: 1(a)).

Original: It means that the volume rendering integral directly optimizes the integral of geometry instead of the
Revised: It means that the volume rendering integral directly optimizes the integral of geometry instead of the

Original: [Figure]
Revised: [Figure]

Original: single surface intersection along the ray.
Revised: single surface intersection along the ray.

Original: This obviously introduces bias for geometry modeling, thus hindering true surface optimization.
Revised: This obviously introduces bias for geometry modeling, thus hindering true surface optimization.

Original: In Fig.1(b), we show the reconstruction case of NeuS [35], in which the bias between rendered colors and object geometry can be observed intuitively.
Revised: In Fig.1(b), we show the reconstruction case of NeuS [35], in which the bias between rendered colors and object geometry can be observed intuitively.

Original: Rendered colors are obtained by the color network via volume rendering.
Revised: Rendered colors are obtained by the color network via volume rendering.

Original: Surface colors are formed by the predicted colors of the surface where the SDF values are zeroes.
Revised: Surface colors are formed by the predicted colors of the surface where the SDF values are zeroes.

Original: It can be easily seen that there exists a gap between the rendered colors and the surface colors.
Revised: It can be easily seen that there exists a gap between the rendered colors and the surface colors.

Original: Thus the reconstructed surface is imprecise despite the high-quality rendered image, indicating the bias between the color rendering and implicit geometry.
Revised: Thus the reconstructed surface is imprecise despite the high-quality rendered image, indicating the bias between the color rendering and implicit geometry.

Original: (Detailed theoretical analysis will be elaborated later).
Revised: (Detailed theoretical analysis will be elaborated later).

Original: To address the above problem, we propose Geo-Neus to devise an explicit and accurate neural geometry optimization model for geometry-consistent neural implicit surfaces learning by volume rendering, leading to better multi-view 3D reconstruction.
Revised: To address the above problem, we propose Geo-Neus to devise an explicit and accurate neural geometry optimization model for geometry-consistent neural implicit surfaces learning by volume rendering, leading to better multi-view 3D reconstruction.

Original: Specifically, we directly locate the zerolevel set of SDF networks and explicitly perform multi-view geometry optimization by leveraging the sparse geometry from structure from motion (SFM) and photometric consistency in multi-view stereo.
Revised: Specifically, we directly locate the zerolevel set of SDF networks and explicitly perform multi-view geometry optimization by leveraging the sparse geometry from structure from motion (SFM) and photometric consistency in multi-view stereo.

Original: This model has several benefits.
Revised: This model has several benefits.

Original: First, directly locating the zero-level set of SDF networks guarantees that our geometry modeling is unbiased.
Revised: First, directly locating the zero-level set of SDF networks guarantees that our geometry modeling is unbiased.

Original: This enables our method to focus on true surface optimization.
Revised: This enables our method to focus on true surface optimization.

Original: Second, we show that explicitly enforcing multi-view geometry constraints on the located zero-level set of SDF networks allows our method to generate geometry-consistent surface reconstruction.
Revised: Second, we show that explicitly enforcing multi-view geometry constraints on the located zero-level set of SDF networks allows our method to generate geometry-consistent surface reconstruction.

Original: Previous neural implicit surfaces learning mainly uses the rendering loss to implicitly optimize SDF networks.
Revised: Previous neural implicit surfaces learning mainly uses the rendering loss to implicitly optimize SDF networks.

Original: This results in geometry ambiguity during the training optimization.
Revised: This results in geometry ambiguity during the training optimization.

Original: Our introduced two types of explicit multi-view constraints encourage our SDF networks to reason about the correct geometry, including both complex thin structures and large smooth regions.
Revised: Our introduced two types of explicit multi-view constraints encourage our SDF networks to reason about the correct geometry, including both complex thin structures and large smooth regions.

Original: In summary, our contributions are: 1) We theoretically analyze that there exists a gap between volume rendering integral and point-based SDF modeling.
Revised: In summary, our contributions are: 1) We theoretically analyze that there exists a gap between volume rendering integral and point-based SDF modeling.

Original: This demonstrates that it is necessary to directly supervise the SDF networks to boost the neural implicit surfaces learning. 2)
Revised: This demonstrates that it is necessary to directly supervise the SDF networks to boost the neural implicit surfaces learning. 2)

Original: Based on our theoretical analysis, we propose to directly locate the zero-level set of SDF networks and leverage multi-view geometry constraints to explicitly supervise the training of SDF networks.
Revised: Based on our theoretical analysis, we propose to directly locate the zero-level set of SDF networks and leverage multi-view geometry constraints to explicitly supervise the training of SDF networks.

Original: In this way, the SDF networks are encouraged to focus on true surface optimization.
Revised: In this way, the SDF networks are encouraged to focus on true surface optimization.

Original: Extensive experiments further validate the effectiveness of our theoretical analysis and the proposed direct optimization of SDF networks.
Revised: Extensive experiments further validate the effectiveness of our theoretical analysis and the proposed direct optimization of SDF networks.

Original: We show that our proposed Geo-Neus is capable to reconstruct both complex thin structures and large smooth regions.
Revised: We show that our proposed Geo-Neus is capable to reconstruct both complex thin structures and large smooth regions.

Original: Therefore, it greatly outperforms the state-of-the-art surface reconstruction methods, including traditional methods and neural implicit surface learning methods.
Revised: Therefore, it greatly outperforms the state-of-the-art surface reconstruction methods, including traditional methods and neural implicit surface learning methods.

Original:  Related work
Revised:  Related work

Original: Traditional multi-view 3D reconstruction.
Revised: Traditional multi-view 3D reconstruction.

Original: Traditional multi-view 3D reconstruction is the classical pipeline of surface reconstruction from multi-view images.
Revised: Traditional multi-view 3D reconstruction is the classical pipeline of surface reconstruction from multi-view images.

Original: Given multi-view input images, traditional multi-view 3D reconstruction uses structure from motion (SFM) [33, 29] to extract and match features of neighbor views, and estimate camera parameters and sparse 3D points.
Revised: Given multi-view input images, traditional multi-view 3D reconstruction uses structure from motion (SFM) [33, 29] to extract and match features of neighbor views, and estimate camera parameters and sparse 3D points.

Original: After that, multi-view stereo (MVS) [30, 9, 37, 38, 36] is applied to estimate dense depth maps for each view and then all the depth maps are fused into dense point clouds.
Revised: After that, multi-view stereo (MVS) [30, 9, 37, 38, 36] is applied to estimate dense depth maps for each view and then all the depth maps are fused into dense point clouds.

Original: Finally, the surface reconstruction method [15, 17, 6], e.g., screened Poisson Surface Reconstruction [15] is used to reconstruct surfaces from point clouds.
Revised: Finally, the surface reconstruction method [15, 17, 6], e.g., screened Poisson Surface Reconstruction [15] is used to reconstruct surfaces from point clouds.

Original: Traditional methods have achieved great success on various occasions, but there exists incompleteness of surface in some cases because their multiple intermediate steps are not made into an ensemble.
Revised: Traditional methods have achieved great success on various occasions, but there exists incompleteness of surface in some cases because their multiple intermediate steps are not made into an ensemble.

Original: With the development of deep learning, many attempts have been made on learning-based multi-view reconstruction [14, 40, 39, 27, 22], but the problem still exists.
Revised: With the development of deep learning, many attempts have been made on learning-based multi-view reconstruction [14, 40, 39, 27, 22], but the problem still exists.

Original: Implicit representation of surface.
Revised: Implicit representation of surface.

Original: Surface reconstruction methods can be generally divided into explicit methods and implicit methods, depending on the representation of surface.
Revised: Surface reconstruction methods can be generally divided into explicit methods and implicit methods, depending on the representation of surface.

Original: Explicit representation includes voxels [5, 31] and triangular mesh [3, 4, 16], which are limited by the resolution.
Revised: Explicit representation includes voxels [5, 31] and triangular mesh [3, 4, 16], which are limited by the resolution.

Original: Implicit representation uses an implicit function to represent the surface and thus is continuous.
Revised: Implicit representation uses an implicit function to represent the surface and thus is continuous.

Original: The surface can be extracted using the implicit function at any resolution.
Revised: The surface can be extracted using the implicit function at any resolution.

Original: Traditional reconstruction methods, e.g., screened Poisson Surface Reconstruction [15], use basic functions to form the implicit function.
Revised: Traditional reconstruction methods, e.g., screened Poisson Surface Reconstruction [15], use basic functions to form the implicit function.

Original: As for learning-based methods, the most commonly used forms are the occupancy function [22, 28] and the signed distance function (SDF) [27] represented by the network.
Revised: As for learning-based methods, the most commonly used forms are the occupancy function [22, 28] and the signed distance function (SDF) [27] represented by the network.

Original: Based on these functions, many implicit surface reconstruction methods from point clouds have been proposed, e.g., ONet [22], DeepSDF [27], Point2Surf [8] and etc.
Revised: Based on these functions, many implicit surface reconstruction methods from point clouds have been proposed, e.g., ONet [22], DeepSDF [27], Point2Surf [8] and etc.

Original: For these methods, point clouds are obtained by scanner devices or multi-view stereo methods.
Revised: For these methods, point clouds are obtained by scanner devices or multi-view stereo methods.

Original: That is, these point clouds are uniform and complete.
Revised: That is, these point clouds are uniform and complete.

Original: Therefore, these methods are rarely applied on the sparse point clouds produced by
Revised: Therefore, these methods are rarely applied on the sparse point clouds produced by

Original: SFM to reconstruct surfaces (In fact, we show that these methods degrade on sparse point clouds from
Revised: SFM to reconstruct surfaces (In fact, we show that these methods degrade on sparse point clouds from

Original: SFM in our supplementary material).
Revised: SFM in our supplementary material).

Original: In this work, we use the sparse points from SFM as an explicit geometry supervision and show that they can facilitate the neural implicit surface reconstruction.
Revised: In this work, we use the sparse points from SFM as an explicit geometry supervision and show that they can facilitate the neural implicit surface reconstruction.

Original: Neural implicit surface reconstruction.
Revised: Neural implicit surface reconstruction.

Original: Neural implicit field is a new way to represent the geometry of objects.
Revised: Neural implicit field is a new way to represent the geometry of objects.

Original: With NeRF [23] first using the neural radiance field represented by Multi-Layer
Revised: With NeRF [23] first using the neural radiance field represented by Multi-Layer

Original: Perceptron (MLP) in novel view synthesis, plenty of works [32, 18, 20] have sprung up using neural networks to represent scenes.
Revised: Perceptron (MLP) in novel view synthesis, plenty of works [32, 18, 20] have sprung up using neural networks to represent scenes.

Original: IDR [43] reconstructs surfaces with neural networks by representing the geometry as the zero level set of an MLP that is considered to be an SDF.
Revised: IDR [43] reconstructs surfaces with neural networks by representing the geometry as the zero level set of an MLP that is considered to be an SDF.

Original: MVSDF [44] imports information from the MVS network to arrive at more geometry priors.
Revised: MVSDF [44] imports information from the MVS network to arrive at more geometry priors.

Original: VolSDF [42] and NeuS [35] use the weight function that involved SDF during the rendering process to make colors and geometry closer.
Revised: VolSDF [42] and NeuS [35] use the weight function that involved SDF during the rendering process to make colors and geometry closer.

Original: UNISURF [26] explores the balance between surface rendering and volume rendering.
Revised: UNISURF [26] explores the balance between surface rendering and volume rendering.

Original: The surface reconstructed by the neural network shows better completeness compared with the traditional multi-view reconstruction methods, especially when dealing with non-Lambertian cases.
Revised: The surface reconstructed by the neural network shows better completeness compared with the traditional multi-view reconstruction methods, especially when dealing with non-Lambertian cases.

Original: However, complex structures are not handled well.
Revised: However, complex structures are not handled well.

Original: Meanwhile, flat planes and sharp corners could not be guaranteed.
Revised: Meanwhile, flat planes and sharp corners could not be guaranteed.

Original: NeuralWarp
Revised: NeuralWarp

Original: [7], a concurrent work, also explores the use of patch-match on neural surface reconstruction.
Revised: [7], a concurrent work, also explores the use of patch-match on neural surface reconstruction.

Original: It combines volumetric rendering with a patch warping integration technique, which aggregates colors from points sampled along the camera ray from source views with patch warping.
Revised: It combines volumetric rendering with a patch warping integration technique, which aggregates colors from points sampled along the camera ray from source views with patch warping.

Original: This way of patch aggregation is similar with volume rendering and shares the same sampled points and the same weights with those used by color integration.
Revised: This way of patch aggregation is similar with volume rendering and shares the same sampled points and the same weights with those used by color integration.

Original: Note that NeuralWarp uses patch match with the color aggregation to optimize weights of samples points, and thus to optimize the geometry indirectly.
Revised: Note that NeuralWarp uses patch match with the color aggregation to optimize weights of sampled points, and thus to optimize the geometry indirectly.

Original: As we will analyze later, this kind of color integration operation will cause bias in the colors and the geometry.
Revised: As we will analyze later, this kind of color integration operation will cause bias in the colors and the geometry.

Original: Therefore, NeuralWarp could not be trained from scratch and relies on the pre-trained model of VolSDF.
Revised: Therefore, NeuralWarp could not be trained from scratch and relies on the pre-trained model of VolSDF.

Original: Differently from NeuralWarp, our method locates the predicted surface of the SDF network using SDF-based interpolation and uses patch match to measure the photometric consistency among neighboring views.
Revised: Differently from NeuralWarp, our method locates the predicted surface of the SDF network using SDF-based interpolation and uses patch match to measure the photometric consistency among neighboring views.

Original: In this way, Geo-Neus can be trained from scratch and gets much better performance.
Revised: In this way, Geo-Neus can be trained from scratch and gets much better performance.

Original:  Method
Revised:  Method

Original: Given posed multi-view images of an object, we aim at reconstructing the surface by neural volume rendering without mask supervision.
Revised: Given posed multi-view images of an object, we aim at reconstructing the surface by neural volume rendering without mask supervision.

Original: The spatial field of the object is represented by a signed distance function (SDF), and the corresponding surface is extracted using the zero level set of the SDF.
Revised: The spatial field of the object is represented by a signed distance function (SDF), and the corresponding surface is extracted using the zero level set of the SDF.

Original: In the process of volume rendering, our goal is to optimize the signed distance function.
Revised: In the process of volume rendering, our goal is to optimize the signed distance function.

Original: In this section, we first analyze the inherent bias in color rendering which causes the inconsistency between rendered colors and implicit geometry.
Revised: In this section, we first analyze the inherent bias in color rendering which causes the inconsistency between rendered colors and implicit geometry.

Original: Then we introduce explicit SDF optimization to achieve geometry consistency.
Revised: Then we introduce explicit SDF optimization to achieve geometry consistency.

Original: An overview of our approach is shown in Fig.
Revised: An overview of our approach is shown in Fig.

Original: 3.1 Bias in color rendering
Revised: 3.1 Bias in color rendering

Original: In the process of volume rending, there is a gap between the rendered colors and the geometry of the object.
Revised: In the process of volume rending, there is a gap between the rendered colors and the geometry of the object.

Original: The rendered colors are not consistent with the real colors of the surface.
Revised: The rendered colors are not consistent with the real colors of the surface.

Original: [Figure]
Revised: [Figure]

Original: [Figure]
Revised: [Figure]

Original: For an opaque solid object Ω ∈ R 3 , the opacity can be represented by an indicator function O
Revised: For an opaque solid object Ω ∈ R 3 , the opacity can be represented by an indicator function O

Original: [Equation]
Revised: [Equation]

Original: p ) :
Revised: p ) :

Original: [Equation]
Revised: [Equation]

Original: When we see some colors or we capture some colors with cameras, the colors are the light that transfers along the light ray into our eyes or cameras.
Revised: When we see some colors or we capture some colors with cameras, the colors are the light that transfers along the light ray into our eyes or cameras.

Original: Based on the inherent optical properties of the opaque solid object, we approximately assume that the colors C of image set { I i } are the colors c of object intersecting with the light ray v from the corresponding camera position o :
Revised: Based on the inherent optical properties of the opaque solid object, we approximately assume that the colors C of image set { I i } are the colors c of object intersecting with the light ray v from the corresponding camera position o :

Original: [Equation]
Revised: [Equation]

Original: where t ∗ = argmin { t | o + t v = p ,
Revised: where t ∗ = argmin { t | o + t v = p ,

Original: p ∈ ∂
Revised: p ∈ ∂

Original: Ω , t ∈ (0 , ∞ ) } .
Revised: Ω , t ∈ (0 , ∞ ) } .

Original: ∂ Ω represents geometry surfaces.
Revised: ∂ Ω represents geometry surfaces.

Original: The assumption is appropriate because light that transmits through the opaque object can be omitted.
Revised: The assumption is appropriate because light that transmits through the opaque object can be omitted.

Original: The intensity of light decays to about zero drastically when passing through the surface of the opaque object.
Revised: The intensity of light decays to about zero drastically when passing through the surface of the opaque object.

Original: Let us represent the surface of the object mathematically with the signed distance function.
Revised: Let us represent the surface of the object mathematically with the signed distance function.

Original: The signed distance function sdf ( p ) is the signed distance between a spatial point p and the surface ∂Ω .
Revised: The signed distance function sdf ( p ) is the signed distance between a spatial point p and the surface ∂Ω .

Original: In this way, the surface ∂Ω can be represented as:
Revised: In this way, the surface ∂Ω can be represented as:

Original: [Equation]
Revised: [Equation]

Original: With neural volume rendering, we estimate the signed distance function ˆ sdf and color field ˆ c by
Revised: With neural volume rendering, we estimate the signed distance function ˆ sdf and color field ˆ c by

Original: Multi-Layer Perceptron (MLP) networks F Θ and G Φ :
Revised: Multi-Layer Perceptron (MLP) networks F Θ and G Φ :

Original: [Equation]
Revised: [Equation]

Original: Thus the estimated colors of the image with camera position o can be represented as:
Revised: Thus the estimated colors of the image with camera position o can be represented as:

Original: [Equation]
Revised: [Equation]

Original: where t is the depth along the ray that comes from o with the direction v and w ( t ) is a weight for the point at t .
Revised: where t is the depth along the ray that comes from o with the direction v and w ( t ) is a weight for the point at t .

Original: For simplicity, the notes o and v are omitted.
Revised: For simplicity, the notes o and v are omitted.

Original: To obtain discrete counterparts of w and ˆ c , we also sample t i discretely along the ray and use the Riemann sum:
Revised: To obtain discrete counterparts of w and ˆ c , we also sample t i discretely along the ray and use the Riemann sum:

Original: [Equation]
Revised: [Equation]

Original: Following NeuS [35], w ( t i ) is computed as w ( t i )
Revised: Following NeuS [35], w ( t i ) is computed as w ( t i )

Original: =
Revised: =

Original: T ( t i ) α ( t i ) , where T ( t i ) = (cid:81) i − 1 j =1 (1 − α
Revised: T ( t i ) α ( t i ) , where T ( t i ) = (cid:81) i − 1 j =1 (1 − α

Original: ( t j )) represents accumulated transmittance, α ( t i )
Revised: ( t j )) represents accumulated transmittance, α ( t i )

Original: =
Revised: =

Original: max ( Φ s ( sdf ( p i ))
Revised: max ( Φ s ( sdf ( p i ))

Original: − Φ s ( sdf ( p i +1 ))
Revised: − Φ s ( sdf ( p i +1 ))

Original: Φ s ( sdf ( p i )) , 0) is opacity, and p i represents the sampled spatial point at t i .
Revised: Φ s ( sdf ( p i )) , 0) is opacity, and p i represents the sampled spatial point at t i .

Original: Φ s ( x ) =
Revised: Φ s ( x ) =

Original: (1 + e − sx ) − 1 is a Sigmoid function, where s is a learnable parameter which controls the smoothness of the transition at the surface.
Revised: (1 + e − sx ) − 1 is a Sigmoid function, where s is a learnable parameter which controls the smoothness of the transition at the surface.

Original: Notably, the goal of novel view synthesis is to make an accurate prediction of the colors ˆ C , and bend efforts to minimize the difference between the colors of ground truth images C and the prediction ˆ C :
Revised: Notably, the goal of novel view synthesis is to make an accurate prediction of the colors ˆ C , and bend efforts to minimize the difference between the colors of ground truth images C and the prediction ˆ C :

Original: [Equation]
Revised: [Equation]

Original: In surface reconstruction tasks, what we concentrate more is the surface of the object rather than the color.
Revised: In surface reconstruction tasks, what we concentrate more is the surface of the object rather than the color.

Original: In this way, the above formula can be rewritten as:
Revised: In this way, the above formula can be rewritten as:

Original: [Equation]
Revised: [Equation]

Original: where ˆ sdf ( ˆ t ∗ ) = 0 , t j denotes the nearest sample point from ˆ t ∗ , ε sample denotes the bias caused by sampling operation and ε weight denotes the bias caused by weighted sum operation of volume rendering.
Revised: where ˆ sdf ( ˆ t ∗ ) = 0 , t j denotes the nearest sample point from ˆ t ∗ , ε sample denotes the bias caused by sampling operation and ε weight denotes the bias caused by weighted sum operation of volume rendering.

Original: With Formula (2), it can be rewritten as:
Revised: With Formula (2), it can be rewritten as:

Original: [Equation]
Revised: [Equation]

Original: There the total bias between the colors of object surface and estimated surface is:
Revised: There the total bias between the colors of object surface and estimated surface is:

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: The relative bias is:
Revised: The relative bias is:

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: [Figure]
Revised: [Figure]

Original: When w ( t j ) approaches to 1 , ε weight approaches to 0 and δc approaches to ε sample / c
Revised: When w ( t j ) approaches to 1 , ε weight approaches to 0 and δc approaches to ε sample / c

Original: ( t ∗ ) .
Revised: ( t ∗ ) .

Original: In this case, the total bias is only caused by discrete sampling, which is small (but still exists).
Revised: In this case, the total bias is only caused by discrete sampling, which is small (but still exists).

Original: Simulated weights of some existing neural reconstruction methods are shown in Fig.
Revised: Simulated weights of some existing neural reconstruction methods are shown in Fig.

Original: As can be seen, it is nearly impossible to get right there in practice, especially without any geometric constraints.
Revised: As can be seen, it is nearly impossible to get right there in practice, especially without any geometric constraints.

Original: Furthermore, the problem becomes more intractable when dealing with cases of occlusion.
Revised: Furthermore, the problem becomes more intractable when dealing with cases of occlusion.

Original: Therefore, the weighted manner of volume rendering integral introduces a bias to implicit geometry modeling.
Revised: Therefore, the weighted manner of volume rendering integral introduces a bias to implicit geometry modeling.

Original: Because the supervision of the whole network almost depends exclusively on the difference between rendered colors and ground truth colors, the bias would make it difficult to supervise the colors of surface and the SDF network, leading to a gap between the colors and the geometry.
Revised: Because the supervision of the whole network almost depends exclusively on the difference between rendered colors and ground truth colors, the bias would make it difficult to supervise the colors of surface and the SDF network, leading to a gap between the colors and the geometry.

Original: A trivial solution is to directly supervise the geometry of the object.
Revised: A trivial solution is to directly supervise the geometry of the object.

Original: In this way, we design explicit supervision on the SDF network and geometry-consistent supervision with multi-view constraints.
Revised: In this way, we design explicit supervision on the SDF network and geometry-consistent supervision with multi-view constraints.

Original: 3.2 Explicit supervision on SDF network
Revised: 3.2 Explicit supervision on SDF network

Original: The SDF network, which estimates the signed distance from any spatial point to the surface of the object, is the key network that we need to optimize.
Revised: The SDF network, which estimates the signed distance from any spatial point to the surface of the object, is the key network that we need to optimize.

Original: So we propose an explicit supervision method on the SDF network to ensure its accuracy directly with points in 3D space.
Revised: So we propose an explicit supervision method on the SDF network to ensure its accuracy directly with points in 3D space.

Original: For less extra cost, we use points generated by structure from motion (SFM) [29, 33] to supervise the
Revised: For less extra cost, we use points generated by structure from motion (SFM) [29, 33] to supervise the

Original: SDF network.
Revised: SDF network.

Original: In fact, SFM is a canonical solution to compute the camera parameters of input images, where 2D feature matches X and sparse 3D points P are also generated as byproducts.
Revised: In fact, SFM is a canonical solution to compute the camera parameters of input images, where 2D feature matches X and sparse 3D points P are also generated as byproducts.

Original: Thus, these sparse 3D points can be used as "free" explicit geometry information.
Revised: Thus, these sparse 3D points can be used as "free" explicit geometry information.

Original: Approximately, we suppose that these sparse points are on the surface of the object.
Revised: Approximately, we suppose that these sparse points are on the surface of the object.

Original: That is, the SDF values of the sparse points are zeroes: sdf ( p i )
Revised: That is, the SDF values of the sparse points are zeroes: sdf ( p i )

Original: = 0 , where p i ∈ P .
Revised: = 0 , where p i ∈ P .

Original: In practice, after obtaining sparse 3D points, a radius filter is applied to exclude some outliers [46].
Revised: In practice, after obtaining sparse 3D points, a radius filter is applied to exclude some outliers [46].

Original: Occlusion handling.
Revised: Occlusion handling.

Original: Because we focus on opaque objects, some parts of objects are invisible from view of a certain camera position.
Revised: Because we focus on opaque objects, some parts of objects are invisible from view of a certain camera position.

Original: Therefore, there are only some of the sparse points visible for each view.
Revised: Therefore, there are only some of the sparse points visible for each view.

Original: For an image
Revised: For an image

Original: I i with camera position
Revised: I i with camera position

Original: o
Revised: o

Original: i , the visible points P i are consistent with feature points
Revised: i , the visible points P i are consistent with feature points

Original: X i of I i :
Revised: X i of I i :

Original: [Equation]
Revised: [Equation]

Original: where K i is the internal calibration matrix,
Revised: where K i is the internal calibration matrix,

Original: R i is the rotation matrix and t i is the translation vector for image
Revised: R i is the rotation matrix and t i is the translation vector for image

Original: I i .
Revised: I i .

Original: The coordinates of X i and P i are all homogeneous coordinates.
Revised: The coordinates of X i and P i are all homogeneous coordinates.

Original: The scale index before X i is omitted for simplicity.
Revised: The scale index before X i is omitted for simplicity.

Original: According to feature points of each image, we get visible points for each view and use them to supervise the SDF network while rendering image from the corresponding view.
Revised: According to feature points of each image, we get visible points for each view and use them to supervise the SDF network while rendering image from the corresponding view.

Original: View-aware SDF loss.
Revised: View-aware SDF loss.

Original: While rendering image
Revised: While rendering image

Original: I i from view V
Revised: I i from view V

Original: i , we use the SDF network to estimate
Revised: i , we use the SDF network to estimate

Original: SDF values for the visible points P i of V
Revised: SDF values for the visible points P i of V

Original: i (see supplementary for the SDF loss by random sampling from sparse 3D points).
Revised: i (see supplementary for the SDF loss by random sampling from sparse 3D points).

Original: Based on the approximation that the SDF values of sparse points are zeroes, we propose the view-aware SDF loss:
Revised: Based on the approximation that the SDF values of sparse points are zeroes, we propose the view-aware SDF loss:

Original: [Equation]
Revised: [Equation]

Original: (15) where N i is the number of points in P i and | · | denotes the L 1 distance.
Revised: (15) where N i is the number of points in P i and | · | denotes the L 1 distance.

Original: It is worth noting that the loss we use to supervise the SDF network varies according to the view being rendered.
Revised: It is worth noting that the loss we use to supervise the SDF network varies according to the view being rendered.

Original: In this way, the introduced SDF loss is consistent with the process of color rendering.
Revised: In this way, the introduced SDF loss is consistent with the process of color rendering.

Original: With the explicit supervision on the SDF network, our network could converge faster owing to the use of geometry prior.
Revised: With the explicit supervision on the SDF network, our network could converge faster owing to the use of geometry prior.

Original: Besides, because the complex geometric structures with strong textures are the concentrated distribution areas of the sparse points, our method could capture more meticulous geometries.
Revised: Besides, because the complex geometric structures with strong textures are the concentrated distribution areas of the sparse points, our method could capture more meticulous geometries.

Original: 3.3 Geometry-consistent supervision with multi-view constraints
Revised: 3.3 Geometry-consistent supervision with multi-view constraints

Original: With SDF loss, our network could capture complex geometric details with strong textures.
Revised: With SDF loss, our network could capture complex geometric details with strong textures.

Original: Since the sparse 3D points mainly provide the explicit constraints on the areas with rich textures, large smooth regions still lack explicit geometry constraints.
Revised: Since the sparse 3D points mainly provide the explicit constraints on the areas with rich textures, large smooth regions still lack explicit geometry constraints.

Original: To go a step further, we design geometry-consistent supervision on the implicit surface with multi-view stereo constraints.
Revised: To go a step further, we design geometry-consistent supervision on the implicit surface with multi-view stereo constraints.

Original: Occlusion-aware implicit surface capture.
Revised: Occlusion-aware implicit surface capture.

Original: We use the implicit representation of the surface, and extract surface with the zero-level set of the implicit function.
Revised: We use the implicit representation of the surface, and extract surface with the zero-level set of the implicit function.

Original: So the question is: Where is our implicit surface?
Revised: So the question is: Where is our implicit surface?

Original: According to Formula (3), the estimated surface is:
Revised: According to Formula (3), the estimated surface is:

Original: [Equation]
Revised: [Equation]

Original: We aim to optimize ˆ ∂Ω with geometry-consistent constraints among different views.
Revised: We aim to optimize ˆ ∂Ω with geometry-consistent constraints among different views.

Original: Because the number of points on the surface is infinite, we need to sample points from ˆ ∂Ω in practice.
Revised: Because the number of points on the surface is infinite, we need to sample points from ˆ ∂Ω in practice.

Original: To maintain consistency with the process of color rendering using view rays, we sample the surface points on these rays.
Revised: To maintain consistency with the process of color rendering using view rays, we sample the surface points on these rays.

Original: As mentioned in 3.1, we sample t discretely along the view ray and use the Riemann sum to obtain the rendered colors.
Revised: As mentioned in 3.1, we sample t discretely along the view ray and use the Riemann sum to obtain the rendered colors.

Original: Based on the sampled points, we use linear interpolation to get the surface points, which is similar to the root-finding used in [25, 26] to estimate the surface.
Revised: Based on the sampled points, we use linear interpolation to get the surface points, which is similar to the root-finding used in [25, 26] to estimate the surface.

Original: Specifically, with sampled point t on the ray, the corresponding 3D point is p
Revised: Specifically, with sampled point t on the ray, the corresponding 3D point is p

Original: =
Revised: =

Original: o + t v , and the predicted SDF value is ˆ sdf ( p ) .
Revised: o + t v , and the predicted SDF value is ˆ sdf ( p ) .

Original: For simplicity, we further represent ˆ sdf ( p ) as ˆ sdf ( t ) , which is the function of t .
Revised: For simplicity, we further represent ˆ sdf ( p ) as ˆ sdf ( t ) , which is the function of t .

Original: We find the sample point
Revised: We find the sample point

Original: t
Revised: t

Original: i , the sign of whose SDF value is different from the next sample point t i +1 .
Revised: i , the sign of whose SDF value is different from the next sample point t i +1 .

Original: The sample points set T formed by t i is:
Revised: The sample points set T formed by t i is:

Original: [Equation]
Revised: [Equation]

Original: In this situation, the line t i t i +1 intersects with the surface ˆ ∂Ω .
Revised: In this situation, the line t i t i +1 intersects with the surface ˆ ∂Ω .

Original: The intersection points set ˆ T ∗ is:
Revised: The intersection points set ˆ T ∗ is:

Original: [Equation]
Revised: [Equation]

Original: The ray that interacts with the object may have more than one intersection with the surface.
Revised: The ray that interacts with the object may have more than one intersection with the surface.

Original: Specifically speaking, there may be at least two intersections.
Revised: Specifically speaking, there may be at least two intersections.

Original: Similar to the SDF supervision mechanism, we just use the first intersection point along the ray considering the occlusion problem:
Revised: Similar to the SDF supervision mechanism, we just use the first intersection point along the ray considering the occlusion problem:

Original: [Equation]
Revised: [Equation]

Original: The selection of t ∗ guarantees the sample points of the implicit surface are all visible for the corresponding view and makes the supervision consistent with the process of color rendering.
Revised: The selection of t ∗ guarantees the sample points of the implicit surface are all visible for the corresponding view and makes the supervision consistent with the process of color rendering.

Original: Multi-view photometric consistency constraints.
Revised: Multi-view photometric consistency constraints.

Original: We capture our estimated implicit surface, of which the geometric structures are supposed to be consistent among different views.
Revised: We capture our estimated implicit surface, of which the geometric structures are supposed to be consistent among different views.

Original: Based on this intuition, we use the photometric consistency constraints in multi-view stereo (MVS) [9, 37, 10] to supervise our extracted implicit surface.
Revised: Based on this intuition, we use the photometric consistency constraints in multi-view stereo (MVS) [9, 37, 10] to supervise our extracted implicit surface.

Original: For a small area s on the surface, the projection of s on the image is a small pixel patch q .
Revised: For a small area s on the surface, the projection of s on the image is a small pixel patch q .

Original: The patches corresponding to s are supposed to be geometry-consistent among different views, except for occlusion occasions.
Revised: The patches corresponding to s are supposed to be geometry-consistent among different views, except for occlusion occasions.

Original: Similar to patch warping in traditional MVS methods, we use the central point and its normal to represent s .
Revised: Similar to patch warping in traditional MVS methods, we use the central point and its normal to represent s .

Original: For convenience, we represent the plane equation of s in the camera coordinate of the reference image
Revised: For convenience, we represent the plane equation of s in the camera coordinate of the reference image

Original: I r :
Revised: I r :

Original: [Equation]
Revised: [Equation]

Original: (20) where p is the intersection point computed through Formula (19) and n T is the normal computed with automatic differentiation of SDF network at p .
Revised: (20) where p is the intersection point computed through Formula (19) and n T is the normal computed with automatic differentiation of SDF network at p .

Original: Then the image point x in the pixel patch q i of reference image I r is related to the corresponding point x ′ in the pixel patch q is of the source image
Revised: Then the image point x in the pixel patch q i of reference image I r is related to the corresponding point x ′ in the pixel patch q is of the source image

Original: I s via the plane-induced homography H [12]:
Revised: I s via the plane-induced homography H [12]:

Original: [Equation]
Revised: [Equation]

Original: where K donates the intrinsic matrix, R donates the rotation matrix and t donates the translation vector.
Revised: where K donates the intrinsic matrix, R donates the rotation matrix and t donates the translation vector.

Original: The index indicates which image the donation belongs to.
Revised: The index indicates which image the donation belongs to.

Original: To concentrate on the geometric information, we convert color images { I i } into gray images { I ′ i } , and supervise our implicit surface with the photometric consistency among patches in { I ′ i } (see supplementary for RGB image settings).
Revised: To concentrate on the geometric information, we convert color images { I i } into gray images { I ′ i } , and supervise our implicit surface with the photometric consistency among patches in { I ′ i } (see supplementary for RGB image settings).

Original: Photometric consistency loss.
Revised: Photometric consistency loss.

Original: To measure the photometric consistency, we use the normalization cross correlation (NCC) of patches in the reference gray image { I ′ r } and the source gray image { I ′ s } :
Revised: To measure the photometric consistency, we use the normalization cross correlation (NCC) of patches in the reference gray image { I ′ r } and the source gray image { I ′ s } :

Original: [Equation]
Revised: [Equation]

Original: where Cov denotes covariance and V ar donates variance.
Revised: where Cov denotes covariance and V ar donates variance.

Original: While rendering colors for an image, we use the patches which take the pixels being rendered as center and the patch size is 11 × 11 .
Revised: While rendering colors for an image, we use the patches which take the pixels being rendered as center and the patch size is 11 × 11 .

Original: We take the rendered image as the reference image and compute NCC scores between its sampled patches and their corresponding patches on all source images.
Revised: We take the rendered image as the reference image and compute NCC scores between its sampled patches and their corresponding patches on all source images.

Original: To handle occlusions, we find the best four of the computed NCC scores for each sampled patch following [10], and use them to compute the photometric consistency loss for the corresponding view:
Revised: To handle occlusions, we find the best four of the computed NCC scores for each sampled patch following [10], and use them to compute the photometric consistency loss for the corresponding view:

Original: [Equation]
Revised: [Equation]

Original: where N is the number of sampled pixels on the rendered image.
Revised: where N is the number of sampled pixels on the rendered image.

Original: With the photometric consistency loss, the geometric consistency of the implicit surface among multiple views is guaranteed.
Revised: With the photometric consistency loss, the geometric consistency of the implicit surface among multiple views is guaranteed.

Original: 3.4 Loss function
Revised: 3.4 Loss function

Original: During rendering colors from a specific view, our total loss is:
Revised: During rendering colors from a specific view, our total loss is:

Original: [Equation]
Revised: [Equation]

Original: L color is the difference between the ground truth colors and the rendered colors:
Revised: L color is the difference between the ground truth colors and the rendered colors:

Original: [Equation]
Revised: [Equation]

Original: And L reg is an eikonal term [11] to regularize the gradients of SDF network:
Revised: And L reg is an eikonal term [11] to regularize the gradients of SDF network:

Original: [Equation]
Revised: [Equation]

Original: In our experiments, we choose α , β and γ as 0.1, 1.0 and 0.5 respectively.
Revised: In our experiments, we choose α , β and γ as 0.1, 1.0 and 0.5 respectively.

Original:  Experiments 4.1 Experimental setting
Revised:  Experiments 4.1 Experimental setting

Original: Datasets.
Revised: Datasets.

Original: Following previous practices [43, 35, 42], we reconstruct surfaces from 15 scans of DTU dataset [1] to evaluate our method.
Revised: Following previous practices [43, 35, 42], we reconstruct surfaces from 15 scans of DTU dataset [1] to evaluate our method.

Original: DTU dataset has objects of various categories, which are quite different in terms of appearance and geometries.
Revised: DTU dataset has objects of various categories, which are quite different in terms of appearance and geometries.

Original: There are 49 or 64 images at a resolution of 1200 × 1600 in each scan with camera parameters.
Revised: There are 49 or 64 images at a resolution of 1200 × 1600 in each scan with camera parameters.

Original: We also test on 7 challenging scenes from the low-res set of the BlendedMVS dataset [41] (CC-4 License).
Revised: We also test on 7 challenging scenes from the low-res set of the BlendedMVS dataset [41] (CC-4 License).

Original: Scenes in BlendedMVS have various numbers of views and camera parameters.
Revised: Scenes in BlendedMVS have various numbers of views and camera parameters.

Original: The scenes are captured by images at a resolution of 768 × 576, and the numbers of views vary from 31 to 143.
Revised: The scenes are captured by images at a resolution of 768 × 576, and the numbers of views vary from 31 to 143.

Original: We evaluate our reconstructed surfaces on DTU dataset with the Chamfer Distance provided by DTU evaluation metrics [1].
Revised: We evaluate our reconstructed surfaces on DTU dataset with the Chamfer Distance provided by DTU evaluation metrics [1].

Original: For the BlendedMVS dataset, we show the visual effects of the reconstructed surfaces.
Revised: For the BlendedMVS dataset, we show the visual effects of the reconstructed surfaces.

Original: Baselines.
Revised: Baselines.

Original: To better evaluate our method, we compare it with the-state-of-art learning-based methods and the traditional reconstruction method, colmap [30].
Revised: To better evaluate our method, we compare it with the-state-of-art learning-based methods and the traditional reconstruction method, colmap [30].

Original: For learning-based methods, we compare with IDR [43], VolSDF [42], NeuS [35] and NeuralWarp [7].
Revised: For learning-based methods, we compare with IDR [43], VolSDF [42], NeuS [35] and NeuralWarp [7].

Original: For colmap, we use the reconstructed surface with trim parameter 7 (the best performance)
Revised: For colmap, we use the reconstructed surface with trim parameter 7 (the best performance)

Original: Implementation details.
Revised: Implementation details.

Original: Similar to [43, 35, 42], the SDF network is modeled by an 8-layer
Revised: Similar to [43, 35, 42], the SDF network is modeled by an 8-layer

Original: MLP with 256 hidden units and a skip connection in the middle.
Revised: MLP with 256 hidden units and a skip connection in the middle.

Original: It is initialized by the geometric initialization presented in [2].
Revised: It is initialized by the geometric initialization presented in [2].

Original: The radiance network is parameterized by a 4-layer MLP withhidden units.
Revised: The radiance network is parameterized by a 4-layer MLP withhidden units.

Original: Positional encoding [20] is applied to 3D location with 6 frequencies and to viewing direction with 4 frequencies.
Revised: Positional encoding [20] is applied to 3D location with 6 frequencies and to viewing direction with 4 frequencies.

Original: We sample 512 rays per batch and follow the hierarchical sampling strategy in NeuS [35] to sample points for each ray.
Revised: We sample 512 rays per batch and follow the hierarchical sampling strategy in NeuS [35] to sample points for each ray.

Original: We train our model for 300k iterations for around 16 hours on a single NVIDIA RTX2080Ti GPU.
Revised: We train our model for 300k iterations for around 16 hours on a single NVIDIA RTX2080Ti GPU.

Original: After network training, a mesh can be extracted from the SDF in a predefined bounding box by the Marching Cube [19] with the volume size of 512 3 .
Revised: After network training, a mesh can be extracted from the SDF in a predefined bounding box by the Marching Cube [19] with the volume size of 512 3 .

Original: 4.2 Comparisons
Revised: 4.2 Comparisons

Original: [Table]
Revised: [Table]

Original: We compare the reconstruction quality of our method and baselines on
Revised: We compare the reconstruction quality of our method and baselines on

Original: Table 1 shows the quantitative results.
Revised: Table 1 shows the quantitative results.

Original: Notably, our method outperforms baselines by a large margin.
Revised: Notably, our method outperforms baselines by a large margin.

Original: Specifically, it outperforms state-of-the-art neural implicit surfaces learning methods by over 25 % and outperforms the traditional method colmap by 22 % .
Revised: Specifically, it outperforms state-of-the-art neural implicit surfaces learning methods by over 25 % and outperforms the traditional method colmap by 22 % .

Original: As shown qualitatively in
Revised: As shown qualitatively in

Original: Fig.
Revised: Fig.

Original: 4, our method achieves high-quality surface reconstruction in both complex thin structures and large smooth regions.
Revised: 4, our method achieves high-quality surface reconstruction in both complex thin structures and large smooth regions.

Original: For example, our method can recover abrupt depth changes in Scan 37 and reconstruct planar structures in Scan 24 and 40.
Revised: For example, our method can recover abrupt depth changes in Scan 37 and reconstruct planar structures in Scan 24 and 40.

Original: To test the capability of handling
Revised: To test the capability of handling

Original: S ca n
Revised: S ca n

Original: ( D T U )
Revised: ( D T U )

Original: S ca n ( D T U ) S ca n ( D T U )
Revised: S ca n ( D T U ) S ca n ( D T U )

Original: [Figure]
Revised: [Figure]

Original: S t on e ( B l e nd e d M
Revised: S t on e ( B l e nd e d M

Original: V S )
Revised: V S )

Original: S c u l p t u r e ( B l e nd e d M
Revised: S c u l p t u r e ( B l e nd e d M

Original: V S )
Revised: V S )

Original: [Figure]
Revised: [Figure]

Original: various scenes
Revised: various scenes

Original: , we test on 7 challenging scenes of the BlendedMVS dataset.
Revised: , we test on 7 challenging scenes of the BlendedMVS dataset.

Original: Qualitative results in Fig.
Revised: Qualitative results in Fig.

Original: 4 show that our method yields more smooth and consistent surface quality than other methods.
Revised: 4 show that our method yields more smooth and consistent surface quality than other methods.

Original: 4.3 Analysis
Revised: 4.3 Analysis

Original: Ablation study.
Revised: Ablation study.

Original: To evaluate the effect of our proposed contributions, we conduct an ablation study on DTU dataset.
Revised: To evaluate the effect of our proposed contributions, we conduct an ablation study on DTU dataset.

Original: NeuS is adopted as our baseline.
Revised: NeuS is adopted as our baseline.

Original: Different modules are progressively added to the baseline to investigate their efficacy.
Revised: Different modules are progressively added to the baseline to investigate their efficacy.

Original: Results are reported in Table 2.
Revised: Results are reported in Table 2.

Original: We see that, with very sparse 3D supervision on SDF networks, Model-A has begun to outperform colmap (0.62 vs 0.65).
Revised: We see that, with very sparse 3D supervision on SDF networks, Model-A has begun to outperform colmap (0.62 vs 0.65).

Original: This demonstrates that explicit SDF optimization is very beneficial to improve geometries.
Revised: This demonstrates that explicit SDF optimization is very beneficial to improve geometries.

Original: With the proposed photometric consistency loss, Model-B can optimize SDF networks more completely, leading to much more performance improvement.
Revised: With the proposed photometric consistency loss, Model-B can optimize SDF networks more completely, leading to much more performance improvement.

Original: Fig.
Revised: Fig.

Original: 5 shows how the proposed loss functions improve the surface quality.
Revised: 5 shows how the proposed loss functions improve the surface quality.

Original: Model-A reconstructs the apple stem finely but the surface is not smooth enough.
Revised: Model-A reconstructs the apple stem finely but the surface is not smooth enough.

Original: Model-B reconstructs the smooth surface but the apple stem is lost.
Revised: Model-B reconstructs the smooth surface but the apple stem is lost.

Original: That is, the SDF loss is better to improve the reconstruction of complex thin structures, while the photometric loss is better for the reconstruction of large smooth regions.
Revised: That is, the SDF loss is better to improve the reconstruction of complex thin structures, while the photometric loss is better for the reconstruction of large smooth regions.

Original: Moreover, our full model, Geo-Neus absorbs their individual advantages and achieves the best performance.
Revised: Moreover, our full model, Geo-Neus absorbs their individual advantages and achieves the best performance.

Original: Geometry bias of volumetric integration.
Revised: Geometry bias of volumetric integration.

Original: To further investigate the geometric bias of volumetric integration, we render the depth images from a particular pose in a similar fashion to rendering RGB pixels [20] (see supplementary for details), and then use the depth images to construct sparse 3D points and photometric consistency constraints.
Revised: To further investigate the geometric bias of volumetric integration, we render the depth images from a particular pose in a similar fashion to rendering RGB pixels [20] (see supplementary for details), and then use the depth images to construct sparse 3D points and photometric consistency constraints.

Original: NeuS is also used as the baseline.
Revised: NeuS is also used as the baseline.

Original: Comparison results are shown in Table 3.
Revised: Comparison results are shown in Table 3.

Original: As can be seen, compared with baseline (0.87), multi-view geometry
Revised: As can be seen, compared with baseline (0.87), multi-view geometry

Original: [Table] [Table]
Revised: [Table] [Table]

Original: constraints with depth integral bring little performance improvement or even degradation.
Revised: constraints with depth integral bring little performance improvement or even degradation.

Original: It is a remarkable fact that photometric consistency supervision with depth integral surface location could not converge because of the initial immense bias while the SDF location model converges smoothly.
Revised: It is a remarkable fact that photometric consistency supervision with depth integral surface location could not converge because of the initial immense bias while the SDF location model converges smoothly.

Original: As an alternative, we train these two models based on the baseline model pretrained with 200k iterations.
Revised: As an alternative, we train these two models based on the baseline model pretrained with 200k iterations.

Original: The result of the depth integral model still degrades compared with the baseline.
Revised: The result of the depth integral model still degrades compared with the baseline.

Original: This verifies the existence of geometric bias in volumetric integration.
Revised: This verifies the existence of geometric bias in volumetric integration.

Original: With our proposed SDF-oriented optimization, surface reconstruction quality can be significantly boosted.
Revised: With our proposed SDF-oriented optimization, surface reconstruction quality can be significantly boosted.

Original: Convergence speed.
Revised: Convergence speed.

Original: We further study the convergence speed of our proposed method, Geo-Neus, and baseline, NeuS. As shown in Fig.
Revised: We further study the convergence speed of our proposed method, Geo-Neus, and baseline, NeuS. As shown in Fig.

Original: 6, our method converges rapidly from scratch and becomes stable after 200k iterations.
Revised: 6, our method converges rapidly from scratch and becomes stable after 200k iterations.

Original: In contrast, NeuS cannot extract the reasonable surface from SDF networks in the beginning and starts to become stable after 250k iterations.
Revised: In contrast, NeuS cannot extract the reasonable surface from SDF networks in the beginning and starts to become stable after 250k iterations.

Original: This demonstrates that our proposed explicit SDF optimization also improves the efficiency of neural surfaces learning by volume rendering, reducing the training time from around 16 hours to around 10 hours.
Revised: This demonstrates that our proposed explicit SDF optimization also improves the efficiency of neural surfaces learning by volume rendering, reducing the training time from around 16 hours to around 10 hours.

Original: [Figure]
Revised: [Figure]

Original: ( a ) ( b )
Revised: ( a ) ( b )

Original: Limitation.
Revised: Limitation.

Original: We show failure cases of our method on scenes with strong specular highlights and transparent objects.
Revised: We show failure cases of our method on scenes with strong specular highlights and transparent objects.

Original: Fig.
Revised: Fig.

Original: 7(a) shows our reconstructed surfaces on the scene with strong specular highlights, DTU scan77.
Revised: 7(a) shows our reconstructed surfaces on the scene with strong specular highlights, DTU scan77.

Original: In this case, the strong specular highlights lead to large view-dependent effects, making the multi-view photometric consistency loss unable to reliably measure multi-view geometry constraints.
Revised: In this case, the strong specular highlights lead to large view-dependent effects, making the multi-view photometric consistency loss unable to reliably measure multi-view geometry constraints.

Original: Thus, our method cannot produce satisfactory surfaces in this case.
Revised: Thus, our method cannot produce satisfactory surfaces in this case.

Original: In addition, Fig. 7(b) shows our reconstructed surfaces on the scene with transparent objects [13].
Revised: In addition, Fig. 7(b) shows our reconstructed surfaces on the scene with transparent objects [13].

Original: As proposed in Sec.
Revised: As proposed in Sec.

Original: 3.1, we assume the target objects are all opaque and solid.
Revised: 3.1, we assume the target objects are all opaque and solid.

Original: For transparent objects, the proposed bias between rendered colors and implicit geometry is invalid.
Revised: For transparent objects, the proposed bias between rendered colors and implicit geometry is invalid.

Original: Furthermore, the geometric loss we proposed may not work well, just like the photometric consistency used in traditional reconstruction methods.
Revised: Furthermore, the geometric loss we proposed may not work well, just like the photometric consistency used in traditional reconstruction methods.

Original:  Conclusion
Revised:  Conclusion

Original: We have proposed Geo-Neus, a new method to perform neural implicit surfaces learning by enforcing explicit SDF optimization.
Revised: We have proposed Geo-Neus, a new method to perform neural implicit surfaces learning by enforcing explicit SDF optimization.

Original: In our paper, we first provide the theoretical analysis that there exists a gap between volume rendering integration and neural SDF learning.
Revised: In our paper, we first provide the theoretical analysis that there exists a gap between volume rendering integration and neural SDF learning.

Original: With this theoretical support, we propose to explicitly optimize neural SDF learning by introducing two multi-view geometry constraints: sparse 3D points in structure from motion and photometric consistency in multi-view stereo.
Revised: With this theoretical support, we propose to explicitly optimize neural SDF learning by introducing two multi-view geometry constraints: sparse 3D points in structure from motion and photometric consistency in multi-view stereo.

Original: In this way, Geo-Neus produces high-quality surface reconstruction in both complex thin structures and large smooth regions.
Revised: In this way, Geo-Neus produces high-quality surface reconstruction in both complex thin structures and large smooth regions.

Original: Therefore, it outperforms the state-of-the-arts by a large margin, including both traditional and neural implicit surfaces learning methods.
Revised: Therefore, it outperforms the state-of-the-arts by a large margin, including both traditional and neural implicit surfaces learning methods.

Original: We note that although our method greatly improves reconstruction quality, its efficiency is still limited.
Revised: We note that although our method greatly improves reconstruction quality, its efficiency is still limited.

Original: In the future, it will be interesting to explore accelerating neural implicit surfaces learning by volume rendering through super-fast per-scene radiance field optimization methods [34, 24].
Revised: In the future, it will be interesting to explore accelerating neural implicit surfaces learning by volume rendering through super-fast per-scene radiance field optimization methods [34, 24].

Original: We don’t see an immediate negative societal impact of our work, but accurate 3D models may be used from malevolence.
Revised: We don’t see an immediate negative societal impact of our work, but accurate 3D models may be used from malevolence.

Original: Acknowledgments This work was in part supported by the National Natural Science Foundation of
Revised: Acknowledgments This work was in part supported by the National Natural Science Foundation of

Original: China under Grants 62176096 and 61991412, the Data Science and Artificial Intelligence Research
Revised: China under Grants 62176096 and 61991412, the Data Science and Artificial Intelligence Research

Original: Center (DSAIR), School of Computer Science and Engineering, Nanyang Technological University and the A*Star Center for Frontier AI Research (CFAR).
Revised: Center (DSAIR), School of Computer Science and Engineering, Nanyang Technological University and the A*Star Center for Frontier AI Research (CFAR).

Original: Checklist
Revised: Checklist

Original: For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?
Revised: For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?

Original: [Yes] (b) Did you describe the limitations of your work?
Revised: [Yes] (b) Did you describe the limitations of your work?

Original: [Yes] See Section 4.3.
Revised: [Yes] See Section 4.3.

Original: (c) Did you discuss any potential negative societal impacts of your work?
Revised: (c) Did you discuss any potential negative societal impacts of your work?

Original: [Yes] See Section 5.
Revised: [Yes] See Section 5.

Original: (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?
Revised: (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?

Original: [Yes] 2.
Revised: [Yes] 2.

Original: If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?
Revised: If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?

Original: [Yes] See Section 3.1.
Revised: [Yes] See Section 3.1.

Original: (b) Did you include complete proofs of all theoretical results?
Revised: (b) Did you include complete proofs of all theoretical results?

Original: [Yes] See Section 3.1. 3.
Revised: [Yes] See Section 3.1. 3.

Original: If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?
Revised: If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?

Original: [No] We plan to release the code completely but have not yet with submission.
Revised: [No] We plan to release the code completely but have not yet with submission.

Original: (b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?
Revised: (b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?

Original: [Yes] See Section 4.1.
Revised: [Yes] See Section 4.1.

Original: (c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?
Revised: (c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?

Original: [No] (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?
Revised: [No] (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?

Original: [Yes] See Section 4.1.
Revised: [Yes] See Section 4.1.

Original: If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?
Revised: If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?

Original: [Yes] See Section 4.1.
Revised: [Yes] See Section 4.1.

Original: (b) Did you mention the license of the assets?
Revised: (b) Did you mention the license of the assets?

Original: [Yes] See Section 4.1.
Revised: [Yes] See Section 4.1.

Original: (c) Did you include any new assets either in the supplemental material or as a URL?
Revised: (c) Did you include any new assets either in the supplemental material or as a URL?

Original: [No] (d) Did you discuss whether
Revised: [No] (d) Did you discuss whether

Original: and how consent was obtained from people whose data you’re using/curating?
Revised: and how consent was obtained from people whose data you’re using/curating?

Original: [N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content?
Revised: [N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content?

Original: [N/A] 5.
Revised: [N/A] 5.

Original: If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?
Revised: If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?

Original: [N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?
Revised: [N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?

Original: [N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?
Revised: [N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?

Original: [N/A]
Revised: [N/A]