No description available.

Published Article / The paper is concerned with the problem of Bayesian decision-makers seeking consensus about the decision that should be taken from a decision space. Each decision-maker has his own utility function and it is assumed that the parameter space has two points, Θ = {θ1,θ2 }. The initial probabilities of the decision-makers for Θ can be updated by information provided by an expert. The decision-makers have an opinion about the expert and this opinion is formed by the observation of the expert's performance in the past. It is shown how the decision-makers can decide beforehand, on the basis of this opinion, whether the consultation of an expert will result in consensus.

No description available.

In many applications, it is common to have multiple diagnostic tests on each subject. When there are multiple tests available, combining tests to incorporate information from various aspects in subjects may be necessary in order to obtain a better diagnostic. For continuous tests, in the presence of a gold standard, we could combine the tests linearly (Su and Liu, 1993) or sequentially (Thompson, 2003), or using the risk score as studied by McIntosh and Pepe (2002). The gold standard, however, is not always available in practice. This dissertation concentrates on deriving classification methods based on multiple tests in the absence of a gold standard. Motivated by a lab data set consisting of two tests testing for an antibody in 100 blood samples, we first develop a mixture model of four bivariate normal distributions with the mixture probabilities depending on a two-stage latent structure. The proposed two-stage latent structure is based on the biological mechanism of the tests. A Bayesian classification method incorporating the available prior information is derived utilizing Bayesian decision theory. The proposed method is illustrated by the motivating example, and the properties of the estimation and the classification are described via simulation studies. Sensitivity to the choice of the prior distribution is also studied. We also investigate a general problem of combining multiple continuous tests without any gold standard or a reference test. We thoroughly study the existing methods for combining multiple tests and develop optimal classification rules corresponding to the methods accommodating the situation without a gold standard. We justify the proposed methods both theoretically and numerically through exten- sive simulation studies and illustrate the methods with the motivating example. In the end, we conclude the thesis with remarks and some interesting open questions extended from the dissertation.

A segmentação de imagens consiste em urna tarefa de fundamental importância para diferentes aplicações em visão computacional, tais como por exemplo, o reconhecimento e o rastreamento de objetos, a segmentação de tomores/lesões em aplicações médicas, podendo também servir de auxílio em sistemas de reconhecimento facial. Embora exista uma extensa literatora abordando o problema de segmentação de imagens, tal tópico ainda continua em aberto para pesquisa. Particularmente, a tarefa de segmentar imagens coloridas é desafiadora devido as diversas inomogeneidades de cor, texturas e formas presentes nas feições descritivas das imagens. Este trabalho apresenta um novo método de clustering para abordar o problema da segmentação de imagens coloridas. Nós desenvolvemos uma abordagem Bayesiana para procura de máximos de densidade em urna distribuição discreta de dados, e representamos os dados de forma hierárquica originando clusters adaptativos a cada nível da hierarquia. Nós aplicamos o método de clustering proposto no problema de segmentação de imagens coloridas, aproveitando sua estrutura hierárquica, baseada em propriedades de árvores direcionadas, para representar hierarquicamente uma imagem colorida. Os experimentos realizados revelaram que o método de clustering proposto, aplicado ao problema de segmentação de imagens coloridas, obteve para a medida de performance Probabilistic Rand lndex (PRI) o valor de 0.8148 e para a medida Global Consistency Error (GCE) o valor 0.1701, superando um total de vinte e um métodos previamente propostos na literatura para o banco de dados BSD300. Comparações visuais confirmaram a competitividade da nossa abordagem em relação aos demais métodos testados. Estes resultados enfatizam a potencialidade do nosso método de clustering para abordar outras aplicações no domínio de Visão Computacional e Reconhecimento de Padrões. / Image segmentation is an essential task for several computer vision applications, such as object recognition, tracking and image retrieval. Although extensively studied in the literature, the problem of image segmentation remains an open topic of research. Particularly, the task of segmenting color images is challenging due to the inhomogeneities in the color regions encountered in natural scenes, often caused by the shapes of surfaces and their interactions with the illumination sources (e.g. causing shading and highlights) This work presents a novel non-supervised classification method. We develop a Bayesian framework for seeking modes on the underlying discrete distribution of data and we represent data hierarchically originating adaptive clusters at each levei of hierarchy. We apply the prnposal clustering technique for tackling the problem of color irnage segmentation, taking advantage of its hierarchical structure based on hierarchy properties of directed trees for representing fine to coarse leveis of details in an image. The experiments herein conducted revealed that the proposed clustering method applied to the color image segmentation problem, achieved for the Probabilistic Rand Index (PRI) performance measure the value of 0.8148 and for the Global Consistency Error (GCE) the value of 0.1701, outperforming twenty-three methods previously proposed in the literature for the BSD300 dataset. Visual comparison confirmed the competitiveness of our approach towards state-of-art methods publicly available in the literature. These results emphasize the great potential of our proposed clustering technique for tackling other applications in computer vision and pattem recognition.

