MétaCan
Menu
Back to cohort
Record W2042706494 · doi:10.1142/s0218001407005867

CONTOUR-BASED FEATURE EXTRACTION USING DUAL-TREE COMPLEX WAVELETS

2007· article· en· W2042706494 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInternational Journal of Pattern Recognition and Artificial Intelligence · 2007
Typearticle
Languageen
FieldComputer Science
TopicImage Retrieval and Classification Techniques
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of CanadaCanadian Space Agency
KeywordsComplex wavelet transformHarmonic wavelet transformFourier transformPattern recognition (psychology)Invariant (physics)Artificial intelligenceWavelet transformWaveletComputer scienceStationary wavelet transformMathematicsScalingDiscrete wavelet transformMathematical analysisGeometry

Abstract

fetched live from OpenAlex

A contour-based feature extraction method is proposed by using the dual-tree complex wavelet transform and the Fourier transform. Features are extracted from the 1D signals r and θ, and hence the processing memory and time are reduced. The approximate shift-invariant property of the dual-tree complex wavelet transform and the Fourier transform guarantee that this method is invariant to translation, rotation and scaling. The method is used to recognize aircrafts from different rotation angles and scaling factors. Experimental results show that it achieves better recognition rates than that which uses only the Fourier features and Granlund's method. Its success is due to the desirable shift invariant property of the dual-tree complex wavelet transform, the translation invariant property of the Fourier spectrum, and our new complete representation of the outer contour of the pattern.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.154
GPT teacher head0.369
Teacher spread0.216 · 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