A Novel 3D Object Categorization and Retrieval System Using Geometric Features
Bibliographic record
Abstract
In this paper, we propose a novel geometric features based method to categorize 3D models using probabilistic neural network and support vector machine classifiers. The employed features are extracted from face and vertex characteristics. In addition, we utilize the proposed features in 3D object retrieval. To achieve this end, each model is decomposed into a set of local/global geometrical features. We use histograms of two variables, i.e., deviation angle of normal vector on the object surface point from the vector that connect shape center to that point; and distance of object surface point from shape center. To achieve better separability of different models, mutual Euclidean distance histogram for the pairs of surface points is also used. The most advantage of using histogram to represent the features is that it shows the density of data and enables creating of low dimensional feature vector and consequently decreasing of computational cost in classification process. The effectiveness of our proposed 3D object categorization system has been evaluated on the generalized McGill 3D model dataset in terms of both accuracy and speed measures. Widespread experimental results and comparison with the other similar methods, demonstrate efficiency of the proposed approach to improve both accuracy and speed of categorization system.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.004 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.006 |
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".