Skip to content
naulon

Not checkedNot checked for notices yet.

IMPROVING LINEAR SPECTRAL UNMIXING THROUGH LOCAL ENDMEMBER DETECTION

R. Ramak, M. J. Valadan Zouj, B. Mojaradi

The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences · 2015

doi:10.5194/isprsarchives-xl-3-w2-177-2015 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

There are a considerable number of mixed pixels in remotely sensed images. Different sub-pixel analyses have been recently developed correspondingly. A well-known method is linear spectral unmixing which obtains an abundance of each endmember in a given pixel. This model assumes that each pixel is a linear combination of all endmembers in a scene. This assumption is not correct since each pixel can only be a composition of some surrounding endmembers. Even though, a fully mathematical technique is used for spectral analysis, the output of the model may not represent the physical nature of the objects over the pixel under test. In this regard, this paper proposes a Local Linear Spectral Unmixing which is based on neighbor pixels classes. Having classified the image, using a supervised classifier, it is scanned through a window of an appropriate size. For each pixel at the center of the window, the endmember matrix is formed only based on the majority classes existed in the window. Then the amount of each one is calculated. The LLSU method was evaluated on an AVIRIS data set collected from an agricultural area of northern Indiana. The results of the proposed method demonstrate a significant improvement in comparison with the LSU results. Moreover, due to the dimension reduction of the endmember matrix in this method, the computation time of the LLSU speeds up by three to eight times compared to the conventional Linear Spectral Unmixing method. As a result, the proposed method is efficient over the spectral unmixing tasks.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.