Techniques and potential capabilities of multi-resolutional information (knowledge) processing

A concept of nested hierarchical (multi-resolutional, pyramidal) information (knowledge) processing is introduced for a variety of systems including data and/or knowledge bases, vision, control, and manufacturing systems, industrial automated robots, and (self-programmed) autonomous intelligent machines. A set of practical recommendations is presented using a case study of a multiresolutional object representation. It is demonstrated here that any intelligent module transforms (sometimes, irreversibly) the knowledge it deals with, and this tranformation affects the subsequent computation processes, e.g., those of decision and control. Several types of knowledge transformation are reviewed. Definite conditions are analyzed, satisfaction of which is required for organization and processing of redundant information (knowledge) in the multi-resolutional systems. Providing a definite degree of redundancy is one of these conditions

Optimal Bayesian estimators for image segmentation and surface reconstruction

"May, 1985."Bibliography: p. 16."Advanced Research Projects Agency of the Department of Defense under Office of Naval Research Contract N00014-80-C-0505" "The author was supported by the Army Research Office under contract ARO-DAAG29-84-K-0005."J.L. Marroquin

Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields

This paper introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov Random Field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. Use of fine-grained, data parallel processing techniques yields real-time algorithms for texture synthesis and compression that are substantially faster than the previously known sequential implementations. Although current implementations are on Connection Machines, the methodology presented here enables machine independent scalable algorithms for a number of problems in image processing and analysis. (Also cross-referenced as UMIACS-TR-93-80.

Automatic near real-time flood detection in high resolution X-band synthetic aperture radar satellite data using context-based classification on irregular graphs

This thesis is an outcome of the project “Flood and damage assessment using very high resolution SAR data” (SAR-HQ), which is embedded in the interdisciplinary oriented RIMAX (Risk Management of Extreme Flood Events) programme, funded by the Federal Ministry of Education and Research (BMBF). It comprises the results of three scientific papers on automatic near real-time flood detection in high resolution X-band synthetic aperture radar (SAR) satellite data for operational rapid mapping activities in terms of disaster and crisis-management support. Flood situations seem to become more frequent and destructive in many regions of the world. A rising awareness of the availability of satellite based cartographic information has led to an increase in requests to corresponding mapping services to support civil-protection and relief organizations with disaster-related mapping and analysis activities. Due to the rising number of satellite systems with high revisit frequencies, a strengthened pool of SAR data is available during operational flood mapping activities. This offers the possibility to observe the whole extent of even large-scale flood events and their spatio-temporal evolution, but also calls for computationally efficient and automatic flood detection methods, which should drastically reduce the user input required by an active image interpreter. This thesis provides solutions for the near real-time derivation of detailed flood parameters such as flood extent, flood-related backscatter changes as well as flood classification probabilities from the new generation of high resolution X-band SAR satellite imagery in a completely unsupervised way. These data are, in comparison to images from conventional medium-resolution SAR sensors, characterized by an increased intra-class and decreased inter-class variability due to the reduced mixed pixel phenomenon. This problem is addressed by utilizing multi-contextual models on irregular hierarchical graphs, which consider that semantic image information is less represented in single pixels but in homogeneous image objects and their mutual relation. A hybrid Markov random field (MRF) model is developed, which integrates scale-dependent as well as spatio-temporal contextual information into the classification process by combining hierarchical causal Markov image modeling on automatically generated irregular hierarchical graphs with noncausal Markov modeling related to planar MRFs. This model is initialized in an unsupervised manner by an automatic tile-based thresholding approach, which solves the flood detection problem in large-size SAR data with small a priori class probabilities by statistical parameterization of local bi-modal class-conditional density functions in a time efficient manner. Experiments performed on TerraSAR-X StripMap data of Southwest England and ScanSAR data of north-eastern Namibia during large-scale flooding show the effectiveness of the proposed methods in terms of classification accuracy, computational performance, and transferability. It is further demonstrated that hierarchical causal Markov models such as hierarchical maximum a posteriori (HMAP) and hierarchical marginal posterior mode (HMPM) estimation can be effectively used for modeling the inter-spatial context of X-band SAR data in terms of flood and change detection purposes. Although the HMPM estimator is computationally more demanding than the HMAP estimator, it is found to be more suitable in terms of classification accuracy. Further, it offers the possibility to compute marginal posterior entropy-based confidence maps, which are used for the generation of flood possibility maps that express that the uncertainty in labeling of each image element. The supplementary integration of intra-spatial and, optionally, temporal contextual information into the Markov model results in a reduction of classification errors. It is observed that the application of the hybrid multi-contextual Markov model on irregular graphs is able to enhance classification results in comparison to modeling on regular structures of quadtrees, which is the hierarchical representation of images usually used in MRF-based image analysis. X-band SAR systems are generally not suited for detecting flooding under dense vegetation canopies such as forests due to the low capability of the X-band signal to penetrate into media. Within this thesis a method is proposed for the automatic derivation of flood areas beneath shrubs and grasses from TerraSAR-X data. Furthermore, an approach is developed, which combines high resolution topographic information with multi-scale image segmentation to enhance the mapping accuracy in areas consisting of flooded vegetation and anthropogenic objects as well as to remove non-water look-alike areas

Self-organising maps : statistical analysis, treatment and applications.

This thesis presents some substantial theoretical analyses and optimal treatments of Kohonen's self-organising map (SOM) algorithm, and explores the practical application potential of the algorithm for vector quantisation, pattern classification, and image processing. It consists of two major parts. In the first part, the SOM algorithm is investigated and analysed from a statistical viewpoint. The proof of its universal convergence for any dimensionality is obtained using a novel and extended form of the Central Limit Theorem. Its feature space is shown to be an approximate multivariate Gaussian process, which will eventually converge and form a mapping, which minimises the mean-square distortion between the feature and input spaces. The diminishing effect of the initial states and implicit effects of the learning rate and neighbourhood function on its convergence and ordering are analysed and discussed. Distinct and meaningful definitions, and associated measures, of its ordering are presented in relation to map's fault-tolerance. The SOM algorithm is further enhanced by incorporating a proposed constraint, or Bayesian modification, in order to achieve optimal vector quantisation or pattern classification. The second part of this thesis addresses the task of unsupervised texture-image segmentation by means of SOM networks and model-based descriptions. A brief review of texture analysis in terms of definitions, perceptions, and approaches is given. Markov random field model-based approaches are discussed in detail. Arising from this a hierarchical self-organised segmentation structure, which consists of a local MRF parameter estimator, a SOM network, and a simple voting layer, is proposed and is shown, by theoretical analysis and practical experiment, to achieve a maximum likelihood or maximum a posteriori segmentation. A fast, simple, but efficient boundary relaxation algorithm is proposed as a post-processor to further refine the resulting segmentation. The class number validation problem in a fully unsupervised segmentation is approached by a classical, simple, and on-line minimum mean-square-error method. Experimental results indicate that this method is very efficient for texture segmentation problems. The thesis concludes with some suggestions for further work on SOM neural networks

Unsupervised segmentation of road images. A multicriteria approach

This paper presents a region-based segmentation algorithm which can be applied to various problems since it does not requir e a priori knowledge concerning the kind of processed images . This algorithm, based on a split and merge method, gives reliable results both on homogeneous grey level images and on textured images . First, images are divided into rectangular sectors . The splitting algorithm works independently on each sector, and uses a homogeneity criterion based only on grey levels . The mergin g is then achieved through assigning labels to each region obtained by the splitting step, using extracted feature measurements . We modeled exploited fields (data field and label field) by Markov Random Fields (MRF), the segmentation is then optimall y determined using the Iterated Conditional Modes (ICM) . Input data of the merging step are regions obtained by the splitting step and their corresponding features vector. The originality of this algorithm is that texture coefficients are directly computed from these regions . These regions will be elementary sites for the Markov relaxation process . Thus, a region- based segmentation algorith m using texture and grey level is obtained . Results from various images types are presented .Nous présentons ici un algorithme de segmentation en régions pouvant s'appliquer à des problèmes très variés car il ne tient compte d'aucune information a priori sur le type d'images traitées. Il donne de bons résultats aussi bien sur des images possédant des objets homogènes au sens des niveaux de gris que sur des images possédant des régions texturées. C'est un algorithme de type division-fusion. Lors d'une première étape, l'image est découpée en fenêtres, selon une grille. L'algorithme de division travaille alors indépendamment sur chaque fenêtre, et utilise un critère d'homogénéité basé uniquement sur les niveaux de gris. La texture de chacune des régions ainsi obtenues est alors calculée. A chaque région sera associé un vecteur de caractéristiques comprenant des paramètres de luminance, et des paramètres de texture. Les régions ainsi définies jouent alors le rôle de sites élémentaires pour le processus de fusion. Celui-ci est fondé sur la modélisation des champs exploités (champ d'observations et champ d'étiquettes) par des champs de Markov. Nous montrerons les résultats de segmentation obtenus sur divers types d'images

Modeling, Estimation, and Pattern Analysis of Random Texture on 3-D Surfaces

To recover 3-D structure from a shaded and textural surface image involving textures, neither the Shape-from-shading nor the Shape-from-texture analysis is enough, because both radiance and texture information coexist within the scene surface. A new 3-D texture model is developed by considering the scene image as the superposition of a smooth shaded image and a random texture image. To describe the random part, the orthographical projection is adapted to take care of the non-isotropic distribution function of the intensity due to the slant and tilt of a 3-D textures surface, and the Fractional Differencing Periodic (FDP) model is chosen to describe the random texture, because this model is able to simultaneously represent the coarseness and the pattern of the 3-D texture surface, and enough flexible to synthesize both long-term and short-term correlation structures of random texture. Since the object is described by the model involving several free parameters and the values of these parameters are determined directly from its projected image, it is possible to extract 3-D information and texture pattern directly from the image without any preprocessing. Thus, the cumulative error obtained from each pre-processing can be minimized. For estimating the parameters, a hybrid method which uses both the least square and the maximum likelihood estimates is applied and the estimation of parameters and the synthesis are done in frequency domain. Among the texture pattern features which can be obtained from a single surface image, Fractal scaling parameter plays a major role for classifying and/or segmenting the different texture patterns tilted and slanted due to the 3-dimensional rotation, because of its rotational and scaling invariant properties. Also, since the Fractal scaling factor represents the coarseness of the surface, each texture pattern has its own Fractal scale value, and particularly at the boundary between the different textures, it has relatively higher value to the one within a same texture. Based on these facts, a new classification method and a segmentation scheme for the 3-D rotated texture patterns are develope

Image segmentation for defect detection on veneer surfaces

Machine vision is widely used in scientific areas and non-wood using industries, but the extreme variability of wood has limited its adoption by forest products industries. However, it is now becoming a key factor in further automation of the forest products industry. As a very important part of machine vision, developing image segmentation algorithms that can be used for wood products is an ambitious undertaking. The focus of this research was to adapt existing and develop some new segmentation algorithms which could be used to detect defects on veneer surfaces. Nine algorithms covering three segmentation technique categories were explored. Three existing edge detection algorithms were modified for use on veneer images, and four existing thresholding algorithms were adapted in both global and local versions. Two new region extraction algorithms were developed specifically for defect detection on veneer surfaces. The performances of these nine algorithms were tested and compared under the combinations of two camera resolutions (5-bit and 8-bit), three color spaces (RGB, Lab, and gray-scale), and seven surface features (clear wood, blue stain, loose knot, pitch pocket, pitch streak, tight knot, and wane). Ten sample images for each of seven surface features on Douglas-fir veneer [Pseudotsuga menziesii] were used. Ten measures were proposed for performance evaluation. A multi-factor factorial ANOVA was used in the performance tests and comparisons. The best combinations of camera resolution and color space for each of the algorithms were determined. The 5-bit and 8-bit camera resolutions were not significantly different for the three edge detection and two region extraction algorithms, but the 8-bit camera resolution was better for all but one of the thresholding algorithms. That exception was the global Otsu thresholding algorithm, for which the 5-bit camera resolution was better. The RGB color space was the best for all algorithms. Overall, the two region extraction algorithms were the best. Under the best combination of factors, those two algorithms provided the highest defect detection accuracies of 91% for pitch streak samples and over 95% for loose knot, tight knot, and pitch pocket samples. These results were accomplished while still providing clear wood accuracies of over 95%. The one performance exception was blue stain, for which no satisfactory algorithm was found