A First Step to Convolutive Sparse Representation

Details A First Step to Convolutive Sparse Representation A First Step to Convolutive Sparse Representation

2008-09-20

arxiv.org/abs/0809.3485v1

Computer Science

Multimedia

4 Pages-In Proceeding of ICASSP 2008

Scientific paper

In this paper an extension of the sparse decomposition problem is considered and an algorithm for solving it is presented. In this extension, it is known that one of the shifted versions of a signal s (not necessarily the original signal itself) has a sparse representation on an overcomplete dictionary, and we are looking for the sparsest representation among the representations of all the shifted versions of s. Then, the proposed algorithm finds simultaneously the amount of the required shift, and the sparse representation. Experimental results emphasize on the performance of our algorithm.

Affiliated with

Also associated with

No associations

Rating

A First Step to Convolutive Sparse Representation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A First Step to Convolutive Sparse Representation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A First Step to Convolutive Sparse Representation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-311391