Adaptive time-frequency decompositions with matching pursuit

By G. Davis, Stéphane Mallat, Zhifeng Zhang. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Richard Baraniuk
2. Christopher J. Rozell
3. Don H. Johnson
4. Yoshua Bengio
5. Francis R. Bach
6. Barbara Olshausen
7. Yann LeCun
8. Karol Gregor

Citations in the corpus

• Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lasso (2017, neutral): “…et al., 2011); greedy alternatives to forward stepwise algorithm, like matching pursuit (Mallat and Zhang, 1993) and orthogonal matching pursuit (Davis et al., 1994); nonconvex-penalized methods, such as SCAD (Fan and Li, 2001), MC+ (Zhang, 2010), and SparseNet (Mazumder et al., 2011); hybrid…”
• Sparse Coding via Thresholding and Local Competition in Neural Circuits (2008, background): “…iteration (Donoho et al., 2006; Pece and Petkov, 2000; Feichtinger et al., 1994) and MP extensions that perform an orthogonalization at each step (Davis et al., 1994; Rebollo-Neira and Lowe, 2002) involve computations that would be very difficult to implement in a parallel distributed architecture.”