Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels

Monte Carlo algorithms often aim to draw from a distribution π by simulating a Markov chain with transition kernel P such that π is invariant under P. However, there are many situations for which it is impractical or impossible to draw from the transition kernel P. For instance, this is the case with massive datasets, where is it prohibitively expensive to calculate the likelihood and is also the case for intractable likelihood models arising from, for example, Gibbs random fields, such as those found in spatial statistics and network analysis. A natural approach in these cases is to replace P by an approximation Pˆ. Using theory from the stability of Markov chains we explore a variety of situations where it is possible to quantify how ’close’ the chain given by the transition kernel Pˆ is to the chain given by P . We apply these results to several examples from spatial statistics and network analysis.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

Comparison of three vascular endothelial markers in the evaluation of microvessel density in breast cancer

Purpose: To evaluate the microvessel density by comparing the performance of anti-factor VIII-related antigen, anti-CD31 and, anti-CD34 monoclonal antibodies in breast cancer. Methods: Twenty-three postmenopausal women diagnosed with Stage II breast cancer submitted to definitive surgical treatment were evaluated. The monoclonal antibodies used were anti-factor VIII, anti-CD31 and anti-CD34. Microvessels were counted in the areas of highest microvessel density in ten random fields (200 x). The data were analyzed using the Kruskal-Wallis nonparametric test (p < 0.05). Results: Mean microvessel densities with anti-factor VIII, anti-CD31 and anti-CD34 were 4.16 +/- 0.38, 4.09 +/- 0.23 and 6.59 +/- 0.42, respectively. Microvessel density as assessed by anti-CD34 was significantly greater than that detected by anti-CD31 or anti-factor VIII (p < 0.0001). There was no statistically significant difference between anti-CD31 and anti-factor VIII (p = 0.4889). Conclusion: The density of stained microvessels was greater and staining was more intense with anti-CD34 compared to anti-CD31 and anti-factor VII-related antigen.

Learning discriminative sequence models from partially labelled data for activity recognition

Recognising daily activity patterns of people from low-level sensory data is an important problem. Traditional approaches typically rely on generative models such as the hidden Markov models and training on fully labelled data. While activity data can be readily acquired from pervasive sensors, e.g. in smart environments, providing manual labels to support fully supervised learning is often expensive. In this paper, we propose a new approach based on partially-supervised training of discriminative sequence models such as the conditional random field (CRF) and the maximum entropy Markov model (MEMM). We show that the approach can reduce labelling effort, and at the same time, provides us with the flexibility and accuracy of the discriminative framework. Our experimental results in the video surveillance domain illustrate that these models can perform better than their generative counterpart (i.e. the partially hidden Markov model), even when a substantial amount of labels are unavailable.

Locally sparsified compressive sensing in magnetic resonance imaging

Magnetic Resonance Imaging (MRI) is a widely used technique for acquiring images of human organs/tissues. Due to its complex imaging process, it consumes a lot of time to produce a high quality image. Compressive Sensing (CS) has been used by researchers for rapid MRI. It uses a global sparsity constraint with variable density random sampling and L1 minimisation. This work intends to speed up the imaging process by exploiting the non-uniform sparsity in the MR images. Locally Sparsified CS suggests that the image can be even better sparsified by applying local sparsity constraints. The image produced by local CS can further reduce the sample set. This paper establishes the basis for a methodology to exploit non-uniform nature of sparsity and to make the MRI process time efficient by using local sparsity constraints.

Graphical models and point set matching

Point pattern matching in Euclidean Spaces is one of the fundamental problems in Pattern Recognition, having applications ranging from Computer Vision to Computational Chemistry. Whenever two complex patterns are encoded by two sets of points identifying their key features, their comparison can be seen as a point pattern matching problem. This work proposes a single approach to both exact and inexact point set matching in Euclidean Spaces of arbitrary dimension. In the case of exact matching, it is assured to find an optimal solution. For inexact matching (when noise is involved), experimental results confirm the validity of the approach. We start by regarding point pattern matching as a weighted graph matching problem. We then formulate the weighted graph matching problem as one of Bayesian inference in a probabilistic graphical model. By exploiting the existence of fundamental constraints in patterns embedded in Euclidean Spaces, we prove that for exact point set matching a simple graphical model is equivalent to the full model. It is possible to show that exact probabilistic inference in this simple model has polynomial time complexity with respect to the number of elements in the patterns to be matched. This gives rise to a technique that for exact matching provably finds a global optimum in polynomial time for any dimensionality of the underlying Euclidean Space. Computational experiments comparing this technique with well-known probabilistic relaxation labeling show significant performance improvement for inexact matching. The proposed approach is significantly more robust under augmentation of the sizes of the involved patterns. In the absence of noise, the results are always perfect.

Efeitos de acoplamentos biquadráticos e campos aleatórios em vidros de spins

