Texture Classification Genetic Programming纹理分类遗传编程.pptVIP

Human Invented Algorithms Texture feature extraction algorithms can be grouped as follows* Statistical Geometrical Model based Signal Processing Statistical Methods Local features Autoregressive Galloway – run length matrix Haralick – co-occurrence matrix Unser Sun and Wee Amadasun Dapeng Amalung Local Features Grey level of central pixels Average of grey levels in window Median Standard deviation of grey levels Difference of maximum and minimum grey levels Difference between average grey level in small and large windows Sobel feature Kirsch feature Derivative in x window Derivative in y window Diagonal derivatives Combine features Haralick Features First transform pixels into a co-occurrence matrix then calculate a (large) number of statistical features from the matrix. Geometric Methods Chen’s geometric features First threshold images into binary images of n grey levels Then calculate statistical features of connected areas. Model Based Methods These involve building mathematical models to describe textures. Markov random fields Fractals 1 Fractals 2 Signal Processing Methods These methods involve transforming original images using filters and calculating the energy of the transformed images. Law’s masks Laines – Daubechies wavelets Fourier transform Gabor filters Research Questions How do we use GP to evolve texture feature extraction programs ? - Inputs - Functions - Fitness evaluation Can GP generate human competitive feature extraction programs ? Texture Classification Data Set Definitions Learning set: 13 Brodatz textures used to evolve 78 programs (80 of 64 x 64 images in each). Training set: 15 Vistex textures used to train classifier (32 of 64 x 64 images in each ). Testing set: 15 Vistex textures used to test classifier (64 of 64 x 64 images in each). Feature Space for Two Textures Histograms of Class 1 and Class 2 Learning Set Textures Results RESULTS 2 Industrial inspection problem Classification of Malt Images Our GP features