Principal Component Image Interpretation A Logical and Statistical Approach

Similar documents
Dimension Reduction CS534

Spectral Classification

Facial Expression Detection Using Implemented (PCA) Algorithm

CIE L*a*b* color model

A Modified SVD-DCT Method for Enhancement of Low Contrast Satellite Images

A MAXIMUM NOISE FRACTION TRANSFORM BASED ON A SENSOR NOISE MODEL FOR HYPERSPECTRAL DATA. Naoto Yokoya 1 and Akira Iwasaki 2

Quality assessment of RS data. Remote Sensing (GRS-20306)

Image Compression with Singular Value Decomposition & Correlation: a Graphical Analysis

( ) =cov X Y = W PRINCIPAL COMPONENT ANALYSIS. Eigenvectors of the covariance matrix are the principal components

Chapter 1. Using the Cluster Analysis. Background Information

Statistical Analysis of Metabolomics Data. Xiuxia Du Department of Bioinformatics & Genomics University of North Carolina at Charlotte

Implementation & comparative study of different fusion techniques (WAVELET, IHS, PCA)


Rotation and Scaling Image Using PCA

MODULE 3 LECTURE NOTES 3 ATMOSPHERIC CORRECTIONS

Remote Sensed Image Classification based on Spatial and Spectral Features using SVM

Network Traffic Measurements and Analysis

Lecture 8 Object Descriptors

Investigation of Alternative Iteration Schemes for the IR-MAD Algorithm

COMPARATIVE STUDY OF IMAGE FUSION TECHNIQUES IN SPATIAL AND TRANSFORM DOMAIN

Image Denoising Using wavelet Transformation and Principal Component Analysis Using Local Pixel Grouping

Workload Characterization Techniques

COSC160: Detection and Classification. Jeremy Bolton, PhD Assistant Teaching Professor

IMAGE ANALYSIS, CLASSIFICATION, and CHANGE DETECTION in REMOTE SENSING

Data Fusion. Merging data from multiple sources to optimize data or create value added data

Performance Evaluation of Biorthogonal Wavelet Transform, DCT & PCA Based Image Fusion Techniques

PRINCIPAL COMPONENT ANALYSIS IMAGE DENOISING USING LOCAL PIXEL GROUPING

Non-linear dimension reduction

Principal Component Analysis (PCA) is a most practicable. statistical technique. Its application plays a major role in many

Estimating the wavelength composition of scene illumination from image data is an

SATELLITE IMAGE REGISTRATION THROUGH STRUCTURAL MATCHING 1

CHANGE DETECTION OF LINEAR MAN-MADE OBJECTS USING FEATURE EXTRACTION TECHNIQUE

Training-Free, Generic Object Detection Using Locally Adaptive Regression Kernels

COMBINED METHOD TO VISUALISE AND REDUCE DIMENSIONALITY OF THE FINANCIAL DATA SETS

Basics of Multivariate Modelling and Data Analysis

Data Mining Chapter 3: Visualizing and Exploring Data Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University

Feature selection. Term 2011/2012 LSI - FIB. Javier Béjar cbea (LSI - FIB) Feature selection Term 2011/ / 22

Recognition, SVD, and PCA

CHAPTER 6 IDENTIFICATION OF CLUSTERS USING VISUAL VALIDATION VAT ALGORITHM

Introduction to Remote Sensing Wednesday, September 27, 2017

TOPOGRAPHIC NORMALIZATION INTRODUCTION

Image Analysis, Classification and Change Detection in Remote Sensing

Data: a collection of numbers or facts that require further processing before they are meaningful

Isolated Curved Gurmukhi Character Recognition Using Projection of Gradient

Using Image's Processing Methods in Bio-Technology

Position Error Reduction of Kinematic Mechanisms Using Tolerance Analysis and Cost Function

Robust Kernel Methods in Clustering and Dimensionality Reduction Problems

Object-Based Correspondence Analysis for Improved Accuracy in Remotely Sensed Change Detection

