MétaCan
Menu
Back to cohort
Record W2348716642

The Improvement of Generalized Hough Transformation

2006· article· en· W2348716642 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueMicrocomputer applications · 2006
Typearticle
Languageen
FieldComputer Science
TopicImage and Object Detection Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceHough transformTransformation (genetics)Enhanced Data Rates for GSM EvolutionObject (grammar)Point (geometry)Function (biology)Artificial intelligenceComputer visionSpace (punctuation)AlgorithmImage (mathematics)Pattern recognition (psychology)MathematicsGeometry
DOInot available

Abstract

fetched live from OpenAlex

This paper proposes an improvement of Generalized Hough Transformation. Compared with the traditional method, the new method can reduce requirement of storage by setting reference point on shape edge. Meanwhile, the speed of search for peak is accelerated conspicuously. Theoretically, the requirement of storage is a function based on the complexity of the shape description in the new method. The more accurate and higher level the shape is described, the smaller the storage space is needed. In the end, the improved algorithm is put into the object recognition, and obtains some experimental result.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.868
Threshold uncertainty score0.236

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.0010.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.003
GPT teacher head0.209
Teacher spread0.205 · 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