45057829
Preclassification of handwritten Chinese characters based on basic stroke substructures
A method for preclassification of handwritten Chinese characters is presented. A set of basic stroke substructures is defined using the consistent stroke connection relations. A knowledge guided recognition process is employed to identify the types of the extracted basic stroke substructures found in a handwritten character. Then a 1-D character coding scheme is given to represent the character and the code can be also used for character preclassification.
42618487
Handwritten Chinese Character Recognition Using Stroke Structural Sequence Code
86627129
Identification of business forms using relationships between adjacent frames
This paper proposes a method of using relationships between adjacent frames to identify business forms. First, we use the relations between adjacent frames in the business form to represent each form as two graphs. We then convert these graphs to two 1-D strings, which are used to perform matching. This approach enables forms to be identified quickly, and it places no restrictions on the layout of the business forms.
2042582
Pose determination of a cylinder using reprojection transformation
Extracting useful and robust feature points from a cylinder image for 3D pose determination is a relatively difficult task, since there are no feature points or lines on the cylinder. In this study, a key vector from a cylinder image is found to yield a transformation. The cylinder is then ''reprojected'' from the original image to obtain a new image using the transformation. The new image reveals some important features capable of determining the 3D cylinder position robustly. The proposed method can yield an exact and analytical solution without the requirement of using any special marks, extra equipment or assumptions. Additionally, a problem in which both circles on the cylinder are not completely visible due to the viewing angle can be resolved by this method. Finally, experimental results are provided to verify the theory and show the robustness of our method.
1822288
Incremental model building of polyhedral objects using structured light
Abstract A vision method using active sensing to construct the complete geometric model of a polyhedral object is presented. The model is constructed incrementally from multiple views. Each view produces a partial object model. Three different methods are described for integrating all the partial models into a final complete model. Theorems regarding the sufficient number of views required and how these views can be set up during the reconstruction process are also given. From theoretical analysis and experimental results, our method is shown to produce an accurate object geometric model, not just an approximate model. Furthermore, it does not rely on a precise object-to-image space transformation. Moreover, the method is fast and robust, since the basic geometric entity it derives is a face instead of a point.
11939257
Building a web thesaurus from web link structure
Thesaurus has been widely used in many applications, including information retrieval, natural language processing, and question answering. In this paper, we propose a novel approach to automatically constructing a domain-specific thesaurus from the Web using link structure information. The proposed approach is able to identify new terms and reflect the latest relationship between terms as the Web evolves. First, a set of high quality and representative websites of a specific domain is selected. After filtering out navigational links, link analysis is applied to each website to obtain its content structure. Finally, the thesaurus is constructed by merging the content structures of the selected websites. The experimental results on automatic query expansion based on our constructed thesaurus show 20% improvement in search precision compared to the baseline.
14828051
MRSSA: an iterative algorithm for similarity spreading over interrelated objects
We introduce the Multiple Relationship Similarity Spreading Algorithm (MRSSA) to enhance IR effectiveness. This method has similarity computed in an iterative "spreading" fashion for multiple object types, combining both inter- and intra-object relationships. We demonstrate the value of this approach in the context of the WWW, where the key objects are web pages and queries, Relationships considered are derived from hyperlinks (in- and out-links) and click-through logs.
1877127
Fault tolerant high performance computing by a coding approach
As the number of processors in today's high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the execution time of many current high performance computing applications. Although today's architectures are usually robust enough to survive node failures without suffering complete system failure, most today's high performance computing applications can not survive node failures and, therefore, whenever a node fails, have to abort themselves and restart from the beginning or a stable-storage-based checkpoint.This paper explores the use of the floating-point arithmetic coding approach to build fault survivable high performance computing applications so that they can adapt to node failures without aborting themselves. Despite the use of erasure codes over Galois field has been theoretically attempted before in diskless checkpointing, few actual implementations exist. This probably derives from concerns related to both the efficiency and the complexity of implementing such codes in high performance computing applications. In this paper, we introduce the simple but efficient floating-point arithmetic coding approach into diskless checkpointing and address the associated round-off error issue. We also implement a floating-point arithmetic version of the Reed-Solomon coding scheme into a conjugate gradient equation solver and evaluate both the performance and the numerical impact of this scheme. Experimental results demonstrate that the proposed floating-point arithmetic coding approach is able to survive a small number of simultaneous node failures with low performance overhead and little numerical impact.
28595321
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly one disc. This problem originates from the application in digital halftoning, with the best known approximation factor being 5.83 [2]. We show that if the maximum radius is no more than a constant times the minimum radius, then there exists a polynomial time approximation scheme. Our techniques are based on the width-bounded geometric separator recently developed in [5,6].
15310025
A study of relevance propagation for web search
Different from traditional information retrieval, both content and structure are critical to the success of Web information retrieval. In recent years, many relevance propagation techniques have been proposed to propagate content information between web pages through web structure to improve the performance of web search. In this paper, we first propose a generic relevance propagation framework, and then provide a comparison study on the effectiveness and efficiency of various representative propagation models that can be derived from this generic framework. We come to many conclusions that are useful for selecting a propagation model in real-world search applications, including 1) sitemap-based propagation models outperform hyperlink-based models in sense of both effectiveness and efficiency, and 2) sitemap-based term propagation is easier to be integrated into real-world search engines because of its parallel offline implementation and acceptable complexity. Some other more detailed study results are also reported in the paper.