206412947
A Fast and Flexible Thinning Algorithm
A fast serial and parallel algorithm for thinning digital patterns is presented. The processing speed is faster than previous algorithms in that it reads pixels along the edge of the input pattern rather than all pixels in each iteration. Using this algorithm, an experiment is conducted and the patterns such as 'X', 'H', 'A', 'moving body', and 'leaf' are tested. The results show that this algorithm is faster, structure-preserving, and more flexible in that it can be done either sequentially or in parallel. >
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.
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.
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.
38659056
Intelligent Pattern Recognition and Applications
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.
17885591
Towards Adaptive Clustering in Self-monitoring Multi-agent Networks
A Decentralised Adaptive Clustering (DAC) algorithm for self-monitoring impact sensing networks is presented within the context of CSIRO-NASA Ageless Aero-space Vehicle project. DAC algorithm is contrasted with a Fixed-order Centralised Adaptive Clustering (FCAC) algorithm, developed to evaluate the comparative performance. A number of simulation experiments is described, with a focus on the scalability and convergence rate of the clustering algorithm. Results show that DAC algorithm scales well with increasing network and data sizes and is robust to dynamics of the sensor-data flux.
6354609
A Genetic Algorithm for VLSI Floorplanning
We present a genetic algorithm (GA) which uses a normalized postfix encoding scheme to solve the VLSI floorplanning problem. We claim to have overcome the representational problems previously associated with encoding postfix expressions into GAs, and have developed a novel encoding system which preserves the integrity of solutions under all the genetic operators. Optimal floorplans are obtained for module sets taken from some MCNC benchmarks. The slicing tree construction process, used by our GA to generate the floorplans, has a run time scaling which compares very favourably with other recent approaches.
16442663
Parallel univariate polynomial factorization on shared-memory multiprocessors
Using parallelism afforded by shared-memory multiprocessors to speed up systems for polynomial factorization is discussed. The approach is to take the fastest known factoring algorithm for practical purposes and parallelize key parts of it. The univariate factoring algorithm consists of two major tasks (a) factoring modulo small integer primes and (b) EEZ lifting and recovery of true factors. A C coded system PFACTOR that implements (a) in parallel is described in detail. PFACTOR is a stand-alone parallel factorizer that can take input from a file, a pipe or a socket connection over a network. It can also be used interactively as a UNIX command. PFACTOR consists of parallel selection of primes, automatic balancing of work, parallel Berlekamp algorithm, and parallel reconciliation of degrees of factors modulo different primes. Actual timings on the Encore Multimax show the effectiveness of the approach. Work on part (b) is still on going.
6202424
On cages with given degree sets
Abstract We consider the problem of constructing minimal graphs of given girth having a particular degree set.
13042163
Non-Axiomatic Reasoning System (Version 4.1)
NARS (Non-Axiomatic Reasoning System) is an intelligent reasoning system. It answers questions according to the knowledge originally provided by its user. What makes it different from conventional reasoning systems is its ability to learn from its experience and to work with insufficient knowledge and resources. The NARS 4.1 demo is a Java applet. It comes with help information and simple examples to show how the system does deduction, induction, abduction, analogy, belief revision, membership evaluation, relational inference, backward inference, new concept formation, and so on, in a unified manner. The demo also allows its user to create new examples to test the system, as well as to see the internal structure and process when the system is running. The on-line help document contains links to relevant publications. A previous version of the system, NARS 3.0, is described in detail in (Wang, 1995), which, and other related publications, are available at the author’s web page.