SKCS-A Separable Kernel Family with Compact Support to improve visual segmentation of handwritten data
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.
Bibliographic record
Abstract
Extraction of pertinent data from noisy gray level document images with various and complex backgrounds such as mail envelopes, bank checks, business forms, etc... remains a challenging problem in character recognition applications. It depends on the quality of the character segmentation process. Over the last few decades, mathematical tools have been developed for this purpose. Several authors show that the Gaussian kernel is unique and offers many beneficial properties. In their recent work Remaki and Cheriet proposed a new kernel family with compact supports (KCS) in scale space that achieved good performance in extracting data information with regard to the Gaussian kernel. In this paper, we focus in further improving the KCS efficiency by proposing a new separable version of kernel family namely (SKCS). This new kernel has also a compact support and preserves the most important properties of the Gaussian kernel in order to perform image segmentation efficiently and to make the recognizer task particularly easier. A practical comparison is established between results obtained by using the KCS and the SKCS operators. Our comparison is based on the information loss and the gain in time processing. Experiments, on real life data, for extracting handwritten data, from noisy gray level images, show promising performance of the SKCS kernel, especially in reducing drastically the processing time with regard to the KCS.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it