低质量图像基于散射图SEM估计的MAP像素聚类方法

直方图是最常用的图像灰度统计分布的表示方法,二维直方图包括共生矩阵,灰度－边界值散射图,灰度平均灰度散射图等,本文提出了一种采用ＳＥＭ算法完成对灰－平均灰度的二维正态分布假设的参数估计,然后采用最大后验概率（ＭＰＡ）准则进行像素无监督聚类的图像分割算法,测试结果显示,我们的算法性能良好,尤其是对低对比度,有阴影和重噪声的低质量图像的分效果远优于其他基于散射图的阈值化方法。     

A computationally efficient approach to the estimation of two- and three-dimensional hidden Markov models.

Statistical modeling methods are becoming indispensable in today's large-scale image analysis. In this paper, we explore a computationally efficient parameter estimation algorithm for two-dimensional (2-D) and three-dimensional (3-D) hidden Markov models (HMMs) and show applications to satellite image segmentation. The proposed parameter estimation algorithm is compared with the first proposed algorithm for 2-D HMMs based on variable state Viterbi. We also propose a 3-D HMM for volume image modeling and apply it to volume image segmentation using a large number of synthetic images with ground truth. Experiments have demonstrated the computational efficiency of the proposed parameter estimation technique for 2-D HMMs and a potential of 3-D HMM as a stochastic modeling tool for volume images.     

Combining strings and necklaces for interactive three-dimensional segmentation of spinal images using an integral deformable spine model

Segmentation of the spine directly from three-dimensional (3-D) image data is desirable to accurately capture its morphological properties. We describe a method that allows true 3-D spinal image segmentation using a deformable integral spine model. The method learns the appearance of vertebrae from multiple continuous features recorded along vertebra boundaries in a given training set of images. Important summarizing statistics are encoded into a necklace model on which landmarks are differentiated on their free dimensions. The landmarks are used within a priority segmentation scheme to reduce the complexity of the segmentation problem. Necklace models are coupled by string models. The string models describe in detail the biological variability in the appearance of spinal curvatures from multiple continuous features recorded in the training set. In the segmentation phase, the necklace and string models are used to interactively detect vertebral structures in new image data via elastic deformation reminiscent of a marionette with strings allowing for movement between interrelated structures. Strings constrain the deformation of the spine model within feasible solutions. The driving application in this work is analysis of computed tomography scans of the human lumbar spine. An illustration of the segmentation process shows that the method is promising for segmentation of the spine and for assessment of its morphological properties.     

一种基于目标特征的多门限图像分割方法

本文提出了一种基于目标特征的多门限图像分割方法。它通过对特征量匹配的方式将属于景物的先验空间知识引入分割过程,使图像分割由单纯的灰度聚类过程变成灰度－几何空间聚类过程。实验结果表明,本文提出的方法可以完整地分割出复杂背景图像中本身具有多个灰度层次的景物。     

Interactive volume segmentation with differential image foresting transforms

The absence of object information very often asks for considerable human assistance in medical image segmentation. Many interactive two-dimensional and three-dimensional (3-D) segmentation methods have been proposed, but their response time to user's actions should be considerably reduced to make them viable from the practical point of view. We circumvent this problem in the framework of the image foresting transform (IFT)--a general tool for the design of image operators based on connectivity--by introducing a new algorithm (DIFT) to compute sequences of IFTs in a differential way. We instantiate the DIFT algorithm for watershed-based and fuzzy-connected segmentations under two paradigms (single-object and multiple-object) and evaluate the efficiency gains of both approaches with respect to their linear-time implementation based on the nondifferential IFT. We show that the DIFT algorithm provides efficiency gains from 10 to 17, reducing the user's waiting time for segmentation with 3-D visualization on a common PC from 19-36 s to 2-3 s. We also show that the multiple-object approach is more efficient than the single-object paradigm for both segmentation methods.     

网格运动分析与形态学滤波相结合的视频对象分割

提出了一种基于二维网格运动分析与改进形态学滤波空域自动分割策略相结合的视频对象时空分割算法。该算法首先利用高阶统计方法对视频图像的二维网格表示进行运动分析，快速得到前景对象区域，通过后处理有效获得前景对象运动检测掩膜。然后，用一种结合交变序列重建滤波算法和自适应阈值判别算法的改进分水岭分割策略有效获得前景对象的精确边缘。最后，用区域基时空融合算法将时域分割结果和空域分割结果结合起来提取出边缘精细的视频对象。实验结果表明，本算法综合了多种算法的优点，主客观分割效果理想。     

Model-based segmentation of medical imagery by matching distributions

The segmentation of deformable objects from three-dimensional (3-D) images is an important and challenging problem, especially in the context of medical imagery. We present a new segmentation algorithm based on matching probability distributions of photometric variables that incorporates learned shape and appearance models for the objects of interest. The main innovation over similar approaches is that there is no need to compute a pixelwise correspondence between the model and the image. This allows for a fast, principled algorithm. We present promising results on difficult imagery for 3-D computed tomography images of the male pelvis for the purpose of image-guided radiotherapy of the prostate.     

