- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper estimates the camera’s orientation relative to a “Manhattan” scene, i.e. a scene built mostly from three perpendicular directions, such as buildings and rooms. The input is the line segments detected in a single calibrated image. This comes down to finding one rotation and, at the same time, deciding which lines belong to which of the three directions and which lines are outliers. The authors use the same objective as GlobustVP. Instead of GlobustVP’s convex relaxation and conic solver, they propose MMVP, an iterative solver based on majorization - minimization. Each iteration simplifies the problem in three steps, 1. It temporarily fixes which direction each line belongs to, 2. It down-weights outlier lines, moving gradually from a smooth version of the loss to the exact one, 3. It replaces the rotation step with a simpler problem that has a closed-form solution through a small SVD. As a result, every step is fast and simple, every estimate is a valid rotation, and no external optimization solver is needed. The authors also prove that the objective decreases at a fixed homotopy level. They provide a quick test that checks whether the returned rotation is globally optimal for its line grouping, and they use a deterministic initialization in place of random sampling. Experiments on synthetic data, HoliCity and YUD+ compare MMVP with nine geometric and learning-based methods. MMVP reports the best line grouping and angular accuracy scores, running in about 30 - 70 ms per image on a CPU.
Critical strengths
- The proposed solution is a clean, solver-free way to minimize the GlobustVP objective. Each step is closed-form, costs grow linearly with the number of lines, and every iterate stays a valid rotation.
- Failures are kept in averages at the worst score, and the YUD+ Manhattan/non-Manhattan split is informative.
- Empirical results look strong with stable behavior as contamination rises.
Critical weaknesses
- Theorem D.1 shows that, for a fixed value of the homotopy parameter , the objective never increases and the iterates reach a stationary point. However, as I understand Algorithm 1 and Section 3.2, is doubled after every outer iteration until it reaches 10e-6. Starting from with c = 0.03, this takes roughly 30 doublings. That matches the “thirty to forty outer iterations” reported in Appendix D.2. If this reading is correct, the algorithm takes only one step at each value of before moving to the next. The guarantees of Theorem D.1 then apply mainly to the final phase, after stops increasing. I appreciate that the Remark in Appendix D.1 acknowledges that monotonicity holds per level and not across levels. Still, the abstract and contribution (3) read as if the guarantee covered the full procedure.
- MMVP is a well-engineered solver, and I see value in how its pieces fit together. However, most of the individual pieces seem to come from prior work, and the paper does not always make this clear. So the main contribution seems to be combining these known tools into one efficient solver for an existing objective. That can be a worthwhile contribution, but the current framing, especially contribution, suggests more originality than the components support.
- The results are strong, but the main paper has no ablation study, so it is unclear which part of MMVP is responsible for the improvement. Without ablations, it's hard to tell whether the gains come mainly from the proposed solver or from the other parts, such as a good initialization followed by local polishing.
Questions for authors
- How many outer iterations are spent at each level in practice? Do results change if you iterate to convergence at each level?
- How was c = 0.03 selected, and how sensitive are results to c on each dataset?
- On what data were CONSAC, PARSAC, Lin et al. and U-ARE-ME trained? Were any trained on YUD/HoliCity-like data?
2 comments
Sincere thanks for your follow-up and updating your score
Dear Reviewer FdZf,
Thank you very much for taking the time to reconsider, for confirming that your main concerns about soundness and ablations have been addressed, and for raising your score. We are truly grateful for your engagement and for the fairness of your assessment.
With sincere appreciation and best regards,
Authors of Submission 9457
My main concerns about soundness and ablations are addressed, and I will raise my score to weak accept.