Differences in the antigenic profile of bloodstream and cell culture derived trypomastigotes of Trypanosoma cruzi

A comparative study of the antigenic profile of bloodstream and cell culture derived trypomastigotes showed many differences in their components. Using mouse anti-T. cruzi antibodies the differences were located mostly in the 120 kDa band, whereas using chagasic patient sera the differences were located in the 85 and 52 kDa bands. These findings might explain known physiological differences between trypomatigotes obtained from cell culture and from infected blood. A brief report of this work has already been published9.

Simultaneous identification of Trypanosoma cruzi surface and internal antigens reactive to different immunoglobulin classes (radio-immunoblotting)

A radioactive Western-blotting technique was developed by which the reactivity of Immunoglobulins (Igs) from different classes to both membrane radiolabelled and internal parasite antigens is simultaneously identified. The method includes radioiodination of parasites, polypeptide fractionation by SDS-PAGE, Western-blot transfer and autoradiography of the immunoblots developed with anti-Igs conjugates labelled with enzymes. The analysis is then performed by the comparison of common bands on the autoradiograms and the respective substrate stained nitrocellulose blots. This technique was used to analyse T. cruzi trypomastigote surface labelled antigens reactive to IgM, IgA and IgG specific antibodies. A different pattern of reactivity with acute Chagas' disease patients sera was thus obtained.

O Processo de internacionalização da música portuguesa: contexto histórico, desafios atuais e futuro

Dissertação de Mestrado apresentada ao Instituto de Contabilidade e Administração do Porto para a obtenção do grau de Mestre em Empreendedorismo e Internacionalização, sob orientação do Professor Doutor Freitas Santos

Immunoelectrophoretic study on common antigens of São Lourenço da Mata and Belo Horizonte strains of Schistosoma mansoni adult worms and Biomphalaria snails

Immunoelectrophoretic studies on common antigens were carried out by using rabbits sera immunized against São Lourenço da Mata and Belo Horizonte strains of Schistosoma mansoni adult worms and antigens of Biomphalaria glabrata pigmented (Jaboatão - PE); B. glabrata albino (Belo Horizonte - MG) and B. straminea (São Lourenço da Mata, PE). Furthermore, the reverse approach was proceeded, namely, sera anti Biomphalaria snails produced in rabbits were tested against both strains of Schistosoma adult worm antigens. The analysis of the common antigens between the SLM strains of S. mansoni adult worm and B. glabrata pigmented showed 8 to 9 precipitin bands, 3 bands with B. glabrata albino and only 1 band with B. straminea crude extracts. On the other hand, the BH strain of S. mansoni adult worm antisera produced 6 to 7 bands with B. glabrata pigmented, 5 bands with B. glabrata albino and 1 band with B. straminea antigenic extract. Biomphalaria snails crude extracts were fractionated by Sephadex G-100 column and three fractions were collected from each snail strain. The fractions were tested with anti SLM and BH strains of S. mansoni adult worm sera by immunoelectrophoresis. The common antigens fractionated from Biomphalaria snails crude extracts and those found for both strains of S. mansoni adult worm mostly existed in the first fraction and they were estimated to have molecular weight over 158,000 daltons. In our laboratory, it was found a relationship between the antigenic similarities and experimental infection rates of S. mansoni towards Biomphalaria snails so that more bands were seen with increasing infection rates of S. mansoni.

Rheo-optical characterization of liquid crystalline acetoxypropylcellulose melt undergoing large shear flow and relaxation after flow cessation

The rheological and structural characteristics of acetoxypropylcellulose (APC) nematic melt are studied at shear rates ranging from 10 s(-1) to 1000 s(-1) which are relevant to extrusion based processes. APC shows a monotonic shear thinning behavior over the range of shear rates tested. The negative extrudate-swell shows a minimum when a critical shear rate (gamma) over dot(c) is reached. For shear rates smaller than (gamma) over dot(c), the flow-induced texture consists of two set of bands aligned parallel and normal to the flow direction. At shear rates larger than (gamma) over dot(c), the flow induced texture is reminiscent of a 2 fluids structure. Close to the shearing walls, domains elongated along the flow direction and stacked along the vorticity are imaged with POM, whereas SALS patterns indicate that the bulk of the sheared APC is made of elliptical domains oriented along the vorticity. No full nematic alignment is achieved at the largest shear rate tested. Below (gamma) over dot(c), the stress relaxation is described by a stretched exponential. Above (gamma) over dot(c), the stress relaxation is described by a fast and a slow process. The latter coincides with the growth of normal bands thicknesses, as the APC texture after flow cessation consists of two types of bands with parallel and normal orientations relative to the flow direction. Both bands thicknesses do not depend on the applied shear rate, in contrast to their orientation. (C) 2015 Elsevier Ltd. All rights reserved.

