Pixel Purity Index Assumes spectrally “pure” pixels are likely to correspond to “in scene” end members   For i = 1 to N Randomly generate a unit vector.

Slides:



Advertisements
Similar presentations
Presented by Xinyu Chang
Advertisements

Intensity Transformations (Chapter 3)
Chapter 4: Image Enhancement
COLORCOLOR A SET OF CODES GENERATED BY THE BRAİN How do you quantify? How do you use?
CHAPTER 2 D IRECT M ETHODS FOR S TOCHASTIC S EARCH Organization of chapter in ISSO –Introductory material –Random search methods Attributes of random search.
Multiple Criteria for Evaluating Land Cover Classification Algorithms Summary of a paper by R.S. DeFries and Jonathan Cheung-Wai Chan April, 2000 Remote.
Simple Neural Nets For Pattern Classification
May 2004SFS1 Shape from shading Surface brightness and Surface Orientation --> Reflectance map READING: Nalwa Chapter 5. BKP Horn, Chapter 10.
USER VERIFICATION SYSTEM. Scope Web Interface RGB separation Pervasive.
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
Potential of Ant Colony Optimization to Satellite Image Classification Raj P. Divakaran.
A Probabilistic Method to Determine the Minimum Leakage Vector for Combinational Designs Kanupriya Gulati Nikhil Jayakumar Sunil P. Khatri Department of.
Computer Vision I Instructor: Prof. Ko Nishino. Today How do we recognize objects in images?
Image Classification To automatically categorize all pixels in an image into land cover classes or themes.
Object recognition under varying illumination. Lighting changes objects appearance.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Lecture 10: Robust fitting CS4670: Computer Vision Noah Snavely.
Colour Image Compression by Grey to Colour Conversion Mark S. Drew 1, Graham D. Finlayson 2, and Abhilash Jindal 3 1 Simon Fraser University 2 University.
Digital Imaging and Remote Sensing Laboratory Mixed Pixels and Spectral Unmixing 1 Spectral Mixtures areal aggregate intimate Linear mixing models (areal.
Chapter 12 Spatial Sharpening of Spectral Image Data.
Spectral contrast enhancement
 C. C. Hung, H. Ijaz, E. Jung, and B.-C. Kuo # School of Computing and Software Engineering Southern Polytechnic State University, Marietta, Georgia USA.
Manipulating contrast/point operations. Examples of point operations: Threshold (demo) Threshold (demo) Invert (demo) Invert (demo) Out[x,y] = max – In[x,y]
Image Segmentation Seminar III Xiaofeng Fan. Today ’ s Presentation Problem Definition Problem Definition Approach Approach Segmentation Methods Segmentation.
Review of Statistics and Linear Algebra Mean: Variance:
Digital Imaging and Remote Sensing Laboratory NAPC 1 Noise Adjusted Principal Component Transform (NAPC) Data are first preprocessed to remove system bias.
Image-based Rendering. © 2002 James K. Hahn2 Image-based Rendering Usually based on 2-D imagesUsually based on 2-D images Pre-calculationPre-calculation.
PFI Cobra/MC simulator Peter Mao. purpose develop algorithms for fiducial (FF) and science (SF) fiber identification under representative operating conditions.
Data Extraction using Image Similarity CIS 601 Image Processing Ajay Kumar Yadav.
Multi-spectral image manipulation Lecture 6 prepared by R. Lathrop 10/99 Revised 2/09.
CS654: Digital Image Analysis
Digital Image Processing
Practical Considerations When t , the supp, then there will be a value of t when supp folds, it becomes multi-w-to-one-x mapping.
Computer Graphics and Image Processing (CIS-601).
Principal Components Analysis. Principal Components Analysis (PCA) A multivariate technique with the central aim of reducing the dimensionality of a multivariate.
Cluster Analysis Potyó László. Cluster: a collection of data objects Similar to one another within the same cluster Similar to one another within the.
Image Segmentation in Color Space By Anisa Chaudhary.
381 Self Organization Map Learning without Examples.
Remote Sensing Unsupervised Image Classification.
Vector Quantization CAP5015 Fall 2005.
Digital Imaging and Remote Sensing Laboratory Maximum Noise Fraction Transform 1 Generate noise covariance matrix Use this to decorrelate (using principle.
Principal Component Analysis (PCA)
Various Change Detection Analysis Techniques. Broadly Divided in Two Approaches ….. 1.Post Classification Approach. 2.Pre Classification Approach.
Change Detection Goal: Use remote sensing to detect change on a landscape over time.
Louisiana Department of Transportation and Development Forecasting Construction Cost Index Values Using Auto Regression Modeling Charles Nickel, P.E. Cost.
Feature Extraction 主講人:虞台文. Content Principal Component Analysis (PCA) PCA Calculation — for Fewer-Sample Case Factor Analysis Fisher’s Linear Discriminant.
Vegetation Enhancements (continued) Lost in Feature Space!
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
01/26/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
Feature Extraction 主講人:虞台文.
Unsupervised Classification
Image Mosaicing with Motion Segmentation from Video Augusto Roman, Taly Gilat EE392J Final Project 03/20/01.
Landsat 8 – Thermal Bands
Clustering MacKay - Chapter 20.
Unsupervised Learning
Hyperspectral Analysis Techniques
Motion Segmentation with Missing Data using PowerFactorization & GPCA
Orthogonal Subspace Projection - Matched Filter
Vegetation Enhancements (continued) Lost in Feature Space!
Hourglass Processing Approach (AIG)
A. Vadivel, M. Mohan, Shamik Sural and A. K. Majumdar
A special case of calibration
Discussion #29 – Images II
Hyperspectral Image preprocessing
What Is Spectral Imaging? An Introduction
Algorithm An algorithm is a finite set of steps required to solve a problem. An algorithm must have following properties: Input: An algorithm must have.
Supervised Classification
Unsupervised Classification
Presented by: Chang Jia As for: Pattern Recognition
EM Algorithm and its Applications
Presentation transcript:

Pixel Purity Index Assumes spectrally “pure” pixels are likely to correspond to “in scene” end members   For i = 1 to N Randomly generate a unit vector Vui Project image vectors (from n dimensional scatter plots) onto the vector Vui. i.e., V'ui · X = xi Identify the pixels that project at the extremes and increment those pixels 1 unit in the PPI image (i.e., min and max xi values) Next i Boardman, J.W., Kruse, F.A., Green, R.O. (1995). Mapping Target Signatures via Partial Unmixing of AVIRIS data, Fifth Annual JPL Airborne Earth Science Workshop, Vol. 1, AVIRIS Workshop, pp. 23-26 Chapter 5

Pixel Purity Index (cont’d) The output image is a brightness map of how often a pixel was defined to be an extreme. By thresholding the PPI image, we can identify pixels or clusters that are candidate end members. Chapter 5

Pixel Purity Index (cont’d) May choose to run this on Minimum Noise Faction (MNF) or noise adjusted principal component (NAPC) images to reduce the amount of data and to reduce the random variation in extremes due to noise in the data. Even though the selection is done using MNF data, we are only selecting pixel locations so further processing can use raw or calibrated data for the end member processing. Chapter 5

Pixel Purity Index (cont’d) Often a threshold is used to account for noise so you mark not only the extreme pixel as extreme, but pixels within ≈ 2 - 3 noise units so that you aren’t missing an end member due to noise in a similar pixel. See plots. Chapter 5

Pixel Purity Index (cont’d) Noise is defined to be 2 counts so accept values within say 4 counts of extreme   All pixels whose projections are shown are incremented one count in the PPI image. Note: if the MNF images are used, the threshold should usually be 2 since one count corresponds to one standard deviation. Chapter 5

Pixel Purity Index (cont’d) In ENVI there is a utility that plots the cumulative number of PPI pixels vs. iterations which should asymtote at a good value for N, so user can interactively terminate process. Chapter 5

Pixel Purity Index (cont’d) Plot the PPI data in either raw form or reduced form, e.g., MNF or PC and select pixels or clusters to define final end members. This normally requires interactive selection and the use of multiple projections of the n-dimensional data onto 2-D plots to define end members. This can be done with “Image Threshold to Region of Interest” and “n-Dimensional Viewer” in ENVI   Chapter 5

Pixel Purity Index (cont’d) Once the end members are defined in these projections, the corresponding pixels can be used to define the end member vectors from the means of the selected pixels in each cluster in either reflectance or radiance space. N.B. This process can be performed on full image sets or subsets instead of PPI derived data. However, the volume of data and the degree of confusion increases enormously. Chapter 5