By Topic

A sparse solution to the bounded subset selection problem: a network flow model approach

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 $13
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)
Alghoniemy, M. ; Dept. of Electr. Eng., Alexandria Univ., Egypt ; Tewfik, A.H.

We reformulate the problem of finding the sparsest representation of a given signal using an overcomplete dictionary as a bounded error subset selection problem. Specifically, the reconstructed signal is allowed to differ from the original signal by a bounded error. We argue that this bounded error formulation is natural in many applications, such as coding. Our novel formulation guarantees the sparsest solution to the bounded error subset selection problem by minimizing the number of nonzero coefficients in the solution vector. We show that this solution can be computed by finding the minimum cost flow path of an equivalent network. Integer programming is adopted to find the solution.

Published in:

Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on  (Volume:5 )

Date of Conference:

17-21 May 2004