期刊
APPLIED SOFT COMPUTING
卷 125, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.asoc.2022.109200
关键词
Image change detection; Evolutionary multiobjective optimization; Gaussian mixture model; Synthetic aperture radar
资金
- National Natural Science Foundation of China [61906146, 62036006]
- Young Talent Fund of University Asso-ciation for Science and Technology in Shaanxi, China [20210103]
- Fundamental Research Funds for the Central Universities [JB210210]
In this paper, a change detection method based on evolutionary multiobjective optimization is proposed to automatically perform binary and ternary change detection of multitemporal SAR images. The method designs two objectives based on the log-likelihood function of the Gaussian mixture model and the Bhattacharyya distance. A novel measurement method based on Bhattacharyya distance is designed for the ternary change detection task. The proposed approach uses a multiobjective optimization method based on non-dominated sorting to optimize these two objectives simultaneously, and incorporates chromosome ranking, perturbation probability selection operators, and a one-step local search strategy to improve the algorithm's performance. Experimental results demonstrate the effectiveness and robustness of the proposed algorithm.
In most of the previous works, changed and unchanged regions are detected by analyzing the changes of backscattering coefficients for SAR images, which is termed as binary change detection. In fact, due to the increase and decrease of backscattering coefficients, the changed regions can be further analyzed as two kinds of changes, which is termed as ternary change detection. In this paper, a change detection method based on evolutionary multiobjective optimization is proposed to automatically perform binary and ternary change detection of multitemporal SAR images. First, the log-likelihood function of the Gaussian mixture model and the Bhattacharyya distance are designed as two objectives, respectively. In particular, a novel measurement method based on Bhattacharyya distance is designed for the ternary change detection task. Not only the separability between each two classes is maximized, but also the Bhattacharyya distance between two changed classes and unchanged class is kept closer to obtain a more balanced classification performance. Then a multiobjective optimization method based on non-dominated sorting is used to optimize these two objectives simultaneously. In the proposed approach, chromosome ranking and perturbation probability selection operators are designed to make high-quality solutions with a high probability of being exploited and improve the performance of the algorithm. In addition, a one-step local search strategy based on the expectation-maximization method is integrated into the proposed algorithm to accelerate the convergence. Experimental results on simulated and real-world datasets demonstrate the effectiveness and robustness of the proposed algorithm.(c) 2022 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据