Pansharpening via locality-constrained sparse representation

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, sparse representation based approaches have been shown an effective performance for pansharpening. However, these methods imposed `0 or `1 -norm constraints on the sparse coefficients. The local similarity of sparse coefficients was ignored. Motivated by the importance of data locality, in this paper, we propose a locality-constrained sparse representation algorithm for pansharpening, which keeps the data locality during the sparse representation process. The learned dictionary is able to preserve local data structure, resulting in improved data representation. During the sparse coding stage, analytical solutions are provided based on the basis of mathematic deduction. The pansharpening results show that the proposed method is competitive to the other well-known fusion methods.

Cite

CITATION STYLE

APA

Tang, S., Zhou, N., & Xiao, L. (2017). Pansharpening via locality-constrained sparse representation. In British Machine Vision Conference 2017, BMVC 2017. BMVA Press. https://doi.org/10.5244/c.31.180

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free