Statistic-based MAP image-reconstruction from Poisson data usingGibbs priors

A statistical method for selecting the Gibbs parameter in MAP image restoration from Poisson data using Gibbs priors is presented. The Gibbs parameter determines the degree to which the prior influences the restoration. The presented method yields a MAP restored image, minimally influenced by the prior, for which a statistic falls within an appropriate confidence interval. The method assumes that a close approximation to the blurring function is known. A simple iterative feedback algorithm is presented to statistically select the parameter as the MAP image restoration is being performed. This algorithm is heuristically based on a model reference control formulation, but it requires only a minimal number of iterations for the parameter to settle to its statistically specified value. The performance of the statistical method for selecting the prior parameter and that of the iterative feedback algorithm are demonstrated using both 2-D and 3-D images     

Joint Segmentation of Multivariate Astronomical Time Series: Bayesian Sampling With a Hierarchical Model

Astronomy and other sciences often face the problem of detecting and characterizing structure in two or more related time series. This paper approaches such problems using Bayesian priors to represent relationships between signals with various degrees of certainty, and not just rigid constraints. The segmentation is conducted by using a hierarchical Bayesian approach to a piecewise constant Poisson rate model. A Gibbs sampling strategy allows joint estimation of the unknown parameters and hyperparameters. Results obtained with synthetic and real photon counting data illustrate the performance of the proposed algorithm     

Fully Bayesian estimation of Gibbs hyperparameters for emissioncomputed tomography data

In recent years, many investigators have proposed Gibbs prior models to regularize images reconstructed from emission computed tomography data. Unfortunately, hyperparameters used to specify Gibbs priors can greatly influence the degree of regularity imposed by such priors and, as a result, numerous procedures have been proposed to estimate hyperparameter values, from observed image data. Many of these, procedures attempt to maximize the joint posterior distribution on the image scene. To implement these methods, approximations to the joint posterior densities are required, because the dependence of the Gibbs partition function on the hyperparameter values is unknown. Here, the authors use recent results in Markov chain Monte Carlo (MCMC) sampling to estimate the relative values of Gibbs partition functions and using these values, sample from joint posterior distributions on image scenes. This allows for a fully Bayesian procedure which does not fix the hyperparameters at some estimated or specified value, but enables uncertainty about these values to be propagated through to the estimated intensities. The authors utilize realizations from the posterior distribution for determining credible regions for the intensity of the emission source. The authors consider two different Markov random field (MRF) models-the power model and a line-site model. As applications they estimate the posterior distribution of source intensities from computer simulated data as well as data collected from a physical single photon emission computed tomography (SPECT) phantom     

Recursive estimation of parameters in Markov-modulated Poissonprocesses

A hidden Markov regime is a Markov process that governs the time or space dependent distributions of an observed stochastic process. Recursive algorithms can be used to estimate parameters in mixed distributions governed by a Markov regime. The authors derive a recursive algorithm for estimation of parameters in a Markov-modulated Poisson process also called a Cox point process. By this the authors mean a doubly stochastic Poisson process with a time dependent intensity that can take on a finite number of different values. The intensity switches randomly between the possible values according to a Markov process. The authors consider two different ways to observe the Markov-modulated Poisson process: in the first model the observations consist of the observed time intervals between events, and in the second model they use the total number of events in successive intervals of fixed length. They derive an algorithm for recursive estimation of the Poisson intensities and the switch intensities between the two states and illustrate the algorithm in a simulation study. The estimates of the switch intensities are based on the observed conditional switch probabilities     

Joint Segmentation of Piecewise Constant Autoregressive Processes by Using a Hierarchical Model and a Bayesian Sampling Approach

We propose a joint segmentation algorithm for piecewise constant autoregressive (AR) processes recorded by several independent sensors. The algorithm is based on a hierarchical Bayesian model. Appropriate priors allow us to introduce correlations between the change locations of the observed signals. Numerical problems inherent to Bayesian inference are solved by a Gibbs sampling strategy. The proposed joint segmentation methodology yields improved segmentation results when compared with parallel and independent individual signal segmentations. The initial algorithm is derived for piecewise constant AR processes whose orders are fixed on each segment. However, an extension to models with unknown model orders is also discussed. Theoretical results are illustrated by many simulations conducted with synthetic signals and real arc-tracking and speech signals     

Maximum-likelihood parameter estimation for unsupervised stochasticmodel-based image segmentation

An unsupervised stochastic model-based approach to image segmentation is described, and some of its properties investigated. In this approach, the problem of model parameter estimation is formulated as a problem of parameter estimation from incomplete data, and the expectation-maximization (EM) algorithm is used to determine a maximum-likelihood (ML) estimate. Previously, the use of the EM algorithm in this application has encountered difficulties since an analytical expression for the conditional expectations required in the EM procedure is generally unavailable, except for the simplest models. In this paper, two solutions are proposed to solve this problem: a Monte Carlo scheme and a scheme related to Besag's (1986) iterated conditional mode (ICM) method. Both schemes make use of Markov random-field modeling assumptions. Examples are provided to illustrate the implementation of the EM algorithm for several general classes of image models. Experimental results on both synthetic and real images are provided.     

