Well-posedness of the permutation problem in sparse filter estimation with lp minimization

Details Well-posedness of the permutation problem in sparse filter estimation with lp minimization Well-posedness of the permutation problem in sparse filter estimation with lp minimization

2011-11-11

arxiv.org/abs/1111.2848v1

Mathematics

Combinatorics

Scientific paper

Convolutive source separation is often done in two stages: 1) estimation of the mixing filters and 2) estimation of the sources. Traditional approaches suffer from the ambiguities of arbitrary permutations and scaling in each frequency bin of the estimated filters and/or the sources, and they are usually corrected by taking into account some special properties of the filters/sources. This paper focusses on the filter permutation problem in the absence of scaling, investigating the possible use of the temporal sparsity of the filters as a property enabling permutation correction. Theoretical and experimental results highlight the potential as well as the limits of sparsity as an hypothesis to obtain a well-posed permutation problem.

Affiliated with

Also associated with

No associations

Rating

Well-posedness of the permutation problem in sparse filter estimation with lp minimization 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 Well-posedness of the permutation problem in sparse filter estimation with lp minimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Well-posedness of the permutation problem in sparse filter estimation with lp minimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2593