Efeito fisiológico da cafeína em estudos neurológicos com base na ponderação em susceptibilidade ferromagnética (SWI)

Introdução – O presente estudo avaliou o efeito da cafeína no valor da razão contraste ruído (CNR) em imagens SWI. Objetivos – Avaliar o efeito da cafeína qualitativamente e quantificado pelo cálculo do valor CNR em imagens de magnitude e MIP para as estruturas: veia cerebral interna, seio sagital superior, tórcula e artéria cerebral média. Metodologia – A população do estudo incluiu 24 voluntários saudáveis que estiveram pelo menos 24h privados da ingestão de cafeína. Adquiriram-se imagens SWI antes e após a ingestão de 100ml de café. Os voluntários foram subdivididos em quatro grupos de seis indivíduos/grupo e avaliados separadamente após decorrido um intervalo de tempo diferente para cada grupo (15, 25, 30 ou 45min pós-cafeína). Utilizou-se um scanner Siemens Avanto 1,5 T com bobine standard de crânio e os parâmetros: T2* GRE 3D de alta resolução no plano axial, TR=49; TE=40; FA=15; FOV=187x230; matriz=221x320. O processamento de imagem foi efetuado no software OsiriX® e a análise estatística no GraphPadPrism®. Resultados e Discussão – As alterações de sinal e diferenças de contraste predominaram nas estruturas venosas e não foram significantes na substância branca, LCR e artéria cerebral média. Os valores CNR pré-cafeína diferiram significativamente do pós-cafeína nas imagens de magnitude e MIP na veia cerebral interna e nas imagens de magnitude do seio sagital superior e da tórcula (p<0,0001). Não se verificaram diferenças significativas entre os grupos avaliados nos diferentes tempos pós-cafeína. Conclusões – Especulamos que a cafeína possa vir a ser usada como agente de contraste nas imagens SWI barato, eficaz e de fácil administração.

The influence of the blood pressure on the venous cerebral flow measured by magnetic susceptibility (SWI) technique

Susceptibility Weighted Image (SWI) is a Magnetic Resonance Imaging (MRI) technique that combines high spatial resolution and sensitivity to provide magnetic susceptibility differences between tissues. It is extremely sensitive to venous blood due to its iron content of deoxyhemoglobin. The aim of this study was to evaluate, through the SWI technique, the differences in cerebral venous vasculature according to the variation of blood pressure values. 20 subjects divided in two groups (10 hypertensive and 10 normotensive patients) underwent a MRI system with a Siemens® scanner model Avanto of 1.5T using a synergy head coil (4 channels). The obtained sequences were T1w, T2w-FLAIR, T2* and SWI. The value of Contrast-to-Noise Ratio (CNR) was assessed in MinIP (Minimum Intensity Projection) and Magnitude images, through drawing free hand ROIs in venous structures: Superior Sagittal Sinus (SSS) Internal Cerebral Vein (ICV) and Sinus Confluence (SC). The obtained values were presented in descriptive statistics-quartiles and extremes diagrams. The results were compared between groups. CNR shown higher values for normotensive group in MinIP (108.89 ± 6.907) to ICV; (238.73 ± 18.556) to SC and (239.384 ± 52.303) to SSS. These values are bigger than images from Hypertensive group about 46 a.u. in average. Comparing the results of Magnitude and MinIP images, there were obtained lower CNR values for the hypertensive group. There were differences in the CNR values between both groups, being these values more expressive in the large vessels-SSS and SC. The SWI is a potential technique to evaluate and characterize the blood pressure variation in the studied vessels adding a physiological perspective to MRI and giving a new approach to the radiological vascular studies.

An Evaluation of Local Feature Combiners for Robot Visual Localization

In the last decade, local image features have been widely used in robot visual localization. To assess image similarity, a strategy exploiting these features compares raw descriptors extracted from the current image to those in the models of places. This paper addresses the ensuing step in this process, where a combining function must be used to aggregate results and assign each place a score. Casting the problem in the multiple classifier systems framework, we compare several candidate combiners with respect to their performance in the visual localization task. A deeper insight into the potential of the sum and product combiners is provided by testing two extensions of these algebraic rules: threshold and weighted modifications. In addition, a voting method, previously used in robot visual localization, is assessed. All combiners are tested on a visual localization task, carried out on a public dataset. It is experimentally demonstrated that the sum rule extensions globally achieve the best performance. The voting method, whilst competitive to the algebraic rules in their standard form, is shown to be outperformed by both their modified versions.

Espetroscopia (1H) por ressonância magnética do disco intervertebral lombar no adulto e sua aplicação na rotina imagiológica

