IGRASS2011 An Interferometric Coherence Optimization Method Based on Genetic Algorithm in PolInSAR Peifeng Ma, Hong Zhang, Chao Wang, Jiehong Chen Center.

Slides:



Advertisements
Similar presentations
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Advertisements

On Estimation of Soil Moisture & Snow Properties with SAR Jiancheng Shi Institute for Computational Earth System Science University of California, Santa.
Object Recognition Using Genetic Algorithms CS773C Advanced Machine Intelligence Applications Spring 2008: Object Recognition.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Two-Dimensional Channel Coding Scheme for MCTF- Based Scalable Video Coding IEEE TRANSACTIONS ON MULTIMEDIA,VOL. 9,NO. 1,JANUARY Yu Wang, Student.
Effective gradient-free methods for inverse problems Jyri Leskinen FiDiPro DESIGN project.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Genetic Programming.
Dual Polarised Entropy/alpha Decomposition and Coherence Optimisation for Improved Forest Height Mapping Z-S Zhou, P. Caccetta, E. Lehmann, A. Held – CSIRO,
HJ-1A/B CCD IMAGERY Geometric Distortions and Precise Geometric Correction Accuracy Analysis Changmiao Hu, Ping Tang
Evolutionary Intelligence
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
On Estimation of Surface Soil Moisture from SAR Jiancheng Shi Institute for Computational Earth System Science University of California, Santa Barbara.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
earthobs.nr.no Temporal Analysis of Forest Cover Using a Hidden Markov Model Arnt-Børre Salberg and Øivind Due Trier Norwegian Computing Center.
Improvement of Multi-population Genetic Algorithms Convergence Time Maria Angelova, Tania Pencheva
Comparison of Differential Evolution and Genetic Algorithm in the Design of a 2MW Permanent Magnet Wind Generator A.D.Lilla, M.A.Khan, P.Barendse Department.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Fuzzy Genetic Algorithm
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
A WEIGHTED CALIBRATION METHOD OF INTERFEROMETRIC SAR DATA Yongfei Mao Maosheng Xiang Lideng Wei Daojing Li Bingchen Zhang Institute of Electronics, Chinese.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
1 Effect of Spatial Locality on An Evolutionary Algorithm for Multimodal Optimization EvoNum 2010 Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong Department.
STATISTICS AND OPTIMIZATION Dr. Asawer A. Alwasiti.
InSAR Processing and Applications
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Authors: Soamsiri Chantaraskul, Klaus Moessner Source: IET Commun., Vol.4, No.5, 2010, pp Presenter: Ya-Ping Hu Date: 2011/12/23 Implementation.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
IGARSS’ July, Vancouver, Canada Subsidence Monitoring Using Polarimetric Persistent Scatterers Interferometry Victor D. Navarro-Sanchez and Juan.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
1 A genetic algorithm with embedded constraints – An example on the design of robust D-stable IIR filters 潘欣泰 國立高雄大學 資工系.
DISPLACED PHASE CENTER ANTENNA SAR IMAGING BASED ON COMPRESSED SENSING Yueguan Lin 1,2,3, Bingchen Zhang 1,2, Wen Hong 1,2 and Yirong Wu 1,2 1 National.
Estimating standard error using bootstrap
Paper Review for ENGG6140 Memetic Algorithms
Introduction.
Meng Liu,Hong Zhang,Chao Wang, Bo Zhang
Bulgarian Academy of Sciences
Bag-of-Visual-Words Based Feature Extraction
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
School of Computer Science & Engineering
Glenn Fung, Murat Dundar, Bharat Rao and Jinbo Bi
René Vidal and Xiaodong Fan Center for Imaging Science
Model-based Polarimetric Decomposition using PolInSAR Coherence
CE 102 Statics Chapter 1 Introduction.
Introduction.
Intelligent Systems and Soft Computing
Introduction.
Introduction to Instrumentation Engineering
Introduction.
Introduction.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Introduction.
Evolving Logical-Linear Edge Detector with Evolutionary Algorithms
○ Hisashi Shimosaka (Doshisha University)
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
A Gentle introduction Richard P. Simpson
Introduction to Genetic Algorithm and Some Experience Sharing
Artificial Intelligence CIS 342
Multi-Information Based GCPs Selection Method
Introduction.
Presentation transcript:

