38659056
Intelligent Pattern Recognition and Applications
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.
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.
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.
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.
41586583
3D Articulated Object Understanding, Learning, and Recognition from 2D Images
This paper is aimed at 3D object understanding from 2D images, including articulated objects in active vision environment, using interactive, and internet virtual reality techniques. Generally speaking, an articulated object can be divided into two portions: main rigid portion and articulated portion. It is more complicated that "rigid" object in that the relative positions, shapes or angles between the main portion and the articulated portion have essentially infinite variations, in addition to the infinite variations of each individual rigid portions due to orientations, rotations and topological transformations. A new method generalized from linear combination is employed to investigate such problems. It uses very few learning samples, and can describe, understand, and recognize 3D articulated objects while the objects status is being changed in an active vision environment.
6309219
Contextual browsing for highlights in sports video
A novel highlight browsing approach for sports videos, based on contextual cue categorization, is proposed in this paper. Contextual cues are those salient audio and visual cues around highlight segments, and they are also informative and attractive to audiences. With further analysis and categorization of these contextual cues, the user could access highlights more flexibly and effectively. An experimental system is built for broadcasting diving videos in our current work, in which contextual cues such as slow-motion replays and game statistics information are extracted and categorized for highlight browsing. An efficient algorithm for slow-motion replay detection and categorization in diving videos is also proposed. Experimental results on 2 hours broadcasting diving videos have demonstrated the effectiveness and efficiency of the proposed approach.
487167
On Self-organising Diagnostics in Impact Sensing Networks
Structural health management (SHM) of safety-critical structures requires multiple capabilities: sensing, assessment, diagnostics, prognostics, repair, etc. This paper presents a capability for self-organising diagnosis by a group of autonomous sensing agents in a distributed sensing and processing SHM network. The diagnostics involves acoustic emission waves emitted as a result of a sudden release of energy during impacts and detected by the multi-agent network. Several diagnostic techniques identifying the nature and severity of damage at multiple sites are investigated, and the self-organising maps (Kohonen neural networks) are shown to outperform the standard k-means algorithm in both time- and frequency domains.
12790595
Optimally scheduling N customer arrival times for a single-server system
Abstract In this paper, we investigate the problem of scheduling a finite number of customer arrivals for a single-server system. Under the assumptions that the customers arrive at the system by scheduled appointments and they request random amount of times for service, the question is: what are the ‘best’ arrival times so that the total operating cost is minimized? This type of queueing problem has important applications in production systems as well as in service systems. Using phase-type distribution functions and matrix algebraic manipulation, we are able to obtain recursive expressions for the customer flow-time distributions, from which the mean and variance, or higher moments, can be easily computed. A computational procedure is developed that efficiently evaluates the mean flow-times for large number of customers that need to be scheduled. This procedure is integrated with a nonlinear program that determines the optimal customer arrival times.
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
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.