Antimicrobial resistance and plasmid detection in strains of the Bacteroides fragilis group

Resistant populations of the Bacteroides fragilis group bacteria (two reference ones and two isolated from human and Callithrix penicillata marmoset) were obtained by the gradient plate technique, to clindamycin, penicillin G, metronidazole and mercuric chloride. All the four tested strains were originaly susceptible to the four antimicrobial drugs at the breakpoint used in this study. MICs determination for the four cultures gave constant values for each antimicrobial, on the several steps by the gradient plate technique. The intestinal human B. fragilis strains showed three DNA bands, that could be representative of only two plasmids in the closed covalently circular (CCC) form with molecular weights of approximately 25 and 2.5 Md. The results do not permit an association between the presence of plasmid in the human strain with the susceptibility to the studied drugs. The four strains were ß-lactamase negative in the two methods used, and no particular chromosomal genetic resistance marker was demonstred. The resistance (MIC) observed, after contact with penicillin G and mercuric chloride, were two-fold in the four tested strains

A hybrid procedure to identify the optimal stiffness coefficients of elastically restrained beams

The formulation of a bending vibration problem of an elastically restrained Bernoulli-Euler beam carrying a finite number of concentrated elements along its length is presented. In this study, the authors exploit the application of the differential evolution optimization technique to identify the torsional stiffness properties of the elastic supports of a Bernoulli-Euler beam. This hybrid strategy allows the determination of the natural frequencies and mode shapes of continuous beams, taking into account the effect of attached concentrated masses and rotational inertias, followed by a reconciliation step between the theoretical model results and the experimental ones. The proposed optimal identification of the elastic support parameters is computationally demanding if the exact eigenproblem solving is considered. Hence, the use of a Gaussian process regression as a meta-model is addressed. An experimental application is used in order to assess the accuracy of the estimated parameters throughout the comparison of the experimentally obtained natural frequency, from impact tests, and the correspondent computed eigenfrequency.

Parallel GPU architecture for hyperspectral unmixing based on augmented Lagrangian method

Hyperspectral imaging has become one of the main topics in remote sensing applications, which comprise hundreds of spectral bands at different (almost contiguous) wavelength channels over the same area generating large data volumes comprising several GBs per flight. This high spectral resolution can be used for object detection and for discriminate between different objects based on their spectral characteristics. One of the main problems involved in hyperspectral analysis is the presence of mixed pixels, which arise when the spacial resolution of the sensor is not able to separate spectrally distinct materials. Spectral unmixing is one of the most important task for hyperspectral data exploitation. However, the unmixing algorithms can be computationally very expensive, and even high power consuming, which compromises the use in applications under on-board constraints. In recent years, graphics processing units (GPUs) have evolved into highly parallel and programmable systems. Specifically, several hyperspectral imaging algorithms have shown to be able to benefit from this hardware taking advantage of the extremely high floating-point processing performance, compact size, huge memory bandwidth, and relatively low cost of these units, which make them appealing for onboard data processing. In this paper, we propose a parallel implementation of an augmented Lagragian based method for unsupervised hyperspectral linear unmixing on GPUs using CUDA. The method called simplex identification via split augmented Lagrangian (SISAL) aims to identify the endmembers of a scene, i.e., is able to unmix hyperspectral data sets in which the pure pixel assumption is violated. The efficient implementation of SISAL method presented in this work exploits the GPU architecture at low level, using shared memory and coalesced accesses to memory.

Parallel hyperspectral compressive sensing method on GPU