Bayes inference for S-shaped software-reliability growth models

Bayes inference for a nonhomogeneous Poisson process with an S-shaped mean value function is studied. In particular, the authors consider the model of Ohba et al. (1983), and its generalization to a class of gamma distribution growth curves. Two Gibbs sampling approaches are proposed to compute the Bayes estimates of the mean number of errors remaining and the current system reliability. One algorithm is a Metropolis within Gibbs algorithm, The other is a stochastic substitution algorithm with data augmentation. Model selection based on the posterior Bayes factor is studied. A numerical example with simulated data is given     

Likelihood maximization for list-mode emission tomographic imagereconstruction

The maximum a posteriori (MAP) Bayesian iterative algorithm using priors that are gamma distributed, due to Lange, Bahn and Little, is extended to include parameter choices that fall outside the gamma distribution model. Special cases of the resulting iterative method include the expectation maximization maximum likelihood (EMML) method based on the Poisson model in emission tomography, as well as algorithms obtained by Parra and Barrett and by Huesman et al. that converge to maximum likelihood and maximum conditional likelihood estimates of radionuclide intensities for list-mode emission tomography. The approach taken here is optimization-theoretic and does not rely on the usual expectation maximization (EM) formalism. Block-iterative variants of the algorithms are presented. A self-contained, elementary proof of convergence of the algorithm is included.     

基于Poisson-Markov场的超分辨力图像复原算法

图像的超分辨力复原和信噪比的提高是图像复原追求的目标.Poisson-ML图像复原方法(PML)具有很强的超分辨力复原能力,但在复原过程中会产生振荡条纹且对带噪较大的图像不能取得理想的复原效果.在Poisson和Markov分布假设的基础上,提出基于Poisson-Markov场的超分辨力图像复原算法及其正则化参数的自适应选择方法(MPML).实验表明,MPML算法不但具有很好的超分辨力复原能力,而且能有效减少和去除复原图像中的振荡条纹,对于带噪较大的图像也能取得理想的复原效果,因此其图像复原质量明显好于PML算法.正则化参数能被自动优化地选择且与图像复原的迭代运算同步进行.     

Bayesian separation of spectral sources under non-negativity and full additivity constraints

This paper addresses the problem of separating spectral sources which are linearly mixed with unknown proportions. The main difficulty of the problem is to ensure the full additivity (sum-to-one) of the mixing coefficients and non-negativity of sources and mixing coefficients. A Bayesian estimation approach based on Gamma priors was recently proposed to handle the non-negativity constraints in a linear mixture model. However, incorporating the full additivity constraint requires further developments. This paper studies a new hierarchical Bayesian model appropriate to the non-negativity and sum-to-one constraints associated to the sources and the mixing coefficients of linear mixtures. The estimation of the unknown parameters of this model is performed using samples obtained with an appropriate Gibbs algorithm. The performance of the proposed algorithm is evaluated through simulation results conducted on synthetic mixture data. The proposed approach is also applied to the processing of multicomponent chemical mixtures resulting from Raman spectroscopy.     

Application of the Gibbs distribution to hidden Markov modeling inspeaker independent isolated word recognition

A method of integrating the Gibbs distributions (GDs) into hidden Markov models (HMMs) is presented. The probabilities of the hidden state sequences of HMMs are modeled by GDs in place of the transition probabilities. The GDs offer a general way in modeling neighbor interactions of Markov random fields where the Markov chains in HMMs are special cases. An algorithm for estimating the model parameters is developed based on Baum reestimation, and an algorithm for computing the probability terms is developed using a lattice structure. The GD models were used for experiments in speech recognition on the TI speaker-independent, isolated digit database. The observation sequences of the speech signals were modeled by mixture Gaussian autoregressive densities. The energy functions of the GDs were developed using very few parameters and proved adequate in hidden layer modeling. The results of the experiments showed that the GD models performed at least as well as the HMM models     

Hierarchical Bayesian Sparse Image Reconstruction With Application to MRFM

This paper presents a hierarchical Bayesian model to reconstruct sparse images when the observations are obtained from linear transformations and corrupted by an additive white Gaussian noise. Our hierarchical Bayes model is well suited to such naturally sparse image applications as it seamlessly accounts for properties such as sparsity and positivity of the image via appropriate Bayes priors. We propose a prior that is based on a weighted mixture of a positive exponential distribution and a mass at zero. The prior has hyperparameters that are tuned automatically by marginalization over the hierarchical Bayesian model. To overcome the complexity of the posterior distribution, a Gibbs sampling strategy is proposed. The Gibbs samples can be used to estimate the image to be recovered, e.g., by maximizing the estimated posterior distribution. In our fully Bayesian approach, the posteriors of all the parameters are available. Thus, our algorithm provides more information than other previously proposed sparse reconstruction methods that only give a point estimate. The performance of the proposed hierarchical Bayesian sparse reconstruction method is illustrated on synthetic data and real data collected from a tobacco virus sample using a prototype MRFM instrument.      

Bilateral Markov mesh random field and its application to image restoration

