Electronic speckle interferometry, phase-mapping, and nondestructive testing techniques applied to real-time, thermal loading

A digital phase-mapping method has been developed for application in real-time electronic speckle interferometry studies. Its principles and application to a continuously deforming object are described. An efficient digital image-processing algorithm has been developed that permits quantitative interpretation of the resulting phase maps.     

Neural-network method applied to the stereo image correspondence problem in three-component particle image velocimetry

The successful application of a recurrent neural network of the Hopfield type to the solution of the stereo image-pair reconciliation problem in stereoscopic particle image velocimetry (PIV) in the tracking mode is described. The results of applying the network to both virtual-flow and physical-flow PIV data sets are presented, and the usefulness of this novel approach to PIV stereo image analysis is demonstrated. A partner-particle image-pair density (PPID) parameter is defined as the average number of potential particle image-pair candidates in the search window in the second view corresponding to a single image pair in the first view. A quantitative assessment of the performance of the method is then made from groups of 100 synthetic flow images at various values of the PPID. The successful pairing of complementary image points is shown to vary from 100% at a PPID of 1 and to remain greater than 97% successful for PPID's up to 5. The application of the method to a hydraulic flow is also described, with in-line stereo images presented, and the application of the neural-matching method is demonstrated for a typical data set.     

On the mapping of genotype to phenotype in evolutionary algorithms

Analogies with molecular biology are frequently used to guide the development of artificial evolutionary search. A number of assumptions are made in using such reasoning, chief among these is that evolution in natural systems is an optimal, or at least best available, search mechanism, and that a decoupling of search space from behaviour encourages effective search. In this paper, we explore these assumptions as they relate to evolutionary algorithms, and discuss philosophical foundations from which an effective evolutionary search can be constructed. This framework is used to examine grammatical evolution (GE), a popular search method that draws heavily upon concepts from molecular biology. We identify several properties in GE that are in direct conflict with those that promote effective evolutionary search. The paper concludes with some recommendations for designing representations for effective evolutionary search.     

Just because it works: a response to comments on “On the Mapping of Genotype to Phenotype in Evolutionary Algorithms”

This response examines the context and implications of the comments to "On the Mapping of Genotype to Phenotype in Evolutionary Algorithms" that appears in this journal. The notion of metaphor is first considered and then the general themes of the commentaries addressed. The response subsequently focuses on representation and operators, noting that many of the comments support our basic premise.The main conclusion is that Sterelny's conditions do form a suitable basis for representation and operator design and that the collection of responses form an excellent basis for further discussion and research in evolutionary computation.     

Evaluation of the HUT modified snow emission model over lake ice using airborne passive microwave measurements

The algorithms designed to estimate snow water equivalent (SWE) using passive microwave measurements falter in lake-rich high-latitude environments due to the emission properties of ice covered lakes on low frequency measurements. Microwave emission models have been used to simulate brightness temperatures (Tbs) for snowpack characteristics in terrestrial environments but cannot be applied to snow on lakes because of the differing subsurface emissivities and scattering matrices present in ice. This paper examines the performance of a modified version of the Helsinki University of Technology (HUT) snow emission model that incorporates microwave emission from lake ice and sub-ice water. Inputs to the HUT model include measurements collected over brackish and freshwater lakes north of Inuvik, Northwest Territories, Canada in April 2008, consisting of snowpack (depth, density, and snow water equivalent) and lake ice (thickness and ice type). Coincident airborne radiometer measurements at a resolution of 80 × 100 m were used as ground-truth to evaluate the simulations.The results indicate that subsurface media are simulated best when utilizing a modeled effective grain size and a 1 mm RMS surface roughness at the ice/water interface compared to using measured grain size and a flat Fresnel reflective surface as input. Simulations at 37 GHz (vertical polarization) produce the best results compared to airborne Tbs, with a Root Mean Square Error (RMSE) of 6.2 K and 7.9 K, as well as Mean Bias Errors (MBEs) of −8.4 K and −8.8 K for brackish and freshwater sites respectively. Freshwater simulations at 6.9 and 19 GHz H exhibited low RMSE (10.53 and 6.15 K respectively) and MBE (−5.37 and 8.36 K respectively) but did not accurately simulate Tb variability (R = −0.15 and 0.01 respectively). Over brackish water, 6.9 GHz simulations had poor agreement with airborne Tbs, while 19 GHz V exhibited a low RMSE (6.15 K), MBE (−4.52 K) and improved relative agreement to airborne measurements (R = 0.47). Salinity considerations reduced 6.9 GHz errors substantially, with a drop in RMSE from 51.48 K and 57.18 K for H and V polarizations respectively, to 26.2 K and 31.6 K, although Tb variability was not well simulated. With best results at 37 GHz, HUT simulations exhibit the potential to track Tb evolution, and therefore SWE through the winter season.     

Similarity-based image organization and browsing using multi-resolution self-organizing map

An algorithm is presented in this paper to facilitate the exploration of large image collections based on visual similarities. Starting with an unordered and unannotated set of images, the algorithm first extracts the salient details into feature vectors using both color and gradient information. The feature vectors are then used to train a self-organizing map which maps high-dimensional feature vectors onto a 2D canvas so that images with similar feature vectors are grouped together. When users browse the image collection, an image collage is generated that selects and displays the most pertinent set of images based on which portion of the 2D canvas is currently in view. Flowing from an overview to details is a seamless operation controlled simply by pan and zoom, with representative images selected in a consistent and predictable way. To make organizing larger image collections practical in interactive time, the organization algorithm is designed to run in parallel on graphics processing units. Overall this paper presents an end-to-end solution that facilitates the surfing of image collections in a fresh way.     

Incremental Evolution in ANNs: Neural Nets which Grow

This paper explains the optimisation of neuralnetwork topology using Incremental Evolution;that is, by allowing the network to expand byadding to its structure. This method allows anetwork to grow from a simple to a complexstructure until it is capable of fulfilling itsintended function. The approach is somewhatanalogous to the growth of an embryo or theevolution of a fossil line through time, it istherefore sometimes referred to as anembryology or embryological algorithm. Thepaper begins with a general introduction,comparing this method to other competingtechniques such as The Genetic Algorithm, otherEvolutionary Algorithms and SimulatedAnnealing. A literature survey of previous workis included, followed by an extensive newframework for application of the technique.Finally, examples of applications and a generaldiscussion are presented.