MRF model and FRAME model-based unsupervised image segmentation

This paper presents a method for unsupervised segmentation of images consisting of multiple textures. The images under study are modeled by a proposed hierarchical random field model, which has two layers. The first layer is modeled as a Markov Random Field (MRF) representing an unobservable region image and the second layer uses "Filters, Random and Maximum Entropy (Abb. FRAME)" model to represent multiple textures which cover each region. Compared with the traditional Hierarchical Markov Random Field (HMRF), the FRAME can use a bigger neighborhood system and model more complex patterns. The segmentation problem is formulated as Maximum a Posteriori (MAP) estimation according to the Bayesian rule. The iterated conditional modes (ICM) algorithm is carried out to find the solution of the MAP estimation. An algorithm based on the local entropy rate is proposed to simplify the estimation of the parameters of MRF. The parameters of FRAME are estimated by the ExpectationMaximum (EM) algorithm. Finally, an exp     

A quasi-dense approach to surface reconstruction from uncalibrated images

This paper proposes a quasi-dense approach to 3D surface model acquisition from uncalibrated images. First, correspondence information and geometry are computed based on new quasi-dense point features that are resampled subpixel points from a disparity map. The quasi-dense approach gives more robust and accurate geometry estimations than the standard sparse approach. The robustness is measured as the success rate of full automatic geometry estimation with all involved parameters fixed. The accuracy is measured by a fast gauge-free uncertainty estimation algorithm. The quasi-dense approach also works for more largely separated images than the sparse approach, therefore, it requires fewer images for modeling. More importantly, the quasi-dense approach delivers a high density of reconstructed 3D points on which a surface representation can be reconstructed. This fills the gap of insufficiency of the sparse approach for surface reconstruction, essential for modeling and visualization applications. Second, surface reconstruction methods from the given quasi-dense geometry are also developed. The algorithm optimizes new unified functionals integrating both 3D quasi-dense points and 2D image information, including silhouettes. Combining both 3D data and 2D images is more robust than the existing methods using only 2D information or only 3D data. An efficient bounded regularization method is proposed to implement the surface evolution by level-set methods. Its properties are discussed and proven for some cases. As a whole, a complete automatic and practical system of 3D modeling from raw images captured by hand-held cameras to surface representation is proposed. Extensive experiments demonstrate the superior performance of the quasi-dense approach with respect to the standard sparse approach in robustness, accuracy, and applicability.     

一种基于纹理特征融合的SAR图像分割方法

在由若干灰度共生矩阵纹理统计量进行特征融合后所生成的图像上,定义多分辨双Markov-GAR模型,采用多分辨MPM参数估计方法及相应的无监督分割算法,对SAR图像进行纹理分割。该方法既利用了像素的灰度信息,也利用了像素的空间位置信息,削弱了斑点噪声对分割的影响。实验表明对于一些高分辨SAR图像,该方法与单纯基于灰度图像上的多分辨双Markov-GAR模型纹理分割相比,分割精度得以提高。     

Granulation,rough entropy and spatiotemporal moving object detection

A new spatio-temporal segmentation approach for moving object(s) detection and tracking from a video sequence is described. Spatial segmentation is carried out using rough entropy maximization, where we use the quad-tree decomposition, resulting in unequal image granulation which is closer to natural granulation. A three point estimation based on Beta Distribution is formulated for background estimation during temporal segmentation. Reconstruction and tracking of the object in the target frame is performed after combining the two segmentation outputs using its color and shift information. The algorithm is more robust to noise and gradual illumination change, because their presence is less likely to affect both its spatial and temporal segments inside the search window. The proposed methods for spatial and temporal segmentation are seen to be superior to several related methods. The accuracy of reconstruction has been significantly high.     

Multiresolution color image segmentation

