2007
Authors
Carvalhal, MIM; Vasconcelos-Raposo, J;
Publication
Motricidade
Abstract
2007
Authors
Isabel Costa, MI; Soares, S; Assuncao, P; Barroso, J;
Publication
2007 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS, PROCEEDINGS, VOLS 1-8
Abstract
Nowadays there are specific video equipments which allow acquisition at very high frame rates, e.g., up to 5000 fps. When observing a high frame rate sequence, it becomes noticeable that a great percentage of the frames' pixels values do not suffer great changes along the sequence. Hence, if a pixel's value remains the same, then a unique sample is enough to represent that particular pixel over several frames. Only pixels that suffer great variations require a higher number of samples to be correctly represented. This work reports a methodology that combines compression and reconstruction techniques to evaluate an alternative to the traditional compression methods 25/30 fps. In the proposed method, sets of pixels are extracted along the temporal direction and by exploiting the high temporal correlation of the signals, a proper decimation process is applied in order to create a sequence with a lower number of frames and consequently smaller rile size. The main objective is to propose a new compression methodology that will take advantage of the signal characteristics using both compression and reconstruction techniques.
2007
Authors
Costelha, H; Lima, P;
Publication
2007 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-9
Abstract
This paper introduces Petri net based models of robotic tasks, which can be used to analyse and synthesise task plans, taking into account a Petri net model that abstracts the relevant features from the robot environment as well. Logical analysis concerning deadlocks and resource conservation can be performed over the ordinary version of the model. A task plan modeled by a Petri net can be extracted from the generalised stochastic version of the model, representing the optimal plan given a probabilistic measure of uncertainty associated to the effects of its composing actions. The Petri net representing the model is suitable for being ran directly within the code, as well as for plan monitoring during execution time. Simulation results illustrating the methodology are presented for a robotic soccer scenario.
2007
Authors
Moura, DC; Correia, MV; Barbosa, JG; Reis, AM; Laranjeira, M; Gomes, E;
Publication
COMPUTATIONAL MODELLING OF OBJECTS REPRESENTED IN IMAGES: FUNDAMENTALS, METHODS AND APPLICATIONS
Abstract
In this paper we will describe our experiments with x-ray image analysis for vertebra detection in juvenile/adolescent patients with idiopathic scoliotic spines. We will focus on detecting vertebrae location in a anterior-posterior x-ray image in a fully automatic way. For accomplishing this, we propose a set of techniques for (i) isolating the spine by removing other bone structures (e.g. ribs), (ii) detecting vertebrae location along the spine using an hierarchical and progressive threshold analysis, and (iii) detecting vertebrae lateral boundaries.
2007
Authors
Vasconcelos-Raposo, J; Lázaro, JP; Teixeira, C; Mota, MP; Fernandes, HM;
Publication
Motricidade
Abstract
2007
Authors
Moyano, CF; Lopes, JAP;
Publication
Renewable Energy and Power Quality Journal
Abstract
The present paper describes an optimization strategy, to be adopted at the wind park control level, especially for those with large power output, that allow to define the commitment of the wind turbines and their active and reactive set points following requests from the wind park dispatch centers, assuming that individual wind turbines short term wind power forecasts are known and are expressed as power availability. This approach was also developed with a concern on the minimization of the connection / disconnection of the individual wind generators, for a given time horizon, and takes also into account restrictions in the limits for reactive power generated at the wind turbines.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.