On improving the efficiency of tensor voting

This paper proposes two alternative formulations to reduce the high computational complexity of tensor voting, a robust perceptual grouping technique used to extract salient information from noisy data. The first scheme consists of numerical approximations of the votes, which have been derived from an in-depth analysis of the plate and ball voting processes. The second scheme simplifies the formulation while keeping the same perceptual meaning of the original tensor voting: The stick tensor voting and the stick component of the plate tensor voting must reinforce surfaceness, the plate components of both the plate and ball tensor voting must boost curveness, whereas junctionness must be strengthened by the ball component of the ball tensor voting. Two new parameters have been proposed for the second formulation in order to control the potentially conflictive influence of the stick component of the plate vote and the ball component of the ball vote. Results show that the proposed formulations can be used in applications where efficiency is an issue since they have a complexity of order O(1). Moreover, the second proposed formulation has been shown to be more appropriate than the original tensor voting for estimating saliencies by appropriately setting the two new parameters.     

Standard process monitoring and traceability programming in collaborative CAD/CAM/CNC manufacturing scenarios

The paper focuses on collaborative STEP-based CAD/CAM/CNC supply chains to program and automate machining process data monitoring and traceability activities. A traceability interface (traceability nc_functions) is defined for the new CNC programming standard ISO STEP-NC. CAM systems will be able to program monitoring and data access activities by inserting traceability nc_function calls in CNC programs. On the shop floor, controllers will automatically interpret these nc_functions to access process data while machining and will relate data records with the corresponding machining operations in a STEP-NC part program. With both types of information—process data and standard machining program (STEP-NC part program)—spread and technologically heterogeneous engineering systems will have full knowledge about what has happened in production. Traceability data access automation will assure data reliability. The paper describes a traceability scenario where standards such as MTConnect and ISA-95 support, rather than interfere with, the STEP-NC traceability proposal.     

A Faà di Bruno Hopf algebra for a group of Fliess operators with applications to feedback

A Faà di Bruno type Hopf algebra is developed for a group of integral operators known as Fliess operators, where operator composition is the group product. Such operators are normally written in terms of generating series over a noncommutative alphabet. Using a general series expansion for the antipode, an explicit formula for the generating series of the compositional inverse operator is derived. The result is applied to analytic nonlinear feedback systems to produce an explicit formula for the feedback product, that is, the generating series for the Fliess operator representation of the closed-loop system written in terms of the generating series of the Fliess operator component systems. This formula is employed to provide a proof that local convergence is preserved under feedback.     

Admission control for a responsive distributed middleware using decision trees to model run-time parameters

The software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not possible to perform admission control for new or changing tasks if we cannot tell how their execution affects the other tasks already running. Previously, we proposed a resource-allocation middleware that manages the execution of tasks in a complex distributed system with real-time requirements. The middleware behavior can be modeled depending on the configuration of the tasks running, so that the performance of any given configuration can be calculated. This makes it possible to have admission control in such a system, but the model requires knowledge of run-time parameters. We propose the utilization of machine-learning algorithms to obtain the model parameters, and be able to predict the system performance under any configuration, so that we can provide a full admission control mechanism for complex software systems. In this paper, we present such an admission control mechanism, we measure its accuracy in estimating the parameters of the model, and we evaluate its performance to determine its suitability for a real-time or responsive system.     

Proof Pearl: a Formal Proof of Higman��s Lemma in ACL2

Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof.     

A model of cerebral cortex formation during fetal development using reaction-diffusion-convection equations with Turing space parameters

The cerebral cortex is a gray lamina formed by bodies of neurons covering the cerebral hemispheres, varying in thickness from 1.25 mm in the occipital lobe to 4 mm in the anterior lobe. The brain's surface is about 30 times greater that of the skull because of its many folds; such folds form the gyri, sulci and fissures and mark out areas having specific functions, divided into five lobes. Convolution formation may vary between individuals and is an important feature of brain formation; such patterns can be mathematically represented as Turing patterns. This article describes how a phenomenological model was developed by describing the formation pattern for the gyri occurring in the cerebral cortex by reaction diffusion equations with Turing space parameters. Numerical examples for simplified geometries of a brain were solved to study pattern formation. The finite element method was used for the numerical solution, in conjunction with the Newton–Raphson method. The numerical examples showed that the model can represent cerebral cortex fold formation and reproduce pathologies related to gyri formation, such as polymicrogyria and lissencephaly.     

Face tracking with automatic model construction

This paper describes an active model with a robust texture model built on-line. The model uses one camera and it is able to operate without active illumination. The texture model is defined by a series of clusters, which are built in a video sequence using previously encountered samples. This model is used to search for the corresponding element in the following frames. An on-line clustering method, named leaderP is described and evaluated on an application of face tracking. A 20-point shape model is used. This model is built offline, and a robust fitting function is used to restrict the position of the points. Our proposal is to serve as one of the stages in a driver monitoring system. To test it, a new set of sequences of drivers recorded outdoors and in a realistic simulator has been compiled. Experimental results for typical outdoor driving scenarios, with frequent head movement, turns and occlusions are presented. Our approach is tested and compared with the Simultaneous Modeling and Tracking (SMAT) [1], and the recently presented Stacked Trimmed Active Shape Model (STASM) [2], and shows better results than SMAT and similar fitting error levels to STASM, with much faster execution times and improved robustness.     

