David A. Clausi

An analysis of co-occurrence texture statistics as a function of grey level quantization

In this paper, the effect of grey level quantization on the ability of co-occurrence probability statistics to classify natural textures is studied. Generally, as a function of increasing grey levels, many of the statistics demonstrate a decrease in classification ability while a few maintain constant classification accuracy. None of the individual statistics show increasing classification accuracy throughout all grey levels. Correlation analysis is used to rationalize a preferred subset of statistics. The preferred statistics set (contrast, correlation, and entropy) is demonstrated to be an improvement over using single statistics or using the entire set of statistics. If the feature space dimension only allows for a single statistic, one of contrast, dissimilarity, inverse difference normalized, or inverse difference moment normalized, is recommended. Testing that compares (using all orientations separately), the average of all orientations and look direction averaging, when determining the co-occurrence features, indicates that the look direction or all orientations is preferred. The Fisher linear discriminant method is used for all classification testing. The Fisher criterion is used as a separability index to provide insight into the classification results. Testing is performed on Brodatz imagery as well as two separate SAR sea-ice data sets.

Design-based texture feature fusion using Gabor filters and co-occurrence probabilities

A design-based method to fuse Gabor filter and grey level co-occurrence probability (GLCP) features for improved texture recognition is presented. The fused feature set utilizes both the Gabor filters capability of accurately capturing lower and mid-frequency texture information and the GLCPs capability in texture information relevant to higher frequency components. Evaluation methods include comparing feature space separability and comparing image segmentation classification rates. The fused feature sets are demonstrated to produce higher feature space separations, as well as higher segmentation accuracies relative to the individual feature sets. Fused feature sets also outperform individual feature sets for noisy images, across different noise magnitudes. The curse of dimensionality is demonstrated not to affect segmentation using the proposed the 48-dimensional fused feature set. Gabor magnitude responses produce higher segmentation accuracies than linearly normalized Gabor magnitude responses. Feature reduction using principal component analysis is acceptable for maintaining the segmentation performance, but feature reduction using the feature contrast method dramatically reduced the segmentation accuracy. Overall, the designed fused feature set is advocated as a means for improving texture segmentation performance.

Unsupervised segmentation of synthetic aperture Radar sea ice imagery using a novel Markov random field model

Environmental and sensor challenges pose difficulties for the development of computer-assisted algorithms to segment synthetic aperture radar (SAR) sea ice imagery. In this research, in support of operational activities at the Canadian Ice Service, images containing visually separable classes of either ice and water or multiple ice classes are segmented. This work uses image intensity to discriminate ice from water and uses texture features to identify distinct ice types. In order to seamlessly combine image spatial relationships with various image features, a novel Bayesian segmentation approach is developed and applied. This new approach uses a function-based parameter to weight the two components in a Markov random field (MRF) model. The devised model allows for automatic estimation of MRF model parameters to produce accurate unsupervised segmentation results. Experiments demonstrate that the proposed algorithm is able to successfully segment various SAR sea ice images and achieve improvement over existing published methods including the standard MRF-based method, finite Gamma mixture model, and K-means clustering.

Intra-retinal layer segmentation in optical coherence tomography images

Retinal layer thickness, evaluated as a function of spatial position from optical coherence tomography (OCT) images is an important diagnostics marker for many retinal diseases. However, due to factors such as speckle noise, low image contrast, irregularly shaped morphological features such as retinal detachments, macular holes, and drusen, accurate segmentation of individual retinal layers is difficult. To address this issue, a computer method for retinal layer segmentation from OCT images is presented. An efficient two-step kernel-based optimization scheme is employed to first identify the approximate locations of the individual layers, which are then refined to obtain accurate segmentation results for the individual layers. The performance of the algorithm was tested on a set of retinal images acquired in-vivo from healthy and diseased rodent models with a high speed, high resolution OCT system. Experimental results show that the proposed approach provides accurate segmentation for OCT images affected by speckle noise, even in sub-optimal conditions of low image contrast and presence of irregularly shaped structural features in the OCT images.

IRGS: Image Segmentation Using Edge Penalties and Region Growing

This paper proposes an image segmentation method named iterative region growing using semantics (IRGS), which is characterized by two aspects. First, it uses graduated increased edge penalty (GIEP) functions within the traditional Markov random field (MRF) context model in formulating the objective functions. Second, IRGS uses a region growing technique in searching for the solutions to these objective functions. The proposed IRGS is an improvement over traditional MRF based approaches in that the edge strength information is utilized and a more stable estimation of model parameters is achieved. Moreover, the IRGS method provides the possibility of building a hierarchical representation of the image content, and allows various region features and even domain knowledge to be incorporated in the segmentation process. The algorithm has been successfully tested on several artificial images and synthetic aperture radar (SAR) images.