Multiscale methods for the segmentation and reconstruction ofsignals and images

This paper addresses the problem of both segmenting and reconstructing a noisy signal or image. The work is motivated by large problems arising in certain scientific applications, such as medical imaging. Two objectives for a segmentation and denoising algorithm are laid out: it should be computationally efficient and capable of generating statistics for the errors in the reconstruction and estimates of the boundary locations. The starting point for the development of a suitable algorithm is a variational approach to segmentation (Shah 1992). This paper then develops a precise statistical interpretation of a one dimensional (1-D) version of this variational approach to segmentation. The 1-D algorithm that arises as a result of this analysis is computationally efficient and capable of generating error statistics. A straightforward extension of this algorithm to two dimensions would incorporate recursive procedures for computing estimates of inhomogeneous Gaussian Markov random fields. Such procedures require an unacceptably large number of operations. To meet the objective of developing a computationally efficient algorithm, the use of previously developed multiscale statistical methods is investigated. This results in the development of an algorithm for segmenting and denoising which is not only computationally efficient but also capable of generating error statistics, as desired.     

Hierarchical morphological segmentation for image sequence coding

This paper deals with a hierarchical morphological segmentation algorithm for image sequence coding. Mathematical morphology is very attractive for this purpose because it efficiently deals with geometrical features such as size, shape, contrast, or connectivity that can be considered as segmentation-oriented features. The algorithm follows a top-down procedure. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, the segmentation quality is improved by introducing regions corresponding to more local information. The algorithm, considering sequences as being functions on a 3-D space, directly segments 3-D regions. A 3-D approach is used to get a segmentation that is stable in time and to directly solve the region correspondence problem. Each segmentation stage relies on four basic steps: simplification, marker extraction, decision, and quality estimation. The simplification removes information from the sequence to make it easier to segment. Morphological filters based on partial reconstruction are proven to be very efficient for this purpose, especially in the case of sequences. The marker extraction identifies the presence of homogeneous 3-D regions. It is based on constrained flat region labeling and morphological contrast extraction. The goal of the decision is to precisely locate the contours of regions detected by the marker extraction. This decision is performed by a modified watershed algorithm. Finally, the quality estimation concentrates on the coding residue, all the information about the 3-D regions that have not been properly segmented and therefore coded. The procedure allows the introduction of the texture and contour coding schemes within the segmentation algorithm. The coding residue is transmitted to the next segmentation stage to improve the segmentation and coding quality. Finally, segmentation and coding examples are presented to show the validity and interest of the coding approach.     

基于平方距离的对称共生矩阵阈值法

基于图像共生矩阵的阈值法是图像分割的一种基本方法,本文基于“灰度—灰度”对称共生矩阵,通过定义目标区域和背景区域的均值,提出了一个阈值分割方法.该方法和常见的基于对称共生矩阵阈值法相比,对图像的适应性更强,仿真实验验证了本文方法的有效性.     

Three-dimensional segmentation and interpolation of magnetic resonance brain images

The authors propose a method for the 3-D reconstruction of the brain from anisotropic magnetic resonance imaging (MRI) brain data. The method essentially consists in two original algorithms both for segmentation and for interpolation of the MRI data. The segmentation process is performed in three steps. A gray level thresholding of the white and gray matter tissue is performed on the brain MR raw data. A global white matter segmentation is automatically performed with a global 3-D connectivity algorithm which takes into account the anisotropy of the MRI voxel. The gray matter is segmented with a local 3-D connectivity algorithm. Mathematical morphology tools are used to interpolate slices. The whole process gives an isotropic binary representation of both gray and white matter which are available for 3-D surface rendering. The power and practicality of this method have been tested on four brain datasets. The segmentation algorithm favorably compares to a manual one. The interpolation algorithm was compared to the shaped-based method both quantitatively and qualitatively.     

Statistical approach to segmentation of single-channel cerebral MRimages

A statistical model is presented that represents the distributions of major tissue classes in single-channel magnetic resonance (MR) cerebral images. Using the model, cerebral images are segmented into gray matter, white matter, and cerebrospinal fluid (CSF). The model accounts for random noise, magnetic field inhomogeneities, and biological variations of the tissues. Intensity measurements are modeled by a finite Gaussian mixture. Smoothness and piecewise contiguous nature of the tissue regions are modeled by a three-dimensional (3-D) Markov random field (MRF). A segmentation algorithm, based on the statistical model, approximately finds the maximum a posteriori (MAP) estimation of the segmentation and estimates the model parameters from the image data. The proposed scheme for segmentation is based on the iterative conditional modes (ICM) algorithm in which measurement model parameters are estimated using local information at each site, and the prior model parameters are estimated using the segmentation after each cycle of iterations. Application of the algorithm to a sample of clinical MR brain scans, comparisons of the algorithm with other statistical methods, and a validation study with a phantom are presented. The algorithm constitutes a significant step toward a complete data driven unsupervised approach to segmentation of MR images in the presence of the random noise and intensity inhomogeneities     

A Radial Basis Function Approach to Pattern Recognition and Its Applications

