MétaCan
Menu
Back to cohort
Record W2110019748 · doi:10.1109/iwfhr.2002.1030926

Recognition of courtesy amounts on bank checks based on a segmentation approach

2003· article· en· W2110019748 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCurrency Recognition and Detection
Canadian institutionsConcordia University
Fundersnot available
KeywordsSegmentationArtificial intelligencePattern recognition (psychology)Computer scienceClassifier (UML)CursiveImage segmentationCourtesyScale-space segmentationComputer vision

Abstract

fetched live from OpenAlex

A segmentation based courtesy amount recognition (CAR) system is presented in this paper. A two-stage segmentation module has been proposed, namely the global segmentation stage and the local segmentation stage. At the global segmentation stage, a courtesy amount is coarsely segmented into sub-images according to the spatial relationships of the connected components. These sub-images are then verified by the recognition module and the rejected sub-images are sequentially split using contour analysis at the local segmentation stage. Two neural network classifiers are combined into a recognition module. The isolated digit classifier divides the input patterns into ten numeral classes (0-9), while the holistic double zeros classifier recognizes the cursive and touching double zeros. Experimental results show that the system reads 66.5% bank checks correctly at 0% misreading rate.

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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.953
Threshold uncertainty score0.386

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.042
GPT teacher head0.258
Teacher spread0.217 · 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

Quick stats

Citations10
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicCurrency Recognition and DetectionFrench-language works237,207