Paper
22 October 2010 Unsupervised change detection by kernel clustering
Michele Volpi, Devis Tuia, Gustavo Camps-Valls, Mikhail Kanevski
Author Affiliations +
Abstract
This paper presents a novel unsupervised clustering scheme to find changes in two or more coregistered remote sensing images acquired at different times. This method is able to find nonlinear boundaries to the change detection problem by exploiting a kernel-based clustering algorithm. The kernel k-means algorithm is used in order to cluster the two groups of pixels belonging to the 'change' and 'no change' classes (binary mapping). In this paper, we provide an effective way to solve the two main challenges of such approaches: i) the initialization of the clustering scheme and ii) a way to estimate the kernel function hyperparameter(s) without an explicit training set. The former is solved by initializing the algorithm on the basis of the Spectral Change Vector (SCV) magnitude and the latter is optimized by minimizing a cost function inspired by the geometrical properties of the clustering algorithm. Experiments on VHR optimal imagery prove the consistency of the proposed approach.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michele Volpi, Devis Tuia, Gustavo Camps-Valls, and Mikhail Kanevski "Unsupervised change detection by kernel clustering", Proc. SPIE 7830, Image and Signal Processing for Remote Sensing XVI, 78300V (22 October 2010); https://doi.org/10.1117/12.864921
Lens.org Logo
CITATIONS
Cited by 14 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Remote sensing

Binary data

Statistical analysis

Chemical elements

Expectation maximization algorithms

Image resolution

Back to Top