MétaCan
Menu
Back to cohort
Record W2392941248

Scene Matching Algorithm based on Edge Strength and Projection Measurement

2011· article· en· W2392941248 on OpenAlexvenueno aff
Yu-Li Zheng

Bibliographic record

VenueMicrocomputer applications · 2011
Typearticle
Languageen
FieldEngineering
TopicAdvanced Algorithms and Applications
Canadian institutionsnot available
Fundersnot available
KeywordsSobel operatorComputer scienceEnhanced Data Rates for GSM EvolutionMatching (statistics)Projection (relational algebra)Edge detectionSimilarity (geometry)Artificial intelligenceImage (mathematics)AlgorithmTemplate matchingBlossom algorithmCanny edge detectorComputer visionPattern recognition (psychology)Image processingMathematics
DOInot available

Abstract

fetched live from OpenAlex

scene matching algorithm based on edge strength and projection measurement is put forward for the matching and location of multi-source image.In this dissertation,edge detection method is adopted to extract stable features of multi-source image.Besides,four applied edge detection operators including Roberts,Sobel,Laplacian and LOG are analyzed and compared.With the method of projection similarity measurement,four matching algorithms based on edge strength are designed and their performances are analyzed and compared with three classical algorithms,MAD,MSD,and NProd.Experimental results show that edge strength matching algorithms based on Laplasian and LOG operators are more reliable.Moreover,they are simple and easy to be carried out.

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.001
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.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.019
GPT teacher head0.211
Teacher spread0.192 · 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

Citations0
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicAdvanced Algorithms and ApplicationsFrench-language works237,207