37838547
Automatic understanding of symbol-connected diagrams
A symbol-connected diagram is mainly composed of symbols and their connections. All symbols can be categorized into two groups: shape symbols and structure symbols. This paper proposes a system for automatic understanding of symbol-connected diagrams based on a graph, called the consistent attributed graph (CAG), which represents the diagram in a bottom-up fashion. The shape symbol processing is carried out by means of shape processing, followed by shape symbol identification with the use of two symbol windows in the CAG. Some experimental results for understanding logic circuit diagrams are given.
27633879
A more efficient branch and bound algorithm for feature selection
Abstract An algorithm is presented to be able to select the globally optimal subset of d features from a larger D -feature set. This is a fundamental problem in statistical pattern recognition and combinatorial optimization. Exhaustive enumeration is computationally unfeasible in most applications. This algorithm dynamically searches for the globally optimal solution on a minimum solution tree which is a subtree of the solution tree used in the traditional branch and bound algorithm. The new algorithm is compared theoretically with the branch and bound algorithm. The analysis and the experimental results show that it is more efficient than the traditional algorithm.
39489918
An economical contour extraction algorithm for understanding large-size engineering drawings
An algorithm is described which produces the extraction of an object's contours in a binary image while storing only two raster lines at a time during processing. The major data structure used is a block adjacency graph which occupies much less space (typically one hundredth) than the original image. Because this algorithm has very low costs of memory space and processing time, it is a powerful tool for processing large-size engineering drawings. Applications of the method to the recognition of some loop-structure logical symbols are described.<<ETX>>
31557244
Isothetic polygon representation for contours
Abstract An isothetic polygon, which has all its edges oriented in two orthogonal directions, is one of the simplest representations for a contour of binary images. This paper introduces an efficient, onepass algorithm for generating the isothetic polygons for the contours in binary images.
38916969
A Generic System for Form Dropout
Recent advances in intelligent character recognition are enabling us to address many challenging problems in document image analysis. One of them is intelligent form analysis. This paper describes a generic system for form dropout when the filled-in characters or symbols are either touching or crossing the form frames. We propose a method to separate these characters from form frames whose locations are unknown. Since some of the character strokes are either touching or crossing the form frames, we need to address the following three issues: 1) localization of form frames; 2) separation of characters and form frames; and 3) reconstruction of broken strokes introduced during separation. The form frame is automatically located by finding long straight lines based on the block adjacency graph. Form frame separation and character reconstruction are implemented by means of this graph. The proposed system includes form structure learning and form dropout. First, a form structure-based template is automatically generated from a blank form which includes form frames, preprinted data areas and skew angle. With this form template, our system can then extract both handwritten and machine-typed filled-in data. Experimental results on three different types of forms show the performance of our system. Further, the proposed method is robust to noise and skew that is introduced during scanning.
9449451
The Tree Representation of the Graph Used in Binary Image Processing
Abstract A very useful structure, line adjacency graph, used in binary image processing is mapped onto an extended binary tree in this paper. The latter is more convenient for storing, traversing and pruning, and it occupies less memory space than the former.
42842563
A WSRF Based Shopping Cart System
Web Services Resource Framework (WSRF) is a set of specifications that represents a convergence point of the Web services and the Grid services communities. This paper presents our early experience with WSRF. A shopping cart system has been implemented with WSRF supported Globus toolkit 3.9.2 (GT3.9.2). Based on the system, the performance of the WSRF core in GT3.9.2 has also been evaluated.
206807096
Multiple copy image denoising via wavelet thresholding
This work addresses the recovery of an image from noisy observations when multiple noisy copies of the image are available. The standard method is to compute the average of these copies. Since the wavelet thresholding technique has been shown to effectively denoise a single noisy copy, it is natural to consider combining these two operations of averaging and thresholding. The first important task is to find the optimal ordering. The second issue is the threshold selection for each method. By modeling the signal wavelet coefficients as Laplacian distributed and the noise as Gaussian, our investigation finds the optimal ordering to depend on the number of available copies and on the signal-to-noise ratio. We propose thresholds that are nearly optimal under the assumed model for each ordering. With the optimal and near-optimal thresholds, the two methods yield very similar performance, and both show considerable improvement over merely averaging.
17926099
Research and Design of One Key Agreement Scheme in Bluetooth
Since there is eavesdropping and MITM attack during establishing encryption key between two Bluetooth devices, a secure key agreement scheme is designed based on elliptic curves cryptography and interlock protocol. This scheme can defend two kinds of attacks mentioned above. It provides bidirectional authentication for two devices and key integrity verification by exchanging the keyspsila Hash-value. Then security of the scheme is theoretically analyzed and efficiency of it is compared with that of other schemes in relative papers. The results demonstrate the scheme proposed in this paper is secure and efficient.
11758
A multi-stream adaptation framework for bandwidth management in 3D tele-immersion
Tele-immersive environments will improve the state of collaboration among distributed participants. However, along with the promise a new set of challenges have emerged including the real-time acquisition, streaming and rendering of 3D scenes to convey a realistic sense of immersive spaces. Unlike 2D video conferencing, a 3D tele-immersive environment employs multiple 3D cameras to cover a much wider field of view, thus generating a very large volume of data that need to be carefully coordinated, organized, and synchronized for Internet transmission, rendering and display. This is a challenging task and a dynamic bandwidth management must be in place. To achieve this goal, we propose a multi-stream adaptation framework for bandwidth management in 3D tele-immersion. The adaptation framework relies on the hierarchy of mechanisms and services that exploits the semantic link of multiple 3D video streams in the tele-immersive environment. We implement a prototype of the framework that integrates semantic stream selection, content adaptation, and 3D data compression services with user preference. The experimental results have demonstrated that the framework shows a good quality of the resulting composite 3D rendered video in case of sufficient bandwidth, while it adapts individual 3D video streams in a coordinated and user-friendly fashion, and yields graceful quality degradation in case of low bandwidth availability.
17350574
Nonparametric sparse hierarchical models describe V1 fMRI responses to natural images
We propose a novel hierarchical, nonlinear model that predicts brain activity in area V1 evoked by natural images. In the study reported here brain activity was measured by means of functional magnetic resonance imaging (fMRI), a noninvasive technique that provides an indirect measure of neural activity pooled over a small volume (≈ 2mm cube) of brain tissue. Our model, which we call the V-SPAM model, is based on the reasonable assumption that fMRI measurements reflect the (possibly nonlinearly) pooled, rectified output of a large population of simple and complex cells in V1. It has a hierarchical filtering stage that consists of three layers: model simple cells, model complex cells, and a third layer in which the complex cells are linearly pooled (called "pooled-complex" cells). The pooling stage then obtains the measured fMRI signals as a sparse additive model (SpAM) in which a sparse nonparametric (nonlinear) combination of model complex cell and model pooled-complex cell outputs are summed. Our results show that the V-SPAM model predicts fMRI responses evoked by natural images better than a benchmark model that only provides linear pooling of model complex cells. Furthermore, the spatial receptive fields, frequency tuning and orientation tuning curves of the V-SPAM model estimated for each voxel appears to be consistent with the known properties of V1, and with previous analyses of this data set. A visualization procedure applied to the V-SPAM model shows that most of the nonlinear pooling consists of simple compressive or saturating nonlinearities.