Pattern recognition is one of the most common problems encountered in engineering and scientific disciplines, which involves developing prediction or classification models from historic data or training samples. This paper introduces a new approach, called the Representational Capability (RC) algorithm, to handle pattern recognition problems using radial basis function (RBF) models. The RC algorithm has been developed based on the mathematical properties of the interpolation and design matrices of RBF models. The model development process based on this algorithm not only yields the best model in the sense of balancing its parsimony and generalization ability, but also provides insights into the design process by employing a design parameter (δ). We discuss the RC algorithm and its use at length via an illustrative example. In addition, RBF classification models are developed for heart disease diagnosis.     

基于Contourlet域HMT-3S模型的激光主动成像图像分割

基于Contourlet系数分布统计特性,结合隐马尔科夫树(HMT)-3S模型和贝叶斯准则,提出了一种基于Contourlet域HMT-3S模型的图像分割算法(CHMT-3Sseg),并将其用于激光主动成像图像的分割。CHMT-3Sseg方法首先利用HMT-3S模型充分挖掘子带间的相关性,通过HMT-3S模型参数训练和似然值计算得到了可靠的初始分割。为了获得较好的区域一致性和边缘准确性,对初始分割结果进行了基于邻域背景的多尺度融合。对合成图像和激光主动成像图像的实验结果表明:CHMT-3Sseg不但在边缘和方向信息保持上有明显改进,而且错分概率显著降低,对真实图像得到了理想的分割效果。     

Efficient segmentation by sparse pixel classification

Segmentation methods based on pixel classification are powerful but often slow. We introduce two general algorithms, based on sparse classification, for optimizing the computation while still obtaining accurate segmentations. The computational costs of the algorithms are derived, and they are demonstrated on real 3-D magnetic resonance imaging and 2-D radiograph data. We show that each algorithm is optimal for specific tasks, and that both algorithms allow a speedup of one or more orders of magnitude on typical segmentation tasks.     

Registration-assisted segmentation of real-time 3-D echocardiographic data using deformable models

Real-time three-dimensional (3-D) echocardiography is a new imaging modality that presents the unique opportunity to visualize the complex 3-D shape and motion of the left ventricle (LV) in vivo and to measure the associated global and local function parameters. To take advantage of this opportunity in routine clinical practice, automatic segmentation of the LV in the 3-D echocardiographic data, usually hundreds of megabytes large, is essential. We report a new segmentation algorithm for this task. Our algorithm has two distinct stages, initialization of a deformable model and its refinement, which are connected by a dual "voxel + wiremesh" template. In the first stage, mutual-information-based registration of the voxel template with the image to be segmented helps initialize the wiremesh template. In the second stage, the wiremesh is refined iteratively under the influence of external and internal forces. The internal forces have been customized to preserve the nonsymmetric shape of the wiremesh template in the absence of external forces, defined using the gradient vector flow approach. The algorithm was validated against expert-defined segmentation and demonstrated acceptable accuracy. Our segmentation algorithm is fully automatic and has the potential to be used clinically together with real-time 3-D echocardiography for improved cardiovascular disease diagnosis.     

基于遗传算法的二维最小交叉熵的动态图像分割

为解决动态图像的分割问题,本文提出了一种遗传算法的二维最小交叉熵的分割算法。首先给出二维交叉熵的定义,然后运用遗传算法,以二维交叉熵为评价函数,搜索能使二维交叉熵最小的参数向量,并以该参数向量为分割阈值对飞机图像进行图像分割处理。实验结果表明,二维飞机交叉熵图像分割精度比一维飞机熵图像分割精度高,且比传统的二维熵分割速度快。     

基于几何特征的点云分割算法研究进展

点云是3维图像的一种特殊数据形式, 正逐渐成为3维图像信息处理的研究热点; 点云分割是点云数据处理的重要步骤, 对算法的结果有直接影响; 基于3维图像几何特征的点云分割算法结构简洁、运算结果稳定性强, 且易于调整, 在实际应用中占有主要地位。对最近几年涌现出来的基于几何特征的点云分割方法进行了梳理, 根据每种方法的理论基础和应用特点将算法归纳为基于边缘检测、表面特征和模型拟合的点云分割方法, 分析了各类算法的特点和存在的主要问题, 并进行了算法性能比较, 分析了影响点云分割算法效率的主要因素, 最后对未来的发展趋势进行了展望。     

Unsupervised vector image segmentation by a tree structure-ICM algorithm

In recent years, many image segmentation approaches have been based on Markov random fields (MRFs). The main assumption of the MRF approaches is that the class parameters are known or can be obtained from training data. In this paper the authors propose a novel method that relaxes this assumption and allows for simultaneous parameter estimation and vector image segmentation. The method is based on a tree structure (TS) algorithm which is combined with Besag's iterated conditional modes (ICM) procedure. The TS algorithm provides a mechanism for choosing initial cluster centers needed for initialization of the ICM. The authors' method has been tested on various one-dimensional (1-D) and multidimensional medical images and shows excellent performance. In this paper the authors also address the problem of cluster validation. They propose a new maximum a posteriori (MAP) criterion for determination of the number of classes and compare its performance to other approaches by computer simulations.