ARRSI: Automatic Registration of Remote-Sensing Images

This paper presents the Automatic Registration of Remote-Sensing Images (ARRSI); an automatic registration system built to register satellite and aerial remotely sensed images. The system is designed specifically to address the problems associated with the registration of remotely sensed images obtained at different times and/or from different sensors. The ARRSI system is capable of handling remotely sensed images geometrically distorted by various transformations such as translation, rotation, and shear. Global and local contrast issues associated with remotely sensed images are addressed in ARRSI using control-point detection and matching processes based on a phase-congruency model. Intensity-difference issues associated with multimodal registration of remotely sensed images are addressed in ARRSI through the use of features that are invariant to intensity mappings during the control-point matching process. An adaptive control-point matching scheme is employed in ARRSI to reduce the performance issues associated with the registration of large remotely sensed images. Finally, a variation on the Random Sample and Consensus algorithm called Maximum Distance Sample Consensus is introduced in ARRSI to improve the accuracy of the transformation model between two remotely sensed images while minimizing computational overhead. The ARRSI system has been tested using various satellite and aerial remotely sensed images and evaluated based on its accuracy and computational performance. The results indicate that the registration accuracy of ARRSI is comparable to that produced by a human expert and improvement over the baseline and multimodal sum of squared differences registration techniques tested

Comparison and fusion of co‐occurrence, Gabor and MRF texture features for classification of SAR sea‐ice imagery

Abstract Image texture interpretation is an important aspect of the computer‐assisted discrimination of Synthetic Aperture Radar (SAR) sea‐ice imagery. Co‐occurrence probabilities are the most common approach used to solve this problem. However, other texture feature extraction methods exist that have not been fully studied for their ability to interpret SAR sea‐ice imagery. Gabor filters and Markov random fields (MRF) are two such methods considered here. Classification and significance level testing shows that co‐occurrence probabilities classify the data with the highest accuracy, with Gaborfilters a close second. MRF results significantly lag Gabor and co‐occurrence results. However, the MRF features are uncorrelated with respect to co‐occurrence and Gabor features. The fused co‐occurrence/MRF feature set achieves higher performance. In addition, it is demonstrated that uniform quantization is a preferred quantization method compared to histogram equalization.

Gaussian MRF rotation-invariant features for image classification

Features based on Markov random field (MRF) models are sensitive to texture rotation. This paper develops an anisotropic circular Gaussian MRF (ACGMRF) model for retrieving rotation-invariant texture features. To overcome the singularity problem of the least squares estimate method, an approximate least squares estimate method is designed and implemented. Rotation-invariant features are obtained from the ACGMRF model parameters using the discrete Fourier transform. The ACGMRF model is demonstrated to be a statistical improvement over three published methods. The three methods include a Laplacian pyramid, an isotropic circular GMRF (ICGMRF), and gray level cooccurrence probability features.

Comparing cooccurrence probabilities and Markov random fields for texture analysis of SAR sea ice imagery

This paper compares the discrimination ability of two texture analysis methods: Markov random fields (MRFs) and gray-level cooccurrence probabilities (GLCPs). There exists limited published research comparing different texture methods, especially with regard to segmenting remotely sensed imagery. The role of window size in texture feature consistency and separability as well as the role in handling of multiple textures within a window are investigated. Necessary testing is performed on samples of synthetic (MRF generated), Brodatz, and synthetic aperture radar (SAR) sea ice imagery. GLCPs are demonstrated to have improved discrimination ability relative to MRFs with decreasing window size, which is important when performing image segmentation. On the other hand, GLCPs are more sensitive to texture boundary confusion than MRFs given their respective segmentation procedures.

Unsupervised Polarimetric SAR Image Segmentation and Classification Using Region Growing With Edge Penalty

A region-based unsupervised segmentation and classification algorithm for polarimetric synthetic aperture radar (SAR) imagery that incorporates region growing and a Markov random field edge strength model is designed and implemented. This algorithm is an extension of the successful Iterative Region Growing with Semantics (IRGS) segmentation and classification algorithm, which was designed for amplitude only SAR imagery, to polarimetric data. Polarimetric IRGS (PolarIRGS) extends IRGS by incorporating a polarimetric feature model based on the Wishart distribution and modifying key steps such as initialization, edge strength computation, and the region growing criterion. Like IRGS, PolarIRGS oversegments an image into regions and employs iterative region growing to reduce the size of the solution search space. The incorporation of an edge penalty in the spatial context model improves segmentation performance by preserving segment boundaries that traditional spatial models will smooth over. Evaluation of PolarIRGS with Flevoland fully polarimetric data shows that it improves upon two other recently published techniques in terms of classification accuracy.