All digital communication channels are subject to inter-symbol interference (ISI). To achieve the desired system performance, at receiver end, the effect of ISI must be compensated and the task of the equalizer is to combat the degrading effects of ISI on the transmission. Due to the demand of high data transmission rate, the multicarrier modulation (MCM) technique implemented with the orthogonal frequency division multiplexing (OFDM) has been adopted in many modern communications systems for block transmission. In block transmission systems, transmitter-included redundancy using finite-impulse response (FIR) filterbanks can be utilized to suppress inter-block-interference (IBI). However, the length of redundancy will affect the system performance, which is highly dependent on the length of channel impulse response. To deal with the effect of ISI, many equalizing schemes have been proposed, among them the FIR zero-forcing (ZF) equalizer with the non-orthogonal projector provides a useful transceiver design structure for suppressing the IBI and ISI, simultaneously. In this thesis, we propose a new equalizing scheme; it combines the FIR-ZF equalizer with non-orthogonal projector as well as the Bayesian decision feedback equalizer (DFE) for IBI and ISI suppression. The Bayesian DFE is known to be one of the best schemes to achieve the desired performance for eliminating ISI. It can be employed to achieve the full potential of symbol-by-symbol equalizer. That is, after removing the effect of IBI with the non-orthogonal projector, the Bayesian DFE is employed for eliminating the ISI, simultaneously. For comparison, the system performance, in term of bit error rate (BER) is investigated, and compared with the minimum mean square error (MMSE)-IBI-DFE. The advantage of the new proposed equalizing scheme is verified via computer simulation under condition of insufficient redundancy.

A segmentação de imagens consiste em urna tarefa de fundamental importância para diferentes aplicações em visão computacional, tais como por exemplo, o reconhecimento e o rastreamento de objetos, a segmentação de tomores/lesões em aplicações médicas, podendo também servir de auxílio em sistemas de reconhecimento facial. Embora exista uma extensa literatora abordando o problema de segmentação de imagens, tal tópico ainda continua em aberto para pesquisa. Particularmente, a tarefa de segmentar imagens coloridas é desafiadora devido as diversas inomogeneidades de cor, texturas e formas presentes nas feições descritivas das imagens. Este trabalho apresenta um novo método de clustering para abordar o problema da segmentação de imagens coloridas. Nós desenvolvemos uma abordagem Bayesiana para procura de máximos de densidade em urna distribuição discreta de dados, e representamos os dados de forma hierárquica originando clusters adaptativos a cada nível da hierarquia. Nós aplicamos o método de clustering proposto no problema de segmentação de imagens coloridas, aproveitando sua estrutura hierárquica, baseada em propriedades de árvores direcionadas, para representar hierarquicamente uma imagem colorida. Os experimentos realizados revelaram que o método de clustering proposto, aplicado ao problema de segmentação de imagens coloridas, obteve para a medida de performance Probabilistic Rand lndex (PRI) o valor de 0.8148 e para a medida Global Consistency Error (GCE) o valor 0.1701, superando um total de vinte e um métodos previamente propostos na literatura para o banco de dados BSD300. Comparações visuais confirmaram a competitividade da nossa abordagem em relação aos demais métodos testados. Estes resultados enfatizam a potencialidade do nosso método de clustering para abordar outras aplicações no domínio de Visão Computacional e Reconhecimento de Padrões. / Image segmentation is an essential task for several computer vision applications, such as object recognition, tracking and image retrieval. Although extensively studied in the literature, the problem of image segmentation remains an open topic of research. Particularly, the task of segmenting color images is challenging due to the inhomogeneities in the color regions encountered in natural scenes, often caused by the shapes of surfaces and their interactions with the illumination sources (e.g. causing shading and highlights) This work presents a novel non-supervised classification method. We develop a Bayesian framework for seeking modes on the underlying discrete distribution of data and we represent data hierarchically originating adaptive clusters at each levei of hierarchy. We apply the prnposal clustering technique for tackling the problem of color irnage segmentation, taking advantage of its hierarchical structure based on hierarchy properties of directed trees for representing fine to coarse leveis of details in an image. The experiments herein conducted revealed that the proposed clustering method applied to the color image segmentation problem, achieved for the Probabilistic Rand Index (PRI) performance measure the value of 0.8148 and for the Global Consistency Error (GCE) the value of 0.1701, outperforming twenty-three methods previously proposed in the literature for the BSD300 dataset. Visual comparison confirmed the competitiveness of our approach towards state-of-art methods publicly available in the literature. These results emphasize the great potential of our proposed clustering technique for tackling other applications in computer vision and pattem recognition.

