an efficient algorithm for overcomplete sparsifying transform learning with signal denoising

Clicks: 146
ID: 161274
2016
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #360 of 1,093 articles by views in journal of power sources

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
This paper deals with the problem of overcomplete transform learning. An alternating minimization based procedure is proposed for solving the formulated sparsifying transform learning problem. A closed-form solution is derived for the minimization involved in transform update stage. Compared with existing ones, our proposed algorithm significantly reduces the computation complexity. Experiments and simulations are carried out with synthetic data and real images to demonstrate the superiority of the proposed approach in terms of the averaged representation and denoising errors, the percentage of successful and meaningful recovery of the analysis dictionary, and, more significantly, the computation efficiency.
Reference Key
hou2016mathematicalan Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Beiping Hou;Zhihui Zhu;Gang Li;Aihua Yu
Journal journal of power sources
Year 2016
DOI
10.1155/2016/6329740
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.