In satellite imaging remote sensing, injecting spatial details extracted from a panchromatic image into a multispectral image is referred to as pansharpening, which is ill-posed and requires regularization. Self-similarity, a critical prior knowledge yielding great success in regularizing various imaging inverse problems, has been widely observed in natural images; its formalization is not, however, straightforward. Very recently, we mathematically described the self-similarity pattern as a weighted graph, which can then be transformed into an explicit convex regularizer, that is adopted in our pansharpening criterion design. Most importantly, such convexity allows the adoption of convex optimization theory in solving self-similarity regularized inverse problems with convergence guarantee. One step of our pansharpening algorithm is exactly the proximal operator induced by our new self-similarity regularizer, which is solved by another customized algorithm that is interesting in its own right as could be used as a denoiser. Experiments show promising performance of the proposed method.
|出版狀態||已出版 - 2019|
|事件||39th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2019 - Yokohama, Japan|
持續時間: 28 7月 2019 → 2 8月 2019
|???event.eventtypes.event.conference???||39th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2019|
|期間||28/07/19 → 2/08/19|