Segmentation of RV in 4D Cardiac MR Volumes using region-merging graph cuts

Non-invasive quantitative assessment of the right ventricular anatomical and functional parameters is a challenging task. We present a semi-automatic approach for right ventricle (RV) segmentation from 4D MR images in two variants, which differ in the amount of user interaction. The method consists of three main phases: First, foreground and background markers are generated from the user input. Next, an over-segmented region image is obtained applying a watershed transform. Finally, these regions are merged using 4D graph-cuts with an intensity based boundary term. For the first variant the user outlines the inside of the RV wall in a few end-diastole slices, for the second two marker pixels serve as starting point for a statistical atlas application. Results were obtained by blind evaluation on 16 testing 4D MR volumes. They prove our method to be robust against markers location and place it favourably in the ranks of existing approaches.

Automatized connection of the layers of planar transformers with parallel windings to improve the component behavior

Transformers with parallel windings are commonly used to reduce the losses in the windings. Windings losses depend on the winding positioning and the frequency effects because each winding affects the current sharing of itself and the neighboring windings. In this paper a methodology for determining the connections of the parallel windings that reduces the power losses (and temperature) in the windings of multi-winding transformers is presented. Other applications of the method, such as balanced current sharing and voltage drop reduction are also explored. In this paper a methodology for determining the connections of the parallel windings that reduces the power losses (and temperature) in the windings of multi-winding transformers is presented. Other applications of the method, such as balanced current sharing and voltage drop reduction are also explored.

An alternative for reducing the layers in the construction of three-phase planar transformers

A modified winding layout for three-phase transformers with PCB windings is proposed in this paper. This modified layout can be used in high current transformers with many PCB layers to simplify the fabrication process. One of the key factors that might increase the cost and complexity in the construction of planar transformers is the number of layers of each PCB winding. This issue becomes even more important in medium-high power three-phase transformers, where the number of PCB layers is higher. In addition to that, the proposed method allows the use of commercial core shapes that are commonly used to design single-phase transformers. This fact makes possible the reduction of cost and flexibility of the design solutions. The proposed solution has been validated and compared using the conventional and the proposed methodologies to design a high power (20 kW) transformer.

Homogeneous links and the Seifert matrix

Homogeneous links were introduced by Peter Cromwell, who pr oved that the projection surface of these links, that given by the Seifert al- gorithm, has minimal genus. Here we provide a different proof , with a geometric rather than combinatorial flavor. To do this, we fir st show a direct relation between the Seifert matrix and the decompo sition into blocks of the Seifert graph. Precisely, we prove that the Sei fert matrix can be arranged in a block triangular form, with small boxes in th e diagonal corresponding to the blocks of the Seifert graph. Then we pro ve that the boxes in the diagonal has non-zero determinant, by looking a t an explicit matrix of degrees given by the planar structure of the Seifer t graph. The paper contains also a complete classification of the homogen eous knots of genus one.

On the design of a planar phased array radar antenna architecture for space debris situational awareness

The Space Situational Awareness (SSA) program from the European Space Agency (ESA) protects Europe's citizens and their satellite-based services by detecting space hazards. ESA Ground Systems (GS) division is currently designing a phased array radar composed of thousands of radiating elements for future stages of the SSA program [1]. The radar shall guarantee the detection of most of the Low Earth Orbit (LEO) space debris, providing a general map of space junk. While range accuracy is mainly dictated by the radar waveform, the detection and tracking of small objects in LEO regimes is highly dependent on the angular accuracy achieved by the smart phased array antenna, demonstrating the important of the performance of this architecture.

GEODA-SARAS: Multi-Phased array planar antenna for satellite communications

Nowadays, earth stations have as a common feature the use of large reflector antenna for downloading data from satellites. Large reflectors have impairments such as mechanical complexity, low flexibility and high cost. Thus, the feasibility of other antenna technologies must be evaluated, such as conformal adaptive antennas based on multiple planar active arrays. In the scenery under study, the capability to track several satellites simultaneously, higher flexibility, lower production and maintenance cost, modularity and a more efficient use of the spectrum; are the most important advantage to boost up active antenna arrays over large dishes.

