Search results for "Random field"

showing 10 items of 78 documents

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

Synergy of features enables detection of texture defined figures

2006

Traditional theories of early visual processing suggest that elementary visual features are handled in parallel by independent neural pathways. We studied the interaction of orientation and spatial frequency in the discrimination of Gabor random fields. Target textures differed from reference textures either in mean feature value, showing an edge-like transition between both textures (edge defined), or in the degree of feature homogeneity with smooth transitions (region defined). Irrespective of the kind of texture definition, we found strong cue summation for targets defined by both cues simultaneously, provided two conditions were fulfilled. First, they were barely discriminable when defi…

MaleDepth PerceptionRandom fieldbusiness.industryOrientation (computer vision)Information processingExperimental and Cognitive PsychologyTexture (music)Visual processingPattern Recognition VisualFeature (computer vision)Task Performance and AnalysisHumansFemaleComputer visionComputer Vision and Pattern RecognitionArtificial intelligenceSpatial frequencybusinessPsychologyPhotic StimulationIndependence (probability theory)Spatial Vision
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

Using Fourier local magnitude in adaptive smoothness constraints in motion estimation

2007

Like many problems in image analysis, motion estimation is an ill-posed one, since the available data do not always sufficiently constrain the solution. It is therefore necessary to regularize the solution by imposing a smoothness constraint. One of the main difficulties while estimating motion is to preserve the discontinuities of the motion field. In this paper, we address this problem by integrating the motion magnitude information obtained by the Fourier analysis into the smoothness constraint, resulting in an adaptive smoothness. We describe how to achieve this with two different motion estimation approaches: the Horn and Schunck method and the Markov Random Field (MRF) modeling. The t…

Mathematical optimizationRandom fieldMarkov random fieldSmoothness (probability theory)ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONOptical flowConstraint (information theory)symbols.namesakeMotion fieldArtificial IntelligenceFourier analysisMotion estimationSignal ProcessingsymbolsComputer Vision and Pattern RecognitionAlgorithmSoftwareComputingMethodologies_COMPUTERGRAPHICSMathematicsPattern Recognition Letters
researchProduct

Hedging of Spatial Temperature Risk with Market-Traded Futures

2011

The main objective of this work is to construct optimal temperature futures from available market-traded contracts to hedge spatial risk. Temperature dynamics are modelled by a stochastic differential equation with spatial dependence. Optimal positions in market-traded futures minimizing the variance are calculated. Examples with numerical simulations based on a fast algorithm for the generation of random fields are presented.

Mathematical optimizationStochastic differential equationWork (thermodynamics)Random fieldApplied MathematicsStochastic simulationEconometricsVariance (accounting)Spatial dependenceHedge (finance)Futures contractFinanceMathematicsApplied Mathematical Finance
researchProduct

On the use of adaptive spatial weight matrices from disease mapping multivariate analyses

2020

Conditional autoregressive distributions are commonly used to model spatial dependence between nearby geographic units in disease mapping studies. These distributions induce spatial dependence by means of a spatial weights matrix that quantifies the strength of dependence between any two neighboring spatial units. The most common procedure for defining that spatial weights matrix is using an adjacency criterion. In that case, all pairs of spatial units with adjacent borders are given the same weight (typically 1) and the remaining non-adjacent units are assigned a weight of 0. However, assuming all spatial neighbors in a model to be equally influential could be possibly a too rigid or inapp…

Multivariate statisticsEnvironmental EngineeringMultivariate analysisSpatial weights matrixInferenceProcessos estocàsticsContext (language use)Adaptive conditional autoregressive distributionsEstadísticaGaussian Markov random fieldsMatrix (mathematics)StatisticsMalaltiesEnvironmental ChemistryAdjacency listSpatial dependenceMultivariate disease mappingSafety Risk Reliability and QualityRandom variableGeneral Environmental ScienceWater Science and TechnologyMathematics
researchProduct