Accelerating Point-Voxel Representation of 3-D Object Detection for Automatic Driving
Bibliographic record
Abstract
Current point-voxel fusion methods for 3D object detection could not make full use of complementary information in the field of autonomous driving. Therefore, a novel two-stage 3D object detection method, called Accelerating Point-Voxel Representation (APVR), is proposed. The advantages of Point-based feature and Voxel-based feature can be integrated into a single 3D representation. Thereby, the proposed method retains more fine-grained information of an object while maintaining high efficiency. Specifically, computational cost is reduced by adding offsets to query neighboring voxels of key-points. More fine-grained information can be obtained by calculating the matching probability between neighbouring voxels and key-points. During the optimization of the prediction boxes, virtual grid points are set to capture the spatial information between key-points. The constraint of minimum enclosing rectangle is also added to optimize the directions of the prediction boxes. A large number of experiments on the KITTI, NuScenes and Waymo datasets demonstrate great generalizability and portability of the proposed approach. The effectiveness and efficiency of APVR has been proved by comparisons with the state-of-art methods. APVR makes the real-time processing frame rate reach 40.4 Hz while ensuring high prediction accuracy.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".