MétaCan
Menu
Back to cohort
Record W4386132130 · doi:10.1109/mmul.2023.3285853

A Novel Learning Dictionary for Sparse Coding-Based Key Point Detection

2023· article· en· W4386132130 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

VenueIEEE Multimedia · 2023
Typearticle
Languageen
FieldMedicine
TopicRetinal Imaging and Analysis
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceArtificial intelligenceNeural codingK-SVDPattern recognition (psychology)DetectorComputer visionPipeline (software)AutoencoderContext (archaeology)Sparse approximationDeep learning

Abstract

fetched live from OpenAlex

Recently, a sparse coding-based key point detector (SCK) was proposed. An SCK shows very impressive performance compared with state-of-the-art key point detection methods on different challenging conditions, such as variations in scale, rotation, context, and nonuniform lighting. The rotational-invariant dictionary in the SCK is, however, manually generated using a time-consuming process of selecting a good seed dictionary and combining multiple versions of its rotated atoms. In this work, the process is automated using a novel duplet autoencoder structure, in which the weights between the input and the hidden layers are designed to embed a rotational-invariant dictionary. A set of loss functions is also proposed to enforce the learning process. A novel retinal image registration pipeline that best uses the new detector is also designed with thorough analysis for selection of different technologies. Extensive experiments on four challenging datasets have confirmed that SCK with the learned dictionary achieves state-of-the-art key point detection performance.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.925
Threshold uncertainty score0.443

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.037
GPT teacher head0.301
Teacher spread0.264 · 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