300 GHz CMOS video detection using broadband and active planar antennas

Using CMOS transistors for terahertz detection is currently a disruptive technology that offers the direct integration of a terahertz detector with video preamplifiers. The detectors are based on the resistive mixer concept and performance mainly depends on the following parameters: type of antenna, electrical parameters (gate to drain capacitor and channel length of the CMOS device) and foundry. Two different 300 GHz detectors are discussed: a single transistor detector with a broadband antenna and a differential pair driven by a resonant patch antenna.

Hierarchical graph maps for visualization of collaborative recommender systems

In this paper we provide a method that allows the visualization of similarity relationships present between items of collaborative filtering recommender systems, as well as the relative importance of each of these. The objective is to offer visual representations of the recommender system?s set of items and of their relationships; these graphs show us where the most representative information can be found and which items are rated in a more similar way by the recommender system?s community of users. The visual representations achieved take the shape of phylogenetic trees, displaying the numerical similarity and the reliability between each pair of items considered to be similar. As a case study we provide the results obtained using the public database Movielens 1M, which contains 3900 movies.

Planar point sets with large minimum convex decompositions

We show the existence of sets with n points (n ? 4) for which every convex decomposition contains more than (35/32)n?(3/2) polygons,which refutes the conjecture that for every set of n points there is a convex decomposition with at most n+C polygons. For sets having exactly three extreme pointswe show that more than n+sqr(2(n ? 3))?4 polygons may be necessary to form a convex decomposition.

A new label fusion method using graph cuts: application to hippocampus segmentation

The aim of this paper is to develop a probabilistic modeling framework for the segmentation of structures of interest from a collection of atlases. Given a subset of registered atlases into the target image for a particular Region of Interest (ROI), a statistical model of appearance and shape is computed for fusing the labels. Segmentations are obtained by minimizing an energy function associated with the proposed model, using a graph-cut technique. We test different label fusion methods on publicly available MR images of human brains.

DROMO formulation for planar motions: Solution to the Tsien Problem

The two-body problem subject to a constant radial thrust is analyzed as a planar motion. The description of the problem is performed in terms of three perturbation methods: DROMO and two others due to Deprit. All of them rely on Hansen?s ideal frame concept. An explicit, analytic, closed-form solution is obtained for this problem when the initial orbit is circular (Tsien problem), based on the DROMO special perturbation method, and expressed in terms of elliptic integral functions. The analytical solution to the Tsien problem is later used as a reference to test the numerical performance of various orbit propagation methods, including DROMO and Deprit methods, as well as Cowell and Kustaanheimo?Stiefel methods.

Heterogeneous architecture for the optimization of large-scale graph processing data centres

