MétaCan
Menu
Back to cohort
Record W2133450349 · doi:10.1109/hpec.2014.7040947

A performance model of fast 2D-DCT parallel JPEG encoding using CUDA GPU and SMP-architecture

2014· article· en· W2133450349 on OpenAlex
Mohammed K. Ali Shatnawi, Hussein Ali Shatnawi

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
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsCUDAJPEGComputer scienceLossy compressionParallel computingSpeedupLossless JPEGDiscrete cosine transformComputationQuantization (signal processing)Thread (computing)JPEG 2000Data compressionImage compressionAlgorithmImage processingArtificial intelligenceImage (mathematics)

Abstract

fetched live from OpenAlex

The performance of image compression algorithms for big data can be enhanced using parallel computations. JPEG algorithm is a lossy compression method that uses DCT to eliminate high-frequency components. In this paper, we describe a cross-compatible design of JPEG on SMD and GPU architectures. To achieve maximal efficiency, we exploit the substantial parallelism to design an optimized version of JPEG based on thread model. A fair algorithm's evaluation on 24-bit BMP, using several performance metrics, is run on the fully optimized GPU using CUDA and SMP using SESC simulator. Our cross-architectural evaluation results revealed a 25.49 speedup in SESC and 21 in GPU and that CPU outperformed GPU for the JPEG.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.715
Threshold uncertainty score0.514

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.001
Open science0.0010.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.027
GPT teacher head0.267
Teacher spread0.240 · 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

Citations4
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207