- Rating
- 3(+2)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper introduces Projective Normal Fields (PNFs), an orientation-free representation for estimating bidirectional normals from raw point clouds, and a convex optimization framework for constructing smooth unsigned distance field (UDF) approximations. Each normal axis is encoded by a rank-one projector, which is invariant to normal reversal. The non-convex set of hard projectors is relaxed to its convex hull—symmetric positive-semidefinite matrices with unit trace—yielding a strongly convex objective with a unique global minimizer under positive anchoring weights. Principal eigenvectors provide bidirectional normals, and the corresponding eigengaps serve as spectral confidence indicators, which are used to weight directional sources for heat diffusion, followed by Poisson integration to construct a regularized UDF approximation. Experiments report reduced sensitivity to neighborhood size, competitive reconstruction under noise and outliers, and improved accuracy near non-manifold junctions.
Critical strengths
- Well-motivated problem.
- Technically sound convex relaxation.
- Elegant orientation-free design.
- Clear mathematical exposition. But ...
Critical weaknesses
The paper is not a representation learning contribution (primary reason for rejection).
The authors frame PNF as an “orientation-free representation” and the resulting UDF as a “compact and flexible representation.” However, the paper does not constitute a representation learning contribution in any meaningful sense. The distinction is not terminological but methodological:
-
No learned parameters. PNF is obtained by solving a convex optimization problem independently for each input point cloud. There is no training procedure, no gradient-based parameter updates, and no shared parameters across samples.
-
No cross-sample generalization. Each point cloud is solved in isolation. There is no train/test split, no encoder that transfers to unseen shapes, and no latent space that can be interpolated or reused.
-
No data-driven prior. The method relies entirely on geometric priors and regularization terms (local tangent-plane fitting, soft-PCA anchoring, overlap regularization). No prior is learned from a data distribution.
-
The UDF is constructed, not learned. Heat diffusion followed by Poisson integration is a deterministic post-processing pipeline. It is not a learned implicit field.
In short, PNF is a per-instance, optimization-based representation construction, not representation learning. ICLR’s scope is centered on learning-based methods and representation learning, broadly construed. A purely optimization-driven geometry processing pipeline, however elegant, does not fit this scope unless it is explicitly framed as a learning contribution—for example, by learning the PNF representation with a network, or embedding it as a differentiable module inside a learning system. The current submission does none of these.
Questions for authors
it is a good paper, and submit it to CVPR or some other place.