11922333
Parallel Matching of 3D Articulated Object Recognition
In dealing with large volume image data, sequential methods usually are too slow and unsatisfactory. This paper introduces a new system employing parallel matching in high-level recognition of 3D articulated objects. A new structural strategy using linear combination and parallel graphic matching techniques is presented for 3D polyhedral objects representable by 2D line-drawings. It solves one of the basic concerns in diffusion tomography complexities, i.e. patterns can be reconstructed through fewer projections, and 3D objects can be recognized by a few learning sample views. It also improves some of the current methods while overcoming their drawbacks. Furthermore, it can distinguish very similar objects and is more accurate than other methods in the literature. An online webpage system for understanding and recognizing 3D objects is also illustrated.
16442037
Handwritten Bank Check Recognition Of Courtesy Amounts
In spite of rapid evolution of electronic techniques, a number of large-scale applications continue to rely on the use of paper as the dominant medium. This is especially true for processing of bank checks. This paper examines the issue of reading the numerical amount field. In the case of checks, the segmentation of unconstrained strings into individual digits is a challenging task because of connected and overlapping digits, broken digits, and digits that are physically connected to pieces of strokes from neighboring digits. The proposed architecture involves four stages: segmentation of the string into individual digits, normalization, recognition of each character using a neural network classifier, and syntactic verification. Overall, this paper highlights the importance of employing a hybrid architecture that incorporates multiple approaches to provide high recognition rates.
207116582
A Thinning Algorithm Based on the Force Between Charged Particles
A new thinning algorithm based on the well known concept of the force of attraction or repulsion between charged particles is presented. This algorithm generates connected skeletons which preserve the shape and end-points of the original patterns. Its performance is experimentally compared with four other known algorithms published in the literature. For the sake of comparison, a reasoned set of test data is introduced. The results of our comparison reveal that the proposed CPM (Charge Particle Method) algorithm is almost as fast as the fastest of those compared. For thin images obtainable from low resolution scanners or coarse scanned images, the CPM algorithm is the fastest.
2857808
A knowledge-based segmentation algorithm for enhanced recognition of handwritten courtesy amounts
Abstract A knowledge-based segmentation algorithm to enhance recognition of courtesy amounts on bank checks is proposed in this paper. This algorithm uses multiple contextual cues to enhance segmentation and recognition. The system described extracts context from the handwritten numerals and uses a syntax parser based on a deterministic finite automaton to provide adequate feedback to enhance recognition. Further feedback is provided by a simple legal amount decoder that determines word count and recognizes several key words (e.g. thousand and hundred). This provides an additional semantic constraint on the dollar section. The segmentation analysis module presented is capable of handling a number of commonly used styles for courtesy amount representation. Both handwritten and machine written courtesy and legal amounts were utilized to test the efficacy of the preprocessor for the check recognition system described in this paper. The substitution error was reduced by 30–40% depending on the input check mix.
31996759
Analysis and Design of Parallel Thinning Algorithms - A Generic Approach
In this paper, a generic approach for the analysis and design of parallel thinning algorithms is presented. The procedures for designing 4-subcycle/iteration, 2-subcycle/iteration, and 1-subcycle/iteration thinning algorithms are developed. The experimental results show that these thinning algorithms designed by proposed approach preserve image connectivity, produce thinner results, and obtain faster speed than many existing key thinning algorithms. As an example, a 1-subcycle/iteration algorithm and its experimental results were illustrated, which is in general about two times faster than others in the literature.
38659056
Intelligent Pattern Recognition and Applications
15078369
Self-organising impact boundaries in ageless aerospace vehicles
Self-monitoring, self-repairing aerospace vehicles require modular, flexible and adaptive sensing and communication networks. In general, a modular (multi-cellular) sensing and communication network is expected to detect and react to impact location, energy and damage over a wide range of impacts. It is critical that global response emerges as a result of interactions involving transfer of information embedded locally, avoiding single points-of-failure. This work presents mechanisms ensuring self-organisation of autonomous cells into robust and continuously connected impact boundaries. The spatiotemporal stability is demonstrated for a variety of cell shapes in a dynamic environment with varying energy dissipation and damage probability models.
17905930
Evaluating Team Performance at the Edge of Chaos
We introduce a concise approach to teamwork evaluation on multiple levels – dealing with agent’s behaviour spread and multi-agent coordination potential, and abstracting away the team decision process. The presented quantitative information-theoretic methods measure behavioural and epistemic entropy, and detect phase transitions – the edge of chaos – in team performance. The techniques clearly identify under-performing states, where a change in tactics may be warranted. This approach is a step towards a unified quantitative framework on behavioural and belief dynamics in complex multi-agent systems.
28403175
GI/S: A Graphical User Interface For Symbolic Computation Systems
The design and implementation of GI/S, a Graphical user Interface for Symbolic computation systems, is described. The system provides a multiple window environment for the high-resolution 2-D display of mathematical expressions, the ability to select and manipulate parts of expressions with a mouse, and graphics plotting of mathematical expressions. GI/S also provides command line editing and a history mechanism for editing and re-executing past commands. GI/S is written in Franz Lisp for the Macsyma system and has been implemented on the Tektronix 4404 workstation.
62548937
Performance Modeling and Prediction of Face Recognition Systems
It is a challenging task to accurately model the performance of a face recognition system, and to predict its individual recognition results under various environments. This paper presents generic methods to model and predict the face recognition performance based on analysis of similarity measurement. We first introduce a concept of "perfect recognition", which only depends on the intrinsic structure of a recognition system. A metric extracted from perfect recognition similarity scores (PRSS) allows modeling the face recognition performance without empirical testing. This paper also presents an EM algorithm to predict the recognition rate of a query set. Furthermore, features are extracted from similarity scores to predict recognition results of individual queries. The presented methods can select algorithm parameters offline, predict recognition performance online, and adjust face alignment online for better recognition. Experimental results show that the performance of recognition systems can be greatly improved using presented methods.
52809451
Improving Face Recognition by Online Image Alignment
Face recognition accuracy is affected by many factors. This paper studies one of the factors, and provides a reliable image alignment for face recognition. For this purpose, a performance metric is extracted from an analysis of face recognition similarity scores. The metric varies with face alignment, and has a relationship with the actual recognition accuracy. Our method adjusts face alignment online by selecting an alignment candidate corresponding to the largest performance metric. The experimental results show that the presented method can improve the accuracy and robustness of current face recognition systems