Statistical character structure modeling and its application to handwritten Chinese character recognition

This paper proposes a statistical character structure modeling method. It represents each stroke by the distribution of the feature points. The character structure is represented by the joint distribution of the component strokes. In the proposed model, the stroke relationship is effectively reflected by the statistical dependency. It can represent all kinds of stroke relationship effectively in a systematic way. Based on the character representation, a stroke neighbor selection method is also proposed. It measures the importance of a stroke relationship by the mutual information among the strokes. With such a measure, the important neighbor relationships are selected by the nth order probability approximation method. The neighbor selection algorithm reduces the complexity significantly because we can reflect only some important relationships instead of all existing relationships. The proposed character modeling method was applied to a handwritten Chinese character recognition system. Applying a model-driven stroke extraction algorithm that cooperates with a selective matching algorithm, the proposed system is better than conventional structural recognition systems in analyzing degraded images. The effectiveness of the proposed methods was visualized by the experiments. The proposed method successfully detected and reflected the stroke relationships that seemed intuitively important. The overall recognition rate was 98.45 percent, which confirms the effectiveness of the proposed methods.     

Period And Priority Assignment Method For Dcs Design

Distributed control systems (DCS) used in industry environments consist of sensors, actuators, and controllers that are connected with a fieldbus. It is difficult to design the DCS while guaranteeing the time‐critical requirements because of both communication delays due to the fieldbus and computation delays due to many tasks executed in one node. This paper proposes a priority assignment method and a period assignment method that find the shortest periods of control loops and guarantee the end‐to‐end constraints such as precedence constraints and timing constraints. Also, a DCS design method is presented by using the proposed two assignment methods. The presented design method considers the worst‐case response times of tasks and messages simultaneously and is applicable to a practical DCS, which consists of several constraints. The design method is validated by examples.     

Computing isophotos of surface of revolution and canal surface

Isophote of a surface consists of a loci of surface points whose normal vectors form a constant angle with a given fixed vector. It also serves as a silhouette curve when the constant angle is given as π/2. We present efficient and robust algorithms to compute isophotes of a surface of revolution and a canal surface. For the two kinds of surfaces, each point on the isophote is derived by a closed-form solution. To find each connected component in the isophote, we utilize the feature of surface normals. Both surfaces are decomposed into a set of circles, where the surface normal vectors at points on each circle construct a cone. The vectors which form a constant angle with given fixed vector construct another cone. We compute the parametric range of the connected component of the isophote by computing the parametric values of the surface which derive the tangential intersection of these two cones.     

Transitive mesh space of a progressive mesh

The paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a complete selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.     

Nonuniform cache architectures for wire-delay dominated on-chip caches

Nonuniform cache access designs solve the on-chip wire delay problem for future large integrated caches. By embedding a network in the cache, NUCA designs let data migrate within the cache, clustering the working set nearest the processor. The authors propose several designs that treat the cache as a network of banks and facilitate nonuniform accesses to different physical regions. NUCA architectures offer low-latency access, increased scalability, and greater performance stability than conventional uniform access cache architectures.     

A flight control system for aerial robots: algorithms and experiments

This paper presents a hierarchical flight control system for unmanned aerial vehicles. The proposed system executes high-level mission objectives by progressively substantiating them into machine-level commands. The acquired information from various sensors is propagated back to the higher layers for reactive decision making. Each vehicle is connected via standardized wireless communication protocol for scalable multi-agent coordination. The proposed system has been successfully implemented on a number of small helicopters and validated in various applications. Results from waypoint navigation, a probabilistic pursuit-evasion game and vision-based target tracking demonstrate the potential of the proposed approach toward intelligent flying robots.     

Human Face Detection in Digital Video Using SVMEnsemble

This Letter proposes automatic human face detection in digital video using a support vector machine (SVM) ensemble to improve the detection performance. The SVM ensemble consists of several independently trained SVMs using randomly chosen training samples via a bootstrap technique. Next, they are aggregated in order to make a collective decision via a majority voting scheme. Experimental results show that the proposed face detection method using SVM ensemble outperforms conventional methods such as using only single SVM and Multi-Layer Perceptron in terms of classification accuracy, false alarms, and missing rates.     

Complete and Rapid Regrasp Planning with Look-up Table

A pick-and-place operation in a 3-dimensional environment is a basic operation for humans and multi-purpose manipulators. However, there may be a difficult problem for such manipulators. Especially, if the object cannot be moved with a single grasp, regrasping, which can be a time-consuming process, should be carried out. Regrasping, given initial and final poses of the target object, is a construction of sequential transition of object poses that are compatible with two poses in the point of grasp configuration. This paper presents a novel approach for solving the regrasp problem. The approach consists of a preprocessing and a planning stage. Preprocessing, which is done only once for a given robot, generates a look-up table which has information on kinematically feasible task space of the end-effector throughout the entire workspace. Then, using this table, the planning automatically determines a possible intermediate location, pose and regrasp sequence leading from the pick-up to put-down grasp. With a redundant robot, it is shown experimentally that the presented method is complete in the entire workspace and can be implemented in real-time applications due to rapid regrasp planning time. The regrasp planner was combined with an existing path.     

Burst Mode Bandwidth Allocation for Real-Time Messages in IEEE 802.12 Networks

In IEEE 802.12 network, a repeater arbitrates among transmission requests on a round robin basis. A node can transmit a packet only when it is granted by the repeater. Recently, the IEEE 802.12 Committee approved a burst mode in which a node can transmit multiple packets per grant. In burst mode a bandwidth, or the number of packets per grant should be allocated taking into account the timing constraints of real-time messages. This paper proposes bandwidth allocation algorithms based on the burst mode to guarantee the deadlines of periodic real-time messages. Once the bandwidth of each node is derived from the lengths and deadlines of periodic messages, a node is allowed to transmit packets up to the allocated bandwidth per grant. Experimental results show that the proposed algorithms providemuch higher guarantee ratio and graceful degradation for heavy network load, compared with the existing approaches.     

Application of megasonic cleaner to sub-micron particles of SIL optical flying head

 As the demand for large capacity storage drives has increased, the flying height of near-field recording (NFR) sliders becomes as small as 100 nm for super high storage density. Accordingly contamination problems have been a concern of information storage industry because it may cause a serious damage to solid immersion lens (SIL) of optical flying head. Sub-micro contaminants in air bearing of the NFR slider may affect the flyability and stability of the optical slider. In addition, the cleaning of small particles becomes more difficult as the contaminant particle size decreases because the adhesion force increases very much as the particle size decreases. Recently developed high-frequency ultrasonic (megasonic) cleaning technique have made it possible to remove sub-micron particles less than 100 nm without surface erosion and many remarkable results have been reported. In this paper, the megasonic technique is applied and tested for the cleaning of the flying head of NFR drive. 1 MHz ultrasound with maximum 100 W was used to remove polystyrene latex (PSL) particles and alumina particles deposited on the surface of the slider. Effective cleaning performance was observed without any damages on the slider surface using optical microscope and AFM at different ultrasonic energy levels and cleaning times. Received: 20 June 2002 / Accepted: 9 September 2002