Conference Paper

Change detection methodology based on region classification fusion

A.U.G. Signals, Toronto
DOI: 10.1109/ICIF.2007.4408010 Conference: Information Fusion, 2007 10th International Conference on
Source: IEEE Xplore

ABSTRACT In this paper, several classification methods are presented and a fusion structure is included to improve the final classification performance. The definition of "layer" and the method to create it are then introduced. Based on "layer", a multiple level change detection algorithm is proposed, which gives the details of the changes in each region and is demonstrated to be an easy, effective and reliable method. Experimental results are provided using RADARSAT images, which have been registered with the automated registration algorithm of A.U.G. Signals that is currently available under the distributed processing system www.signalfusion.com.

0 Bookmarks
 · 
74 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce key concepts and issues including the effects of atmospheric propagation upon the data, spectral variability, mixed pixels, and the distinction between classification and detection algorithms. Detection algorithms for full pixel targets are developed using the likelihood ratio approach. Subpixel target detection, which is more challenging due to background interference, is pursued using both statistical and subspace models for the description of spectral variability. Finally, we provide some results which illustrate the performance of some detection algorithms using real hyperspectral imaging (HSI) data. Furthermore, we illustrate the potential deviation of HSI data from normality and point to some distributions that may serve in the development of algorithms with better or more robust performance. We therefore focus on detection algorithms that assume multivariate normal distribution models for HSI data
    IEEE Signal Processing Magazine 02/2002; · 3.37 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we provide a review of the different approaches used for target decomposition theory in radar polarimetry. We classify three main types of theorem; those based on the Mueller matrix and Stokes vector, those using an eigenvector analysis of the covariance or coherency matrix, and those employing coherent decomposition of the scattering matrix. We unify the formulation of these different approaches using transformation theory and an eigenvector analysis. We show how special forms of these decompositions apply for the important case of backscatter from terrain with generic symmetries
    IEEE Transactions on Geoscience and Remote Sensing 04/1996; · 3.47 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Polarimetric signatures of two primitives shapes (dihedral and edge) are simulated using high-frequency electromagnetic scattering methods. Signatures are predicted for a variety of orientations of the shapes. Polarimetric responses are analyzed using a polarization scattering matrix decomposition developed by Cameron and Leung (1990, 1992). It is shown that symmetric scatterer responses can be represented as points contained in the unit disc of the complex plane. The simulation shows that the polarimetric responses of the primitive shapes are remarkably stable as the shapes are rotated about various axes
    IEEE Transactions on Geoscience and Remote Sensing 06/1996; · 3.47 Impact Factor

Full-text (2 Sources)

Download
0 Downloads
Available from