Mayo, Perla, Karakus, Oktay ![]() ![]() |
![]() |
PDF
- Published Version
Available under License Creative Commons Attribution. Download (3MB) |
Abstract
In representation learning, Convolutional Sparse Coding (CSC) enables unsupervised learning of features by jointly optimising both an ℓ2 -norm fidelity term and a sparsity enforcing penalty. This work investigates using a regularisation term derived from an assumed Cauchy prior for the coefficients of the feature maps of a CSC generative model. The sparsity penalty term resulting from this prior is solved via its proximal operator, which is then applied iteratively, element-wise, on the coefficients of the feature maps to optimise the CSC cost function. The performance of the proposed Iterative Cauchy Thresholding (ICT) algorithm in reconstructing natural images is compared against algorithms based on minimising standard penalty functions via soft and hard thresholding as well as against the Iterative Log-Thresholding (ILT) method. ICT outperforms the Iterative Hard Thresholding (IHT), Iterative Soft Thresholding (IST), and ILT algorithms in most of our reconstruction experiments across various datasets, with an average Peak Signal to Noise Ratio (PSNR) of up to 11.30 dB, 7.04 dB, and 7.74 dB over IST, IHT, and ILT respectively. The source code for the implementation of the proposed approach is publicly available at https://github.com/p-mayo/cauchycsc
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Additional Information: | This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/ |
Publisher: | Institute of Electrical and Electronics Engineers |
ISSN: | 2169-3536 |
Date of First Compliant Deposit: | 14 September 2021 |
Date of Acceptance: | 7 July 2021 |
Last Modified: | 02 May 2023 12:08 |
URI: | https://orca.cardiff.ac.uk/id/eprint/144106 |
Citation Data
Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |