mlsanityData to 7 Oct 2026

Learning ℓ1-based analysis and synthesis sparsity priors using bi-level optimization

arXiv 1401.4105 ↗First posted 16 Jan 2014cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

We consider the analysis operator and synthesis dictionary learning problems based on the the ℓ1 regularized sparse representation model. We reveal the internal relations between the ℓ1-based analysis model and synthesis model. We then introduce an approach to learn both analysis operator and synthesis dictionary simultaneously by using a unified framework of bi-level optimization. Our aim is to learn a meaningful operator (dictionary) such that the minimum energy solution of the analysis (synthesis)-prior based model is as close as possible to the ground-truth. We solve the bi-level optimization problem using the implicit differentiation technique. Moreover, we demonstrate the effectiveness of our leaning approach by applying the learned analysis operator (dictionary) to the image denoising task and comparing its performance with state-of-the-art methods. Under this unified framework, we can compare the performance of the two types of priors.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Jan 2014.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 2; 2023: 0; 2024: 1; 2025: 1.

6 papers.