MétaCan
Menu
Back to cohort
Record W2130626940 · doi:10.1109/crv.2012.52

Robust Horizon Detection Using Segmentation for UAV Applications

2012· article· en· W2130626940 on OpenAlexaff
Nasim Sepehri Boroujeni, S. Ali Etemad, Anthony Whitehead

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicInfrared Target Detection Methodologies
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceComputer visionArtificial intelligenceHorizonTerrainSkySegmentationObstacleImage segmentationPath (computing)Field (mathematics)Obstacle avoidanceLine (geometry)Remote sensingGeologyMathematicsGeographyMobile robotRobot

Abstract

fetched live from OpenAlex

A critical step in navigation of unmanned aerial vehicles is the detection of the horizon line. This information can be used for adjusting flight parameters as well as obstacle avoidance. In this paper, a fast and robust technique for precise detection of the horizon path is proposed. The method is based on existence of a unique light field that occurs in imagery where the horizon is viewed. This light field exists in different scenes including sea-sky, soil-sky, and forest-sky horizon lines. Our proposed approach employs segmentation of the scene and subsequent analysis of the image segments for extraction of the mentioned field and thus the horizon path. Through various experiments carried out on our own dataset and that of another previously published paper, we illustrate the significance and accuracy of this technique for various types of terrains from water to ground, and even snow-covered ground. Finally, it is shown that robust performance and accuracy, speed, and extraction of the path as curves (as opposed to a straight line which is resulted from many other approaches) are the benefits of our method.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

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

Opus teacher head0.110
GPT teacher head0.304
Teacher spread0.193 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations46
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicInfrared Target Detection MethodologiesFrench-language works237,207