Image segmentation is the process by which an original image is partitioned into some homogeneous regions. In this paper, a novel multiresolution color image segmentation (MCIS) algorithm which uses Markov random fields (MRF's) is proposed. The proposed approach is a relaxation process that converges to the MAP (maximum a posteriori) estimate of the segmentation. The quadtree structure is used to implement the multiresolution framework, and the simulated annealing technique is employed to control the splitting and merging of nodes so as to minimize an energy function and therefore, maximize the MAP estimate. The multiresolution scheme enables the use of different dissimilarity measures at different resolution levels. Consequently, the proposed algorithm is noise resistant. Since the global clustering information of the image is required in the proposed approach, the scale space filter (SSF) is employed as the first step. The multiresolution approach is used to refine the segmentation. Experimental results of both the synthesized and real images are very encouraging. In order to evaluate experimental results of both synthesized images and real images quantitatively, a new evaluation criterion is proposed and developed     

Fast segmentation of range images into planar regions by scan line grouping

A novel technique is presented for rapid partitioning of surfaces in range images into planar patches. The method extends and improves Pavlidis' algorithm (1976), proposed for segmenting images from electron microscopes. The new method is based on region growing where the segmentation primitives are scan line grouping features instead of individual pixels. We use a noise variance estimation to automatically set thresholds so that the algorithm can adapt to the noise conditions of different range images. The proposed algorithm has been tested on real range images acquired by two different range sensors. Experimental results show that the proposed algorithm is fast and robust.     

基于人工蜂群与模糊C均值的自适应小波变换的噪声图像分割

针对传统模糊C均值（FCM）聚类算法在处理噪声图像时易受到噪声影响的问题,提出了基于FCM的小波域特征增强的噪声图像分割方法。首先,将噪声图像进行二维小波分解;其次,对近似系数进行边缘增强,同时利用人工蜂群（ABC）优化算法对细节系数进行阈值处理,并将处理后的系数进行小波重构;最后,对重构后的图片使用FCM算法来进行图像分割。选取5幅典型的灰度图像,分别添加高斯噪声和椒盐噪声,使用多种方法进行分割,以分割后图像的峰值信噪比（PSNR）和误分率（ME）作为性能指标,实验结果表明,所提方法分割后的图片相较于传统FCM聚类算法分割方法和粒子群优化（PSO）分割方法分割后的图片在PSNR上最多分别有281%和54%的提升,在ME上最多分别有55%和41%的降低。可见所提出的分割方法较好地保留了图像边缘纹理信息,其抗噪性能与分割性能得到了提升。     

A robust active contour model driven by fuzzy c-means energy for fast image segmentation

In this paper, we propose a robust region-based active contour model driven by fuzzy c-means energy that draws upon the clustering intensity information for fast image segmentation. The main idea of fuzzy c-means energy is to quickly compute the two types of cluster center functions for all points in image domain by fuzzy c-means algorithm locally with a proper preprocessing procedure before the curve starts to evolve. The time-consuming local fitting functions in traditional models are substituted with these two functions. Furthermore, a sign function and a Gaussian filtering function are utilized to replace the penalty term and the length term in most models, respectively. Experiments on several synthetic and real images have proved that the proposed model can segment images with intensity inhomogeneity efficiently and precisely. Moreover, the proposed model has a good robustness on initial contour, parameters and different kinds of noise.     

A novel multiresolution fuzzy segmentation method on MR image

Multiresolution-based magnetic resonance (MR) image segmentation has attracted attention for its ability to capture rich information across scales compared with the conventional segmentation methods. In this paper, a new scale-space-based segmentation model is presented,where both the intra-scale and inter-scale properties are considered and formulated as two fuzzy energy functions. Meanwhile, a control parameter is introduced to adjust the contribution of the similarity character across scales and the clustering character within the scale. By minimiT.ing thecombined inter/intra energy function, the multiresolution fuzzy segmentation algorithm is derived.Then the coarse to fine leading segmentation is performed automatically and iteratively on a set of multiresolution images. The validity of the proposed algorithm is demonstrated by the test image and pathological MR images. Experiments show that by this approach the segmentation results,especially in the tumor area delineation, are more precise than those of the conventional fuzzy segmentation methods.     

基于多尺度随机模型的SAR图像无监督分割

合成孔径雷达（synthetic aperture radar,SAR）是一种基于相干原理的成像系统,在SAR图像中存在严重影响图像质量的斑点噪声,使得SAR图像的可靠分割非常困难。〖BP）〗根据SAR图像的成像机理,利用两种多尺度随机模型,即多尺度自回归（Multiscale Autoregressive,MAR）模型和多尺度自回归滑动平均（Multiscale Aautoregressive Moving Average, MARMA）模型,分别来描述同一场景不同分辨率SAR图像像素间的统计相关性,并构造了相应的多分辨混合算法实现SAR图像的无监督分割。试验结果表明,提出的两种无监督分割方法是可行的,且MARMA模型比MAR模型能够更精确地捕捉SAR图像多尺度序列中不同类型地形的统计信息,使分割质量具有明显的改进。     

快速鲁棒核空间模糊聚类分割

目的 传统模糊C-均值聚类应用于图像分割仅考虑像素本身的聚类问题,无法克服噪声干扰对图像分割结果的影响,不利于受到噪声干扰的工业图像、医学影像和高分遥感影像等进行目标提取、识别和解译。嵌入像素空间邻域信息或局部信息的鲁棒模糊C-均值聚类分割算法是近年来图像分割理论研究中的热点课题。为此,针对现有的鲁棒核空间模糊聚类算法非常耗时且抑制噪声能力弱、不适合强噪声干扰下大幅面图像快速分割等问题,提出一种快速鲁棒核空间模糊聚类分割算法。方法 利用待分割图像中像素邻域的灰度信息和空间位置等信息构建线性加权滤波图像,对其进行鲁棒核空间模糊聚类。为了进一步提高算法实时性,引入当前聚类像素与其邻域像素均值所对应的2维直方图信息,构造一种基于2维直方图的鲁棒核空间模糊聚类快速分割最优化数学模型,采用拉格朗日乘子法获得图像分割的像素聚类迭代表达式。结果 对大幅面图像添加一定强度的高斯、椒盐以及混合噪声,以及未加噪标准图像的分割测试结果表明,本文算法比基于邻域空间约束的核模糊C-均值聚类等算法的峰值信噪比至少提高1.5 dB,误分率降低约5%,聚类性能评价的划分系数提高约10%,运行速度比核模糊C-均值聚类和基于邻域空间约束的鲁棒核模糊C-均值聚类算法至少提高30%,与1维直方图核空间模糊C-均值聚类算法具有相当的时间开销,所得分割结果具有较好的主观视觉效果。结论 通过理论分析和实验验证,本文算法相比现有空间邻域信息约束的鲁棒核空间模糊聚类等算法具有更强的抗噪鲁棒性、更优的分割性能和实时性,对大幅面遥感、医学等影像快速解译具有积极的促进作用,能更好地满足实时性要求较高场合的图像分割需要。     

基于图分割与Hausdorff距离的多分辨率影像匹配

针对具有复杂场景的航拍图像提出了一种基于图分割理论与Hausdorff距离的多分辨率影像匹配方法。在高斯金字塔图像模型中,低分辨率的图像通过图分割方法,充分考虑图像中的局部和全局的信息,提取到稳定和完整的图像区域边界,并以区域边界作为待匹配的曲线。再通过计算曲线的统计特性作为图像间待匹配特征,并由信号相关的度量方法粗估计出图像间全局仿射变换参数。利用粗估计的参数在高分辨率层次上进一步通过基于Hausdorff距离的匹配方法搜索到精确的变换参数。实验结果表明,该方法在较大变形和强噪音干扰的情况下对复杂场景的图像也能有效地完成匹配。     

An iterative Gibbsian technique for reconstruction of m-ary images

The reconstruction of m-ary images corrupted by independent noise is treated. The original image is modeled by a Markov Random Field (MRF) whose parameters are unknown. Likewise, the probabilistic structure of the noise is unknown. This paper presents an iterative procedure which performs the parameter estimation and image reconstruction tasks at the same time. The procedure that we call Gibbsian EM algorithm, is a generalization to the MRF context of a general algorithm, known as the EM algorithm, used to approximate maximum-likelihood estimates for incomplete data problems. A number of experiments are presented in the case of Gaussian noise and binary noise, showing that the Gibbsian EM algorithm is useful and effective for image reconstruction and segmentation.     

基于简化Mumford-Shah模型的水平集图像分割算法

为解决传统图像分割方法受噪声和边界轮廓影响而使分割效果不佳问题，基于简化的Mumford Shah模型的水平集图像分割算法通过将曲线嵌入水平集函数，利用函数的求解以达到曲线演化和图像分割的目的。试验表明此分割算法与初始轮廓线位置无关、不受边界轮廓线连续性限制、对图像噪声具有很强的鲁棒性，对均质灰度目标分割效果良好。     

A robust hybrid image-based modeling system

This paper presents a new robust image-based modeling system for creating high-quality 3D models of complex objects from a sequence of unconstrained photographs. The images can be acquired by a video camera or hand-held digital camera without the need of camera calibration. In contrast to previous methods, we integrate correspondence-based and silhouette-based approaches, which significantly enhances the reconstruction of objects with few visual features (e.g., uni-colored objects) and improves surface smoothness. Our solution uses a mesh segmentation and charting approach in order to create a low-distortion mesh parameterization suitable for objects of arbitrary genus. A high-quality texture is produced by first parameterizing the reconstructed objects using a segmentation and charting approach, projecting suitable sections of input images onto the model, and combining them using a graph-cut technique. Holes in the texture due to surface patches without projecting input images are filled using a novel exemplar-based inpainting method which exploits appearance space attributes to improve patch search, and blends patches using Poisson-guided interpolation. We analyzed the effect of different algorithm parameters, and compared our system with a laser scanning-based reconstruction and existing commercial systems. Our results indicate that our system is robust, superior to other image-based modeling techniques, and can achieve a reconstruction quality visually not discernible from that of a laser scanner.     

Robust information gain based fuzzy c-means clustering and classification of carotid artery ultrasound images

In this paper, a robust method is proposed for segmentation of medical images by exploiting the concept of information gain. Medical images contain inherent noise due to imaging equipment, operating environment and patient movement during image acquisition. A robust medical image segmentation technique is thus inevitable for accurate results in subsequent stages. The clustering technique proposed in this work updates fuzzy membership values and cluster centroids based on information gain computed from the local neighborhood of a pixel. The proposed approach is less sensitive to noise and produces homogeneous clustering. Experiments are performed on medical and non-medical images and results are compared with state of the art segmentation approaches. Analysis of visual and quantitative results verifies that the proposed approach outperforms other techniques both on noisy and noise free images. Furthermore, the proposed technique is used to segment a dataset of 300 real carotid artery ultrasound images. A decision system for plaque detection in the carotid artery is then proposed. Intima media thickness (IMT) is measured from the segmented images produced by the proposed approach. A feature vector based on IMT values is constructed for making decision about the presence of plaque in carotid artery using probabilistic neural network (PNN). The proposed decision system detects plaque in carotid artery images with high accuracy. Finally, effect of the proposed segmentation technique has also been investigated on classification of carotid artery ultrasound images.     

基于马尔可夫随机场的SAR图象目标分割

运动、静止目标获取与识别（MSTAR）计划表明，将合成孔径雷达（SAP）图象分割成目标、阴影和背景杂波区域对于从开放环境中进行目标识别是一种有效的手段。但是由于SAP图象所固有的斑点噪声的影响，传统的分割方法很难获得准确的分割。为此提出了一种基于MRF(Markov random field)模型的SAP图象分割算法。用MRF模型描述待分割图象的先验知识，利用最大似然（ML）估计从训练数据中获得图象各区域的先验概率分布，采用Bayes方法，在观测数据基础上，根据分割图象的后验分布所对应的MRF模型的条件概率，利用Metroplis采样器获得最大后验概率（MAP）准则下的图象分割。通过对MSTAR的样本目标图象应用该算法，结果表明它可以获得稳健和准确的分割效果。     

Efficient and robust model fitting with unknown noise scale

This paper addresses the general problem of robust parametric model estimation from data that has both an unknown (and possibly majority) fraction of outliers as well as an unknown scale of measurement noise. We focus on computer vision applications from image correspondences, such as camera resectioning, estimation of the fundamental matrix or relative pose for 3D reconstruction, and estimation of 2D homographies for image registration and motion segmentation, although there are many other applications. In practice, these methods typically rely on a predefined inlier thresholds because automatic scale detection is usually too unreliable or too slow. We propose a new method for robust estimation with automatic scale detection that is faster, more precise and more robust than previous alternatives, and show that it can be practically applied to these problems.     

RGB-D结构相似性度量下的多边自适应深度图像超分辨率重建

目的 深度相机能够对场景的深度信息进行实时动态捕捉,但捕获的深度图像分辨率低且容易形成空洞。利用高分辨率彩色图像作为引导,是深度图超分辨率重建的重要方式。现有方法对彩色边缘与深度不连续区域的不一致性问题难以有效解决,在深度图超分辨率重建中引入了纹理复制伪影。针对这一问题,本文提出了一种鲁棒的彩色图像引导的深度图超分辨率重建算法。方法 首先,利用彩色图像边缘与深度图像边缘的结构相关性,提出RGB-D结构相似性度量,检测彩色图像与深度图像共有的边缘不连续区域,并利用RGB-D结构相似性度量自适应选取估计像素点邻域的最优图像块。接着,通过提出的定向非局部均值权重,在图像块区域内建立多边引导下的深度估计,解决彩色边缘和深度不连续区域的结构不一致性。最后,利用RGB-D结构相似性度量与图像平滑性之间的对应关系,对多边引导权重的参数进行自适应调节,实现鲁棒的深度图超分辨率重建。结果 在Middlebury合成数据集、ToF和Kinect数据集以及本文自建数据集上的实验结果表明,相比其他先进方法,本文方法能够有效抑制纹理复制伪影。在Middlebury、ToF和Kinect数据集上,本文方法相较于次优算法,平均绝对偏差平均降低约63.51%、39.47 %和7.04 %。结论 对于合成数据集以及真实场景的深度数据集,本文方法均能有效处理存在于彩色边缘和深度不连续区域的不一致性问题,更好地保留深度边缘的不连续性。