MétaCan
Menu
Back to cohort
Record W4297685040 · doi:10.1109/mipr54900.2022.00014

Learning Rotational Invariant Dictionary for Sparse Coding based Key-point Detection

2022· article· en· W4297685040 on OpenAlexaff
Thanh Hong-Phuoc, Ling Guan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsAutoencoderDetectorComputer scienceNeural codingInvariant (physics)Artificial intelligenceCoding (social sciences)K-SVDRotational invariancePattern recognition (psychology)Key (lock)AlgorithmDeep learningSparse approximationMathematics

Abstract

fetched live from OpenAlex

Recent research has shown the effectiveness of a Scale and Rotational Invariant Sparse Coding based Key-point Detector. However, this detector utilizes a dictionary generated by combining a carefully selected seed dictionary with multiple rotated versions of its atoms. This manual generation process is time-demanding, thus a novel autoencoder structure for automating it is proposed. Specifically, the weights between input and hidden layers of the structure are designed to embed a rotational invariant dictionary. Indeed, it is a duplet structure constrained by a novel loss function such that rotated inputs correspond to circularly shifted versions of hidden layer responses. To our knowledge, an autoencoder embedded in its weight a rotational invariant dictionary is new and the proposed loss function is the first to fulfill this requirement. Experimental results show that the learned dictionary preserves the original detector's performance, helps achieve state-of-the-art key-point detection performance while substantially eliminating the laborious work.

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 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: Methods · Consensus signal: none
Teacher disagreement score0.799
Threshold uncertainty score0.518

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.0010.000
Scholarly communication0.0000.001
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.024
GPT teacher head0.267
Teacher spread0.243 · 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 teacher head, not a consensus.

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

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

Citations1
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Image and Video Retrieval TechniquesFrench-language works237,207