MétaCan
Menu
Back to cohort

Joint-sparse dictionary learning: Denoising multiple measurement vectors

2017· article· en· W2792680995 on OpenAlexaff
Prerna Singh, Ramy Hussein, Angshul Majumdar, Rabab Ward

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsNoise reductionJoint (building)Computer scienceArtificial intelligencePattern recognition (psychology)ExploitDictionary learningChannel (broadcasting)Sparse approximationEngineering

Abstract

fetched live from OpenAlex

This work addresses the problem of denoising multiple measurement vectors having a common sparse support. Such problems arise in a variety of imaging problems, e.g. color imaging, multi-spectral and hyper-spectral imaging, multi-echo and multi-channel magnetic resonance imaging, etc. For such cases, denoising them piecemeal, one channel at a time, is not optimal; since it does not exploit the full structure (joint sparsity) of the problem. Joint-sparsity based methods have been used for solving such problems when the sparsifying transform is assumed to be fixed. In this work, we learn the sparsifying basis following the dictionary learning paradigm. Results on multi-spectral denoising and multi-echo MRI denoising demonstrates the superiority of our method over existing ones based on KSVD and BM4D.

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.004
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.001
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.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.065
GPT teacher head0.232
Teacher spread0.167 · 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
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207