Optimal inverter design for an induction machine using resonant frequency matching

The frequency responses of two 50 Hz and one 400 Hz induction machines have been measured experimentally over a frequency range of 1 kHz to 400 kHz. This study has shown that the stator impedances of the machines behave in a similar manner to a parallel resonant circuit, and hence have a resonant point at which the Input impedance of the machine is at a maximum. This maximum impedance point was found experimentally to be as low as 33 kHz, which is well within the switching frequency ranges of modern inverter drives. This paper investigates the possibility of exploiting the maximum impedance point of the machine, by taking it into consideration when designing an inverter, in order to minimize ripple currents due to the switching frequency. Minimization of the ripple currents would reduce torque pulsation and losses, increasing overall performance. A modified machine model was developed to take into account the resonant point, and this model was then simulated with an inverter to demonstrate the possible advantages of matching the inverter switching frequency to the resonant point. Finally, in order to experimentally verify the simulated results, a real inverter with a variable switching frequency was used to drive an induction machine. Experimental results are presented.

Improved Fault Location on Distribution Feeders Based on Matching During-Fault Voltage Sags

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

ECM versus ICP for point registration

Iterative Closest Point (ICP) is a widely exploited method for point registration that is based on binary point-to-point assignments, whereas the Expectation Conditional Maximization (ECM) algorithm tries to solve the problem of point registration within the framework of maximum likelihood with point-to-cluster matching. In this paper, by fulfilling the implementation of both algorithms as well as conducting experiments in a scenario where dozens of model points must be registered with thousands of observation points on a pelvis model, we investigated and compared the performance (e.g. accuracy and robustness) of both ICP and ECM for point registration in cases without noise and with Gaussian white noise. The experiment results reveal that the ECM method is much less sensitive to initialization and is able to achieve more consistent estimations of the transformation parameters than the ICP algorithm, since the latter easily sinks into local minima and leads to quite different registration results with respect to different initializations. Both algorithms can reach the high registration accuracy at the same level, however, the ICP method usually requires an appropriate initialization to converge globally. In the presence of Gaussian white noise, it is observed in experiments that ECM is less efficient but more robust than ICP.

Accuracy of navigated surgery of the pelvis after surface matching with an a-mode ultrasound probe

Computer-aided surgery (CAS) allows for real-time intraoperative feedback resulting in increased accuracy, while reducing intraoperative radiation. CAS is especially useful for the treatment of certain pelvic ring fractures, which necessitate the precise placement of screws. Flouroscopy-based CAS modules have been developed for many orthopedic applications. The integration of the isocentric flouroscope even enables navigation using intraoperatively acquired three-dimensional (3D) data, though the scan volume and imaging quality are limited. Complicated and comprehensive pathologies in regions like the pelvis can necessitate a CT-based navigation system because of its larger field of view. To be accurate, the patient's anatomy must be registered and matched with the virtual object (CT data). The actual precision within the region of interest depends on the area of the bone where surface matching is performed. Conventional surface matching with a solid pointer requires extensive soft tissue dissection. This contradicts the primary purpose of CAS as a minimally invasive alternative to conventional surgical techniques. We therefore integrated an a-mode ultrasound pointer into the process of surface matching for pelvic surgery and compared it to the conventional method. Accuracy measurements were made in two pelvic models: a foam model submerged in water and one with attached porcine muscle tissue. Three different tissue depths were selected based on CT scans of 30 human pelves. The ultrasound pointer allowed for registration of virtually any point on the pelvis. This method of surface matching could be successfully integrated into CAS of the pelvis.

Progress in Simulations with Twisted Mass Fermions at the Physical Point

In this contribution, results from Nf = 2 lattice QCD simulations at one lattice spacing using twisted mass fermions with a clover term at the physical pion mass are presented. The mass splitting between charged and neutral pions (including the disconnected contribution) is shown to be around 20(20) MeV. Further, a first measurement using the clover twisted mass action of the average momentum fraction of the pion is given. Finally, an analysis of pseudoscalar meson masses and decay constants is presented involving linear interpolations in strange and charm quark masses. Matching to meson mass ratios allows the calculation of quark mass ratios: ms=ml = 27:63(13), mc=ml = 339:6(2:2) and mc=ms = 12:29(10). From this mass matching the quantities fK = 153:9(7:5) MeV, fD = 219(11) MeV, fDs = 255(12) MeV and MDs = 1894(93) MeV are determined without the application of finite volume or discretization artefact corrections and with errors dominated by a preliminary estimate of the lattice spacing.

Aerial video geo-registration using terrain models from dense and coherent stereo matching

In the context of aerial imagery, one of the first steps toward a coherent processing of the information contained in multiple images is geo-registration, which consists in assigning geographic 3D coordinates to the pixels of the image. This enables accurate alignment and geo-positioning of multiple images, detection of moving objects and fusion of data acquired from multiple sensors. To solve this problem there are different approaches that require, in addition to a precise characterization of the camera sensor, high resolution referenced images or terrain elevation models, which are usually not publicly available or out of date. Building upon the idea of developing technology that does not need a reference terrain elevation model, we propose a geo-registration technique that applies variational methods to obtain a dense and coherent surface elevation model that is used to replace the reference model. The surface elevation model is built by interpolation of scattered 3D points, which are obtained in a two-step process following a classical stereo pipeline: first, coherent disparity maps between image pairs of a video sequence are estimated and then image point correspondences are back-projected. The proposed variational method enforces continuity of the disparity map not only along epipolar lines (as done by previous geo-registration techniques) but also across them, in the full 2D image domain. In the experiments, aerial images from synthetic video sequences have been used to validate the proposed technique.

A stable graph-based representation for object recognition through high-order matching

Many Object recognition techniques perform some flavour of point pattern matching between a model and a scene. Such points are usually selected through a feature detection algorithm that is robust to a class of image transformations and a suitable descriptor is computed over them in order to get a reliable matching. Moreover, some approaches take an additional step by casting the correspondence problem into a matching between graphs defined over feature points. The motivation is that the relational model would add more discriminative power, however the overall effectiveness strongly depends on the ability to build a graph that is stable with respect to both changes in the object appearance and spatial distribution of interest points. In fact, widely used graph-based representations, have shown to suffer some limitations, especially with respect to changes in the Euclidean organization of the feature points. In this paper we introduce a technique to build relational structures over corner points that does not depend on the spatial distribution of the features. © 2012 ICPR Org Committee.

GPX - Gardens Point XML Information Retrieval at INEX 2004

Traditional information retrieval (IR) systems respond to user queries with ranked lists of relevant documents. The separation of content and structure in XML documents allows individual XML elements to be selected in isolation. Thus, users expect XML-IR systems to return highly relevant results that are more precise than entire documents. In this paper we describe the implementation of a search engine for XML document collections. The system is keyword based and is built upon an XML inverted file system. We describe the approach that was adopted to meet the requirements of Content Only (CO) and Vague Content and Structure (VCAS) queries in INEX 2004.