Bibliographic record
Abstract
This dissertation addresses the problem of visual place categorization, which aims at augmenting different locations in the environment visited by an autonomous robot with information that relates them to human-understandable concepts. In visual place categorization, there are two constraints that should be taken into consideration: (i) the categorical place label assigned to each location should be consistent with the observation (i.e., image) gathered at that location; and (ii) the overall labelling should be temporally coherent (i.e., the place labels assigned to consecutively visited locations should be consistent). To address both constraints together, this dissertation formulates the problem of visual place categorization in terms of energy minimization. A method based on graph cuts is used to minimize energy for a function of a data term and a temporal term. While the data term aims at assigning visual observations to a set of pre-specified place categories, the temporal term incorporates contextual evidence from neighbours to ensure that the labels vary smoothly almost everywhere while preserving discontinuities at the borders between adjacent places in the environment. For the data term, a novel context-based scene categorization method is presented that is invariant to common changes in dynamic environments (e.g., lighting condition, partial occlusion, etc.) and robust against intra-class variations. For the temporal term, a general solution is presented that incorporates statistic cues, without being restricted by constant and small neighbourhood radii, or being dependent on the actual path followed by the robot. An extensive set of experiments on several publicly available databases validates the robustness of the proposed approach in reliably labelling visual observations with place categories and efficiently incorporating contextual cues.
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 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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".