This paper introduces bilateral Markov mesh random field to overcome the shortcomings of the conventional Markov random fields in image modeling. These shortcomings consist of (a) the computational intractability of such fields when expressing the image probability function in the form of the Gibbs distribution function, and (b) the formulation of the image probability function via the product of low-dimensional densities at the expense of obtaining non-symmetrical image models. The properties of bilateral Markov mesh random field are presented and used to derive an image model to address the above shortcomings. As an application, a framework for image restoration is then provided. Restoration results based on this new bilateral Markov mesh random field are compared to the conventional fields to demonstrate its effectiveness.     

Unification of reliability/availability/repairability models forMarkov systems

An examination is made of the structure of the general transition rate matrix from which the model transition rate matrices are obtained. An exact solution to the system-state equations is derived which depends on the eigenvalues of the model transition rate matrix. In order to obtain the exact numerical solution, an algorithm is given which requires a minimal amount of computer storage requirements. An approximate solution is derived which does not require determination of eigenvalues but, instead, is based on the representation of a Markov process by a Markov chain randomized by a Poisson process. This approximation is highly accurate with a controllable error, and its use is particularly effective for large systems     

一种基于区域Gibbs势能函数的视频运动对象分割算法

提出了一种基于时空联合分析框架的视频对象分割算法,通过改进的分水岭变换对视频图像进行帧内空间区域划分,并根据帧间运动信息和区域的空间特性得到初步的分割掩模;然后建立基于区域的马尔可夫随机场分布模型,并定义对应的Gibbs势能函数,通过迭代条件模式(ICM)方法求解得到最小化能量,从而获得稳定的分割标记场,准确地提取视频对象。实验结果表明,提出的分割算法性能优于欧洲COST211研究组所得到的分割结果。     

A general framework for nonlinear multigrid inversion.

A variety of new imaging modalities, such as optical diffusion tomography, require the inversion of a forward problem that is modeled by the solution to a three-dimensional partial differential equation. For these applications, image reconstruction is particularly difficult because the forward problem is both nonlinear and computationally expensive to evaluate. In this paper, we propose a general framework for nonlinear multigrid inversion that is applicable to a wide variety of inverse problems. The multigrid inversion algorithm results from the application of recursive multigrid techniques to the solution of optimization problems arising from inverse problems. The method works by dynamically adjusting the cost functionals at different scales so that they are consistent with, and ultimately reduce, the finest scale cost functional. In this way, the multigrid inversion algorithm efficiently computes the solution to the desired fine-scale inversion problem. Importantly, the new algorithm can greatly reduce computation because both the forward and inverse problems are more coarsely discretized at lower resolutions. An application of our method to Bayesian optical diffusion tomography with a generalized Gaussian Markov random-field image prior model shows the potential for very large computational savings. Numerical data also indicates robust convergence with a range of initialization conditions for this nonconvex optimization problem.     

二阶Hopfield型神经网络的稳定性 分析及收敛速度的估计

本文讨论二阶连续Hopfield型神经网络平衡点的全局稳定性问题,利用LMI方法和Lyapunov方法得到了网络平衡点全局渐近稳定和全局指数稳定的几个充分条件,并对其指数收敛速度进行了估计.     

基于广义Gibbs先验的优质PET成像

 最大后验方法(Maximum a posteriori, MAP)已经广泛应用于解决图像重建中的病态问题,正电子发射成像(Positron emission tomography, PET)便是其中之一。本文基于MAP方法,针对PET成像提出一新的基于图像相似结构信息的广义Gibbs先验形式,新先验能在有效地抑制噪声的同时,鲁棒地保持锐利的边缘信息。但由于新先验的引入,使得重建模型的求解趋于复杂。为解决模型解的收敛性问题,我们提出两步式的局部线化优化迭代重建策略,并结合抛物线替代坐标上升(Paraboloidal surrogate coordinate ascent,PSCA)算法进行求解。新算法分别对PET模拟数据和真实数据进行重建实验,结果表明本文提出的基于广义Gibbs先验的PET成像可以获得优质的重建图像。     

基于MPMAP序列红外图像高分辨力重建和非均匀性校正

红外焦平面阵列(IRFPA)的非均匀性校正是获得高性能热成像的基本保证,非均匀性校正(NUC)算法是当前国内外研究的重要方向.鉴于序列图像的超分辨力复原方法和基于场景的NUC算法都需要存在微位移的多帧序列目标场景图像,本文在Poisson和Markov分布假设的基础上,将超分辨力复原与NUC结合,针对存在非均匀性的红外...     

实现单通道MPSK信号盲分离的MCMC新算法

本文根据单通道接收两路MPSK混合信号在过采样下的基本模型,针对粒子滤波算法在单通道信号盲分离中的性能瓶颈以及高复杂度问题,提出了基于MCMC方法的新算法。该算法对接收信号进行过采样处理,能够利用更多的波形信息,从而有效抑制噪声的影响。新算法利用Gibbs采样估计MPSK调制符号的后验概率,近似实现了贝叶斯最优估计,并利用最小二乘法实现参数的迭代估计。理论分析与仿真实验表明,相对粒子滤波算法,本文提出的新算法在误码率性能以及复杂度方面具有良好的表现。