Elsevier

Computers & Geosciences

Volume 38, Issue 1, January 2012, Pages 107-114
Computers & Geosciences

Linear and kernel methods for multivariate change detection

https://doi.org/10.1016/j.cageo.2011.05.012Get rights and content

Abstract

The iteratively reweighted multivariate alteration detection (IR-MAD) algorithm may be used both for unsupervised change detection in multi- and hyperspectral remote sensing imagery and for automatic radiometric normalization of multitemporal image sequences. Principal components analysis (PCA), as well as maximum autocorrelation factor (MAF) and minimum noise fraction (MNF) analyses of IR-MAD images, both linear and kernel-based (nonlinear), may further enhance change signals relative to no-change background. IDL (Interactive Data Language) implementations of IR-MAD, automatic radiometric normalization, and kernel PCA/MAF/MNF transformations are presented that function as transparent and fully integrated extensions of the ENVI remote sensing image analysis environment. The train/test approach to kernel PCA is evaluated against a Hebbian learning procedure. Matlab code is also available that allows fast data exploration and experimentation with smaller datasets. New, multiresolution versions of IR-MAD that accelerate convergence and that further reduce no-change background noise are introduced. Computationally expensive matrix diagonalization and kernel image projections are programmed to run on massively parallel CUDA-enabled graphics processors, when available, giving an order of magnitude enhancement in computational speed. The software is available from the authors' Web sites.

Highlights

► Easy-to-use IDL software implementations of change detection and kernel-based postprocessing algorithms are documented. ► Computationally expensive elements are programmed to run optionally on massively parallel CUDA-enabled graphics processors. ► New multiresolution versions of the iteratively re-weighted multivariate alteration detection transformation are presented. ► The train/test approach to kernel principal components analysis is evaluated against a Hebbian learning procedure.

Introduction

In a standard change detection situation involving optical remote sensing imagery, two multi- or hyperspectral images of the same scene are acquired at two different points in time and then compared. Between acquisitions, ground reflectance changes will have occurred at some locations, but in general not everywhere. In order to observe the changes, the images are accurately registered to one another and—optionally—corrected for atmospheric and illumination effects. The necessary preprocessing steps having been performed, it is common to examine functions of the spectral bands (differences, ratios, or other linear or nonlinear band combinations) that bring change information contained within them to the fore. Singh (1989) gives a good, but now somewhat outdated, survey of change detection algorithms for remotely sensed data. For more recent reviews in a more general context, see Radke et al. (2005) or Coppin et al. (2004) and in the context of very-high-resolution imagery, Marchesi et al. (2010). Alternatively, the objective may not be to observe change, but rather to eliminate relative differences between the images arising from effects due to the atmosphere, sensor gain, or differing solar illumination conditions. This can sometimes be achieved by linear radiometric normalization using invariant pixels identified within the images, that is, on the basis of no-change rather than change observations (Schott et al., 1988, Hall et al., 1991, Moran et al., 1992, Yang and Lo, 2000, Furby and Campbell, 2001, Du et al., 2002).

In a series of publications (Nielsen et al., 1998, Canty et al., 2004, Canty and Nielsen, 2006, Canty and Nielsen, 2008, Nielsen, 2007), the multivariate alteration detection (MAD) transformation and a modification involving iterative reweighting (IR-MAD or iMAD) were proposed, both for unsupervised change detection and for automatic radiometric normalization. More recently, Nielsen (2011) discussed, among other applications, the successful use of kernel versions of maximum autocorrelation factor (MAF) and minimum noise fraction (MNF) transformations for the postprocessing of difference images for change detection.

In this contribution, we present efficient and easy-to-use software implementations for IR-MAD and radiometric normalization, as well as for kernelized versions of principal components analysis (PCA), and the MAF and MNF transformations. The paper is organized as follows. In Section 2 we briefly outline the IR-MAD transformation, pointing out its advantages both for change detection and for radiometric normalization, and introduce new, multiresolution variants of IR-MAD. In Section 3 the kernel methods are summarized. In Section 4 we outline some specific choices made in the software implementations and describe IDL and Matlab programs for IR-MAD, radiometric normalization, kernel PCA, MAF, and MNF. The IDL routines, which function as fully integrated extensions of the ENVI remote sensing image analysis environment, can run on conventional CPU architectures as well as take advantage of the massively parallel capabilities of graphics processors. In Section 5, examples illustrating IR-MAD applied to multispectral imagery and the postprocessing of change images with kernel transformations are presented and the adopted train/test approach to kernel transformations is examined. Conclusions are drawn in Section 6.

Section snippets

Change detection

The observations (pixel vectors) in a bitemporal, p-band, multispectral image may be represented by random vectors X=(X1Xp)T and Y=(Y1Yp)T for the first and second acquisitions, respectively. The components Xi and Yi correspond to the original spectral bands and are conventionally ordered by wavelength. The MAD algorithm determines transformation matricesA=(a1,a2ap),B=(b1,b2bp)such that the components of the transformed random vectors U=ATX,V=BTY are ordered by similarity, where similarity

Kernel transformations for postprocessing

