Tree-based pursuit: Algorithm and properties

IEEE Transactions on Signal Processing

Volumn 54, Issue 12, 2006, Pages 4685-4697

  Jost, Philippe ^b   Vandergheynst, Pierre ^a,b   Frossard, Pascal ^a,b  

^a IEEE   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

Clustering; Greedy algorithms; Matching pursuit; Redundant expansions; Sparse approximation; Tree search

Indexed keywords

MATCHING PURSUIT; REDUNDANT EXPANSIONS; SIGNAL EXPANSIONS; SPARSE APPROXIMATION;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DECISION TREES; GLOSSARIES; MOLECULES; SIGNAL PROCESSING;

APPROXIMATION ALGORITHMS;

EID: 33947121059     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2006.882080     Document Type: Article

References (24)

1. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," J. Construct. Approx., vol. 13, pp. 57-98, 1997.
2. S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
3. S.S.Chen, D.L.Donoho, and M.A. Saunders,"Atomic decomposition by basis pursuit," SIAM J. Scientific Comput., vol. 20, no. 1, pp. 33-61, 1999.
4. D. Redmill, D. Bull, and P. Czerepinki, "Video coding using a fast non-separable matching pursuits algorithm," in Proc. IEEE Int. Conf. Image Processing, Oct. 1998, vol. 1, pp. 769-773.
5. R. Neff and A. Zakhor, "Matching pursuit video coding, i. Dictionary approximation," IEEE Trans. Circuits Syst. Video Technol., vol. 12, no. 1, pp. 13-26, Jan. 2002.
6. K.-P. Cheung and Y.-H. Chan, "A fast two-stage algorithm for realizing matching pursuit," in Proc. IEEE Int. Confe. Image Processing, Oct. 2001, vol. 2, pp. 431-434.
7. R. Gribonval, "Fast matching pursuit with a multiscale dictionary of gaussian chirps," IEEE Trans. Signal Process., vol. 49, no. 5, pp. 994-1001, May 2001.
8. C. de Vleeschwomver and B. Macq, "Subband dictionaries for low-cost matching pursuits of video residues," IEEE Trans. Circuits Syst. Video Technol., vol. 9, no. 7, pp. 984-993, Oct., 199.
9. M. Goodwin and M. Vetterli, "Matching pursuit and atomic signal models based on recursive filter banks," IEEE Trans. Signal Process., vol. 47, no. 7, pp. 1890-1902, Jul. 1999.
10. P. Schmid-Saugeon and A. Zakhor, "Dictionary design for matching pursuit and application to motion-compensated video coding," IEEE Trans. Circuits Syst. Video Technol., vol. 14, no. 6, pp. 880-886, Jun. 2004.
11. Y.-T. Chou, W.-L. Hwang, and C.-L. Huang, "Gain-shape optimized dictionary for matching pursuit video coding," Signal Process., vol. 83, pp. 1937-1943, Sep. 2003.
12. D. Jiang, C. Tang, and A. Zhang, "Cluster analysis for gene expression data: a survey," IEEE Trans. Knowledge and Data Engi., vol. 16, no. 11, pp. 1370-1386, Nov. 2004.
13. S. Safavian and D. Landgrebe, "A survey of decision tree classifier methodology," IEEE Trans. Systems, Man Cybern., vol. 21, no. 3, pp. 660-674, May/Jun. 1991.
14. S. Cotter and B. Rao, "Application of tree-based searches to matching pursuit," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, May 2001, vol. 6, pp. 3933-3936.
15. J. A. Tropp, "Topics in sparse approximation," in Computational and Applied Mathematics. Austin, TX: Univ. Texas-Austin Press, Aug. 2004.
16. M. Elad and A. Bruckstein, "A generalized uncertainty principle and sparse representations in pairs of bases," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2558-2567, Sep. 2002.
17. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, De. 2003.
18. J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
19. P. Frossard and P. Vandergheynst, "Redundancy in non-orthogonal transforms," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 196.
20. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
21. L. Peotta, P. Jost, P. Vandergheynst, and P. Frossard, Sparse Approximation With Block Incoherent Dictionaries EPFL, 1015 Ecublens, TR-ITS 2003.007, Dec. 2003.
22. I. S. Dhillon, E. M. Marcotte, and U. Roshan, "Diametrical clustering for identifying anti-correlated gene clusters," Bioinfonnatics, vol. 19, no. 13, pp. 1612-1619, 2003.
23. J. A. Tropp, Just Relax: Convex Programming Methods for Subset Selection and Sparse Approximation Univ. Texas at Austin, ICES Rep. 04-04, Feb. 2004.
24. R. Figueras i Ventura, P. Vandergheynst, and P. Frossard, "Low rate and flexible image coding with redundant representations," IEEE Trans. Image Process., vol. 15, no. 3, pp. 726-739, Mar. 2006.