MétaCan
Menu
Back to cohort
Record W2129379831 · doi:10.1109/ccece.2004.1345219

Lossy compression of DNA microarray images

2004· article· en· W2129379831 on OpenAlexafffund
Naser Faramarzpour, Shahram Shirani, M. Jamal Deen

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicImage Processing Techniques and Applications
Canadian institutionsMcMaster University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsLossy compressionComputer scienceQuantization (signal processing)Data compressionArtificial intelligenceEntropy (arrow of time)Image compressionComputer visionDiscrete cosine transformTransform codingEntropy encodingLossless compressionPattern recognition (psychology)Image processingImage (mathematics)Physics

Abstract

fetched live from OpenAlex

DNA microarray images, which are the final results of a microarray experiment, are usually massive in size. We have designed and implemented an algorithm for lossy compression of microarray images. First, spots are automatically extracted into spot sub-images. Then, within each subimage, a circle is matched to each spot. This is done via spatial optimization techniques. After that, our circle to square transform, C2S, is applied to the sub-image and a square image representing its spot part is achieved. Information regarding the coordinates of the C2S transform is also included in the final compressed file. The background parts which contain no biological information are neglected. The square shaped images are then put together and coded by means of DCT transform, quantization, and entropy coding.

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.000
metaresearch head score (Gemma)0.002
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.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
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.0030.001

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.008
GPT teacher head0.238
Teacher spread0.230 · 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

Citations2
Published2004
Admission routes2
Has abstractyes

Explore more

Same topicImage Processing Techniques and ApplicationsFrench-language works237,207