As opposed to linear spectral transformations (PCA, MAF/MNF), nonlinear transformations, especially kernel MAF/MNF analysis of difference images, have been found to give conspicuously better suppression of both noise and signal in the no-change background (Nielsen, 2011). The kernel versions of PCA and MAF/MNF handle nonlinearities by implicitly transforming data by nonlinear mapping functions ϕ into higher, even infinite, dimensional feature space and then performing a linear analysis in that

Software

High-level program scripts were written in IDL and Matlab to code the methods outlined in the two preceding sections and are described below in 4.1 ENVI/IDL, 4.2 Matlab, respectively. We present first some general design decisions made in the implementations.

Sign ambiguity: To avoid ambiguity in the signs of the canonical transformations and hence of the IR-MAD variates, it was required that the correlations of the canonical variates, like those of the original bitemporal image bands, be

Examples

In previous publications, several studies of the application of IR-MAD and its associated automatic radiometric normalization to multi- and hypervariate imagery have been given (Canty et al., 2004, Canty and Nielsen, 2006, Canty and Nielsen, 2008, Nielsen, 2007). Therefore, in this section, we restrict ourselves to examples involving the new multiresolution algorithms (Section 2.3) and kernel postprocessing (Section 3).

Conclusion

We have presented and illustrated efficient and easy-to-use IDL and Matlab software for multivariate change detection and radiometric normalization as well as for kernelized versions of principal components, maximum autocorrelation factors, and maximum noise fraction transformations. Comparison with the kernel Hebbian algorithm indicates that the use of 1% subsampling for kernel methods will give satisfactorily reproducible results for the first five or six eigenvectors. We have also introduced

Acknowledgment

Thanks to Dr. Luis Gomez-Chova, University of Valencia, Spain, for suggesting the centering of the test data with the training data mean.

References (25)

  • S. Günter et al.

    Fast iterative kernel principal component analysis

    Journal of Machine Learning Research

    (2007)
  • Halfhill, T.R., 2008. Parallel processing with CUDA. In: Microprocessor Report, Reed Electronics, Scottsdale, Az, pp....
  • Cited by (34)

    • Semi-supervised label propagation for multi-source remote sensing image change detection

      2023, Computers and Geosciences
      Citation Excerpt :

      Many works have emerged for change detection in recent years. They can be broadly divided into supervised (Volpi et al., 2013; Camps-Valls et al., 2008; Qin et al., 2006) and unsupervised change detection (Celik, 2009; Canty and Nielsen, 2012; Ouma et al., 2008) according to whether the prior knowledge exists or not (Lu et al., 2004). Supervised change detection is mainly based on the classification framework (Camps-Valls et al., 2008), but it needs a large number of labeled training data, which brings large consumptions of time and labor.

    • Modelling the spatial impact of regional planning and climate change prevention strategies on land consumption in the Rhine-Ruhr Metropolitan Area 2017–2030

      2022, Landscape and Urban Planning
      Citation Excerpt :

      Following the generation of accurate output for the baseline year, the iteratively reweighted multivariate alteration detection (IR-MAD) was used (Nielsen, 2007; Canty & Nielsen, 2008), in order to derive the areas with no change, which are the base for the extraction of reference samples for the classification of the preceding time steps. The IR-MAD transformation identifies suitable invariant pixels for radiometric normalization with an multivariate change detection algorithm (Pal, 2005) that iteratively increases the weight of non-change observations and thereby enhances the discrimination of substantial spectral changes between images from different time periods (Yang & Sun, 2017; Canty & Nielsen, 2012). A stepwise classification framework to former years by selecting new training samples through the integration of spectral information from unchanged pixels was applied (Ghazaryan et al., 2021).

    • Signal-to-noise ratio in reproducing kernel Hilbert spaces

      2018, Pattern Recognition Letters
      Citation Excerpt :

      Gómez-Chova et al. [7] extended the standard formulation by studying both signal and noise directly in the feature space (explicit kMNF). In this way, kSNR can effectively express nonlinear relations between signal and noise and, at the same time, reduces the number of parameters needed [4,5]. Later, we introduced in [6] the main ideas for exploiting the presented kSNR in machine learning applications beyond feature extraction.

    • Finding a needle by removing the haystack: A spatio-temporal normalization method for geophysical data

      2016, Computers and Geosciences
      Citation Excerpt :

      Spatial information is commonly used in satellite image processing. Such image processing techniques have been applied, among others, for feature extraction (e.g. van der Werff et al., 2006; Soto-Pinto et al., 2013), change detection (e.g. Coppin et al., 2004; Canty and Nielsen, 2012), normalization of specific influences in the satellite signal (e.g. Yang and Lo, 2000; Canty and Nielsen, 2008; Ulusoy et al., 2012), active fire monitoring (e.g. Giglio et al., 1999, 2003; Ichoku et al., 2003; Stolle et al., 2004; Kuenzer et al., 2007, 2008; Calle et al., 2008; Xu et al., 2010; Wooster et al., 2012), and studies of volcanic and geothermal activity (e.g. Coolbaugh et al., 2007; Ganci et al., 2011; Koeppen et al., 2011; Murphy et al., 2011; Steffke and Harris, 2011; Gutierrez et al., 2012; Vaughan et al., 2012; Blackett, 2014, 2015; van der Meer et al., 2014). A main aim is often the selection of an optimum background: this is used to contrast with an expected change or to describe a representative average state of a given neighbourhood.

    View all citing articles on Scopus
    View full text