Learn More
The problem of optimally approximating a function with a linear expansion over a redundant dictionary of waveforms is NP-hard. The greedy matching pursuit algorithm and its orthog-onalized variant produce sub-optimal function expansions by iteratively choosing dictionary waveforms that best match the function's structures. A matching pursuit provides a(More)
The problem of optimally approximating a function with a linear expansion over a redundant dictionary of waveforms is NP-hard. The greedy matching pursuit algorithm and its orthogo-nalized variant produce sub-optimal function expansions by iteratively choosing the dictionary waveforms which best match the function's structures. Matching pursuits provide a(More)
  • 1