MétaCan
Menu
Back to cohort
Record W2049748457 · doi:10.1109/icsipa.2011.6144072

Visibly accurate model-based binary image compression scheme

2011· article· en· W2049748457 on OpenAlexaff
Saif alZahir

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Northern British Columbia
Fundersnot available
KeywordsBinary imageRectangleImage compressionPixelData compressionLogarithmAlgorithmBinary numberMathematicsComputer scienceImage (mathematics)Cartesian coordinate systemDistortion (music)Artificial intelligenceComputer visionImage processingGeometry

Abstract

fetched live from OpenAlex

In this paper we propose a model-based binary image compression scheme. In this scheme, we merge one-dimensional (1-D) blocks of black pixels of the input binary image with those in consecutive rows into larger blocks using mathematical models that preserve the quality of the image. This process reduces the number of vertices when the image is segmented into rectangles for compression. The top-left and the bottom-right vertices of each generated rectangle are then identified and the coordinates of which are efficiently encoded. The model for merging the blocks was obtained through extracting the data values involving the blocks of various widths and the subjective tolerance of an average viewer. The data values are then plotted on a Cartesian plane and approximated with linear, logarithmic, and polynomial functions. Simulation results show that the images after merging using the proposed model have less number of rectangles without any obvious image distortion and have higher compression ratio those rectangular partitioning methods in the literature.

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 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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.708
Threshold uncertainty score0.702

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.002
Open science0.0020.001
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.050
GPT teacher head0.301
Teacher spread0.251 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
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

Citations1
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207