SGN (4 cr) Chapter 10

Introduction to Machine Learning Prof. Anirban Santara Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Recognition: Face Recognition. Linda Shapiro EE/CSE 576

International Journal of Advancements in Research & Technology, Volume 2, Issue 8, August ISSN

INTELLIGENT TARGET DETECTION IN HYPERSPECTRAL IMAGERY

Nonlinear dimensionality reduction of large datasets for data exploration

Short Survey on Static Hand Gesture Recognition

Fourier analysis of low-resolution satellite images of cloud

An Approach for Image Fusion using PCA and Genetic Algorithm

UNIT - 5 IMAGE ENHANCEMENT IN SPATIAL DOMAIN

Adaptive Video Compression using PCA Method

MULTIVARIATE TEXTURE DISCRIMINATION USING A PRINCIPAL GEODESIC CLASSIFIER

Introduction to digital image classification

Invisible Watermarking Using Eludician Distance and DWT Technique

CSE 481C Imitation Learning in Humanoid Robots Motion capture, inverse kinematics, and dimensionality reduction

Hyperspectral Chemical Imaging: principles and Chemometrics.

Robust Pose Estimation using the SwissRanger SR-3000 Camera

Simplified clustering algorithms for RFID networks

Spatial Enhancement Definition

Vivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT.

Digital Image Classification Geography 4354 Remote Sensing

Statistical Pattern Recognition

EVALUATION OF THE THEMATIC INFORMATION CONTENT OF THE ASTER-VNIR IMAGERY IN URBAN AREAS BY CLASSIFICATION TECHNIQUES

CLASSIFICATION AND CHANGE DETECTION

1314. Estimation of mode shapes expanded from incomplete measurements

Chapter 3 Set Redundancy in Magnetic Resonance Brain Images

Fast Anomaly Detection Algorithms For Hyperspectral Images

Copyright 2005 Center for Imaging Science Rochester Institute of Technology Rochester, NY

Clustering and Visualisation of Data

FEATURE EXTRACTION TECHNIQUES FOR IMAGE RETRIEVAL USING HAAR AND GLCM

University of Florida CISE department Gator Engineering. Data Preprocessing. Dr. Sanjay Ranka

Handwritten Script Recognition at Block Level

CSC 411: Lecture 14: Principal Components Analysis & Autoencoders

Lab 9. Julia Janicki. Introduction

Statistical Pattern Recognition

Performance optimization of a rotary mower using Taguchi method

Lecture 4: Spatial Domain Transformations

An ICA based Approach for Complex Color Scene Text Binarization

Dimension reduction : PCA and Clustering

3D Visualization and Spatial Data Mining for Analysis of LULC Images

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

CSC 411: Lecture 14: Principal Components Analysis & Autoencoders

IMAGE DE-NOISING IN WAVELET DOMAIN

The Novel Approach for 3D Face Recognition Using Simple Preprocessing Method

Data Preprocessing. Data Preprocessing

Estimating Noise and Dimensionality in BCI Data Sets: Towards Illiteracy Comprehension

PRINCIPAL components analysis (PCA) is a widely

Reconstruction of Surface Spectral Reflectances Using Characteristic Vectors of Munsell Colors

GPU Based Face Recognition System for Authentication

Statistical Image Compression using Fast Fourier Coefficients

Spectral Compression: Weighted Principal Component Analysis versus Weighted Least Squares

UNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences

Transcription:

