Your SlideShare is downloading. ×
Matteoli ieee gold_2010_clean
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Matteoli ieee gold_2010_clean

279
views

Published on

Published in: Education

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
279
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
24
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide
  • As regards background suppression, background subspace can be defined globally over the whole scene, or locally, by considering a neighborhood of each test pixel.
  • That is the image where the targets have been inserted. The simulation was conducted for several different values both of FI and ALFA:
  • These are detection results. FAR@PD=1, so the lower the better. Specifically we have plots of FAR vs FI and FAR vs ALFA. Results are in favor of the local approach. The global method (blue curve) manages to perform comparably to the local ones for a value of FI=10dB, but its performance quickly degrades for lower FI. (Of course the performance gets better as ALFA increases). Conversely, the local methods manage to detect the target even if it has very low global residual energy. Specifically, LBSE (red curve) provides the best results in most cases. LBSS exhibits a diversity in performance wrt to the number of neighboring pixels considered, for the selection of which no criteria can be invoked. IN fact, here, several configurations had to be tested so as to get good performance.
  • Transcript

    • 1. Pisa, 30.11.2007 Stefania Matteoli a Nicola Acito b Marco Diani a Giovanni Corsini a a Dipartimento di Ingegneria dell’Informazione, Università di Pisa, Pisa, Italy b Accademia Navale, Livorno, Italy Livorno, 30.04.2010 Hyperspectral Target Detection via Local Background Suppression South of Italy Chapter Remote Sensing & Image Processing Group
    • 2. Background - Hyperspectral Target Detection
    • 3. Outline
    • 4. Linear Mixing Model (LMM)
        • random vector associated to the test pixel
        • spectral signature of the target
        • scalar value accounting for sub-pixel targets
        • matrix spanning the background subspace
        • vector of background components
        • background subspace of dimension
        • zero-mean Gaussian random noise vector with covariance matrix
        • number of spectral bands
    • 5. Subspace-based target detection scheme original data space
        • Background is suppressed via orthogonal projection
      background suppression
        • projection matrix onto
      residual subspace target detection
    • 6. Target detection scheme, detection performance Background suppression
        • Target detection performance (P D and P FA ) depends on
      noise covariance matrix target residual energy P D is expected to be an increasing function of . Target detection
    • 7. Global background vs local background Global background subspace Local background subspace generally Target detection Background suppression
    • 8. Global background vs local background Global approach Local approach
      • Global background lies in a high-dimensional subspace
      • Low target residual energy after suppression (major risk of target leakage )
      • Provides lower-dimensional subspaces
      • Higher residual energy after projection (which benefits to detection performance)
      Target detection Background suppression
        • The background subspace basis is unknown and has to be estimated from the data
    • 9. Global background estimation : N-S NWHFC SVD all image pixels N-S subspace dimension (Virtual Dimension, VD) basis vectors
      • N-P based test on covariance and correlation matrix eigenvalues
      • based on asymptotic properties
      Target detection Background suppression
    • 10. Local background estimation : LBSS local neighborhood LBSS
      • A set of neighboring pixels is let span the background subspace
      Local Background Subspace Selection
      • The local subspace dimension is imposed by the number of neighboring pixels
      • LBSS cannot account for background spatial variability within the scene!
      LBSS main limitation
      • target leakage (overestimation)
      • false alarms (underestimation)
      Target detection Background suppression
    • 11. Local background estimation : a new algorithm local neighborhood LBSE
      • Automatic technique
      • Adaptive estimation on a per-pixel basis
      • Estimated local background subspace tailored to background spatial variability
      Local Background Subspace Estimation Statistical hypothesis testing SVD LBSE local subspace dimension basis vectors Target detection Background suppression
    • 12. LBSE procedure
    • 13. Target detection step each considered background basis estimation algorithm (N-S, LBSS, and LBSE) should be embodied in a subspace-based target detector Generalized Matched Filter (GMF) defined in the orthogonal complement of the background subspace N-S LBSS LBSE Background suppression Target detection
    • 14. Results: 1) LBSE adaptability to spatially variable backgrounds True-color image LBSE map LBSE map histogram urban area: high complexity vegetated rural area: low complexity
    • 15. Results: 2) Simulation methodology N-S, LBSS, LBSE the scalar value allows to set a desired value of the target residual energy on the orthogonal complement of the N-S estimated subspace
      • simulation performed over N=1000 images
      • Target detection results averaged over the 1000 images
    • 16. Results: 2) Simulation results (1000 images) Data-set
    • 17. Results: 2) Simulation (1000 images), [email_address] D =1 LBSS: K L BSS is a user-specified parameter. No criteria exist to set it and several configurations have to be tested in order to assure good performance.
    • 18. Results: 3) Testing on real data real target detection scenario with ground-truthed targets LBSE histogram ROC curves
      • Best performance obtained with LBSE
      • LBSS results exhibit diversity w.r.t. K LBSS
    • 19. Conclusion LBSE
      • novel and fully automatic algorithm for local background subspace estimation and suppression
      • experimental evidence of three main advantages w.r.t exiting methodologies
      being local , it is able at properly detecting targets with low residual energy w.r.t the global background subspace provides unambiguous results through the automatic computation of a local background dimension for each pixel it is capable of adapting to spatial variations of background complexity within the scene
    • 20. Pisa, 30.11.2007 Livorno, 30.04.2010 Thanks for your attention! South of Italy Chapter