MODNet: Multi‐offset Point Cloud Denoising Network Customized for Multi‐scale Patches
Bibliographic record
Abstract
Abstract The intricacy of 3D surfaces often results cutting‐edge point cloud denoising (PCD) models in surface degradation including remnant noise, wrongly‐removed geometric details. Although using multi‐scale patches to encode the geometry of a point has become the common wisdom in PCD, we find that simple aggregation of extracted multi‐scale features can not adaptively utilize the appropriate scale information according to the geometric information around noisy points. It leads to surface degradation, especially for points close to edges and points on complex curved surfaces. We raise an intriguing question – if employing multi‐scale geometric perception information to guide the network to utilize multi‐scale information, can eliminate the severe surface degradation problem? To answer it, we propose a Multi‐offset Denoising Network (MODNet) customized for multi‐scale patches. First, we extract the low‐level feature of three scales patches by patch feature encoders. Second, a multi‐scale perception module is designed to embed multi‐scale geometric information for each scale feature and regress multi‐scale weights to guide a multi‐offset denoising displacement. Third, a multi‐offset decoder regresses three scale offsets, which are guided by the multi‐scale weights to predict the final displacement by weighting them adaptively. Experiments demonstrate that our method achieves new state‐of‐the‐art performance on both synthetic and real‐scanned datasets. Our code is publicly available at https://github.com/hay-001/MODNet .
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".