TY - CONF
T1 - Panchromatic sharpening of multispectral satellite imagery via an explicitly defined convex self-similarity regularization
AU - Wang, Chia Hsiang
AU - Lin, Chia Hsiang
AU - Bioucas Dias, José M.
AU - Zheng, Wei Cheng
AU - Tseng, Kuo Hsin
N1 - Funding Information:
This work is supported partly by the Portuguese Science and Technology Foundation under Projects UID/EEA/50008/2013; and partly by the Young Scholar Fellowship Program (Einstein Program) of Ministry of Science and Technology (MOST) in Taiwan, under Grant MOST107-2636-E-006-006.
Publisher Copyright:
© 2019 IEEE.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85102327294&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85102327294&partnerID=8YFLogxK
U2 - 10.1109/IGARSS.2019.8900610
DO - 10.1109/IGARSS.2019.8900610
M3 - Paper
AN - SCOPUS:85102327294
SP - 3129
EP - 3132
T2 - 39th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2019
Y2 - 28 July 2019 through 2 August 2019
ER -