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.
3177556
A parallel architecture for probabilistic relaxation operations on images
Abstract The design of a parallel architecture for executing probabilistic relaxation operations on two dimensional images is addressed. First of all, the concerned relaxation process is divided into three different parallel operations, i.e. systolic, simultaneous, and pipelined. All these parallel operations are mapped onto a linear array architecture that runs smoothly without any bottleneck in the data flows. The proposed architecture and its components are described. An illustrative running of the relaxation process for an image thresholding application on the architecture is described in some details. The hardware implementation and CAD logic simulation are then given. Finally, performance comparison between the proposed architecture and some existing ones is reported.
21895291
Determination of feature correspondences in stereo images using a calibration polygon
In this paper, we propose a novel approach to solving the vertex/edge correspondence problem for stereo images. Assume an object is placed on a calibration plate (C-plate) and two perspective views of them are given. The C-plate vertex correspondence, determined by cross-ratios, is used to reduce the search space for determining object vertex/edge correspondence. First, the correspondence of object edges lying on the C-plate (called the object base edges) is considered. This is because the subpolygons obtained from the division of the C-plate by the extended line of each of these base edges are viewpoint invariant, i.e. the cross-ratio of each of their vertices in different images will have equal value. Assume that at least one of the base edges is visible in each image. Since a visible object base edge has to be an object boundary edge in an image, only object boundary edges will be considered for the cross-ratios check for the associated subpolygons as well as other geometric constraint checks in determining the object base vertex/edge correspondence. These geometric constraints include (i) the position of the edges along the boundary of object faces, and (ii) the division of the C-plate vertices by the extended lines of these edges. Based on one of the determined corresponding base edge pairs, the correspondence of all other edges can be determined by constraints similar to (i). Finally, some additional viewpoint invariant measures about the object faces and the C-plates are introduced to resolve the ambiguity problem which may arise for specific viewpoints and some special object shapes. The proposed approach only needs 2-D image data and has no constraint on the number of vertices of an object face. Experimental results are presented for some polyhedral as well as curved objects.
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.
23002052
Transition matrices in the measurement and control of synchronous sequential machines
Abstract This paper develops a matrix approach to the solution of the measurement and control problems in synchronous sequential machines. The control problem in sequential machines is concerned with finding input sequences that take a given machine from a known initial state to a predesignated terminal state. There may be many different measurement problems of interest in sequential machines. One important measurement problem is the identification of the unknown initial state of the machine, called the initial-state identification problem or diagnosing problem; another important measurement problem is the identification of the terminal state of the machine, known as the terminal-state identification problem or homing problem, of which a special case is the synchronizing problem. These measurement problems may be solved by applying predetermined input sequences to the machine and noting the resulting output sequences. The conventional approach to the solution of these measurement and control problems is to make use of the information contained in the transition table of the machine in conjunction with its response tree, which is basically an exhaustive tree search process. In the present paper, instead of using the transition table and the corresponding response tree, we use only the transition matrix representation of the machine and its higher order forms to solve the aforementioned problems. The suggested approach is very systematic and completely algorithmic, and thus lends itself to easy computer implementation.
42618487
Handwritten Chinese Character Recognition Using Stroke Structural Sequence Code
17642246
Evolving an Experience Base for Software Process Research
Since 1996 the USC Center for Software Engineering has been accumulating a large amount of software process experience through many real-client project software engineering practices. Through the application of the Experience Factory approach, we have collected and evolved this experience into an experience base (eBASE) which has been leveraged successfully for empirically based software process research. Through eBASE we have realized tangible benefits in automating, organizational learning, and strategic advantages for software engineering research. We share our rationale for creating and evolving eBASE, give examples of how the eBASE has been used in recent process research, discuss current limitations and challenges with eBASE, and what we hope to do achieve in the future with it.
16272457
SimFusion: measuring similarity using unified relationship matrix
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks, user click-through sequences). We claim that iterative computations over the URM can help overcome the data sparseness problem and detect latent relationships among heterogeneous data objects, thus, can improve the quality of information applications that require com- bination of information from heterogeneous sources. To support our claim, we present a unified similarity-calculating algorithm, SimFusion. By iteratively computing over the URM, SimFusion can effectively integrate relationships from heterogeneous sources when measuring the similarity of two data objects. Experiments based on a web search engine query log and a web page collection demonstrate that SimFusion can improve similarity measurement of web objects over both traditional content based algorithms and the cutting edge SimRank algorithm.
11820934
Computing Lyapunov exponents based on the solution expression of the variational system
A simple discrete QR algorithm based on a solution expression of the variational equation of a dynamical system is presented for computing the Lyapunov exponents of n-dimensional continuous dynamical systems. The developed numerical scheme of study is based on a time integration using a constant time-step fourth-order Adams–Bashforth method. Numerical results are presented for a Lorenz system with known Lyapunov exponents, and higher dimensional dynamical systems. The algorithm proposed to compute the Lyapunov exponents is found to be robust, computationally efficient, and stable for a sufficiently small step-size h.
9224231
The plain old television in a smart apartment
Our GO (www.go-outside.org) project focuses on community access for the cognitively impaired population. In addition to devising new facilities, we are interested in using existing appliances found in an apartment to interact with a user to help with a specific task, e.g., making a trip to the doctor. This requires establishment of collaboration protocols between the appliances (and smart agents) and user to be established. These protocols must enforce certain safety properties, e.g., that the user get timely information to start a task. We will show how we use a light-weight formal modeling toolkit to reason about a protocol's ability to meet safety properties
1865477
On integral sum graphs
A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u)+f(v)=f(w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K"3 has at most two saturated nodes. We determine the structure for all integral sum graphs with exactly two saturated nodes, and give an upper bound for the number of edges of a connected integral sum graph with no saturated nodes. We introduce a method of identification on constructing new connected integral sum graphs from given integral sum graphs with a saturated node. Moreover, we show that every graph is an induced subgraph of a connected integral sum graph. Miscellaneous related results are also presented.