An Efficient Algorithm for Overcomplete Sparsifying Transform Learning with Signal Denoising

<div>Relationship between the time (in seconds) consumed and the number of the training samples <svg height="8.68572pt" id="M578" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 7.31558 8.68572" width="7.31558pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M541 160L512 170C485 116 462 88 439 67C411 41 376 35 318 35C272 35 238 37 224 48C207 61 205 85 212 121L290 533C305 611 308 615 391 622L397 650H139L133 622C217 615 221 612 206 533L126 118C111 41 103 34 23 26L17 0H474C489 31 528 124 541 160Z" id="g113-77"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="553" vert-adv-y="553"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig12

Figure 12

Figure 12: An Efficient Algorithm for Overcomplete Sparsifying Transform Learning with Signal Denoising 