TY - GEN
T1 - A multi-phase multiobjective approach based on decomposition for sparse reconstruction
AU - Li, Hui
AU - Fan, Yuanyuan
AU - Zhang, Qingfu
AU - Xu, Zongben
AU - Deng, Jingda
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/11/14
Y1 - 2016/11/14
N2 - Solving sparse optimization problems via regularization frameworks is the dominant methodology for reconstructing sparse signals in the area of compressive sensing. In recent a few years, the use of multiobjective evolutionary algorithms (MOEAs) for sparse optimization has also attracted some research interests. Under the multiobjective framework, the loss term (error) and the regularization term (sparsity) are treated as two separate objective functions. So far, two popular multiobjective frameworks, NSGA-II and MOEA/D, have been used for sparse optimization. In this paper, we further develop a new MOEA/D variant for sparse reconstruction and sparsity detection, which involves three phases - approximating Pareto front (PF) in a chain order (phase 1) and in a random order (phase 2), and exploiting a knee region (phase 3 - optional). Our experimental results show that our proposed method is more effective than the earlier version of MOEA/D and the HALF solver in sparse signal reconstruction and sparsity detection.
AB - Solving sparse optimization problems via regularization frameworks is the dominant methodology for reconstructing sparse signals in the area of compressive sensing. In recent a few years, the use of multiobjective evolutionary algorithms (MOEAs) for sparse optimization has also attracted some research interests. Under the multiobjective framework, the loss term (error) and the regularization term (sparsity) are treated as two separate objective functions. So far, two popular multiobjective frameworks, NSGA-II and MOEA/D, have been used for sparse optimization. In this paper, we further develop a new MOEA/D variant for sparse reconstruction and sparsity detection, which involves three phases - approximating Pareto front (PF) in a chain order (phase 1) and in a random order (phase 2), and exploiting a knee region (phase 3 - optional). Our experimental results show that our proposed method is more effective than the earlier version of MOEA/D and the HALF solver in sparse signal reconstruction and sparsity detection.
UR - https://www.scopus.com/pages/publications/85008257506
U2 - 10.1109/CEC.2016.7743848
DO - 10.1109/CEC.2016.7743848
M3 - 会议稿件
AN - SCOPUS:85008257506
T3 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
SP - 601
EP - 608
BT - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Congress on Evolutionary Computation, CEC 2016
Y2 - 24 July 2016 through 29 July 2016
ER -