On the domain decomposition and transmission line modelling finite element method for time-domain induction motor analysis

This paper demonstrates how a finite element model which exploits domain decomposition is applied to the analysis of three-phase induction motors. It is shown that a significant gain in cpu time results when compared with standard finite element analysis. Aspects of the application of the method which are particular to induction motors are considered: the means of improving the convergence of the nonlinear finite element equations; the choice of symmetrical sub-domains; the modelling of relative movement; and the inclusion of periodic boundary conditions. © 1999 IEEE.

Application of domain decomposition and transmission line modelling techniques to 2D, time-domain, finite element problems

In this paper a recently published finite element method, which combines domain decomposition with a novel technique for solving nonlinear magnetostatic finite element problems is described. It is then shown how the method can be extended to, and optimised for, the solution of time-domain problems. © 1999 IEEE.

Low-cost, scalable optical packet switching networks with multi-wavelength labels

We propose a self-forwarding packet-switched optical network with bit-parallel multi-wavelength labels. We experimentally demonstrate transmission of variable-length optical packets over 80 km of fiber and switching over a 1×4 multistage switch with two stages. © 2007 Optical Society of America.

Applications of the dynamic mode decomposition

The decomposition of experimental data into dynamic modes using a data-based algorithm is applied to Schlieren snapshots of a helium jet and to time-resolved PIV-measurements of an unforced and harmonically forced jet. The algorithm relies on the reconstruction of a low-dimensional inter-snapshot map from the available flow field data. The spectral decomposition of this map results in an eigenvalue and eigenvector representation (referred to as dynamic modes) of the underlying fluid behavior contained in the processed flow fields. This dynamic mode decomposition allows the breakdown of a fluid process into dynamically revelant and coherent structures and thus aids in the characterization and quantification of physical mechanisms in fluid flow. © 2010 Springer-Verlag.

Multiscale object features from clustered complex wavelet coefficients

This paper introduces a method by which intuitive feature entities can be created from ILP (InterLevel Product) coefficients. The ILP transform is a pyramid of decimated complex-valued coefficients at multiple scales, derived from dual-tree complex wavelets, whose phases indicate the presence of different feature types (edges and ridges). We use an Expectation-Maximization algorithm to cluster large ILP coefficients that are spatially adjacent and similar in phase. We then demonstrate the relationship that these clusters possess with respect to observable image content, and conclude with a look at potential applications of these clusters, such as rotation- and scale-invariant object recognition. © 2005 IEEE.

Statistical image modelling using interscale phase relationships of complex wavelet coefficients

A novel method for modelling the statistics of 2D photographic images useful in image restoration is defined. The new method is based on the Dual Tree Complex Wavelet Transform (DT-CWT) but a phase rotation is applied to the coefficients to create complex coefficients whose phase is shift-invariant at multiscale edge and ridge features. This is in addition to the magnitude shift invariance achieved by the DT-CWT. The increased correlation between coefficients adjacent in space and scale provides an improved mechanism for signal estimation. © 2006 IEEE.

DT-MRI data visualisation using the dual tree Complex Wavelet transform

In this paper a novel visualisation method for diffusion tensor MRI datasets is introduced. This is based on the use of Complex Wavelets in order to produce "stripy" textures which depict the anisotropic component of the diffusion tensors. Grey-scale pixel intensity is used to show the isotropic component. This paper also discusses enhancements of the technique for 3D visualisation. © 2004 IEEE.

Convex approaches to model wavelet sparsity patterns

Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as deconvolution, tomography, and compressed sensing, the presence of a sensing or observation matrix produces a linear mixing of the simple Markovian dependency structure. This leads to reconstruction problems that are non-convex optimizations. Past work has dealt with this issue by resorting to greedy or suboptimal iterative reconstruction methods. In this paper, we propose new modeling approaches based on group-sparsity penalties that leads to convex optimizations that can be solved exactly and efficiently. We show that the methods we develop perform significantly better in de-convolution and compressed sensing applications, while being as computationally efficient as standard coefficient-wise approaches such as lasso. © 2011 IEEE.

Biologically-inspired object recognition system with features from complex wavelets

In this paper, a novel cortex-inspired feed-forward hierarchical object recognition system based on complex wavelets is proposed and tested. Complex wavelets contain three key properties for object representation: shift invariance, which enables the extraction of stable local features; good directional selectivity, which simplifies the determination of image orientations; and limited redundancy, which allows for efficient signal analysis using the multi-resolution decomposition offered by complex wavelets. In this paper, we propose a complete cortex-inspired object recognition system based on complex wavelets. We find that the implementation of the HMAX model for object recognition in [1, 2] is rather over-complete and includes too much redundant information and processing. We have optimized the structure of the model to make it more efficient. Specifically, we have used the Caltech 5 standard dataset to compare with Serre's model in [2] (which employs Gabor filter bands). Results demonstrate that the complex wavelet model achieves a speed improvement of about 4 times over the Serre model and gives comparable recognition performance. © 2011 IEEE.