Show simple item record

dc.contributor.authorBibi, Adel Aamer
dc.contributor.authorItani, Hani
dc.contributor.authorGhanem, Bernard
dc.date.accessioned2018-01-16T11:46:50Z
dc.date.available2018-01-16T11:46:50Z
dc.date.issued2017-11-09
dc.identifier.citationBibi A, Itani H, Ghanem B (2017) FFTLasso: Large-Scale LASSO in the Fourier Domain. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). Available: http://dx.doi.org/10.1109/cvpr.2017.465.
dc.identifier.doi10.1109/cvpr.2017.465
dc.identifier.urihttp://hdl.handle.net/10754/626825
dc.description.abstractIn this paper, we revisit the LASSO sparse representation problem, which has been studied and used in a variety of different areas, ranging from signal processing and information theory to computer vision and machine learning. In the vision community, it found its way into many important applications, including face recognition, tracking, super resolution, image denoising, to name a few. Despite advances in efficient sparse algorithms, solving large-scale LASSO problems remains a challenge. To circumvent this difficulty, people tend to downsample and subsample the problem (e.g. via dimensionality reduction) to maintain a manageable sized LASSO, which usually comes at the cost of losing solution accuracy. This paper proposes a novel circulant reformulation of the LASSO that lifts the problem to a higher dimension, where ADMM can be efficiently applied to its dual form. Because of this lifting, all optimization variables are updated using only basic element-wise operations, the most computationally expensive of which is a 1D FFT. In this way, there is no need for a linear system solver nor matrix-vector multiplication. Since all operations in our FFTLasso method are element-wise, the subproblems are completely independent and can be trivially parallelized (e.g. on a GPU). The attractive computational properties of FFTLasso are verified by extensive experiments on synthetic and real data and on the face recognition task. They demonstrate that FFTLasso scales much more effectively than a state-of-the-art solver.
dc.description.sponsorshipThis work was supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research. We thank Congli Wang for his help in the CUDA implementation.
dc.publisherIEEE
dc.relation.urlhttp://ieeexplore.ieee.org/document/8099948/
dc.titleFFTLasso: Large-Scale LASSO in the Fourier Domain
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.contributor.departmentVisual Computing Center (VCC)
dc.identifier.journal2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
dc.conference.dateJUL 21-26, 2016
dc.conference.name30th IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
dc.conference.locationHonolulu, HI
kaust.personBibi, Adel Aamer
kaust.personItani, Hani
kaust.personGhanem, Bernard


This item appears in the following Collection(s)

Show simple item record