MétaCan
Menu
Back to cohort
Record W2885381296 · doi:10.1109/icc.2018.8422412

An Improved Algorithm for Road Markings Detection with SVM and ROI Restriction: Comparison with a Rule-Based Model

2018· article· en· W2885381296 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicle License Plate Recognition
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of CanadaCanada Research Chairs
KeywordsSupport vector machineComputer scienceHistogramArtificial intelligencePopularityHistogram of oriented gradientsMachine learningField (mathematics)AlgorithmDeep learningData miningPattern recognition (psychology)Image (mathematics)Mathematics

Abstract

fetched live from OpenAlex

Machine learning method have increased in popularity in Advanced Driving Assistant System (ADAS) field recently. Although most of the best performances are achieved by machine learning and deep learning methods in benchmarks, a matured database of road markings with labels has not yet been built. This paper analyzes the road markings detection using Histogram of Oriented Gradient (HOG) with Support Vector Machine (SVM) on our local database. Compared with the results of the rulebased detection method, our exploration provides a possible solution to improve the machine learning method in order to get a balance on speed and accuracy.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.912
Threshold uncertainty score0.571

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.219
Teacher spread0.209 · 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

Citations9
Published2018
Admission routes2
Has abstractyes

Explore more

Same topicVehicle License Plate RecognitionFrench-language works237,207