Remote hyperspectral sensors collect large amounts of data per flight usually with low spatial resolution. It is known that the bandwidth connection between the satellite/airborne platform and the ground station is reduced, thus a compression onboard method is desirable to reduce the amount of data to be transmitted. This paper presents a parallel implementation of an compressive sensing method, called parallel hyperspectral coded aperture (P-HYCA), for graphics processing units (GPU) using the compute unified device architecture (CUDA). This method takes into account two main properties of hyperspectral dataset, namely the high correlation existing among the spectral bands and the generally low number of endmembers needed to explain the data, which largely reduces the number of measurements necessary to correctly reconstruct the original data. Experimental results conducted using synthetic and real hyperspectral datasets on two different GPU architectures by NVIDIA: GeForce GTX 590 and GeForce GTX TITAN, reveal that the use of GPUs can provide real-time compressive sensing performance. The achieved speedup is up to 20 times when compared with the processing time of HYCA running on one core of the Intel i7-2600 CPU (3.4GHz), with 16 Gbyte memory.

Parallel hyperspectral coded aperture for compressive sensing on GPUs

The application of compressive sensing (CS) to hyperspectral images is an active area of research over the past few years, both in terms of the hardware and the signal processing algorithms. However, CS algorithms can be computationally very expensive due to the extremely large volumes of data collected by imaging spectrometers, a fact that compromises their use in applications under real-time constraints. This paper proposes four efficient implementations of hyperspectral coded aperture (HYCA) for CS, two of them termed P-HYCA and P-HYCA-FAST and two additional implementations for its constrained version (CHYCA), termed P-CHYCA and P-CHYCA-FAST on commodity graphics processing units (GPUs). HYCA algorithm exploits the high correlation existing among the spectral bands of the hyperspectral data sets and the generally low number of endmembers needed to explain the data, which largely reduces the number of measurements necessary to correctly reconstruct the original data. The proposed P-HYCA and P-CHYCA implementations have been developed using the compute unified device architecture (CUDA) and the cuFFT library. Moreover, this library has been replaced by a fast iterative method in the P-HYCA-FAST and P-CHYCA-FAST implementations that leads to very significant speedup factors in order to achieve real-time requirements. The proposed algorithms are evaluated not only in terms of reconstruction error for different compressions ratios but also in terms of computational performance using two different GPU architectures by NVIDIA: 1) GeForce GTX 590; and 2) GeForce GTX TITAN. Experiments are conducted using both simulated and real data revealing considerable acceleration factors and obtaining good results in the task of compressing remotely sensed hyperspectral data sets.

Evaluation of the double diffusion, enzyme immunoassay and immunoblotting techniques, for the diagnosis of human hydatid disease in tropical areas

Hydatid disease in tropical areas poses a serious diagnostic problem due to the high frequence of cross-reactivity with other endemic helminthic infections. The enzyme-linked-immunosorbent assay (ELISA) and the double diffusion arc 5 showed respectively a sensitivity of 73% and 57% and a specificity of 84-95% and 100%. However, the specificity of ELISA was greatly increased by using ovine serum and phosphorylcholine in the diluent buffer. The hydatic antigen obtained from ovine cyst fluid showed three main protein bands of 64,58 and 30 KDa using SDS PAGE and immunoblotting. Sera from patients with onchocerciasis, cysticercosis, toxocariasis and Strongyloides infection cross-reacted with the 64 and 58 KDa bands by immunoblotting. However, none of the analyzed sera recognized the 30 KDa band, that seems to be specific in this assay. The immunoblotting showed a sensitivity of 80% and a specificity of 100% when used to recognize the 30 KDa band.

The diagnostic importance of species specific and cross-reactive components of Taenia solium, Echinococcus granulosus, and Hymenolepis nana

Sera from patients infected with Taenia solium, Hymenolepis nana and Echinococcus granulosus were tested against homologous and heterologous parasite antigens using an ELISA assay, and a high degree of cross-reactivity was verified. To identify polypeptides responsible for this cross reactivity, the Enzyme Linked Immunoelectro Transfer Blot (EITB) was used. Sera from infected patients with T.solium, H.nana, and E.granulosus were assessed against crude, ammonium sulphate precipitated (TSASP), and lentil-lectin purified antigens of T.solium and crude antigens of.H.nana and E.granulosus. Several bands, recognized by sera from patients with T.solium, H.nana, and E.granulosus infections, were common to either two or all three cestodes. Unique reactive bands in H.nana were noted at 49 and 66 K-Da and in E.granulosus at 17-21 K-Da and at 27-32 K-Da. In the crude cysticercosis extract, a specific non glycoprotein band was present at 61-67 K-Da in addiction to specific glycoprotein bands of 50, 42, 24, 21, 18, 14, and 13 K-Da. None of the sera from patients with H.nana or E.granulosus infection cross reacted with these seven glycoprotein bands considered specific for T.solium infection.