IGRASS2011 An Interferometric Coherence Optimization Method Based on Genetic Algorithm in PolInSAR Peifeng Ma, Hong Zhang, Chao Wang, Jiehong Chen Center for Earth Observation and Digital Earth Chinese Academy of Sciences hzhang@ceode.ac.cn Vancouver, Canada July 29, 2011

Outline Introduction to coherence optimization Present methods for coherence optimization Cohenrence optimization with genetic algorithm (GA) Experimental results of GA algorithm Conclusions

Introduction of coherence optimization Polarimetric SAR information of the shape, orientation, dielectric properties of scatters Interferometric SAR information of location of scatters Combination of two aspects can be used to estimate important physical parameters, such as forest height, extinction coefficient, and topography.

Introduction of coherence optimization scattering matrix: scattering vector: generalized vector expression for the coherence: The accuracy of height estimation depends on the quality of interferogram, the indicator of which is complex coherence. We are always attempting to search for the best projection vector combination to acquire the highest interferometric coherence.

Present methods Cloude & Papathanassiou algorithm (C&P): Pros: Two-mechanism algorithm: Assuming Cloude & Papathanassiou algorithm (C&P): By constructing a Lagrangian polynomial for the coherence, we can obtain the optimum coherence by solution of two different mechanisms. Pros: 1, optimum solution globally Cons: 1, introduce polarimetric phase which usually happens in the presence of severe temporal decorrelation 2, instability mathematically

Present methods Colin algorithm: One-mechanism algorithm: Assuming Colin algorithm: By calculating the numerical radius of a matrix, a local maximum can be obtained. the numerical radius of a matrix A: Pros: 1, more accurate estimation of phase Cons: 1, difficult to interpret the second and the third projection vectors physically 2, merely a local optimum solution mathematically

Coherence optimization with GA The fundamental concept of GA is dependent on natural selection in the evolutionary process, including inheritance, mutation, selection and crossover. Advantages: more likely converge toward a global optimum no need of linearization of the problem more robust Owing to the merit of capabilities of optimizing globally it is also reasonable to look for the best projection pair using GA to estimate the optimal interferometric coherence

Coherence optimization with GA scattering mechanism definition: Each individual of population has six chromosomes to be developed in single-mechanism: When optimizing the second coherence we must add a constraint: So the last two chromosomes can be represented by the first four as:

Coherence optimization with GA When optimizing the third coherence we must add another constraint: and So the last four chromosomes can be represented by the first two as: where

Coherence optimization with GA Block diagram of coherence optimization using GA: Pre-processing Initialization Genetic operation Output

Optical image from Google Earth and Pauli image Experiment results The data we choose is Chinese X-band airborne PolInSAR data over Sanya area: Optical image from Google Earth and Pauli image

Experiment results Initialization: Population size:50 Terminating generation:100 Crossover probability:0.9 Mutation probability:0.1 the interval of :[-1,1] Precision:0.001 We select one pixel to demonstrate the process of tendency to stability as shown in right. Initialized and evolutional coherence

Experiment results Mean of coherence in different optimization methods (L=9) C&P 0.887 0.776 0.602 GA 0.872 0.777 0.622 Colin 0.854 0.791 0.703 GD 0.646 0.481 Histograms of the optimum coherence The optimum coherence and relative phase

Conclusions Compared with the C&P algorithm, under the control of single-mechanism coherence in GA is more stable without polarimetric phase introduced and hence is more proper to interpret the practical scattering process. Although the optimum coherence in GA is smaller than that in C&P, the latter two coherences are generally larger because it has larger space when searching the last two coherence. Compared with other coherences in single-mechanism, the optimum coherence in GA is larger. Besides, the three projection pairs in GA are absolutely orthogonal and so they can reflect the situation of three orthogonal scattering components in the case of volume scattering.

Acknowledgment This work is supported by National Hi-tech R&D Program of China (Grant No. 2009AA12Z118) and National Natural Science Foundation of China (Grant No. 40971198 and 40701106) East China Electronic Institute is acknowledged for provision of airborne SAR data