MétaCan
Menu
Back to cohort
Record W2138504825 · doi:10.1109/ccece.2008.4564672

Logo classification using Haar wavelet co-occurrence histograms

2008· article· en· W2138504825 on OpenAlexaffvenue
Ali Hesson, Dimitrios Androutsos

Bibliographic record

VenueConference proceedings - Canadian Conference on Electrical and Computer Engineering · 2008
Typearticle
Languageen
FieldComputer Science
TopicImage Retrieval and Classification Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsHistogramArtificial intelligencePattern recognition (psychology)Histogram matchingImage histogramHaar waveletHistogram of oriented gradientsComputer visionComputer scienceWaveletBalanced histogram thresholdingAdaptive histogram equalizationMathematicsWavelet transformImage (mathematics)Image processingHistogram equalizationImage textureDiscrete wavelet transform

Abstract

fetched live from OpenAlex

In this paper, a system for the classification of logo and trademark images is proposed. Our proposed technique is based on using a co-occurrence histogram of the coefficients of the Haar wavelet decomposition of an image for indexing and classification. We call this histogram the wavelet co-occurrence histogram (WCH). The WCH produces a more accurate representation of the image features than does a histogram of edge direction angles in an image, since it captures the edge information and intensity variations in the image as well as the spatial separation of these features more accurately. We compare the results produced by our system to the results produced by the edge gradient histogram (EGH); a histogram of the direction angles of edges in an image. We show that when tested on a database of logos and trademarks, the retrieval results produced by our proposed system are more accurate than the EGH.

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.004
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: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0080.005
Science and technology studies0.0010.000
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.003

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.054
GPT teacher head0.241
Teacher spread0.188 · 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
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

Citations6
Published2008
Admission routes2
Has abstractyes

Explore more

Same venueConference proceedings - Canadian Conference on Electrical and Computer EngineeringSame topicImage Retrieval and Classification TechniquesFrench-language works237,207