1 |
Vibration design by means of structural modificationAkbar, Shahzad January 1998 (has links)
No description available.
|
2 |
Using Local Invariant in Occluded Object Recognition by Hopfield Neural NetworkTzeng, Chih-Hung 11 July 2003 (has links)
In our research, we proposed a novel invariant in 2-D image contour recognition based on Hopfield-Tank neural network. At first, we searched the feature points, the position of feature points where are included high curvature and corner on the contour. We used polygonal approximation to describe the image contour. There have two patterns we set, one is model pattern another is test pattern. The Hopfield-Tank network was employed to perform feature matching. In our results show that we can overcome the test pattern which consists of translation, rotation, scaling transformation and no matter single or occlusion pattern.
|
3 |
A Methodology for the Integration of Hopfield Network and Genetic Algorithm Schemes for Graph Matching ProblemsHuang, Chin-Chung 14 February 2005 (has links)
Object recognition is of much interest in recent industrial automation. Although a variety of approaches have been proposed to tackle the recognition problem, some cases such as overlapping objects, articulated objects, and low-resolution images, are still not easy for the existing schemes. Coping with these more complex images has remained a challenging task in the field.
This dissertation, aiming to recognize objects from such images, proposes a new integrated method. For images with overlapping or articulated objects, graph matching methods are often used, seeing them as solving a combinatorial optimization problem. Both Hopfield network and the genetic algorithm are decent tools for the combinatorial optimization problems. Unfortunately, they both have intolerable drawbacks. The Hopfield network is sensitive to its initial state and stops at a local minimum if it is not properly given. The GA, on the other hand, only finds a near-global solution, and it is time-consuming for large-scale tasks. This dissertation proposes to combine these two methods, while eliminating their bad and keeping their good, to solve some complex recognition problems. Before the integration, some arrangements are required. For instance, specialized 2-D GA operators are used to accelerate the convergence. Also, the ¡§seeds¡¨ of the solution of the GA is extracted as the initial state of the Hopfield network. By doing so the efficiency of the system is greatly improved. Additionally, several fine-tuning post matching algorithms are also needed.
In order to solve the homomorphic graph matching problem, i.e., multiple occurrences in a single scene image, the Hopfield network has to repeat itself until the stopping criteria are met. The method can not only be used to obtain the homomorphic mapping between the model and the scene graphs, but it can also be applied to articulated object recognition. Here we do not need to know in advance if the model is really an articulated object. The proposed method has been applied to measure some kinematic properties, such as the positions of the joints, relative linear and angular displacements, of some simple machines. The subject about articulated object recognition has rarely been mentioned in the literature, particularly under affine transformations.
Another unique application of the proposed method is also included in the dissertation. It is about using low-resolution images, where the contour of an object is easily affected by noise. To increase the performance, we use the hexagonal grid in dealing with such low-resolution images. A hexagonal FFT simulation is first presented to pre-process the hexagonal images for recognition. A feature vector matching scheme and a similarity matching scheme are also devised to recognize simpler images with only isolated objects. For complex low-resolution images with occluded objects, the integrated method has to be tailored to go with the hexagonal grid. The low-resolution, hexagonal version of the integrated scheme has also been shown to be suitable and robust.
|
4 |
An Annealed Neural Network Approach to Solving the Mobile Agent Planning ProblemChiou, Yan-cheng 11 December 2009 (has links)
Annealed neural network combines the characteristics of both simulation annealing and Hopfield-Tank neural network, which are high quality solutions and fast convergence. Mobile agent planning is an important technique of information retrieval systems to provide the minimum cost of the location-aware services in mobile computing environment. By taking the time constraints of effective resources into account and the mobile agent to explore the cost optimization, we modify annealing neural network to design a new energy function and control the annealing temperature in order to deal with the dynamic temporal feature of computing environments. We not only consider the server performance and network latency when scheduling mobile agents, but also investigate the location-based constraints, such as the home site of routing sequence of the traveling mobile agent must be the start and end node. To guarantee the convergent stable state and existence of the valid solution, the energy function is reformulated into a Lyapunov function which is combined with the annealing temperature to form an activation function. The connection weights between the neurons and the activation function of state variables in the dynamic network are devised in searching for the valid solutions. Simulation of different coefficients assess the proposed model and algorithm. Furthermore, Taguchi method is used to obtain the optimal combination factors of annealing neural network. The results show that this research presents the feature of both simulated annealing and Hopfield neural network by providing fast convergence and highly quality. In addition with a larger number of sites, the experimental results demonstrate the benefits of the annealed neural network. This innovation would be applicable to improve the effectiveness of solving optimization problems.
|
5 |
O problema de Lurie e aplicações às redes neurais / The problem of Lurie and applications to neural networksPinheiro, Rafael Fernandes 12 March 2015 (has links)
Neste trabalho apresentamos um assunto que tem contribuído em diversas áreas, o conhecido Problemas de Lurie. Para exemplificar sua aplicabilidade estudamos a Rede Neural de Hopfield e a relacionamos com o problema. Alguns teoremas são apresentados e um dos resultados do Problema de Lurie é aplicado ao modelo de Hopfield. / In the present work we show some properties of the so called Luries type equation. We treat particularly the stability conditions problem, and show how this theory is applied in a Hopfield neural network.
|
6 |
O problema de Lurie e aplicações às redes neurais / The problem of Lurie and applications to neural networksRafael Fernandes Pinheiro 12 March 2015 (has links)
Neste trabalho apresentamos um assunto que tem contribuído em diversas áreas, o conhecido Problemas de Lurie. Para exemplificar sua aplicabilidade estudamos a Rede Neural de Hopfield e a relacionamos com o problema. Alguns teoremas são apresentados e um dos resultados do Problema de Lurie é aplicado ao modelo de Hopfield. / In the present work we show some properties of the so called Luries type equation. We treat particularly the stability conditions problem, and show how this theory is applied in a Hopfield neural network.
|
7 |
Low complexity turbo equalization using superstructuresMyburgh, Hermanus Carel January 2013 (has links)
In a wireless communication system the transmitted information is subjected to a number of impairments,
among which inter-symbol interference (ISI), thermal noise and fading are the most prevalent.
Owing to the dispersive nature of the communication channel, ISI results from the arrival of multiple
delayed copies of the transmitted signal at the receiver. Thermal noise is caused by the random
fluctuation on electrons in the receiver hardware, while fading is the result of constructive and destructive
interference, as well as absorption during transmission. To protect the source information,
error-correction coding (ECC) is performed in the transmitter, after which the coded information is
interleaved in order to separate the information to be transmitted temporally.
Turbo equalization (TE) is a technique whereby equalization (to correct ISI) and decoding (to correct
errors) are iteratively performed by iteratively exchanging extrinsic information formed by optimal
posterior probabilistic information produced by each algorithm. The extrinsic information determined
from the decoder output is used as prior information by the equalizer, and vice versa, allowing for
the bit-error rate (BER) performance to be improved with each iteration. Turbo equalization achieves
excellent BER performance, but its computational complexity grows exponentially with an increase in
channel memory as well as with encoder memory, and can therefore not be used in dispersive channels
where the channel memory is large. A number of low complexity equalizers have consequently been developed to replace the maximum a posteriori probability (MAP) equalizer in order to reduce the
complexity. Some of the resulting low complexity turbo equalizers achieve performance comparable
to that of a conventional turbo equalizer that uses a MAP equalizer. In other cases the low complexity
turbo equalizers perform much worse than the corresponding conventional turbo equalizer (CTE)
because of suboptimal equalization and the inability of the low complexity equalizers to utilize the
extrinsic information effectively as prior information.
In this thesis the author develops two novel iterative low complexity turbo equalizers. The turbo equalization
problem is modeled on superstructures, where, in the context of this thesis, a superstructure
performs the task of the equalizer and the decoder. The resulting low complexity turbo equalizers
process all the available information as a whole, so there is no exchange of extrinsic information
between different subunits. The first is modeled on a dynamic Bayesian network (DBN) modeling
the Turbo Equalization problem as a quasi-directed acyclic graph, by allowing a dominant connection
between the observed variables and their corresponding hidden variables, as well as weak connections
between the observed variables and past and future hidden variables. The resulting turbo equalizer is
named the dynamic Bayesian network turbo equalizer (DBN-TE). The second low complexity turbo
equalizer developed in this thesis is modeled on a Hopfield neural network, and is named the Hopfield
neural network turbo equalizer (HNN-TE). The HNN-TE is an amalgamation of the HNN maximum
likelihood sequence estimation (MLSE) equalizer, developed previously by this author, and an HNN
MLSE decoder derived from a single codeword HNN decoder. Both the low complexity turbo equalizers
developed in this thesis are able to jointly and iteratively equalize and decode coded, randomly interleaved information transmitted through highly dispersive multipath channels. The performance of both these low complexity turbo equalizers is comparable to that of the conventional
turbo equalizer while their computational complexities are superior for channels with long
memory. Their performance is also comparable to that of other low complexity turbo equalizers, but
their computational complexities are worse. The computational complexity of both the DBN-TE and
the HNN-TE is approximately quadratic at best (and cubic at worst) in the transmitted data block
length, exponential in the encoder constraint length and approximately independent of the channel
memory length. The approximate quadratic complexity of both the DBN-TE and the HNN-TE is
mostly due to interleaver mitigation, requiring matrix multiplication, where the matrices have dimensions
equal to the data block length, without which turbo equalization using superstructures is
impossible for systems employing random interleavers. / Thesis (PhD)--University of Pretoria, 2013. / gm2013 / Electrical, Electronic and Computer Engineering / unrestricted
|
8 |
Návrh síťového prvku pomocí neuronové sítě / Network element project by means of neural networkPokorný, Petr January 2008 (has links)
The diploma thesis deal with a priority network switch whose model was made in programming environment Matlab - Simulink. Problem of optimal switching is solved by Hopfield’s artificial neural network. Produce of the diploma thesis is a model of packet switch and time-severity comparison of optimalization problem solved with or without artificial neural network. The thesis was developed in research project MSM 0021630529 Intelligent Systems in Automation.
|
9 |
Implementation of Hopfield Neural Network Using Double Gate MOSFETBorundiya, Amit Parasmal 25 April 2008 (has links)
No description available.
|
10 |
Síťový prvek s pokročilým řízením / Network Element with Advanced ControlZedníček, Petr January 2010 (has links)
The diploma thesis deal with finding and testing neural networks, whose characteristics and parameters suitable for the active management of network element. Solves optimization task priority switching of data units from input to output. Work is focused largely on the use of Hopfield and Kohonen networks and their optimization. Result of this work are two models. The first theory is solved in Matlab, where each comparing the theoretical results of neural networks. The second model is a realistic model of the active element designed in Simulink
|
Page generated in 0.0987 seconds