Skip to Main content Skip to Navigation
New interface
Journal articles

Toward fast transform learning

Abstract : This paper introduces a new dictionary learning strategy based on atoms obtained by translating the composition of K convolutions with S-sparse kernels of known support. The dictionary update step associated with this strategy is a non-convex optimization problem. We propose a practical formulation of this problem and introduce a Gauss–Seidel type algorithm referred to as alternative least square algorithm for its resolution. The search space of the proposed algorithm is of dimension KS, which is typically smaller than the size of the target atom and much smaller than the size of the image. Moreover, the complexity of this algorithm is linear with respect to the image size, allowing larger atoms to be learned (as opposed to small patches). The conducted experiments show that we are able to accurately approximate atoms such as wavelets, curvelets, sinc functions or cosines for large values of K. The proposed experiments also indicate that the algorithm generally converges to a global minimum for large values of K and S.
Complete list of metadata

Cited literature [52 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Thursday, March 3, 2016 - 9:24:47 AM
Last modification on : Tuesday, October 25, 2022 - 11:58:11 AM
Long-term archiving on: : Saturday, June 4, 2016 - 10:31:01 AM


Files produced by the author(s)



Olivier Chabiron, François Malgouyres, Jean-Yves Tourneret, Nicolas Dobigeon. Toward fast transform learning. International Journal of Computer Vision, 2015, vol. 114 (n° 2), pp. 195-216. ⟨10.1007/s11263-014-0771-z⟩. ⟨hal-00862903v4⟩



Record views


Files downloads