Principal Component Image Interpretation A Logical and Statistical Approach Md Shahid Latif M.Tech Student, Department of Remote Sensing, Birla Institute of Technology, Mesra Ranchi, Jharkhand-835215 Abstract - Principal component analysis a multivariate statistical data analysis algorithm widely used as a dimensionality reduction algorithm in image processing task. In remote sensing data analysis, PCA used as a spectral enhancement preprocessing algorithm to reduce higher dimension space to lower dimension space with preservation of all the information in original variables. This paper provides a lucid approach to analyse and interpret PC images using statistical and logical approach. It also describe the dependency of the tonal variation of pixel vector of PCs image with magnitude and sign (negative or positive) of the coefficient of eigenvector and pixel value in original multispectral bands. Keywords - Principal Component Analysis, Eigenvalue, Eigenvector, Component Loading Factor I. INTRODUCTION Principal component analysis is a multivariate statistical dimensionality reduction algorithm. Through linear orthogonal coordinate transformation it projects the sample dataset distributed in m dimensional highly correlated space into uncorrelated orthogonal PC vector space with preservation of all the information of original variables. This algorithm tries to find out the direction of maximum variance on the basis of the distributed sample data in multivariate space towards which PCs vector exhibit maximum variability. Traditionally its application has been applied for image enhancement and channel reduction, also been effectively used in terrestrial change detection studies. The transformed principal component vector exhibit orthogonal vector space in which every PC vector directed along the direction of maximum variance must orthogonal with other PC vectors. PC transformation does not leads any loss of information. Due to compression of information from high dimension to low dimension components it reduce computational complexity for interpreting the details of feature. Eigenvalue define the scene variance by each PCs and eigenvector define the direction of orientation of each PCs vector. Percentage of scene variance posed by PCs component decreases with increase in order of components. ERDAS IMAGIN, ENVI, MATLAB, be some image processing software for handling the remote sensing dataset provide the facility to perform principal component transformation (PCT) sorted the components in order of decrease in variance. The purpose of the present article to explain the approach to interpret the principal component images in lucid manner through statistical and logical approach. We makes an assessment and evaluation of the effect of the tonal dependency of PC pixel with eigenvector (magnitude and sign (negative or positive eigenvectors (, i.e. loading))) and pixels value in original bands. The paper has been organized into two sections as follow: Basic concept and terminology of PCA. Assessment and evaluation of the effect of combination of eigenvector with DN values of spectral bands( with the help of examples) II. PRINCIPAL COMPONENT ANALYSIS- CONCEPTUAL UNDERSTANDING. Principal component analysis is a lower order multivariate statistical data analysis algorithm used as a feature extraction process to reduce the dimensionality of the spectral band into few spectral component. It transform highly correlated bands into uncorrelated components through linear transformation orthogonal projection approaches. PCA preserve all the relevant information of ground features during transformation. PCA improve signal to noise ratio by discarding the extrinsic components (exhibits low variance) and remove inter-band correlation among the variables. In remote sensing, multispectral and hyper-spectral sensor observe or monitor the bio-physical characteristic of the ground features in multiple spectral channels (either continuous or discrete distribution). Hence these bands always undergoes different statistical error are as follows: Inter band correlation among the bands. Overlapping of spectral signature of multiple ground feature. Computational complexness. PCA not only reduce the dimensionality of original bands but also provide a sharp spectral distinction among the multiple ground features posse spectral overlapping. Dimensionality of PC components must be less than equal to dimension of original bands. Satellite remote sensing digital images are continuous numeric variable; therefore their dimensionality can be reduce using PCA algorithm. PCA reduces lower order dependency among the variables. PCA is a Gaussian based multivariate data analysis, which summarize the sample data using lower order statistics (1st or 2nd order). After performing PCA transformation we generate a new set of pixel array with pixel value is function of elements of eigenvector matrix and original pixel value. IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 383

