Dictionary Learning: Reconstructing Incomplete Signals

  • Thread starter Thread starter steve_elf
  • Start date Start date
  • Tags Tags
    Signals
steve_elf
Messages
1
Reaction score
0
Hi guys! I am new here and I have a question related to the dictionary learning. For the dictionary learning, three critical elements are the dictionary, sparse coefficients and a signal for dictionary learning. Currently I have a dictionary D for learning all the signals in the set S, so for a signal s in the S, we can have s=Dw where w represents sparse coefficients. My question is that I now have an incomplete signal U and U can be regarded as a component of a signal in the S, so that s = U+T where T represents another component. So in this case how to reconstruct a signal s (in the signal set S) which best fits U using the dictionary D? I would be very grateful if you could give me some suggestions on this.

[Moderator's note: moved from a technical forum.]
 
Last edited by a moderator:
Physics news on Phys.org
Hello and :welcome: !

Can you explain a bit more? What is dictionary learning and how are the sets ##S,U,T## precisely defined?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top