1231228
Font Recognition Based on Global Texture Analysis
We describe a novel texture analysis-based approach toward font recognition. Existing methods are typically based on local typographical features that often require connected components analysis. In our method, we take the document as an image containing some specific textures and regard font recognition as texture identification. The method is content-independent and involves no detailed local feature analysis. Experiments are carried out by using 14000 samples of 24 frequently used Chinese fonts (six typefaces combined with four styles), as well as 32 frequently used English fonts (eight typefaces combined with four styles). An average recognition rate of 99.1 percent is achieved. Experimental results are also included on the robustness of the method against image degradation (e.g., pepper and salt noise) and on the comparison with existing methods.
11321791
A new face detection method based on shape information
Automatic detection of human faces is one of the most difficult problems in pattern recognition. In many practical applications (e.g. personal identification using photo-IDs), face images often have a simple background. In this paper, we propose a new method based on shape information. Our system can be very efficient for images with simple background. Input image is first enhanced by means of histogram equalization, followed by edge detection based on a multiple-scale filter. The extracted edges are then linked using a method based on an energy function. The face contour is finally extracted using the direction information of the linked edges. Experimental results are included to verify the effectiveness of this method. (C) 2000 Elsevier Science B.V. All rights reserved.
7282879
Jump flooding in GPU with applications to Voronoi diagram and distance transform
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant time algorithm on GPU to compute an approximation to the Voronoi diagram of a given set of seeds in a 2D grid. The errors due to the differences between the approximation and the actual Voronoi diagram are hardly noticeable to the naked eye in all our experiments. The same approach can also compute in constant time an approximation to the distance transform of a set of seeds in a 2D grid. In practice, such constant time algorithm is useful to many interactive applications involving, for example, rendering and image processing. Besides the experimental evidences, this paper also confirms quantitatively the effectiveness of jump flooding by analyzing the occurrences of errors. The analysis is a showcase of insights to the jump flooding paradigm, and may be of independent interests to other applications of jump flooding.
10936404
Affine invariant texture signatures
We develop a new approach for texture classification independent of affine transforms. Based on a spectral representation of texture images under affine transform, anisotropic scale invariant signatures of the orientation spectrum distribution are extracted. A peaks distribution vector (PDV) obtained on the distribution of these signatures captures texture properties invariant to affine distortion. The PDV is used to measure the similarity between textures. Experimental results show the efficiency of the PDV for affine invariant texture classification.
37912790
Asia Pacific Bioinformatics Network
625121
A comprehensive high-level synthesis system for control-flow intensive behaviors
In this paper, we describe a comprehensive high-level synthesis system for control-flow intensive as well as data-dominated behaviors. We propose a new control-data flow graph model to preserve the parallelism inherent in the application, as well as to facilitate high-level synthesis. Our algorithm, which is based on an iterative improvement strategy, performs clock selection, scheduling, module selection, resource allocation and assignment simultaneously to fully derive the benefits of design space exploration at the behavior level. The system can be used to optimize area, power or energy, by selecting the cost function accordingly. Experimental results show that for energy-optimized designs, energy is reduced by up to 79.4% (an average of 42.2%), with an average of 24.8% area overhead, compared to area-optimized designs. For power-optimized designs, power is reduced by up to 70.8% (an average of 56.7%), with an average of 25.2% area overhead, compared to area-optimized designs. No Vdd scaling is performed to obtain the above results.
386735
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. This paper presents three novel variants of JFA. They focus on different aspects of JFA: the first variant can further reduce the errors of JFA; the second variant can greatly increase the speed of JFA; and the third variant enables JFA to compute Voronoi diagrams in 3D space in a slice-by-slice manner, without a high end graphics processing unit. These variants are orthogonal to each other. In other words, it is possible to combine any two or all of them together.