F-PVNet: Frustum-Level 3-D Object Detection on Point–Voxel Feature Representation for Autonomous Driving
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Current 3-D object detection technology for autonomous driving usually cannot efficiently utilize local sensitive points. Meanwhile, contextual feature extracted from a object is not sufficient, which easily leads to deteriorated detection accuracy of the final object estimation. For the problems, a point–voxel-based 3-D dynamic object detection algorithm is proposed. First, local points are grouped with a camera frustum. Then, the global feature extracted by the submanifold 3-D voxel CNNs is aggregated into frustum key points. Second, a module of vector pool with feature aggregation is used to aggregate multiscale features of the point cloud. Moreover, the frustum raw feature and BEV feature are used for feature extension. Subsequently, the fine multiscale feature extracted from the point cloud is used as input to a subsequent fully convolutional network for final classification and continuous estimation of oriented 3-D boxes. The proposed method was compared with other state-of-the-art algorithms on the KITTI, Waymo, and nuScenes data sets. Experimental results showed that the proposed algorithm was better in accuracy, robustness, and generalization capabilities in 3-D dynamic object detection. Experiments on a real scenario and extensive ablation studies also demonstrated that the proposed algorithm not only effectively controls computational cost but also achieved more efficient results in 3-D object detection.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it