By Topic

Polynomial Time and Stack Decoding Solutions to Bounded Error Subset Selection

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)
Tewfik, A.H. ; Dept. of Electr. & Comput. Eng., Minnesota Univ. ; Alghoniemy, M.

The goal of bounded error subset selection (BESS) is to find the sparsest representation of an Ntimes1 vector b using vectors from a dictionary A of size NtimesM, such that the approximation is within a distance delta from b. Here delta is a user defined approximation threshold. Specifically, the goal is to find the sparsest vector x such that parAx - bpar les delta. The BESS is a reformulation of the classical subset selection problem. We describe two enumeration approaches with bounded complexities that find the optimal solution to the BESS problem. In particular, the paper describes the first exhaustive enumeration solution to subset selection type problems with polynomial complexity. Furthermore, it also describes a lower complexity stack decoding approach that finds a solution to the BESS problem with a complexity that is proportional to that of orthogonal matching pursuit. The approaches described here have a markedly better rate-distortion behavior than any of the other known solutions to the subset selection and BESS problems

Published in:

Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on  (Volume:3 )

Date of Conference:

14-19 May 2006