In this work we have studied the effects of random biquadratic and random fields in spin-glass models using the replica method. The effect of a random biquadratic coupling was studied in two spin-1 spin-glass models: in one case the interactions occur between pairs of spins, whereas in the second one the interactions occur between p spins and the limit p > oo is considered. Both couplings (spin glass and biquadratic) have zero-mean Gaussian probability distributions. In the first model, the replica-symmetric assumption reveals that the system presents two pha¬ses, namely, paramagnetic and spin-glass, separated by a continuous transition line. The stability analysis of the replica-symmetric solution yields, besides the usual instability associated with the spin-glass ordering, a new phase due to the random biquadratic cou¬plings between the spins. For the case p oo, the replica-symmetric assumption yields again only two phases, namely, paramagnetic and quadrupolar. In both these phases the spin-glass parameter is zero. Besides, it is shown that they are stable under the Almeida-Thouless stability analysis. One of them presents negative entropy at low temperatures. We developed one step of replica simmetry breaking and noticed that a new phase, the biquadratic glass phase, emerge. In this way we have obtained the correct phase diagram, with.three first-order transition lines. These lines merges in a common triple point. The effects of random fields were studied in the Sherrington-Kirkpatrick model consi¬dered in the presence of an external random magnetic field following a trimodal distribu¬tion {P{hi) = p+S(hi - h0) +Po${hi) +pS(hi + h0))- It is shown that the border of the ferromagnetic phase may present, for conveniently chosen values of p0 and hQ, first-order phase transitions, as well as tricritical points at finite temperatures. It is verified that the first-order phase transitions are directly related to the dilution in the fields: the extensions of these transitions are reduced for increasing values of po- In fact, the threshold value pg, above which all phase transitions are continuous, is calculated analytically. The stability analysis of the replica-symmetric solution is performed and the regions of validity of such a solution are identified

Imunoexpressão da IL-17 e RORγt em carcinomas de células escamosas de lábio e língua

Th17 cells have been strongly associated to the pathogenesis of inflammatory and autoimmune diseases, although their influence on the carcinogenesis is still little known, there are reports of anti-tumor and protumoral actions. The objective of this study is to research the presence of Th17 lineage in lip and tongue SCC, using the analysis of the immunoexpression of IL-17 and RORγt, relating this immunoexpression with clinical and morphological findings in the attempt to better comprehend the role of these cells on the tumoral immunity of OSCCs. The results were submitted to non-parametric statistical tests with significance level of 5%. On the histomorphological analysis, it was observed the predominance of low level lesions on lip and high level lesions on tongue (p=0,024). It was not observed statistical significance between clinical stage and histological gradation of malignancy (p=0,644). For the immunohistochemical study, 5 random fields with greater immunoreactivity of the peritumoral inflammatory infiltrate were photomicrographed on the 400x magnification. It was done the count of lymphocytes which showed cytoplasmic and pericytoplasmic staining for the IL-17 cytokine as well as nuclear and cytoplasmic staining for RORγt. It was observed statistical significance difference on the quantity of immunopositive lymphocytes to IL-17 between the groups of SCC of lip and tongue (p=0,028). For the RORγt it was not observed statistical significance difference between the groups of SCC of lip and tongue (p=0,915). It was not observed statistical difference between the immunostaining of IL-17 and RORγt with histological gradation of malignancy and clinical staging. The findings of this research suggest a possible anti-tumor role of IL-17 for cases of lip. The results of the analysis of the RORγt are possibly due to the wide duality of the anti-tumor and protumoral role of the Th17 cells and their plasticity which, in the presence of different cytokines expressed on the tumor microenvironment, can alter its phenotype.

Effects of basic fibroblast growth factor on density and morphology of fibroblasts grown on root surfaces with or without conditioning with tetracycline or EDTA.

A study was conducted to evaluate in vitro the effect of root surface conditioning with basic fibroblast growth factor (b-FGF) on morphology and proliferation of fibroblasts. Three experimental groups were used: non-treated, and treated with 50 microg or 125 microg b-FGF/ml. The dentin samples in each group were divided into subgroups according to the chemical treatment received before application of b-FGF: none, or conditioned with tetracycline-HCl or EDTA. After contact with b-FGF for 5 min, the samples were incubated for 24 h with 1 ml of culture medium containing 1 x 10(5) cells/ml plus 1 ml of culture medium alone. The samples were then subjected to routine preparation for SEM, and random fields were photographed. Three calibrated and blind examiners performed the assessment of morphology and density according to two index systems. Classification and regression trees indicated that the root surfaces treated with 125 microg b-FGF and previously conditioned with tetracycline-HCl or EDTA presented a morphology more suggestive of cellular adhesion and viability (P = 0.004). The density of fibroblasts on samples previously conditioned with EDTA, regardless of treatment with b-FGF, was significantly higher than in the other groups (P < 0.001). The present findings suggest that topical application of b-FGF has a positive influence on both the density and morphology of fibroblasts.

Building roof contour extraction from LiDAR data

This paper proposes a method for the automatic extraction of building roof contours from a LiDAR-derived digital surface model (DSM). The method is based on two steps. First, to detect aboveground objects (buildings, trees, etc.), the DSM is segmented through a recursive splitting technique followed by a region merging process. Vectorization and polygonization are used to obtain polyline representations of the detected aboveground objects. Second, building roof contours are identified from among the aboveground objects by optimizing a Markov-random-field-based energy function that embodies roof contour attributes and spatial constraints. Preliminary results have shown that the proposed methodology works properly.

Busca em vizinhança variável aplicado na solução do problema de planejamento da expansão do sistema de transmissão de energia elétrica

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

Novas aplicações de metaheurísticas na solução do problema de planejamento da expansão do sistema de transmissão de energia elétrica

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

Programação de horários usando um algoritmo de busca em vizinhança variável

Pós-graduação em Engenharia Elétrica - FEIS

Sequenciamento de lotes em prensas de alta capacidade com tempo de setup dependente da sequência

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