MétaCan
Menu
Back to cohort
Record W2021238165 · doi:10.1109/icinfa.2006.374113

Investigating the Performance of Corridor and Door Detection Algorithms in Different Environments

2006· article· en· W2021238165 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer scienceRobustness (evolution)Computer visionRobotArtificial intelligenceMobile robotReal-time computing

Abstract

fetched live from OpenAlex

The capability of identifying physical structures in an unknown environment is important for autonomous mobile robot navigation and scene understanding. A methodology for detecting corridor and door structures in an indoor environment is proposed, and the performances of the corridor detection algorithm and door detection algorithm applied in different environments are evaluated. In the proposed algorithms, we utilize a feedback mechanism based hypothesis generation and verification (HGV) method to detect corridor and door structures using low level line features in video images. The proposed method consists of low, intermediate, and high level processing stages which correspond to the extraction of low-level features, the formation of hypotheses, and the verification of hypotheses using a feedback mechanism, respectively. The system has been tested on a large number of real corridor images captured by a moving robot in a corridor. The experimental results validated the effectiveness and robustness of the proposed methods with respect to different viewpoints, different robot moving speed, under different illumination conditions and reflection variations.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.572
Threshold uncertainty score0.230

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.011
GPT teacher head0.205
Teacher spread0.194 · 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

Quick stats

Citations22
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207