An evolutionary multiobjective approach to sparse reconstruction

IEEE Transactions on Evolutionary Computation

Volumn 18, Issue 6, 2014, Pages 827-845

  Li, Lin ^a   Yao, Xin ^b   Stolkin, Rustam ^b   Gong, Maoguo ^a   He, Shan ^b  

^a XIDIAN UNIVERSITY   (China)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Compressed Sensing; Evolutionary Algorithm; Knee Region; Multi Objective Optimization; Pareto Front; Sparse Reconstruction; Zero Norm

Indexed keywords

COMPRESSED SENSING; COST FUNCTIONS; EVOLUTIONARY ALGORITHMS; LINEAR SYSTEMS; MULTIOBJECTIVE OPTIMIZATION; NUMERICAL METHODS; OPTIMAL SYSTEMS;

EVOLUTIONARY MULTI-OBJECTIVE ALGORITHMS; KNEE REGIONS; MULTIOBJECTIVE APPROACH; NUMERICAL OPTIMIZATIONS; PARETO FRONT; SPARSE RECONSTRUCTION; SPEED OF CONVERGENCE; ZERO NORMS;

PROBLEM SOLVING;

EID: 84902353224     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2013.2287153     Document Type: Article

References (46)

1. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
2. E. J. Candès and Y. Plan, "Near-ideal model selection by l1 minimization," Ann. Stat., vol. 37, no. 5A, pp. 2145-2177, 2009.
3. E. J. Candès, "The restricted isometry property and its implications for compressed sensing," Comptes Rendus Math., vol. 346, no. 9, pp. 589-592, 2008.
4. J. Wu, F. Liu, L. C. Jiao, and X. Wang, "Compressive sensing SAR image reconstruction based on Bayesian framework and evolutionary computation," IEEE Trans. Image Process., vol. 20, no. 7, pp. 1904-1911, Jul. 2011.
5. H. Lee, A. Battle, R. Raina, and A. Y. Ng, "Efficient sparse coding algorithms," in Proc. 19th Conf. Adv. Neural Inf. Process. Syst., vol. 19, pp. 801-808, 2007.
6. A. Y. Yang, S. S. Sastry, A. Ganesh, and Y. Ma, "Fast l1-minimization algorithms and an application in robust face recognition: A review," in Proc. 17th IEEE Int. Conf. Image Process., Sep. 2010, pp. 1849-1852.
7. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 586-597, Dec. 2007.
8. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmonic Anal., vol. 27, no. 3, pp. 265-274, 2009.
9. G. Davis, "Adaptive nonlinear approximations," Ph.D. dissertation, Dept. Math., Courant Inst. of Math. Sci., New York Univ., New York, NY, USA, 1994.
10. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," Constructive Approx., vol. 13, no. 1, pp. 57-98, 1997.
11. V. N. Temlyakov, "The best m-term approximation and greedy algorithms," Adv. Comput. Math., vol. 8, no. 3, pp. 249-265, 1998.
12. T. Blumensath and M. Davies, "Normalized iterative hard thresholding: Guaranteed stability and performance," IEEE J. Sel. Topics Signal Process., vol. 4, no. 2, pp. 298-309, Apr. 2010.
13. Z. Xu, X. Chang, F. Xu, and H. Zhang, "L1/2 regularization: A thresholding representation theory and a fast solver," IEEE Trans. Neural Netw. Learn. Syst., vol. 23, no. 7, pp. 1013-1027, Jul. 2012.
14. S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2346-2356, Jun. 2008.
15. D. L. Donoho and Y. Tsaig, "Fast solution of l1 norm minimization problems when the solution may be sparse," IEEE Trans. Inf. Theory, vol. 54, no. 11, pp. 4789-4812, Nov. 2008.
16. D. M. Malioutov, M. Cetin, and A. S. Willsky, "Homotopy continuation for sparse signal representation," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process., Mar. 2005, vol. 5, pp. 733-736.
17. K. K. Herrity, A. C. Gilbert, and J. A. Tropp, "Sparse approximation via iterative thresholding," in Proc. IEEE Int. Conf. Acoustics, Speech Signal Process., May 2006, vol. 3, pp. 624-627.
18. L. Jiao, L. Li, R. Shang, F. Liu, and R. Stolkin, "A novel selection evolutionary strategy for constrained optimization," Inf. Sci., vol. 239, no. 1, pp. 122-141, 2013.
19. D. Lim, Y. S. Ong, M. H. Lim, and Y. Jin, "Single/multi-objective inverse robust evolutionary design methodology in the presence of uncertainty," in Evolutionary Computation in Dynamic and Uncertain Environments, vol. 51, S. Yang, Y. Ong, and Y. Jin, Eds. Berlin, Germany: Springer, 2007, pp. 437-456.
20. H. Wang, S. Kwong, Y. Jin, W. Wei, and K. Man, "Multi-objective hierarchical genetic algorithm for interpretable fuzzy rule-based knowledge extraction," Fuzzy Sets Syst., vol. 149, no. 1, pp. 149-186, 2005.
21. Q. Zhang and H. Li, "MOEA/D: A multiobjective evolutionary algorithm based on decomposition," IEEE Trans. Evol. Comput., vol. 11, no. 6, pp. 712-731, Dec. 2007.
22. Z. Cai and Y. Wang, "A multiobjective optimization-based evolutionary algorithm for constrained optimization," IEEE Trans. Evol. Comput., vol. 10, no. 6, pp. 658-675, Dec. 2006.
23. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-197, Apr. 2002.
24. Y. Jin and B. Sendhoff, "Pareto-based multiobjective machine learning: An overview and case studies," IEEE Trans. Syst., Man, Cybern.C, Appl. Rev., vol. 38, no. 3, pp. 397-415, May 2008.
25. Y. Jin, Multi-objective machine learning. Berlin, Germany: Springer Verlag, 2006, vol. 16.
26. A. Chandra and X. Yao, "Evolving hybrid ensembles of learning machines for better generalisation," Neurocomputing, vol. 69, nos. 7-9, pp. 686-700, 2006.
27. H. Chen and X. Yao, "Multiobjective neural network ensembles based on regularized negative correlation learning," IEEE Trans. Knowl. Data Eng., vol. 22, no. 12, pp. 1738-1751, Dec. 2010.
28. L. Rachmawati and D. Srinivasan, "Multiobjective evolutionary algorithm with controllable focus on the knees of the Pareto front," IEEE Trans. Evol. Comput., vol. 13, no. 4, pp. 810-824, Aug. 2009.
29. J. Branke, K. Deb, H. Dierolf, and M. Osswald, "Finding knees in multiobjective optimization," in Proc. 8th Conf. PPSN, 2004, LNCS 3242, pp. 722-731.
30. K. Deb and S. Gupta, "Understanding knee points in bicriteria problems and their implications as preferred solution principles," Eng. Optimiz., vol. 43, no. 11, pp. 1175-1204, 2011.
31. I. Das, "On characterizing the 'knee' of the Pareto curve based on normal-boundary intersection," Structural Multidisciplinary Optimiz., vol. 18, no. 2, pp. 107-115, 1999.
32. T. Schnier, X. Yao, and P. Liu, "Digital filter design using multiple Pareto fronts," Soft Comput., vol. 8, no. 5, pp. 332-343, 2004.
33. K. Praditwong, M. Harman, and X. Yao, "Software module clustering as a multi-objective search problem," IEEE Trans. Softw. Eng., vol. 37, no. 2, pp. 264-282, Mar.-Apr. 2011.
34. S. Kukkonen and K. Deb, "Improved pruning of non-dominated solutions based on crowding distance for bi-objective optimization problems," in Proc. WCCI, 2006, pp. 1179-1186.
35. D. Yang, L. Jiao, M. Gong, and J. Feng, "Apaptive ranks clone and k-nearest neighbour list based immune multi-objective optimization," Comput. Intell., vol. 26, no. 4, pp. 359-385, 2010.
36. A. Neubauer, "A theoretical analysis of the non-uniform mutation operator for the modified genetic algorithm," in Proc. IEEE Int. Conf. Evol. Comput., Apr. 1997, pp. 93-96.
37. L. J. Eshelman, "Real-coded genetic algorithms and interval-schemata," in Proc. Foundations Genetic Algorithms II, D. L. Whitley, Ed., San Mateo, CA, pp. 187-202, 1993.
38. S. J. Wright, R. D. Nowak, and M. A. T. Figueiredo, "Sparse reconstruction by separable approximation," IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2479-2493, Jun. 2009.
39. E. T. Hale, W. Yin, and Y. Zhang, "A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing," Dept. Comput. Appl. Math., Rice Univ., Houston, TX, USA, Tech. Rep. TR07-07, 2007.
40. Z. Wang, K. Tang, and X. Yao, "Multi-objective approaches to optimal testing resource allocation in modular software systems," IEEE Trans. Reliab., vol. 59, no. 3, pp. 563-575, Sep. 2010.
41. A. Graps, "An introduction to wavelets," IEEE Comput. Sci. Eng., vol. 2, no. 2, pp. 50-61, 1995.
42. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, no. 1, pp. 129-159, 2001.
43. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, 2009.
44. J. Yang and Y. Zhang, "Alternating direction algorithms for l1-problems in compressive sensing," SIAM J. Sci. Comput., vol. 33, no. 1, pp. 250-278, 2011.
45. A. Y. Yang et al. (2009). l-1 Benchmark Package [Online]. Available: http://www.eecs.berkeley.edu/yang/software/l1benchmark/l1benchmark.zip
46. E. V. Berg, M. P. Friedlander, G. Hennenfent, F. Herrmann, R. Saab, and Apcode Ä. Yilmaz, "Sparco: A testing framework for sparse reconstruction," Dept. Computer Science, Univ. Brit. Columbia, Vancouver, U.K., Tech. Rep. TR-2007-20, Oct. 2007.