Objetivos – Demonstrar o potencial da espetroscopia (1H) por ressonância magnética na doença degenerativa discal lombar e defender a integração desta técnica na rotina clínico‑imagiológica para a precisa classificação da involução vs degenerescência dos discos L4‑L5 e L5‑S1 em doentes com lombalgia não relacionável com causa mecânica. Material e métodos – O estudo incluiu 102 discos intervertebrais lombares de 123 doentes. Foram estudados 61 discos de L4‑L5, 41 discos de L5‑S1 e 34 discos de D12‑L1. Utilizou‑se um sistema de ressonância magnética de 1,5 T e técnica monovoxel. Obtiveram‑se os rácios [Lac/Nacetyl] e [Nacetyl/(Lac+Lípidos)] e aplicou‑se a ressonância de lípidos para avaliar a bioquímica do disco com o fim de conhecer o estado de involução vs degenerescência que o suscetibilizam para a instabilidade e sobrecarga. Avaliou‑se o comportamento dos rácios e do teor lipídico dos discos L4‑L5‑S1 e as diferenças apresentadas em relação a D12‑L1. Foi também realizada a comparação entre os discos L4‑L5, L5‑S1 e D12‑L1 na ponderação T2 (T2W), segundo a classificação ajustada (1‑4) de Pfirrmann. Resultados – Verificou‑se que os rácios e o valor dos lípidos dos discos L4‑L5‑S1 apresentaram diferenças estatisticamente significativas quando relacionados com os discos D12‑L1. O rácio [Lac/Nacetyl] em L4‑L5‑S1 mostrou‑se aumentado em relação a D12‑L1 (p=0,033 para os discos com grau de involução [1+2] e p=0,004 para os discos com grau [3+4]). Estes resultados sugerem que a involução vs degenerescência dos discos nos graus mais elevados condiciona um decréscimo do pico do Lactato. O rácio [Nacetyl/(Lac+Lip)] discrimina os graus de involução [1+2] do [3+4] no nível L4‑L5, apresentando os valores dos rácios (média 0,65 e 0,5 respetivamente com p=0,04). O rácio médio de [Nacetyl/(Lac+Lip)] dos discos L4‑L5 foi 1,8 vezes mais elevado do que em D12‑L1. O espetro lipídico em L4‑L5‑S1 nos graus mais elevados não mostrou ter uma prevalência constante quanto às frequências de ressonância. Conclusão – A espetroscopia (1H) dos discos intervertebrais poderá ter aplicação na discriminação dos graus de involução vs degenerescência e representar um contributo semiológico importante em suplemento à ponderação T2 convencional. As ressonâncias de lípidos dos discos L4‑L5 e L5‑S1, involuídos ou degenerados, devem ser avaliadas em relação a D12‑L1, utilizando este valor como referência, pois este último é o nível considerado estável e com baixa probabilidade de degenerescência.

Dinâmicas das relações da rede formal de saúde da criança maltratada na cidade do Barreiro

Mestrado em Intervenção Sócio-Organizacional na Saúde - Ramo de especialização: Qualidade e Tecnologias da Saúde

Task-based occupational exposure assessment and particle number concentration: two important data resources to perform risk assessment for occupational exposure to particles

Environment monitoring has an important role in occupational exposure assessment. However, due to several factors is done with insufficient frequency and normally don´t give the necessary information to choose the most adequate safety measures to avoid or control exposure. Identifying all the tasks developed in each workplace and conducting a task-based exposure assessment help to refine the exposure characterization and reduce assessment errors. A task-based assessment can provide also a better evaluation of exposure variability, instead of assessing personal exposures using continuous 8-hour time weighted average measurements. Health effects related with exposure to particles have mainly been investigated with mass-measuring instruments or gravimetric analysis. However, more recently, there are some studies that support that size distribution and particle number concentration may have advantages over particle mass concentration for assessing the health effects of airborne particles. Several exposure assessments were performed in different occupational settings (bakery, grill house, cork industry and horse stable) and were applied these two resources: task-based exposure assessment and particle number concentration by size. The results showed interesting results: task-based approach applied permitted to identify the tasks with higher exposure to the smaller particles (0.3 μm) in the different occupational settings. The data obtained allow more concrete and effective risk assessment and the identification of priorities for safety investments.

Exposição ocupacional a compostos orgânicos voláteis e a matéria particulada na limpeza automóvel em parques de estacionamento

Mestrado em Segurança e Higiene no Trabalho

Robot visual localization through local feature fusion: an evaluation of multiple classifiers combination approaches

In the last decade, local image features have been widely used in robot visual localization. In order to assess image similarity, a strategy exploiting these features compares raw descriptors extracted from the current image with those in the models of places. This paper addresses the ensuing step in this process, where a combining function must be used to aggregate results and assign each place a score. Casting the problem in the multiple classifier systems framework, in this paper we compare several candidate combiners with respect to their performance in the visual localization task. For this evaluation, we selected the most popular methods in the class of non-trained combiners, namely the sum rule and product rule. A deeper insight into the potential of these combiners is provided through a discriminativity analysis involving the algebraic rules and two extensions of these methods: the threshold, as well as the weighted modifications. In addition, a voting method, previously used in robot visual localization, is assessed. Furthermore, we address the process of constructing a model of the environment by describing how the model granularity impacts upon performance. All combiners are tested on a visual localization task, carried out on a public dataset. It is experimentally demonstrated that the sum rule extensions globally achieve the best performance, confirming the general agreement on the robustness of this rule in other classification problems. The voting method, whilst competitive with the product rule in its standard form, is shown to be outperformed by its modified versions.

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

Blind hyperspectral unmixing

Hyperspectral unmixing methods aim at the decomposition of a hyperspectral image into a collection endmember signatures, i.e., the radiance or reflectance of the materials present in the scene, and the correspondent abundance fractions at each pixel in the image. This paper introduces a new unmixing method termed dependent component analysis (DECA). This method is blind and fully automatic and it overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. DECA is based on the linear mixture model, i.e., each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abundances are modeled as mixtures of Dirichlet densities, thus enforcing the non-negativity and constant sum constraints, imposed by the acquisition process. The endmembers signatures are inferred by a generalized expectation-maximization (GEM) type algorithm. The paper illustrates the effectiveness of DECA on synthetic and real hyperspectral images.

Hyperspectral unmixing algorithm via dependent component analysis

This paper introduces a new method to blindly unmix hyperspectral data, termed dependent component analysis (DECA). This method decomposes a hyperspectral images into a collection of reflectance (or radiance) spectra of the materials present in the scene (endmember signatures) and the corresponding abundance fractions at each pixel. DECA assumes that each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abudances are modeled as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. This method overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. The effectiveness of the proposed method is illustrated using simulated data based on U.S.G.S. laboratory spectra and real hyperspectral data collected by the AVIRIS sensor over Cuprite, Nevada.