Superpipelined high-performance optical-flow computation architecture

Optical-flow computation is a well-known technique and there are important fields in which the application of this visual modality commands high interest. Nevertheless, most real-world applications require real-time processing, an issue which has only recently been addressed. Most real-time systems described to date use basic models which limit their applicability to generic tasks, especially when fast motion is presented or when subpixel motion resolution is required. Therefore, instead of implementing a complex optical-flow approach, we describe here a very high-frame-rate optical-flow processing system. Recent advances in image sensor technology make it possible nowadays to use high-frame-rate sensors to properly sample fast motion (i.e. as a low-motion scene), which makes a gradient-based approach one of the best options in terms of accuracy and consumption of resources for any real-time implementation. Taking advantage of the regular data flow of this kind of algorithm, our approach implements a novel superpipelined, fully parallelized architecture for optical-flow processing. The system is fully working and is organized into more than 70 pipeline stages, which achieve a data throughput of one pixel per clock cycle. This computing scheme is well suited to FPGA technology and VLSI implementation. The developed customized DSP architecture is capable of processing up to 170 frames per second at a resolution of 800 × 600 pixels. We discuss the advantages of high-frame-rate processing and justify the optical-flow model chosen for the implementation. We analyze this architecture, measure the system resource requirements using FPGA devices and finally evaluate the system’s performance and compare it with other approaches described in the literature.     

Effect of the centrifugal forces on the finite element eigenvalue solution of a rotating blade: a comparative study

In this study, the effect of the centrifugal forces on the eigenvalue solution obtained using two different nonlinear finite element formulations is examined. Both formulations can correctly describe arbitrary rigid body displacements and can be used in the large deformation analysis. The first formulation is based on the geometrically exact beam theory, which assumes that the cross section does not deform in its own plane and remains plane after deformation. The second formulation, the absolute nodal coordinate formulation (ANCF), relaxes this assumption and introduces modes that couple the deformation of the cross section and the axial and bending deformations. In the absolute nodal coordinate formulation, four different models are developed; a beam model based on a general continuum mechanics approach, a beam model based on an elastic line approach, a beam model based on an elastic line approach combined with the Hellinger–Reissner principle, and a plate model based on a general continuum mechanics approach. The use of the general continuum mechanics approach leads to a model that includes the ANCF coupled deformation modes. Because of these modes, the continuum mechanics model differs from the models based on the elastic line approach. In both the geometrically exact beam and the absolute nodal coordinate formulations, the centrifugal forces are formulated in terms of the element nodal coordinates. The effect of the centrifugal forces on the flap and lag modes of the rotating beam is examined, and the results obtained using the two formulations are compared for different values of the beam angular velocity. The numerical comparative study presented in this investigation shows that when the effect of some ANCF coupled deformation modes is neglected, the eigenvalue solutions obtained using the geometrically exact beam and the absolute nodal coordinate formulations are in a good agreement. The results also show that as the effect of the centrifugal forces, which tend to increase the beam stiffness, increases, the effect of the ANCF coupled deformation modes on the computed eigenvalues becomes less significant. It is shown in this paper that when the effect of the Poisson ration is neglected, the eigenvalue solution obtained using the absolute nodal coordinate formulation based on a general continuum mechanics approach is in a good agreement with the solution obtained using the geometrically exact beam model.     

Direct electron crystallographic determination of zeolite zonal structures

The prospect for improving the success of ab initio zeolite structure investigations with electron diffraction data is evaluated. First of all, the quality of intensities obtained by precession electron diffraction at small hollow cone illumination angles is evaluated for seven representative materials: ITQ-1, ITQ-7, ITQ-29, ZSM-5, ZSM-10, mordenite, and MCM-68. It is clear that, for most examples, an appreciable fraction of a secondary scattering perturbation is removed by precession at small angles. In one case, ZSM-10, it can also be argued that precession diffraction produces a dramatically improved 'kinematical' data set. There seems to no real support for application of a Lorentz correction to these data and there is no reason to expect for any of these samples that a two-beam dynamical scattering relationship between structure factor amplitude and observed intensity should be valid. Removal of secondary scattering by the precession mode appears to facilitate ab initio structure analysis. Most zeolite structures investigated could be solved by maximum entropy and likelihood phasing via error-correcting codes when precession data were used. Examples include the projected structure of mordenite that could not be determined from selected area data alone. One anomaly is the case of ZSM-5, where the best structure determination in projection is made from selected area diffraction data. In a control study, the zonal structure of SSZ-48 could be determined from selected area diffraction data by either maximum entropy and likelihood or traditional direct methods. While the maximum entropy and likelihood approach enjoys some advantages over traditional direct methods (non-dependence on predicted phase invariant sums), some effort must be made to improve the figures of merit used to identify potential structure solutions.