A segmentação de imagens consiste em urna tarefa de fundamental importância para diferentes aplicações em visão computacional, tais como por exemplo, o reconhecimento e o rastreamento de objetos, a segmentação de tomores/lesões em aplicações médicas, podendo também servir de auxílio em sistemas de reconhecimento facial. Embora exista uma extensa literatora abordando o problema de segmentação de imagens, tal tópico ainda continua em aberto para pesquisa. Particularmente, a tarefa de segmentar imagens coloridas é desafiadora devido as diversas inomogeneidades de cor, texturas e formas presentes nas feições descritivas das imagens. Este trabalho apresenta um novo método de clustering para abordar o problema da segmentação de imagens coloridas. Nós desenvolvemos uma abordagem Bayesiana para procura de máximos de densidade em urna distribuição discreta de dados, e representamos os dados de forma hierárquica originando clusters adaptativos a cada nível da hierarquia. Nós aplicamos o método de clustering proposto no problema de segmentação de imagens coloridas, aproveitando sua estrutura hierárquica, baseada em propriedades de árvores direcionadas, para representar hierarquicamente uma imagem colorida. Os experimentos realizados revelaram que o método de clustering proposto, aplicado ao problema de segmentação de imagens coloridas, obteve para a medida de performance Probabilistic Rand lndex (PRI) o valor de 0.8148 e para a medida Global Consistency Error (GCE) o valor 0.1701, superando um total de vinte e um métodos previamente propostos na literatura para o banco de dados BSD300. Comparações visuais confirmaram a competitividade da nossa abordagem em relação aos demais métodos testados. Estes resultados enfatizam a potencialidade do nosso método de clustering para abordar outras aplicações no domínio de Visão Computacional e Reconhecimento de Padrões. / Image segmentation is an essential task for several computer vision applications, such as object recognition, tracking and image retrieval. Although extensively studied in the literature, the problem of image segmentation remains an open topic of research. Particularly, the task of segmenting color images is challenging due to the inhomogeneities in the color regions encountered in natural scenes, often caused by the shapes of surfaces and their interactions with the illumination sources (e.g. causing shading and highlights) This work presents a novel non-supervised classification method. We develop a Bayesian framework for seeking modes on the underlying discrete distribution of data and we represent data hierarchically originating adaptive clusters at each levei of hierarchy. We apply the prnposal clustering technique for tackling the problem of color irnage segmentation, taking advantage of its hierarchical structure based on hierarchy properties of directed trees for representing fine to coarse leveis of details in an image. The experiments herein conducted revealed that the proposed clustering method applied to the color image segmentation problem, achieved for the Probabilistic Rand Index (PRI) performance measure the value of 0.8148 and for the Global Consistency Error (GCE) the value of 0.1701, outperforming twenty-three methods previously proposed in the literature for the BSD300 dataset. Visual comparison confirmed the competitiveness of our approach towards state-of-art methods publicly available in the literature. These results emphasize the great potential of our proposed clustering technique for tackling other applications in computer vision and pattem recognition.

Decision support systems have emerged over five decades ago to serve decision makers in uncertain conditions and usually rapidly changing and unstructured problems. Most decision support approaches, such as Bayesian decision theory and computing with words, compare and analyze the consequences of different decision alternatives. Bayesian decision methods use probabilities to handle uncertainty and have been widely used in different areas for estimating, predicting, and offering decision supports. On the other hand, computing with words (CW) and approximate reasoning apply fuzzy set theory to deal with imprecise measurements and inexact information and are most concerned with propositions stated in natural language. The concept of a Z-number [69] has been recently introduced to represent propositions and their reliability in natural language. This work proposes a methodology that integrates Z-numbers and Bayesian decision theory to provide decision support when precise measurements and exact values of parameters and probabilities are not available. The relationships and computing methods required for such integration are derived and mathematically proved. The proposed hybrid methodology benefits from both approaches and combines them to model the expert knowledge and its certainty (reliability) in natural language and apply such model to provide decision support. To the best of our knowledge, so far there has been no other decision support methodology capable of using the reliability of propositions in natural language. In order to demonstrate the proof of concept, the proposed methodology has been applied to a realistic case study on breast cancer diagnosis and a daily life example of choosing means of transportation.

Reservoir mudflats limit development of healthy fish assemblages due to the lack of structural habitat provided by plants. Seeding mudflats with agricultural plants may mimic floodplain wetlands once inundated and provide fish habitat. However, planting success is uncertain because of unpredictable water level fluctuations that affect plant growth. Decision support tools can quantify uncertainty that influences decision outcomes, thus reducing risk in the decision-making process. I used Bayesian Decision Networks and sensitivity analyses to quantify uncertainty surrounding mudflat plantings as supplemental fish habitat in four northwest Mississippi reservoirs. When averaged across all uncertainty, planting was the optimal decision only in Enid Lake. Response profiles identified specific contours within Enid, Sardis, and Grenada reservoirs at which planting was the optimal decision. No such contours were identified in Arkabutla Lake. These results provide a quantified basis for establishing best management practices and identifying key system states that influence decision outcomes.