Single-Cycle Image Recognition Using an Adaptive Granularity Associative Memory Network
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Comparison between analog and digital neural network implementations for range-finding applications
IEEE Transactions on Neural Networks
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Multi-wheel graph neuron: a distributed associative memory for structured P2P networks
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Lightweight and distributed attack detection scheme in mobile ad hoc networks
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
A distributed event detection scheme for wireless sensor networks
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Distributed Multi-Feature Recognition Scheme for Greyscale Images
Neural Processing Letters
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II
A single shot associated memory based classification scheme for WSN
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
| Hi-index | 0.00 |
The hierarchical graph neuron (HGN) implements a single cycle memorization and recall operation through a novel algorithmic design. The HGN is an improvement on the already published original graph neuron (GN) algorithm. In this improved approach, it recognizes incomplete/noisy patterns. It also resolves the crosstalk problem, which is identified in the previous publications, within closely matched patterns. To accomplish this, the HGN links multiple GN networks for filtering noise and crosstalk out of pattern data inputs. Intrinsically, the HGN is a lightweight in-network processing algorithm which does not require expensive floating point computations; hence, it is very suitable for real-time applications and tiny devices such as the wireless sensor networks. This paper describes that the HGN's pattern matching capability and the small response time remain insensitive to the increases in the number of stored patterns. Moreover, the HGN does not require definition of rules or setting of thresholds by the operator to achieve the desired results nor does it require heuristics entailing iterative operations for memorization and recall of patterns.