Flexible Object Recognition: A New Approach toward Increasing Noise Tolerance in Contour Pattern Matching

Author(s):  
Chao-Yi Huang ◽  
Jong-Chen Chen
2009 ◽  
Vol 19 (01) ◽  
pp. 25-42 ◽  
Author(s):  
MASHUD HYDER ◽  
MD. MONIRUL ISLAM ◽  
M. A. H. AKHAND ◽  
KAZUYUKI MURASE

This paper presents a new approach, known as symmetry axis based feature extraction and recognition (SAFER), for recognizing objects under translation, rotation and scaling. Unlike most previous invariant object recognition (IOR) systems, SAFER puts emphasis on both simplicity and accuracy of the recognition system. To achieve simplicity, it uses simple formulae for extracting invariant features from an object. The scheme used in feature extraction is based on the axis of symmetry and angles of concentric circles drawn around the object. SAFER divides the extracted features into a number of groups based on their similarity. To improve the recognition performance, SAFER uses a number of neural networks (NNs) instead of single NN are used for training and recognition of extracted features. The new approach, SAFER, has been tested on two of real world problems i.e., English characters with two different fonts and images of different shapes. The experimental results show that SAFER can produce good recognition performance in comparison with other algorithms.


Author(s):  
Pradeep Kumar

This chapter summarize and concludes the issues and challenges elaborated in different chapters using machine learning approaches presented by various authors. It identifies the importance of supervised and unsupervised learning algorithms establishing classification, prediction, clustering, security policies along with object recognition and pattern matching structures. A systematic position for future research and practice is also described in detail. This book presents the capabilities of machine learning methods and ideas on how these methods could be used to solve real-world problems related to health, social and engineering applications.


Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 496 ◽  
Author(s):  
Kamil Židek ◽  
Peter Lazorík ◽  
Ján Piteľ ◽  
Alexander Hošovský

Small series production with a high level of variability is not suitable for full automation. So, a manual assembly process must be used, which can be improved by cooperative robots and assisted by augmented reality devices. The assisted assembly process needs reliable object recognition implementation. Currently used technologies with markers do not work reliably with objects without distinctive texture, for example, screws, nuts, and washers (single colored parts). The methodology presented in the paper introduces a new approach to object detection using deep learning networks trained remotely by 3D virtual models. Remote web application generates training input datasets from virtual 3D models. This new approach was evaluated by two different neural network models (Faster RCNN Inception v2 with SSD, MobileNet V2 with SSD). The main advantage of this approach is the very fast preparation of the 2D sample training dataset from virtual 3D models. The whole process can run in Cloud. The experiments were conducted with standard parts (nuts, screws, washers) and the recognition precision achieved was comparable with training by real samples. The learned models were tested by two different embedded devices with an Android operating system: Virtual Reality (VR) glasses, Cardboard (Samsung S7), and Augmented Reality (AR) smart glasses (Epson Moverio M350). The recognition processing delays of the learned models running in embedded devices based on an ARM processor and standard x86 processing unit were also tested for performance comparison.


2005 ◽  
Vol 16 (1) ◽  
pp. 35-74 ◽  
Author(s):  
PER GUSTAFSSON ◽  
KONSTANTINOS SAGONAS

Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an approach to extend pattern matching to terms without (much of a) structure such as binaries which is the kind of data format that network applications typically manipulate. After introducing the binary datatype and a notation for matching binary data against patterns, we present an algorithm that constructs a decision tree automaton from a set of binary patterns. We then show how the pattern matching using this tree automaton can be made adaptive, how redundant tests can be avoided, and how we can further reduce the size of the resulting automaton by taking interferences between patterns into account. Since the size of the tree automaton is exponential in the worst case, we also present an alternative new approach to compiling binary pattern matching which is conservative in space and analyze its complexity properties. The effectiveness of our techniques is evaluated using standard packet filter benchmarks and on implementations of network protocols taken from actual telecom applications.


Sign in / Sign up

Export Citation Format

Share Document