MétaCan
Menu
Back to cohort
Record W4250113389 · doi:10.32920/ryerson.14649948.v1

Dictionaries and algorithms for sparsity constrained image reconstruction

2021· preprint· en· W4250113389 on OpenAlexaff
Mathiruban Tharmalingam

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceAlgorithmSignal reconstructionSIGNAL (programming language)Iterative reconstructionCoding (social sciences)Nonlinear systemSignal processingArtificial intelligencePeak signal-to-noise ratioPolynomialExponential functionImage (mathematics)Pattern recognition (psychology)MathematicsDigital signal processingStatistics

Abstract

fetched live from OpenAlex

There has been a growing interest in the different types of dictionaries that can be used in image processing applications. We propose a hybrid dictionary composed of transform based atoms and additional nonlinear atoms generated using the polynomial, rectangular and exponential functions. The additional nonlinear atoms improve signal reconstruction quality for both transient and smooth signals. To further improve signal reconstruction quality, we optimize the hybrid dictionary using training samples from the signal. We also propose a signal coding algorithm that generates additional atoms by performing a circular shift on the provided dictionary prior to coding the signal. We have evaluated the proposed methods against existing predefined dictionaries by visually examining the reconstructed images as well as evaluating the peak signal to noise ratio of the reconstructed signal. All methods proposed in this thesis improved signal reconstruction quality however; we require an in-depth cost analysis study to evaluate its limitations.

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.001
metaresearch head score (Gemma)0.005
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.0010.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.002

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.040
GPT teacher head0.295
Teacher spread0.255 · 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

Citations0
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicImage and Signal Denoising MethodsFrench-language works237,207