Engineering design and mechatronics: The schemebuilder project

The paper describes the development of a software design aid for use at the conceptual stage of engineering design. It is intended for use in the design of mechatronic products but has wider potential uses. Early approaches were based on function structures and tables of options and the system that evolved allows the assembly of schemes linked by matching their input and output ports. A database of components is provided which can be accessed via different indexes and the designer can easily create and compare alternative schemes at the concept stage. A bond graph approach is used to define the interconnections between components. This allows correct port matching but also provides for future development such as constraint propagation through the design and links to simulation tools. © 1993 Springer-Verlag New York Inc.

Video tracking using dual-treewavelet polar matching and particle filtering

In this paper, we describe a video tracking application using the dual-tree polar matching algorithm. The models are specified in a probabilistic setting, and a particle ilter is used to perform the sequential inference. Computer simulations demonstrate the ability of the algorithm to track a simulated video moving target in an urban environment with complete and partial occlusions. © The Institution of Engineering and Technology.

The Modeling of Ion Implantation in a Three-Layer Structure Using the Method of Dose Matching

The method of modeling ion implantation in a multilayer target using moments of a statistical distribution and numerical integration for dose calculation in each target layer is applied to the modelling of As⁺ in poly-Si/SiO2/Si. Good agreement with experiment is obtained. Copyright © 1985 by The Institute of Electrical and Electronics Engineers, Inc.

Robust pairwise matching of interest points with complex wavelets

We present a matching framework to find robust correspondences between image features by considering the spatial information between them. To achieve this, we define spatial constraints on the relative orientation and change in scale between pairs of features. A pairwise similarity score, which measures the similarity of features based on these spatial constraints, is considered. The pairwise similarity scores for all pairs of candidate correspondences are then accumulated in a 2-D similarity space. Robust correspondences can be found by searching for clusters in the similarity space, since actual correspondences are expected to form clusters that satisfy similar spatial constraints in this space. As it is difficult to achieve reliable and consistent estimates of scale and orientation, an additional contribution is that these parameters do not need to be determined at the interest point detection stage, which differs from conventional methods. Polar matching of dual-tree complex wavelet transform features is used, since it fits naturally into the framework with the defined spatial constraints. Our tests show that the proposed framework is capable of producing robust correspondences with higher correspondence ratios and reasonable computational efficiency, compared to other well-known algorithms. © 1992-2012 IEEE.

Large scale heterogeneous networks, the Davis-Wielandt shell, and graph separation

We consider a large scale network of interconnected heterogeneous dynamical components. Scalable stability conditions are derived that involve the input/output properties of individual subsystems and the interconnection matrix. The analysis is based on the Davis-Wielandt shell, a higher dimensional version of the numerical range with important convexity properties. This can be used to allow heterogeneity in the agent dynamics while relaxing normality and symmetry assumptions on the interconnection matrix. The results include small gain and passivity approaches as special cases, with the three dimensional shell shown to be inherently connected with corresponding graph separation arguments. © 2012 Society for Industrial and Applied Mathematics.