High Resolution Image Reconstruction of Polymer Composite Materials Using Neural Networks

A neural network is an artificial intelligence technique inspired by a simplistic model of biological neurons and their connectivity. A neural network has the ability to learn an input-output function without a priori knowledge of the relationship between them. Typically a neural network consists of layers of neurons, whereby each neuron in a given layer is fully connected to neurons in adjacent layers. Figure 1 shows such an arrangement with three layers, called the input, hidden and output layers. The connection strengths between neurons, often referred to as weights, are modified by a training phase. The training phase used here utilizes an error back propagation algorithm [1]. During training the neural network is presented with input which propagates through the network producing a corresponding output. A comparison of the actual output with the desired or target output generates an error which is used to adjust the neural network’s weights according to an error gradient descent technique [2]. This procedure is repeated for many different input and desired output pairs allowing the neural network to learn the input-output function

Construction of energy landscape for discrete Hopfield associative memory with guaranteed error correction capability

An energy function-based auto-associative memory design method to store a given set of unipolar binary memory vectors as attractive fixed points of an asynchronous discrete Hopfield network is presented. The discrete quadratic energy function whose local minima correspond to the attractive fixed points of the network is constructed via solving a system of linear inequalities derived from the strict local minimality conditions. In spite of its computational complexity, the method performs better than the conventional design methods, also ensuring the attractiveness for almost all memory sets whose cardinality is less than or equal to the dimension of its elements, as verified by computer simulations

A new design method for the complex-valued multistate Hopfield associative memory

A method to store each element of an integral memory set M subset of {1,2,...,K}(n) as a fixed point into a complex-valued multistate Hopfield network is introduced. The method employs a set of inequalities to render each memory pattern as a strict local minimum of a quadratic energy landscape. Based on the solution of this system,. it gives a recurrent network of n multistate neurons with complex and. symmetric synaptic weights, which operates on the finite state space {1, 2,...,K}(n) to minimize this quadratic functional. Maximum number of integral vectors that can be embedded into the energy landscape of the network. by this method is investigated by computer experiments. This paper also enlightens the performance of the proposed method in reconstructing noisy gray-scale images

An energy function-based design method for discrete Hopfield associative memory with attractive fixed points

An energy function-based autoassociative memory design method to store a given set of unipolar binary memory vectors as attractive fixed points of an asynchronous discrete Hopfield network (DHN) is presented. The discrete quadratic energy function whose local minima correspond to the attractive fixed points of the network is constructed via solving a system of linear inequalities derived from the strict local minimality conditions. The weights and the thresholds are then calculated using this energy function. If the inequality system is infeasible, we conclude that no such asynchronous DHN exists, and extend the method to design a discrete piecewise quadratic energy function, which can be minimized by a generalized version of the conventional DHN, also proposed herein. In spite of its computational complexity, computer simulations indicate that the original method performs better than the conventional design methods in the sense that the memory can store, and provide the attractiveness for almost all memory sets whose cardinality is less than or equal to the dimension of its elements. The overall method, together with its extension, guarantees the storage of an arbitrary collection of memory vectors, which are mutually at least two Hamming distances away from each other, in the resulting network

Infant Brain Extraction in T1-Weighted MR Images Using BET and Refinement Using LCDG and MGRF Models.

In this paper, we propose a novel framework for the automated extraction of the brain from T1-weighted MR images. The proposed approach is primarily based on the integration of a stochastic model [a two-level Markov-Gibbs random field (MGRF)] that serves to learn the visual appearance of the brain texture, and a geometric model (the brain isosurfaces) that preserves the brain geometry during the extraction process. The proposed framework consists of three main steps: 1) Following bias correction of the brain, a new three-dimensional (3-D) MGRF having a 26-pairwise interaction model is applied to enhance the homogeneity of MR images and preserve the 3-D edges between different brain tissues. 2) The nonbrain tissue found in the MR images is initially removed using the brain extraction tool (BET), and then the brain is parceled to nested isosurfaces using a fast marching level set method. 3) Finally, a classification step is applied in order to accurately remove the remaining parts of the skull without distorting the brain geometry. The classification of each voxel found on the isosurfaces is made based on the first- and second-order visual appearance features. The first-order visual appearance is estimated using a linear combination of discrete Gaussians (LCDG) to model the intensity distribution of the brain signals. The second-order visual appearance is constructed using an MGRF model with analytically estimated parameters. The fusion of the LCDG and MGRF, along with their analytical estimation, allows the approach to be fast and accurate for use in clinical applications. The proposed approach was tested on in vivo data using 300 infant 3-D MR brain scans, which were qualitatively validated by an MR expert. In addition, it was quantitatively validated using 30 datasets based on three metrics: the Dice coefficient, the 95% modified Hausdorff distance, and absolute brain volume difference. Results showed the capability of the proposed approach, outperforming four widely used BETs: BET, BET2, brain surface extractor, and infant brain extraction and analysis toolbox. Experiments conducted also proved that the proposed framework can be generalized to adult brain extraction as well