Con el auge del Cloud Computing, las aplicaciones de proceso de datos han sufrido un incremento de demanda, y por ello ha cobrado importancia lograr m�ás eficiencia en los Centros de Proceso de datos. El objetivo de este trabajo es la obtenci�ón de herramientas que permitan analizar la viabilidad y rentabilidad de diseñar Centros de Datos especializados para procesamiento de datos, con una arquitectura, sistemas de refrigeraci�ón, etc. adaptados. Algunas aplicaciones de procesamiento de datos se benefician de las arquitecturas software, mientras que en otras puede ser m�ás eficiente un procesamiento con arquitectura hardware. Debido a que ya hay software con muy buenos resultados en el procesamiento de grafos, como el sistema XPregel, en este proyecto se realizará una arquitectura hardware en VHDL, implementando el algoritmo PageRank de Google de forma escalable. Se ha escogido este algoritmo ya que podr��á ser m�ás eficiente en arquitectura hardware, debido a sus características concretas que se indicaráan m�ás adelante. PageRank sirve para ordenar las p�áginas por su relevancia en la web, utilizando para ello la teorí��a de grafos, siendo cada página web un vértice de un grafo; y los enlaces entre páginas, las aristas del citado grafo. En este proyecto, primero se realizará un an�álisis del estado de la técnica. Se supone que la implementaci�ón en XPregel, un sistema de procesamiento de grafos, es una de las m�ás eficientes. Por ello se estudiará esta �ultima implementaci�ón. Sin embargo, debido a que Xpregel procesa, en general, algoritmos que trabajan con grafos; no tiene en cuenta ciertas caracterí��sticas del algoritmo PageRank, por lo que la implementaci�on no es �optima. Esto es debido a que en PageRank, almacenar todos los datos que manda un mismo v�értice es un gasto innecesario de memoria ya que todos los mensajes que manda un vértice son iguales entre sí e iguales a su PageRank. Se realizará el diseño en VHDL teniendo en cuenta esta caracter��ística del citado algoritmo,evitando almacenar varias veces los mensajes que son iguales. Se ha elegido implementar PageRank en VHDL porque actualmente las arquitecturas de los sistemas operativos no escalan adecuadamente. Se busca evaluar si con otra arquitectura se obtienen mejores resultados. Se realizará un diseño partiendo de cero, utilizando la memoria ROM de IPcore de Xillinx (Software de desarrollo en VHDL), generada autom�áticamente. Se considera hacer cuatro tipos de módulos para que as�� el procesamiento se pueda hacer en paralelo. Se simplificar�á la estructura de XPregel con el fin de intentar aprovechar la particularidad de PageRank mencionada, que hace que XPregel no le saque el m�aximo partido. Despu�és se escribirá el c�ódigo, realizando una estructura escalable, ya que en la computación intervienen millones de páginas web. A continuación, se sintetizar�á y se probará el código en una FPGA. El �ultimo paso será una evaluaci�ón de la implementaci�ón, y de posibles mejoras en cuanto al consumo.

Inorganic Photovoltaics - Planar and Nanostructured Devices

Since its invention in the 1950s, semiconductor solar cell technology has evolved in great leaps and bounds. Solar power is now being considered as a serious leading contender for replacing fossil fuel based power generation. This article reviews the evolution and current state, and potential areas of near future research focus, of leading inorganic materials based solar cells, including bulk crystalline, amorphous thin-films, and nanomaterials based solar cells. Bulk crystalline silicon solar cells continue to dominate the solar power market, and continued efforts at device fabrication improvements, and device topology advancements are discussed. III-V compound semiconductor materials on c-Si for solar power generation are also reviewed. Developments in thin-film based solar cells are reviewed, with a focus on amorphous silicon, copper zinc tin sulfide, cadmium telluride, as well as nanostructured Cadmium telluride. Recent developments in the use of nano-materials for solar power generation, including silicon and gallium arsenide nanowires, are also reviewed.

A source reconstruction technique for planar arrays of wide slots

A method to reconstruct the excitation coefficients of wide-slot arrays from near-field data is presented. The plane wave spectrum (PWS) is used for reconstruction, and the shape of the field distribution on a wide slot is considered in the calculation of the PWS. The proposed algorithm is validated through the reconstruction of the excitation coefficients of a wide-slot array with element failures from the simulated nearfield data. The element failures are clearly located by the proposed algorithm

Pedestrian Motion Prediction: A Graph Based Approach

A novel pedestrian motion prediction technique is presented in this paper. Its main achievement regards to none previous observation, any knowledge of pedestrian trajectories nor the existence of possible destinations is required; hence making it useful for autonomous surveillance applications. Prediction only requires initial position of the pedestrian and a 2D representation of the scenario as occupancy grid. First, it uses the Fast Marching Method (FMM) to calculate the pedestrian arrival time for each position in the map and then, the likelihood that the pedestrian reaches those positions is estimated. The technique has been tested with synthetic and real scenarios. In all cases, accurate probability maps as well as their representative graphs were obtained with low computational cost.