By Topic

Fast sparse representation model for I1-norm minimisation problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Peng, C.Y. ; Key Lab. of Optoelectron. Technol. & Syst. of Minist. of Educ., Chongqing Univ., Chongqing, China ; Li, J.W.

To solve the l1-norm minimisation problem, many algorithms, such as the l1-Magic solver, utilise the conjugate gradient (CG) method to speed up implementation. Since the dictionary employed by CG is often dense in `large-scale` mode, the time complexities of these algorithms remain significantly high. As signals can be modelled by a small set of atoms in a dictionary, proposed is a fast sparse representation model (FSRM) that exploits the property and it is shown that the l1-norm minimisation problem can be reduced from a large and dense linear system to a small and sparse one. Experimental results with image recognition demonstrate that the FSRM is able to achieve double-digit gain in speed with comparable accuracy compared with the l1-Magic solver.

Published in:

Electronics Letters  (Volume:48 ,  Issue: 3 )