MétaCan
Menu
Back to cohort
Record W4292793963 · doi:10.1109/cvprw56347.2022.00334

Multimodal Shape Completion via Implicit Maximum Likelihood Estimation

2022· article· en· W4292793963 on OpenAlexaff
Himanshu Arora, S. Mishra, Shichong Peng, Ke Li, Ali Mahdavi‐Amiri

Bibliographic record

Venue2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · 2022
Typearticle
Languageen
FieldEngineering
Topic3D Shape Modeling and Analysis
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsComputer scienceArtificial intelligencePoint cloudCompleteness (order theory)Machine learningPoint (geometry)Computer visionPattern recognition (psychology)Mathematics

Abstract

fetched live from OpenAlex

Shape completion is the problem of completing partial input shapes such as partial scans. This problem finds important applications in computer vision and robotics due to issues such as occlusion or sparsity in real-world data. However, most of the existing research related to shape completion has been focused on completing shapes by learning a one-to-one mapping which limits the diversity and creativity of the produced results. We propose a novel multimodal shape completion technique that is effectively able to learn a one-to-many mapping and generates diverse complete shapes. Our approach is based on the conditional Implicit Maximum Likelihood Estimation (IMLE) technique wherein we condition our inputs on partial 3D point clouds. We extensively evaluate our approach by comparing it to various baselines both quantitatively and qualitatively. We show that our method is superior to alternatives in terms of completeness and diversity of shapes.

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 imitation

Not 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.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0030.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0050.003

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.

Opus teacher head0.024
GPT teacher head0.247
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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".

Quick stats

Citations13
Published2022
Admission routes1
Has abstractyes

Explore more

Same venue2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)Same topic3D Shape Modeling and AnalysisFrench-language works237,207