MétaCan
Menu
Back to cohort
Record W2735885719 · doi:10.1109/ijcnn.2017.7966385

Image completion with global structure and weighted nuclear norm regularization

2017· article· en· W2735885719 on OpenAlexaff
Mingli Zhang, Christian Desrosiers

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsPixelRegularization (linguistics)Matrix normArtificial intelligenceComputer scienceRedundancy (engineering)Norm (philosophy)Image restorationPattern recognition (psychology)AlgorithmImage (mathematics)ResidualMathematicsComputer visionImage processingEigenvalues and eigenvectors

Abstract

fetched live from OpenAlex

Structure and nonlocal patch similarity have been used successfully to enhance the performance of image restoration. However, these techniques can often remove textures and edges, or introduce artifacts. In this paper, we propose a novel image completion method that leverages the redundancy of nonlocal image patches via the low-rank regularization of similar patch groups. The textures and edges in these patches are preserved using an adaptive regularization technique based on the weighted nuclear norm. Furthermore, a new global structure regularization strategy, imposing ℓ1-norm sparsity on the image's high-frequency residual component, is presented to recover missing pixels while preserving structural information in the image. An efficient optimization technique, based on the Alternating Direction Method of Multipliers (ADMM) algorithm, is used to solve the proposed model. Experimental results show our method to outperform state-of-the-art image completion approaches, for various text-corrupted images and different ratios of missing pixels.

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.003
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
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.010
GPT teacher head0.253
Teacher spread0.243 · 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
GenreEmpirical

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

Citations14
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicImage and Signal Denoising MethodsFrench-language works237,207