Unmixing hyperspectral data: independent and dependent component analysis

The development of high spatial resolution airborne and spaceborne sensors has improved the capability of ground-based data collection in the fields of agriculture, geography, geology, mineral identification, detection [2, 3], and classification [4–8]. The signal read by the sensor from a given spatial element of resolution and at a given spectral band is a mixing of components originated by the constituent substances, termed endmembers, located at that element of resolution. This chapter addresses hyperspectral unmixing, which is the decomposition of the pixel spectra into a collection of constituent spectra, or spectral signatures, and their corresponding fractional abundances indicating the proportion of each endmember present in the pixel [9, 10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. The linear mixing model holds when the mixing scale is macroscopic [13]. The nonlinear model holds when the mixing scale is microscopic (i.e., intimate mixtures) [14, 15]. The linear model assumes negligible interaction among distinct endmembers [16, 17]. The nonlinear model assumes that incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [18]. Under the linear mixing model and assuming that the number of endmembers and their spectral signatures are known, hyperspectral unmixing is a linear problem, which can be addressed, for example, under the maximum likelihood setup [19], the constrained least-squares approach [20], the spectral signature matching [21], the spectral angle mapper [22], and the subspace projection methods [20, 23, 24]. Orthogonal subspace projection [23] reduces the data dimensionality, suppresses undesired spectral signatures, and detects the presence of a spectral signature of interest. The basic concept is to project each pixel onto a subspace that is orthogonal to the undesired signatures. As shown in Settle [19], the orthogonal subspace projection technique is equivalent to the maximum likelihood estimator. This projection technique was extended by three unconstrained least-squares approaches [24] (signature space orthogonal projection, oblique subspace projection, target signature space orthogonal projection). Other works using maximum a posteriori probability (MAP) framework [25] and projection pursuit [26, 27] have also been applied to hyperspectral data. In most cases the number of endmembers and their signatures are not known. Independent component analysis (ICA) is an unsupervised source separation process that has been applied with success to blind source separation, to feature extraction, and to unsupervised recognition [28, 29]. ICA consists in finding a linear decomposition of observed data yielding statistically independent components. Given that hyperspectral data are, in given circumstances, linear mixtures, ICA comes to mind as a possible tool to unmix this class of data. In fact, the application of ICA to hyperspectral data has been proposed in reference 30, where endmember signatures are treated as sources and the mixing matrix is composed by the abundance fractions, and in references 9, 25, and 31–38, where sources are the abundance fractions of each endmember. In the first approach, we face two problems: (1) The number of samples are limited to the number of channels and (2) the process of pixel selection, playing the role of mixed sources, is not straightforward. In the second approach, ICA is based on the assumption of mutually independent sources, which is not the case of hyperspectral data, since the sum of the abundance fractions is constant, implying dependence among abundances. This dependence compromises ICA applicability to hyperspectral images. In addition, hyperspectral data are immersed in noise, which degrades the ICA performance. IFA [39] was introduced as a method for recovering independent hidden sources from their observed noisy mixtures. IFA implements two steps. First, source densities and noise covariance are estimated from the observed data by maximum likelihood. Second, sources are reconstructed by an optimal nonlinear estimator. Although IFA is a well-suited technique to unmix independent sources under noisy observations, the dependence among abundance fractions in hyperspectral imagery compromises, as in the ICA case, the IFA performance. Considering the linear mixing model, hyperspectral observations are in a simplex whose vertices correspond to the endmembers. Several approaches [40–43] have exploited this geometric feature of hyperspectral mixtures [42]. Minimum volume transform (MVT) algorithm [43] determines the simplex of minimum volume containing the data. The MVT-type approaches are complex from the computational point of view. Usually, these algorithms first find the convex hull defined by the observed data and then fit a minimum volume simplex to it. Aiming at a lower computational complexity, some algorithms such as the vertex component analysis (VCA) [44], the pixel purity index (PPI) [42], and the N-FINDR [45] still find the minimum volume simplex containing the data cloud, but they assume the presence in the data of at least one pure pixel of each endmember. 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. Hyperspectral sensors collects spatial images over many narrow contiguous bands, yielding large amounts of data. For this reason, very often, the processing of hyperspectral data, included unmixing, is preceded by a dimensionality reduction step to reduce computational complexity and to improve the signal-to-noise ratio (SNR). Principal component analysis (PCA) [46], maximum noise fraction (MNF) [47], and singular value decomposition (SVD) [48] are three well-known projection techniques widely used in remote sensing in general and in unmixing in particular. The newly introduced method [49] exploits the structure of hyperspectral mixtures, namely the fact that spectral vectors are nonnegative. The computational complexity associated with these techniques is an obstacle to real-time implementations. To overcome this problem, band selection [50] and non-statistical [51] algorithms have been introduced. This chapter addresses hyperspectral data source dependence and its impact on ICA and IFA performances. The study consider simulated and real data and is based on mutual information minimization. Hyperspectral observations are described by a generative model. This model takes into account the degradation mechanisms normally found in hyperspectral applications—namely, signature variability [52–54], abundance constraints, topography modulation, and system noise. The computation of mutual information is based on fitting mixtures of Gaussians (MOG) to data. The MOG parameters (number of components, means, covariances, and weights) are inferred using the minimum description length (MDL) based algorithm [55]. We study the behavior of the mutual information as a function of the unmixing matrix. The conclusion is that the unmixing matrix minimizing the mutual information might be very far from the true one. Nevertheless, some abundance fractions might be well separated, mainly in the presence of strong signature variability, a large number of endmembers, and high SNR. We end this chapter by sketching a new methodology to blindly unmix hyperspectral data, where abundance fractions are modeled as a mixture of Dirichlet sources. This model enforces positivity and constant sum sources (full additivity) constraints. The mixing matrix is inferred by an expectation-maximization (EM)-type algorithm. This approach is in the vein of references 39 and 56, replacing independent sources represented by MOG with mixture of Dirichlet sources. Compared with the geometric-based approaches, the advantage of this model is that there is no need to have pure pixels in the observations. The chapter is organized as follows. Section 6.2 presents a spectral radiance model and formulates the spectral unmixing as a linear problem accounting for abundance constraints, signature variability, topography modulation, and system noise. Section 6.3 presents a brief resume of ICA and IFA algorithms. Section 6.4 illustrates the performance of IFA and of some well-known ICA algorithms with experimental data. Section 6.5 studies the ICA and IFA limitations in unmixing hyperspectral data. Section 6.6 presents results of ICA based on real data. Section 6.7 describes the new blind unmixing scheme and some illustrative examples. Section 6.8 concludes with some remarks.

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.

Cross-reactivity of antibodies in human infections by the kinetoplastid protozoa Trypanosoma cruzi, Leishmania chagasi and Leishmania (Viannia) braziliensis

We have detected antibodies, in the sera of Chagas disease, Kala-azar and Mucocutaneous leishmaniasis patients, that bind multiple antigens shared between the three causative agents. The Chagas disease sera showed 98 to 100% positive results by ELISA when the Leishmania braziliensis and Leishmania chagasi antigens were used, respectively. The Kala-azar sera showed 100% positive results with Trypanosoma cruzi or L. braziliensis antigens by immunofluorescence assays. The antibodies in the sera of Mucocutaneous leishmaniasis patients showed 100% positive results by ELISA assays with T. cruzi or L. chagasi antigens. Furthermore, the direct agglutination of L. chagasi promastigotes showed that 95% of Kala-azar and 35% of Mucocutaneous leishmaniasis sera agglutinated the parasite in dilutions above 1:512. In contrast, 15% of Chagas sera agglutinated the parasite in dilutions 1:16 and below. Western blot analysis showed that the Chagas sera that formed at least 24 bands with the T. cruzi also formed 13 bands with the L. chagasi and 17 bands with the L. braziliensis. The Kala-azar sera that recognized at least 29 bands with the homologous antigen also formed 14 bands with the T. cruzi and 10 bands with the L. braziliensis antigens. Finally, the Mucocutaneous leishmaniasis sera that formed at least 17 bands with the homologous antigen also formed 10 bands with the T. cruzi and four bands with the L. chagasi antigens. These results indicate the presence of common antigenic determinants in several protozoal proteins and, therefore, explain the serologic cross-reactions reported here.