Efficient matching algorithm by a hybrid Hopfield network for object recognition

1992 ◽  
Author(s):  
Jung H. Kim ◽  
Sung H. Yoon ◽  
Yong H. Kim ◽  
Evi H. Park ◽  
Celestine A. Ntuen ◽  
...  
Keyword(s):  
Object Recognition ◽  
Hopfield Network ◽  
Matching Algorithm ◽  
Efficient Matching

A Pattern Matching Algorithm for Double-Type Characters

2014 ◽  
Vol 571-572 ◽  
pp. 461-464
Author(s):  
Hai Yan Zhou
Keyword(s):  
Pattern Matching ◽  
Chinese Characters ◽  
Cross Link ◽  
Data Link ◽  
Matching Algorithm ◽  
Order Of Magnitude ◽  
Link Data ◽  
Efficient Matching ◽  
Link Table ◽  
Double Cross

A fast and efficient matching algorithm is proposed to address the issue on multi-pattern matching of double-byte string, for example Chinese characters, which has major difference with single-byte string matching algorithm. The algorithm capitalizes on double cross link data list and two finite prefix automata to match a double-byte character, so as to solve the storage expansion problems in which the double-byte cross data link table results. The method requires less storage in comparison with double-byte cross data link table, and has the same order of magnitude in efficiency as a single-byte cross-link table approach.

A Multi-Gradation Stereo Matching Method Based on Edge Feature Points

2013 ◽  
Vol 748 ◽  
pp. 624-628
Author(s):  
Zhu Lin Li
Keyword(s):  
Object Recognition ◽  
Stereo Matching ◽  
Three Dimensional ◽  
Feature Points ◽  
Image Pair ◽  
Three Dimensional Reconstruction ◽  
Matching Method ◽  
Matching Algorithm ◽  
Dimensional Reconstruction ◽  
Edge Feature

A gradation stereo matching algorithm based on edge feature points was proposed. Its basic idea is: firstly edge feature points of image pair were extracted; then, gradient invariability and singular eigenvalue invariability were analyzed, two-grade stereo matching method was build, foundation matrix was solved further, and three-grade stereo matching algorithm was finished by foundation matrix guidance. The result indicates that the algorithm can improve matching precision, from 58.3% to 73.2%, it is simple and utility, and it is important for object recognition, tracking, and three-dimensional reconstruction.

scholarly journals An efficient matching algorithm applied in statistical physics

1994 ◽  
Vol 52 (2) ◽  
pp. 139-153 ◽  
Author(s):  
J. Bendisch ◽  
U. Derigs ◽  
A. Metz
Keyword(s):  
Statistical Physics ◽  
Matching Algorithm ◽  
Efficient Matching

scholarly journals Design and Implementation of Locations Matching Algorithm for Multi-Object Recognition and Localization

2018 ◽  
Vol 14 (1) ◽  
pp. 10-21
Author(s):  
Abdulmuttalib Rashid ◽  
Wael Zayer ◽  
Mofeed Rashid
Keyword(s):  
Object Recognition ◽  
The Other ◽  
Long Distance ◽  
Matching Algorithm ◽  
Design And Implementation ◽  
Look Up Table ◽  
Ir Sensor ◽  
Ir Sensors ◽  
Different Color

A new algorithm for multi-object recognition and localization is introduced in this paper. This algorithm deals with objects which have different reflectivity factors and distinguish color with respect to the other objects. Two beacons scan multi-color objects using long distance IR sensors to estimate their absolute locations. These two beacon nodes are placed at two corners of the environment. The recognition of these objects is estimated by matching the locations of each object with respect to the two beacons. A look-up table contains the distances information about different color objects is used to convert the reading of the long distance IR sensor from voltage to distance units. The locations of invisible objects are computed by using absolute locations of invisible objects method. The performance of introduced algorithm is tested with several experimental scenarios that implemented on color objects.

Sign in / Sign up

Export Citation Format

Share Document