Search results for " random field"

showing 10 items of 41 documents

The Max-Product Algorithm Viewed as Linear Data-Fusion: A Distributed Detection Scenario

2019

In this paper, we disclose the statistical behavior of the max-product algorithm configured to solve a maximum a posteriori (MAP) estimation problem in a network of distributed agents. Specifically, we first build a distributed hypothesis test conducted by a max-product iteration over a binary-valued pairwise Markov random field and show that the decision variables obtained are linear combinations of the local log-likelihood ratios observed in the network. Then, we use these linear combinations to formulate the system performance in terms of the false-alarm and detection probabilities. Our findings indicate that, in the hypothesis test concerned, the optimal performance of the max-product a…

FOS: Computer and information sciencesfactor graphsComputer scienceComputer Science - Information TheoryMarkovin ketjut02 engineering and technologyMarkov random fieldsalgoritmit0202 electrical engineering electronic engineering information engineeringMaximum a posteriori estimationmax-product algorithmElectrical and Electronic EngineeringLinear combinationStatistical hypothesis testingdistributed systemsMarkov random fieldspectrum sensingApplied MathematicsNode (networking)Information Theory (cs.IT)linear data-fusionApproximation algorithm020206 networking & telecommunicationsComputer Science Applicationssum-product algorithmPairwise comparisonRandom variableAlgorithmstatistical inference
researchProduct

Prediction and Surveillance Sampling Assessment in Plant Nurseries and Fields

2022

In this paper, we propose a structured additive regression (STAR) model for modeling the occurrence of a disease in fields or nurseries. The methodological approach involves a Gaussian field (GF) affected by a spatial process represented by an approximation to a Gaussian Markov random field (GMRF). This modeling allows the building of maps with prediction probabilities regarding the presence of a disease in plants using Bayesian kriging. The advantage of this modeling is its computational benefit when compared with known spatial hierarchical models and with the Bayesian inference based on Markov chain Monte Carlo (MCMC) methods. Inference through the use of the integrated nested Laplace app…

Fluid Flow and Transfer ProcessesEstadística bayesianaProcess Chemistry and TechnologyGeneral EngineeringModels matemàticsGeneral Materials ScienceBayesian kriging; Bayesian hierarchical models; Gaussian Markov random field (GMRF); integrated nested Laplace approximation (INLA); stochastic partial differential equation (SPDE)InstrumentationComputer Science ApplicationsApplied Sciences
researchProduct

Conjugate Gradient Method for Brain Magnetic Resonance Images Segmentation

2018

Part 8: Pattern Recognition and Image Processing; International audience; Image segmentation is the process of partitioning the image into regions of interest in order to provide a meaningful representation of information. Nowadays, segmentation has become a necessity in many practical medical imaging methods as locating tumors and diseases. Hidden Markov Random Field model is one of several techniques used in image segmentation. It provides an elegant way to model the segmentation process. This modeling leads to the minimization of an objective function. Conjugate Gradient algorithm (CG) is one of the best known optimization techniques. This paper proposes the use of the nonlinear Conjugat…

Ground truthComputer sciencebusiness.industryThe Conjugate Gradient algorithmComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONBrain image segmentationPattern recognition02 engineering and technologyImage segmentationImage (mathematics)Nonlinear conjugate gradient method03 medical and health sciences0302 clinical medicineDice Coefficient metricHidden Markov Random FieldConjugate gradient methodComputer Science::Computer Vision and Pattern Recognition0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingSegmentation[INFO]Computer Science [cs]Artificial intelligencebusinessHidden Markov random field030217 neurology & neurosurgery
researchProduct

A Novel Approach for Faulty Sensor Detection and Data Correction in Wireless Sensor Network

2013

he main Wireless Sensor Networks purpose is represented by areas of interest monitoring. Even if the Wireless sensor network is properly initialized, errors can occur during its monitoring tasks. The present work describes an approach for detecting faulty sensors in Wireless Sensor Network and for correcting their corrupted data. The approach is based on the assumption that exist a spatio-temporal cross- correlations among sensors. Two sequential mathematical tools are used. The first stage is a probabilistic tools, namely Markov Random Field, for a two-fold sensor classification (working or damaged). The last stage is represented by the Locally Weighted Regression model, a learning techniq…

Locally Weighted RegressionSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniBrooks–Iyengar algorithmMarkov random fieldVisual sensor networkComputer scienceProbabilistic logicMarkov processMarkov Random FieldSoft sensorcomputer.software_genresymbols.namesakesymbolsMobile wireless sensor networkData miningInternet of ThingcomputerWireless sensor networkWireless Sensor Network2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications
researchProduct

Comparison of Different Hypotheses Regarding the Spread of Alzheimer’s Disease Using Markov Random Fields and Multimodal Imaging

2018

Alzheimer’s disease (AD) is characterized by a cascade of pathological processes that can be assessed in vivo using different neuroimaging methods. Recent research suggests a systematic sequence of pathogenic events on a global biomarker level, but little is known about the associations and dependencies of distinct lesion patterns on a regional level. Markov random fields are a probabilistic graphical modeling approach that represent the interaction between individual random variables by an undirected graph. We propose the novel application of this approach to study the interregional associations and dependencies between multimodal imaging markers of AD pathology and to compare different hy…