Standardized and unstandardized PCA: We perform PCA using two different statistical approaches; Standardize PCA: standardized PC vector estimated using correlation matrix. Estimation of correlation matrix been made using the following mathematical relation; V 1/2 * *V -1/2 = (1) Or, V -1/2 * *V 1/2 (2) Where; = Correlation matrix. V 1/2 = Diagonal Standard deviation matrix. = Covariance matrix. Hence from the above mathematical derivation equation-2 used to calculate correlation matrix from variance-covariance matrix after standardization of all the variables of covariance matrix. Standardized PCA always provide better signal to noise (SNR) than unstandardized PCA. Unstandardized PCA: unstandardized PC vectors estimated using covariance (or ) matrix were the variables are not standardized. It poses always poor signal to noise ratio. Covariance matrix is a 2 nd order representative of sample data in multivariate feature space derive from mean vector measure the intersection in between bands or variables. Mathematically: Where: And, Cov (X Y) = ( ) (3) X and Y = observe random variable. X and Y = mean of the random variable. N= sample population of X and Y (assumed to be same). Corr (X Y) = xy = = ( ) Equation-4 represents the statistical relation in between correlation matrix and covariance matrix. In multivariate data analysis we have multiple variable called bands as a vector measured the radiance flux from pixel vector and plot the data in accordance with their spectral value measured by each vector in n dimensional space called feature space. Mathematical procedure to estimate PC vector as follow: Estimation of mean vector from sample data or pixel vector distributed in n (say) dimensional feature space using the following eq n are as ; Mean vector = m = = ; for k=3(dimensionality of bands) (5) Where: X k = spectral value of n th sample data measured by k th vector. Estimation of covariance or correlation matrix using equation-3 and 4. Estimation of eigenvalue and eigenvector through Eigen matrix derive from correlation or covariance matrix.where eigenvalue measure the scene variance or variability of sample data of each PCs vector and eigenvector define the direction of orientation of each PCs vector( always along the direction of maximum variance). (4) o Eigenvalue estimation Let A be covariance matrix derive using equation-3 of the sample data represented in n dimensional feature space plot. Then using characteristic equation we got; (A - = (6) Where: I be the unit matrix and be the arbitrary value called root Solving equation- (6) we get the root of the characteristic equation called eigenvalue say, > > >. are arrange in decreasing order of variance and number of roots must equal with no of original bands. Statistically we must say exhibit maximum variance or information than, similarly exhibit larger variance than and so on. Statistically we must say that out of m th principal components we maximize the variance of the first k th effective principal components called intrinsic dimensionality and minimize the variance of m-k principal components. o Eigenvector estimation: Let e1, e2..en be the n th set of eigenvector correspondence to eigenvalue then, (A - *I)[e n ]= (7) Solving equation- (7) for different value of give the values of Eigen vector also called the coefficient of Eigen matrix. IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 384

Estimation of VAF (variance accounted for) for each components. Estimation of Loading Factor: measure Pearson correlation coefficient in between the pixel value of PC image and original band at same pixel location (i,j). Statistically we say it measure the importance or weightage of each spectral band to the particular PC axis. Mathematically: pq = (8) Where: p = PC Components; q = original bands; Estimation of contribution: measure of fractional contribution of each bands for estimating PC component images. Mathematically: Contribution of Band i to PC k = (9) Finally estimation of PC images using the following linear transformation equation as follow: PC j = e1j*b1+e2j*b2+ enj*bn (1) Where: PC j = pixel value of jth PC at spatial location say (ij), e1j, e2j.enj = eigenvector for PCj and B1, B2 Bn = pixel value at location (ij) recorded by n spectral band. III. SCOPE OF WORK From the previous discussion we highlights the statistical approach to estimate PC images and also we analyse how the tonal value at each pixel location in PCs images is a linear function of eigenvector and DN values in original bands or variables. The purpose of this paper to highlight how the pixels value in PC images varies in accordance with spectral variation in original band with magnitude and sign (negative or positive) eigenvector through examples. IV. DEPENDENCY OF EIGEN VECTOR WITH DN VALUES OF SPECTRAL BANDS ON PC IMAGES From the above discussion it has already been shown that, PC image DN value = Hence from the above equation we must say that larger numeric value eigenvector exhibit maximum contribution and significance for estimation of PCs than lower numeric value eigenvectors. Now, our first attempt to analyse the above discussion by taking some examples. These examples are generated using a different subset data of LISS3 image and Landsat7 ETM image of Ranchi district. 3.1 Example 1: (Figure 1) Target Point P Fig-1(a): PC1 Image of Ranchi district derived from LISS3 image IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 385

Spectral Profile of subset image 6 5 51 4 3 2 32 24 1 Band1 Band2 Band3 Band4 1 Pixel Value Fig-1(b): Spectral Profile curve of LISS3 subset image Eigenvector Graph of PC1.7.6.5.4.3.2.1 -.1 -.2 -.3.58913.632394.439448 BAND1 BAND2 BAND3 BAND4 -.244721 Fig-1(c): Eigenvector graph of PC1 Contribution (%) Matrix of PC1 39.9922 34.774 19.3115 5.9888 BAND1 BAND2 BAND3 BAND4 Fig-1(d): Contribution Percent Matrix of PC1 From the above Fig-1(a) shows the PC1 image of subset area of Ranchi district comprising of VNIR-SWIR bands, Fig-1(b) shows the spectral profile curve at point P (as mention in fig1(a))in subset image and Fig-1(c) shows eigenvector plot for PC1 to all the bands. From Fig-1(a) we found that spectral profile curve continuously decreasing from band1 to band4 with maximum value at band1 for point P in Fig-1(a) shows in band1 point P are more reflective but as we move towards band4 its reflectivity goes decreasing but simultaneously from Fig- 1(c) we observe band4 exhibit maximum contribution with positive value to PC1 but pixel value at this band is very low, also spectral value at band3 is quite better than band4 but negative eigenvector makes the contribution of band3 at pixel location P be low or insignificant. From contribution graph for PC1 we found that band4 possess IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 386

maximum contribution or more weightage than band1.hence from above discussion we conclude that pixel location P exhibit low DN value in PC1 image or appears to darker signature. 3.2 Example 2 ( Figure 2) Target point P Fig-2(a): PC4 subset images of Ranchi district from LISSS3 image.6.4.2.512835 Eigenvector for PC4.444789.24296 -.2 BAND1 BAND2 BAND3 BAND4 -.4 -.6 -.8 Fig-2(b): Eigenvector Graph of PC4 layer Contribution(%) graph of PC4 -.693845 48.1421 26.3 19.7837 5.7742 BAND1 BAND2 BAND3 BAND4 Fig-2(c): Contribution Percent Graph of PC4 Fig-2(a) show the subset image of the same area as in Fig-1(a) in PC4 component. Target point P appears to brighter signature which are irrespective of Fig-1(a) were it appear to darker signature. From statistics graph in Fig-2(b) we observe that all the bands except band4 exhibit positive eigenvector with maximum contribution of 48.1241% to estimate PC4. Spectral profile curve Fig-1(b) shows the darkest spectral signature at point P. Similarly eigenvector at band1, 2&3 exhibit positive value. From above discussion we got two result: Combination of negative maximum eigenvector at band4 with low spectral DN value in band4 satisfied brighter spectral signature in PC4 image at target location P. IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 387

Combination of positive moderate eigenvector at band1,2,&3 with high spectral DN value in band1,2&3 also satisfied brighter spectral signature at pixel location P in PC4 images. Hence on combination of the above two statement we got brighter DN value at this location in PC4 image. 3.3 Example 3(Figure 3) Target point Q Fig-3(a): Subset Image of PC-3 of Ranchi district derived from Landsat 7 image Eigenvector Graph of PC3.8.6.47936.568776.486813.4.2 -.2 -.4 1 8 -.39924 -.348816 Fig-3(b): Eigenvector Graph of PC3 Spectral Profile at Point 'Q' 8 6 4 57 48 2 2 23 Fig-3(c): Spectral Profile at Point Q IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 388

Contribution(%) Graph for PC3 9.653 12.1673 22.1781 23.6987 32.356 Fig-3(d): Contribution Graph of PC3 Fig-3(a) shows the PC3 subset image of Ranchi district derived from Landsat7 ETM sensor comprising VNIR-SWIR bands. Fig-3(b) shows that band2 exhibit maximum contribution of eigenvector for estimating the PC3 image with positive value. Band 4&5 exhibit low eigenvector contribution for PC3 image possess less significance than band 1, 2, &3. Spectral profile graph in Fig- 3(c) shows that maximum spectral DN value at location Q is achieved by band1 and as we move towards other bands pixel value linearly decreases. From contribution graph we observe that band1 & band2 in combination provide 54.5287 percent of the total contribution for estimation of PC3 than other bands from Fig-3(d). Band 4 &5 exhibit negative and low eigenvector with low percentage of contribution for PC3 and poor spectral value at target point P from Fig-3(c). Statistically we get following conclusion: Positive and high eigenvector exhibit band 1, 2&3 with high spectral DN value enforce the DN value at target point in PC3 to be higher. Hence it emphasize brighter pixel value Low and negative eigenvector consist band 4&5 with low spectral DN value due to counter effect enforce the output DN value in PC image at target point to be positive or brighter spectral signature. Actually in both case; whether high negative eigenvector with low spectral DN value bands or high positive eigenvector with high spectral DN value bands, we got brighter pixel vector in PC images at that location. Similarly, whether high negative eigenvector with high spectral DN value bands or high positive eigenvector with low spectral DN value bands, we must got dark pixel vector in PCs image at that location. 3.4 Example 4(Figure 4) Target Point Q Fig-4(a): Subset of PC-2 layer of Ranchi district derived from Landsat 7 IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 389

Eigenvector Graph for PC-2 1.8.825378.6.4.37188.4625.2 -.2.6375 -.11312 Fig-4(b): Eigenvector Graph of PC-2 Contribution(%) Graph of PC-2 13.7391553 1.2792624 16.485636 68.12488429.464625 Fig-4(c): Contribution Percent Matrix of PC-2 From Fig-4(a) we observe that the brightness condition at pixel location Q in PC-2 is dark which are opposite w.r.t to Fig-3(a). From the above statistical calculation and graph associated with PC2 image and original bands, we found that band 5 exhibit maximum positive eigenvector from Fig-4(b) with maximum percentage of contribution to estimate the PC-2 of 68.12% from Fig- 4(c) and band 1& 3 both exhibit low contribution of 13.7% and 16.4856% to estimate PC-2 image. But spectral graph of Fig-3(c) shows band 5 exhibit very low spectral value than band 1, 2&3. From above discussion we conclude the following facts: Low spectral DN value with high eigenvector contribution by band5 has negative impact on PC-2 at point Q makes the low DN value. High spectral DN value with low positive eigenvector contribution by band 1&3 has negative effect on PC-2 image. Hence pixel value must be dark spectral signature at point Q. V. CONCLUSION From the above experimental analysis of different multispectral dataset we observe the dependency of PCs image pixel value at any spatial location as a linear function of magnitude and sign of eigenvector and spectral profile of original multispectral bands or layer for same pixel location, i.e. brightness value in PC images at each pixel vector location depend upon spectral profile of the pixel vector at same spatial location and magnitude and sign of Eigenvectors. REFERENCES [1] Hair, Andreson, Tatham and Black, Multivariate Data Analysis, Low Price Edition, 21 [2] Johnson and Wichern, Applied Multivariate Statistical Analysis, Prentice Hall, New Jersey, 21. [3] P.M. Mather, Computer Processing of Remote Sensed Images, John Wiley & Sons Ltd, West Sussex, 24. [4] Lillesand, Keifer, Chipman, Remote Sensing and Image Interpretation, John Wiley & Sons Ltd, 28. [5] [6] A. Singh and A. Harrison, Standardized Principal Component Analysis, International Journal of Remote Sensing, Vol.6, no.6, 1985, pp.883-96 [7] Sabins, F.F., Jr., Remote Sensing Principal and interpretation, 3 rd ed., W.H.Freeman, New York, 1997. [8] Ravi P.Gupta, Reet K. Tiwari, Varinder Saini and Neeraj Srivastava, A Simplified Approaches For Interpreting Principal Component Images, Advance in Remote Sensing, 213, 2, 111-119 IJEDR14469 International Journal of Engineering Development and Research (www.ijedr.org) 381