共查询到10条相似文献,搜索用时 531 毫秒
1.
The modeling and segmentation of images by MRF's (Markov random fields) is treated. These are two-dimensional noncausal Markovian stochastic processes. Two conceptually new algorithms are presented for segmenting textured images into regions in each of which the data are modeled as one of C MRF's. The algorithms are designed to operate in real time when implemented on new parallel computer architectures that can be built with present technology. A doubly stochastic representation is used in image modeling. Here, a Gaussian MRF is used to model textures in visible light and infrared images, and an autobinary (or autoternary, etc.) MRF to model a priori information about the local geometry of textured image regions. For image segmentation, the true texture class regions are treated either as a priori completely unknown or as a realization of a binary (or ternary, etc.) MRF. In the former case, image segmentation is realized as true maximum likelihood estimation. In the latter case, it is realized as true maximum a posteriori likelihood segmentation. In addition to providing a mathematically correct means for introducing geometric structure, the autobinary (or ternary, etc.) MRF can be used in a generative mode to generate image geometries and artificial images, and such simulations constitute a very powerful tool for studying the effects of these models and the appropriate choice of model parameters. The first segmentation algorithm is hierarchical and uses a pyramid-like structure in new ways that exploit the mutual dependencies among disjoint pieces of a textured region. 相似文献
2.
3.
《Pattern recognition letters》2003,24(9-10):1123-1131
This paper proposes two robust multiresolution estimation methods of surface parameters for range images. Based on the robust estimation of surface parameters, the proposed methods approximate a patch to a planar surface in the locally adaptive window. Selection of resolution is made pixelwise by comparing a locally computed homogeneity measure with the global threshold obtained by the distribution of the approximation error. The proposed multiresolution surface parameter estimation methods are applied to range image reconstruction and segmentation. Computer simulation results with noisy images contaminated by additive Gaussian noise and impulse noise show that the proposed multiresolution reconstruction methods preserve step and roof edges better than the conventional methods. Also the segmentation methods based on the estimated surface parameters are shown to be robust to noise. 相似文献
4.
基于平均场退火的二值纹理图象恢复 总被引:2,自引:1,他引:1
本文根据平均场退火技术,提出了一种二值纹理图象的估计和恢复算法,纹理图象描述为一个马尔可夫随机场模型和噪声过程的综合结果,算法递归地进行模型参数估计和图象恢复,其核心是一个统计松驰搜索算法,平均场方法将统计松驰方程转化为一组确定性方程,从而有效地提高了计算效率,对二值噪声纹理图象的实验结果说明了算法的有效性。 相似文献
5.
This paper presents a comparative study of several well-known and thoroughly tested techniques for the segmentation of textured images, including two algorithms belonging to the adaptive Bayesian family of restoration and segmentation methods, and a novel approach based on the recently introduced concept of the frequency histogram of connected elements (FHCE). The paper first introduces the parameters that define a connected element and then details the sensitivity analysis of these parameters, showing that the grayscale intensity histogram of a digital image is a particular case of the FHCE. The application domain chosen for comparison purposes is the problem of medical images segmentation and, more specifically, as a particularly illustrative case the segmentation of digital angiograms is analyzed in detail. To get a comparative evaluation of FHCE performance, two well-established adaptive or contextual Bayesian segmentation algorithms have been applied to the segmentation of digital angiograms as well. The paper ends with a brief discussion of the comparative performances. 相似文献
6.
7.
This paper presents a new two-step pseudo maximum a posteriori (MAP) segmentation method for the Markov random field (MRF)-modeled image because the exact MAP estimation is hard to implement due to intractable complexity. The expectation maximization (EM) and Markov Chain Monte Carlo (MCMC) methods are adopted to estimate the parameters for the MRF model due to their comparatively good performance. Although the image segmentation algorithms via graph cuts have become very popular nowadays, our proposed algorithm still performs significantly better in automatic identification and segmentation of fuzzy images than them, which is shown by the quantitative results on synthesized images. In practical applications, the proposed two-step pseudo MAP method is superior in segmenting the fuzzy laser images reflected from the weld pool surfaces during the P-GMAW welding process. 相似文献
8.
目的 基于高斯混合模型(GMM)的图像分割方法易受噪声影响,为此采用马尔可夫随机场(MRF)将像素邻域关系引入GMM,提高算法抗噪性。针对融入邻域作用的高斯混合分割模型结构复杂、参数估计困难,难以获得全局最优分割解等问题,提出一种融入邻域作用的高斯混合分割模型及其简化求解方法。方法 首先,构建融入邻域作用的GMM。为了提高GMM的抗噪性,采用MRF建模混合模型权重系数的先验分布。然后,利用贝叶斯理论建立图像分割模型,即品质函数;由于品质函数中参数较多(包括权重系数,均值,协方差)、函数结构复杂,导致参数求解困难。因此,将品质函数中的均值和协方差定义为权重系数的函数,由此简化模型结构并方便其求解;虽然品质函数中仅包含参数权重系数,但结构比较复杂,难以求得参数的解析式。最后,采用非线性共轭梯度法(CGM)求解参数,该方法仅需利用品质函数值和参数梯度值,降低了参数求解的复杂性,并且收敛快,可以得到全局最优解。结果 为了有效而准确地验证提出的分割方法,分别采用本文算法和对比算法对合成图像和高分辨率遥感图像进行分割实验,并定性和定量地评价和分析了实验结果。实验结果表明本文方法的有效抗噪性,并得到很好的分割结果。从参数估计结果可以看出,本文算法有效简化了模型参数,并获得全局最优解。结论 提出一种融入邻域作用的高斯混合分割模型及其简化求解方法,实验结果表明,本文算法提高了算法的抗噪性,有效地简化了模型参数,并得到全局最优参数解。本文算法对具有噪声的高分辨率遥感影像广泛适用。 相似文献
9.
Istvan Vajk 《International journal of systems science》2013,44(4):437-447
This article considers the problem of estimating linear model parameters from noisy measurements. The starting point is the classical approach by Koopmans for linear regression analysis. It is known that concerning the direct application of those early results for process identification, neither the original Koopmans algorithm nor its updated forms called Koopmans–Levin algorithms exhibit maximum-likelihood (ML) parameter estimation. In this article, a new, numerically advanced method is developed to ensure ML property for the parameter estimation, assuming noisy inputs and outputs, respectively. 相似文献
10.
GrabCut算法用户交互量少且分割精度高,但它迭代使用GraphCuts的求解模式使得在处理高分辨率图像时,耗时巨大。提出了一种快速GrabCut算法,在高斯混合模型参数估计过程中,通过SLIC算法构建精简的GraphCuts模型以实现加速。通过SLIC算法将原始图像快速地预分割成具有确定边界且区域内相似度高的超像素图,并以此构建精简的网络图。以块内的RGB均值描述超像素特征进行高斯混合模型参数估计。为了提高分割精度,使用得到的GMM参数对原始图像进行分割。实验结果证明了该算法在时效和精度上都有很好的性能。 相似文献