MétaCan
Menu
Back to cohort
Record W2050652283 · doi:10.1109/icip.2011.6116181

Shape context based image hashing using local feature points

2011· article· en· W2050652283 on OpenAlexaff
Xudong Lv, Z. Jane Wang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsArtificial intelligenceHash functionPattern recognition (psychology)Computer scienceShape contextFeature hashingFeature (linguistics)Context (archaeology)Computer visionImage retrievalFeature extractionMathematicsImage (mathematics)Hash tableDouble hashing

Abstract

fetched live from OpenAlex

Local feature points have been widely utilized in solving many problems in computer vision, such as robust matching, object detection and classification, due to the fact that they can hold the intrinsic geometric structures of the image content. However, its investigation in the area of image hashing is still limited. In this paper, we propose a novel shape context based image hashing approach using local feature points, by taking advantage of the geometric invariance of local feature points such as SIFT and preserving the intrinsic structure of the image content using shape context. Experimental results clearly show that the proposed hashing is robust to various classic and malicious attacks, due to the virtue of robust salient keypoints detection as well as the shape context feature descriptors. When compared with the current state-of-art block-based image hashing schemes, such as NMF and FJLT hashing, which extract robust features using dimension reduction, experimental results show that the proposed hashing scheme yields better identification performances under geometric attacks such as rotation attacks and brightness changes, and provides comparable performances under classic distortions such as additive noise, blurring and compression.

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.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.052
GPT teacher head0.289
Teacher spread0.238 · 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 designBench or experimental
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

Citations1
Published2011
Admission routes1
Has abstractyes

Explore more

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