Male0301 basic medicineComputer scienceModels Neurologicalphysiopathology [Brain]Machine learningcomputer.software_genrephysiopathology [Alzheimer Disease]Multimodal Imaging03 medical and health sciences0302 clinical medicineNeuroimagingAlzheimer DiseaseHumansddc:610Graphical modeldiagnostic imaging [Brain]Default mode networkAgedModels StatisticalRandom fieldMarkov random fieldMarkov chainbusiness.industryGeneral NeuroscienceProbabilistic logicBrainGeneral MedicineMagnetic Resonance ImagingMarkov ChainsPsychiatry and Mental healthClinical Psychology030104 developmental biologyPositron-Emission TomographyGraph (abstract data type)FemaleArtificial intelligenceGeriatrics and Gerontologybusinessdiagnostic imaging [Alzheimer Disease]computer030217 neurology & neurosurgeryJournal of Alzheimer's Disease
researchProduct

ℓ1-Penalized Methods in High-Dimensional Gaussian Markov Random Fields

2016

In the last 20 years, we have witnessed the dramatic development of new data acquisition technologies allowing to collect massive amount of data with relatively low cost. is new feature leads Donoho to define the twenty-first century as the century of data. A major characteristic of this modern data set is that the number of measured variables is larger than the sample size; the word high-dimensional data analysis is referred to the statistical methods developed to make inference with this new kind of data. This chapter is devoted to the study of some of the most recent ℓ1-penalized methods proposed in the literature to make sparse inference in a Gaussian Markov random field (GMRF) defined …

Markov kernelMarkov random fieldMarkov chainComputer scienceStructured Graphical lassoVariable-order Markov model010103 numerical & computational mathematicsMarkov Random FieldMarkov model01 natural sciencesGaussian random field010104 statistics & probabilityHigh-Dimensional InferenceMarkov renewal processTuning Parameter SelectionMarkov propertyJoint Graphical lassoStatistical physics0101 mathematicsSettore SECS-S/01 - StatisticaGraphical lasso
researchProduct

Fuzzy Distributed Genetic Approaches for Image Segmentation

2010

This paper presents a new image segmentation algorithm (called FDGA-Seg) based on a combination of fuzzy logic, multiagent systems and genetic algorithms. We propose to use a fuzzy representation of the image site labels by introducing some imprecision in the gray tones values. The distributivity of FDGA-Seg comes from the fact that it is designed around a MultiAgent System (MAS) working with two different architectures based on the master-slave and island models. A rich set of experimental segmentation results given by FDGA-Seg is discussed and compared to the ICM results in the last section.

Markov random fieldGeneral Computer ScienceComputer sciencebusiness.industrySegmentation-based object categorizationComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-space segmentationMarkov processImage processingImage segmentationFuzzy logicsymbols.namesakeGenetic algorithmsymbolsSegmentationArtificial intelligencebusinessJournal of Computing and Information Technology
researchProduct

Statistical Shape and Probability Prior Model for Automatic Prostate Segmentation

2011

International audience; Accurate prostate segmentation in Trans Rectal Ultra Sound (TRUS) images is an important step in different clinical applications. However, the development of computer aided automatic prostate segmentation in TRUS images is a challenging task due to low contrast, heterogeneous intensity distribution inside the prostate region, imaging artifacts like shadow, and speckle. Significant variations in prostate shape, size and contrast between the datasets pose further challenges to achieve an accurate segmentation. In this paper we propose to use graph cuts in a Bayesian framework for automatic initialization and propagate multiple mean parametric models derived from princi…

Markov random field[ INFO.INFO-IM ] Computer Science [cs]/Medical Imagingbusiness.industryPosterior probability[INFO.INFO-IM] Computer Science [cs]/Medical ImagingInitializationPattern recognitionImage segmentation01 natural sciences030218 nuclear medicine & medical imagingActive appearance model010104 statistics & probability03 medical and health sciences0302 clinical medicineHausdorff distanceCutParametric model[INFO.INFO-IM]Computer Science [cs]/Medical ImagingComputer visionArtificial intelligence0101 mathematicsbusinessMathematics
researchProduct

MRF Model-Based Approach for Image Segmentation Using a Chaotic MultiAgent System

2006

In this paper, we propose a new Chaotic MultiAgent System (CMAS) for image segmentation. This CMAS is a distributed system composed of a set of segmentation agents connected to a coordinator agent. Each segmentation agent performs Iterated Conditional Modes (ICM) starting from its own initial image created initially from the observed one by using a chaotic mapping. However, the coordinator agent receives and diversifies these images using a crossover and a chaotic mutation. A chaotic system is successfully used in order to benefit from the special chaotic characteristic features such as ergodic property, stochastic aspect and dependence on initialization. The efficiency of our approach is s…

Markov random fieldbusiness.industryComputer scienceMulti-agent systemCrossoverChaoticInitializationImage segmentationComputingMethodologies_ARTIFICIALINTELLIGENCEComputer Science::Multiagent SystemsNonlinear Sciences::Chaotic DynamicsComputerSystemsOrganization_MISCELLANEOUSIterated conditional modesSegmentationArtificial intelligencebusinessAlgorithm
researchProduct

Methods cooperation for multiresolution motion estimation

2002

For a medical application, we are interested in an estimation of optical flow on a patient's face, particularly around the eyes. Among the methods of optical flow estimation, gradient estimation and block matching are the main methods. However, the gradient-based approach can only be applied for small displacements (one or two pixels). Gener- ally, the process of block matching leads to good results only if the searching strategy is judiciously selected. Our approach is based on a Markov random field model, combined with an algorithm of block match- ing in a multiresolution scheme. The multiresolution approach allows de- tection of a large range of speeds. The large displacements are detect…

Mathematical optimizationRandom fieldMarkov random fieldMarkov chainComputer scienceGeneral EngineeringOptical flowInitializationMotion detectionImage processingAtomic and Molecular Physics and OpticsOptical flow estimationMotion estimationImage resolutionAlgorithmBlock (data storage)Block-matching algorithmOptical Engineering
researchProduct