Sparse solutions to linear inverse problems with multiple measurement vectors

IEEE Transactions on Signal Processing

Volumn 53, Issue 7, 2005, Pages 2477-2488

  Cotter, Shane F ^a,c   Rao, Bhaskar D ^a   Engan, Kjersti ^b   Kreutz Delgado, Kenneth ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF STAVANGER   (Norway)

^c NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FUNCTIONS; INVERSE PROBLEMS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

COST FUNCTIONS; LINEAR INVERSE PROBLEMS; MULTIPLE MEASUREMENT VECTORS; SINGLE-MEASUREMENT SUBOPTIMAL ALGORITHMS; SPARSE SOLUTIONS;

SIGNAL PROCESSING;

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

References (58)

1. B. D. Rao, "Signal processing with the sparseness constraint," in Proc. ICASSP, vol. III, Seattle, WA, May 1998, pp. 1861-4.
2. I. F. Gorodnitsky, J. S. George, and B. D. Rao, "Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm," J. Electroencephalog. Clinical Neurophysiol., vol. 95, no. 4, pp. 231-251, Oct. 1995.
3. I. F. Gorodnitsky and B. D. Rao, "Sparse signal reconstructions from limited data using FOCUSS: A re-weighted minimum norm algorithm," IEEE Trans. Signal Process., vol. 45, no. 3, pp. 600-616, Mar. 1997.
4. H. Lee, D. P. Sullivan, and T. H. Huang, "Improvement of discrete bandlimited signal extrapolation by iterative subspace modification," in Proc. ICASSP, vol. 3, Dallas, TX, Apr. 1987, pp. 1569-1572.
5. S. D. Cabrera and T. W. Parks, "Extrapolation and spectral estimation with iterative weighted norm modification," IEEE Trans. Acoust., Speech, Signal Process., vol. 39, no. 4, pp. 842-851, Apr. 1991.
6. B. D. Jeffs, "Sparse inverse solution methods for signal and image processing applications," in Proc. ICASSP, vol. III, Seattle, WA, May 1998, pp. 1885-1888.
7. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, no. 2, pp. 227-234, Apr. 1995.
8. E. S. Cheng, S. Chen, and B. Mulgrew, "Efficient computational schemes for the orthogonal least squares learning algorithm," IEEE Trans. Signal Process., vol. 43, no. 1, pp. 373-376, Jan. 1995.
9. I. J. Fevrier, S. B. Gelfand, and M. P. Fitz, "Reduced complexity decision feedback equalization for multipath channels with large delay spreads," IEEE Trans. Commun., vol. 47, no. 6, pp. 927-937, Jun. 1999.
10. D. L. Duttweiler, "Proportionate normalized least-mean-squares adaptation in echo cancelers," IEEE Trans. Speech Audio Process., vol. 8, no. 5, pp. 508-518, Sep. 2000.
11. B. Jeffs and M. Gunsay, "Restoration of blurred star field images by maximally sparse optimization," IEEE Trans. Image Process., vol. 2, no. 2, pp. 202-211, Mar. 1993.
12. J. B. Ramsey and Z. Zhang, "The application of waveform dictionaries to stock market index data," in Predictablility of Complex Dynamical Systems, J. Kadtke and A. Kravtsov, Eds. New York: Springer-Verlag, 1996.
13. D. J. Field, "What is the goal of sensory coding," Neural Comput., vol. 6, pp. 559-601, 1994.
14. B. A. Olshausen and D. J. Field, "Emergence of simple-cell receptive field properties by learning a sparse code for natural images," Nature, vol. 381, pp. 607-609, Jun. 1996.
15. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," Constructive Approx., vol. 13, no. 1, pp. 57-98, 1997.
16. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
17. B. S. Atal and J. R. Remde, "A new model of LPC excitation for producing natural-sounding speech at low bit rates," in Proc. ICASSP, Paris, France, May 1982, pp. 614-17.
18. S. Chen and J. Wigger, "Fast orthogonal least squares algorithm for efficient subset model selection," IEEE Trans. Signal Process., vol. 43, no. 7, pp. 1713-1715, Jul. 1995.
19. Y. C. Pari, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Asilomar Conf. Signal, Syst., Comput., Nov. 1993, pp. 40-44.
20. G. Davis, S. Mallat, and Z. Zhang, "Adaptive time-frequency decompositions," Opt. Eng., vol. 33, no. 7, pp. 2183-2191, 1994.
21. S. Singhal and B. S. Atal, "Amplitude optimization and pitch prediction in multipulse coders" IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-37, no. 3, pp. 317-327, Mar. 1989.
22. S. F. Cotter, J. Adler, B. D. Rao, and K. Kreutz-Delgado, "Forward sequential algorithms for best basis selection," Proc. Inst. Elect. Eng. Vision, Image, Signal Process., vol. 146, no. 5, pp. 235-244, Oct. 1999.
23. S. Chen and D. Donoho, "Basis pursuit," in Proc. Twenty-Eighth Asilomar Conf. Signals, Syst., Comput., vol. I, Monterey, CA, Nov. 1994, pp. 41-44.
24. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.
25. B. D. Rao and K. Kreutz-Delgado, "An affine scaling methodology for best basis selection," IEEE Trans. Signal Process., vol. 47, no. 1, pp. 187-200, Jan. 1999.
26. K. Kreutz-Delgado and B. D. Rao, "Sparse basis selection, ICA, and majorization: Toward a unified perspective," in Proc. ICASSP, Phoenix, AZ, Mar. 1999.
27. K. Kreutz-Delgado and B. D. Rao, "Convex/schur-convex (CSC) log-priors and sparse coding," in Proc. 6th Joint Symp. Neural Comput., Pasadena, CA, May 1999.
28. K. Engan, "Frame Based Signal Representation and Compression," Ph.D. dissertation, Univ. Stavanger/NTNU, Stavenger, Norway, Sep. 2000, [Online] Available http://www.ux.uis.no/~kjersti.
29. B. D. Rao, K. Engan, S. F. Cotter, J. Palmer, and K. Kreutz-Delgado, "Subset selection in noise based on diversity measure minimization," IEEE Trans. Signal Process., vol. 51, no. 3, pp. 760-770, Mar. 2003.
30. C. Couvreur and Y. Bresler, "On the optimality of the backward greedy algorithm for the subset selection problem," SIAM J. Matrix Anal. Applicat., vol. 21, no. 3, pp. 797-808, 1999.
31. G. Harikumar, C. Couvreur, and Y. Bresler, "Fast optimal and suboptimal algorithms for sparse solutions to linear inverse problems," in Proc. ICASSP, vol. III, Seattle, WA, May 1998, pp. 1877-80.
32. S. Reeves, "An efficient implementation of the backward greedy algorithm for sparse signal reconstruction," IEEE Signal Process. Lett., vol. 6, pp. 266-8, Oct. 1999.
33. S. F. Cotter, K. Kreutz-Delgado, and B. D. Rao, "Backward sequential elimination for sparse vector subset selection," Signal Process., vol. 81, pp. 1849-64, Sep. 2002.
34. S. F. Cotter, K. Kreutz-Delgado, and B. D. Rao, "Efficient backward elimination algorithm for sparse signal representation using overcomplete dictionaries," IEEE Signal Process. Lett., vol. 9, no. 5, pp. 145-7, May 2002.
35. B. D. Rao and K. Kreutz-Delgado, "Basis selection in the presence of noise," in Proc. 32st Asilomar Conf. Signals, Syst., Comput., Monterey, CA, Nov. 1998.
36. B. D. Rao and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," in Proc. IEEE Digital Signal Process. Workshop, Bryce Canyon, UT, Aug. 1998.
37. R. Gribonval, "Sparse decomposition of stereo signals with matching pursuit and application to blind separation of more than two sources from a stereo mixture," in Proc. Int. Conf. Acoust., Speech, Signal Process., 2002.
38. R. Gribonval, "Piecewise linear separation," in Proc. SPIE, Wavelets: Applications in Signal and Image Processing X, 2003.
39. D. Leviatan and V. N. Temlyakov, "Simultaneous Approximation by Greedy Algorithms," Univ. South Carolina, Dept. Math., Columbia, SC, Tech. Rep. 0302, 2003.
40. J. W. Phillips, R. M. Leahy, and J. C. Mosher, "Meg-based imaging of focal neuronal current sources," IEEE Trans. Med. Imag., Vol. 16, no. 3, pp. 338-348, Mar. 1997.
41. P. Stoica and R. Moses, Introduction to Spectral Analysis. Upper Saddle River, NJ: Prentice-Hall, 1997.
42. S. F. Cotter and B. D. Rao, "Sparse channel estimation via matching pursuit with application to equalization," IEEE Trans. Commun., vol. 50, no. 3, pp. 374-377, Mar. 2002.
43. D. L. Donoho and H. Xiaoming, "Uncertainty principles and ideal atomic decompositions," IEEE Trans. Inf Theory, Vol. 47, no. 7, pp. 2845-2862, Nov. 2001.
44. M. Elad and A. M. 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.
45. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
46. 1 minimization," Proc. Nat. Aca. Sci., vol. 100, no. 5, pp. 2197-2202, 2003.
47. J. J. Fuchs, "On Sparse Representations in Arbitrary Redundant Bases. Tech. Rep.," IRISA, Paris, France, 2002.
48. J. Tropp, "Greed is Good: Algorithmic Results for Sparse Approximation: Tech. Rep.," Texas Inst. Comput. Eng. Sci., Univ. Texas, Austin, TX, 2003.
49. R. Gribonval and M. Nielsen, "Highly Sparse Representations from Dictionaries are Unique and Independent of the Sparseness Measure," Aalborg Univ., Dept. Math. Sci., Aalborg, Denmark, Tech. Rep. R-2003-16, 2003.
50. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: John Hopkins Univ. Press, 1989.
51. M. V. Wickerhauser, Adapted Wavelet Analysis from Theory to Software. Wellesley, MA: A. K. Peters, 1994.
52. D. Donoho, "On minimum entropy segmentation," in Wavelets: Theory, Algorithms, and Applications, L. Montefusco, C. K. Chui, and L. Puccio, Eds. New York: Academic, 1994, pp. 233-269.
53. K. Kreutz-Delgado and B. D. Rao, "Measures and algorithms for best basis selection," in Proc. ICASSP, vol. III, Seattle, WA, May 1998, pp. 1881-1884.
54. P. C. Hansen, "Analysis of discrete III-posed problems by means of the L-curve," SIAM Rev., vol. 34, pp. 561-580, Dec. 1992.
55. P. C. Hansen and D. P. O'Leary, "The use of the L-Curve inthe regularization of discrete ill-posed problems," SIAM J. Sci. Comput., vol. 14, pp. 1487-1503, Nov. 1993.
56. D. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1989.
57. S. F. Cotter, "Subset Selection Algorithms with Applications," Ph.D. dissertation, Univ. Calif. San Diego, La Jolla, CA, 2001.
58. J. Palmer and K. Kreutz-Delgado, "A globally convergent algorithm for maximum likelihood estimation in the Bayesian linear model with non-Gaussian source and noise priors," in Proc. 36th Asilomar Conf. Signals, Syst., Comput,, Monterey, CA, Nov. 2002.