改进复杂网络模型的形状特征提取

目的 传统的基于欧氏距离的复杂网络表示方法容易受形状的非刚性变形影响。鉴于此,提出一种基于复杂网络模型与相对一致性距离相结合的形状特征提取方法。方法 首先,提取形状的边界轮廓点作为网络的节点,利用节点间的相对一致性距离作为边的权值构建初始的复杂网络模型;然后,利用阈值演化方法对初始网络模型进行动态演化,得到一系列子网络;最后,提取不同演化阶段下子网络的拓扑特征,实现对形状特征的提取。结果 分类和检索实验结果表明,相比于传统的复杂网络描述方法,本文方法对形状图像具有更强的描述和识别能力。结论 相比于传统的距离度量,相对一致性距离对形状的非刚性变形具有更强的稳定性。     

Kernel Density Estimation and Intrinsic Alignment for Shape Priors in Level Set Segmentation

In this paper, we make two contributions to the field of level set based image segmentation. Firstly, we propose shape dissimilarity measures on the space of level set functions which are analytically invariant under the action of certain transformation groups. The invariance is obtained by an intrinsic registration of the evolving level set function. In contrast to existing approaches to invariance in the level set framework, this closed-form solution removes the need to iteratively optimize explicit pose parameters. The resulting shape gradient is more accurate in that it takes into account the effect of boundary variation on the object’s pose. Secondly, based on these invariant shape dissimilarity measures, we propose a statistical shape prior which allows to accurately encode multiple fairly distinct training shapes. This prior constitutes an extension of kernel density estimators to the level set domain. In contrast to the commonly employed Gaussian distribution, such nonparametric density estimators are suited to model aribtrary distributions. We demonstrate the advantages of this multi-modal shape prior applied to the segmentation and tracking of a partially occluded walking person in a video sequence, and on the segmentation of the left ventricle in cardiac ultrasound images. We give quantitative results on segmentation accuracy and on the dependency of segmentation results on the number of training shapes. Electronic supplementary material Electronic supplementary material is available for this article at and accessible for authorised users.     

Curve/surface representation and evolution using vector level sets with application to the shape-based segmentation problem

In this paper, we revisit the implicit front representation and evolution using the vector level set function (VLSF) proposed in (H. E. Abd El Munim, et al., Oct. 2005). Unlike conventional scalar level sets, this function is designed to have a vector form. The distance from any point to the nearest point on the front has components (projections) in the coordinate directions included in the vector function. This kind of representation is used to evolve closed planar curves and 3D surfaces as well. Maintaining the VLSF property as the distance projections through evolution will be considered together with a detailed derivation of the vector partial differential equation (PDE) for such evolution. A shape-based segmentation framework will be demonstrated as an application of the given implicit representation. The proposed level set function system will be used to represent shapes to give a dissimilarity measure in a variational object registration process. This kind of formulation permits us to better control the process of shape registration, which is an important part in the shape-based segmentation framework. The method depends on a set of training shapes used to build a parametric shape model. The color is taken into consideration besides the shape prior information. The shape model is fitted to the image volume by registration through an energy minimization problem. The approach overcomes the conventional methods problems like point correspondences and weighing coefficients tuning of the evolution (PDEs). It is also suitable for multidimensional data and computationally efficient. Results in 2D and 3D of real and synthetic data will demonstrate the efficiency of the framework     

Moment-based alignment for shape prior with variational B-spline level set

This paper presents a new shape prior-based implicit active contour model for image segmentation. The paper proposes an energy functional including a data term and a shape prior term. The data term, inspired from the region-based active contour approach, evolves the contour based on the region information of the image to segment. The shape prior term, defined as the distance between the evolving shape and a reference shape, constraints the evolution of the contour with respect to the reference shape. Especially, in this paper, we present shapes via geometric moments, and utilize the shape normalization procedure, which takes into account the affine transformation, to align the evolving shape with the reference one. By this way, we could directly calculate the shape transformation, instead of solving a set of coupled partial differential equations as in the gradient descent approach. In addition, we represent the level-set function in the proposed energy functional as a linear combination of continuous basic functions expressed on a B-spline basic. This allows a fast convergence to the segmentation solution. Experiment results on synthetic, real, and medical images show that the proposed model is able to extract object boundaries even in the presence of clutter and occlusion.     

应用区域统计特征的PolSAR影像分割

目的 提出一种利用区域统计特征的PolSAR影像分割方法,以解决目前研究中在降低斑点噪声和提高分割效率方面的不足。方法 首先利用基于梯度分割影像的分水岭算法进行SAR影像初分割,针对差值梯度非恒虚警率（CFAR）,可能给出虚假边缘从而导致分割错误的问题,引入恒虚警率的均值比率梯度（ROA）;同时,考虑到梯度影像中存在大量局部极小值,直接用分水岭处理得到初分割结果,存在过度过分割,给出了一种利用形态学方法进行梯度重构以消除局部极小值、抑制过分割的方法。然后,基于初分割得到区域,计算区域相干矩阵的最大似然估计,结合假设检验和相干矩阵的Wishart分布,给出一种有效描述区域相似度的目标函数,通过建立区域邻接关系图（RAG）,执行等级区域合并得到最终分割结果。结果 利用模拟数据,德国奥伯法芬霍芬L波段实测数据和中国海南陵水黎族自治县X波段的高分辨率数据,验证本文方法,初分割结果证实梯度重构处理不会破坏原有梯度结构,并能有效抑制过分割;最终分割结果定性定量对比分析表明,本文给出的目标函数,在分割效率、信息保持和分割精度上都有较好表现。结论 实验结果表明,本文方法能有效降低斑点噪声,提高分割效率,从而提供更加准确的分割结果。     

双层水平集描述眼底图像视杯视盘分割

目的 青光眼是一种可导致视力严重减弱甚至失明的高发眼部疾病。在眼底图像中,视杯和视盘的检测是青光眼临床诊断的重要步骤之一。然而,眼底图像普遍是灰度不均匀的,眼底结构复杂,不同结构之间的灰度重叠较多,受到血管和病变的干扰较为严重。这些都给视盘与视杯的分割带来很大挑战。因此,为了更准确地提取眼底图像中的视杯和视盘区域,提出一种基于双层水平集描述的眼底图像视杯视盘分割方法。方法 通过水平集函数的不同层级分别表示视杯轮廓和视盘轮廓,依据视杯与视盘间的位置关系建立距离约束,应用图像的局部信息驱动活动轮廓演化,克服图像的灰度不均匀性。根据视杯与视盘的几何形状特征,引入视杯与视盘形状的先验信息约束活动轮廓的演化,从而实现视杯与视盘的准确分割。结果 本文使用印度Aravind眼科医院提供的具有视杯和视盘真实轮廓注释的CDRISHTI-GS1数据集对本文方法进行实验验证。该数据集主要用来验证视杯及视盘分割方法的鲁棒性和有效性。本文方法在数据集上对视杯和视盘区域进行分割,取得了67.52%的视杯平均重叠率,81.04%的视盘平均重叠率,0.719的视杯F1分数和0.845的视盘F1分数,结果优于基于COSFIRE（combination of shifted filter responses）滤波模型的视杯视盘分割方法、基于先验形状约束的多相Chan-Vese（C-V）模型和基于聚类融合的水平集方法。结论 实验结果表明,本文方法能够有效克服眼底图像灰度不均匀、血管及病变区域的干扰等影响,更为准确地提取视杯与视盘区域。     

利用Kolmogorov-Smirnov统计的区域化图像分割

目的 为了在未知或无法建立图像模型的情况下,实现统计图像分割,提出一种结合Voronoi几何划分、K-S(Kolmogorov-Smirnov)统计以及M-H(Metropolis-Hastings)算法的图像分割方法.方法 首先利用Voronoi划分将图像域划分成不同的子区域,而每个子区域为待分割同质区域的一个组成部分,并利用K-S统计定义类属异质性势能函数,然后应用非约束吉布斯表达式构建概率分布函数,最后采用M-H算法进行采样,从而实现图像分割.结果 采用本文算法,分别对模拟图像、合成图像、真实光学和SAR图像进行分割实验,针对模拟图像和合成图像,分割结果精度均达到98%以上,取得较好的分割结果.结论 提出基于区域的图像分割算法,由于该算法中图像分割模型的建立无需原先假设同质区域内像素光谱测度的概率分布,因此提出算法具有广泛的适用性.为未知或无法建立图像模型的统计图像分割提供了一种新思路.     

融合外观和运动特征的在线目标分割

目的 视频中的目标分割是计算机视觉领域的一个重要课题,有着极大的研究和应用价值。为此提出一种融合外观和运动特征的在线自动式目标分割方法。方法 首先,融合外观和运动特征进行目标点估计,结合上一帧的外观模型估计出当前帧的外观模型。其次,以超像素为节点构建马尔可夫随机场模型,结合外观模型和位置先验把分割问题转化为能量最小化问题,并通过Graph Cut进行优化求解。结果 最后,在两个数据集上与5种标准方法进行了对比分析,同时评估了本文方法的组成成分。本文算法在精度上至少比其他的目标分割算法提升了44.8%,且具有较高的分割效率。结论 本文通过融合外观与运动特征实现在线的目标分割,取得较好的分割结果,且该方法在复杂场景中也具有较好的鲁棒性。     

鲁棒空间约束的模糊聚类图像分割

目的 为进一步提高分割精度,在模糊聚类的基础上引入统计信息,提出一种鲁棒型空间约束的模糊聚类分割算法。方法 基于局部空间信息的先验概率与后验概率,提出一种新型空间约束项,并通过卷积操作提高运行效率;进而引入负对数联合概率作为测度函数,进一步提高算法对于各像素点所属类别的甄别能力;同时将测度函数与空间约束项整合至目标函数中,通过迭代更新各参数达到最小化目标函数的目的。结果 对于合成图像的实验结果表明,本文算法对于噪声类型和噪声强度具有较强的鲁棒性;对于彩色图像的实验结果表明,在适当的特征描述符的辅助下,本文算法也能够获得令人满意的分割结果和较高的分割精度。结论 本文算法克服了现有算法的缺陷,进一步提升了图像的分割精度。其适用于分割带噪声图像,且在适当纹理特征的辅助下分割彩色图像,与同类算法的比较实验结果验证了本文算法的有效性。     

Prior-based Segmentation and Shape Registration in the Presence of Perspective Distortion

Challenging object detection and segmentation tasks can be facilitated by the availability of a reference object. However, accounting for possible transformations between the different object views, as part of the segmentation process, remains difficult. Recent statistical methods address this problem by using comprehensive training data. Other techniques can only accommodate similarity transformations. We suggest a novel variational approach to prior-based segmentation, using a single reference object, that accounts for planar projective transformation. Generalizing the Chan-Vese level set framework, we introduce a novel shape-similarity measure and embed the projective homography between the prior shape and the image to segment within a region-based segmentation functional. The proposed algorithm detects the object of interest, extracts its boundaries, and concurrently carries out the registration to the prior shape. We demonstrate prior-based segmentation on a variety of images and verify the accuracy of the recovered transformation parameters.     

结合区域协方差分析的图像显著性检测

目的 图像显著性检测的目的是为了获得高质量的能够反映图像不同区域显著性程度的显著图,利用图像显著图可以快速有效地处理图像中的视觉显著区域。图像的区域协方差分析将图像块的多维特征信息表述为一个协方差矩阵,并用协方差距离来度量两个图像块特征信息的差异大小。结合区域协方差分析,提出一种新的图像显著性检测方法。方法 该方法首先将输入的图像进行超像素分割预处理;然后基于像素块的区域协方差距离计算像素块的显著度;最后对像素块进行上采样用以计算图像像素点的显著度。结果 利用本文显著性检测方法对THUS10000数据集上随机选取的200幅图像进行了显著性检测并与4种不同方法进行了对比,本文方法估计得到的显著性检测结果更接近人工标定效果,尤其是对具有复杂背景的图像以及前背景颜色接近的图像均能达到较好的检测效果。结论 本文方法将图像像素点信息和像素块信息相结合,避免了单个噪声像素点引起图像显著性检测的不准确性,提高了检测精确度;同时,利用协方差矩阵来表示图像特征信息,避免了特征点的数量、顺序、光照等对显著性检测的影响。该方法可以很好地应用到显著目标提取和图像分割应用中。     

Shape recognition based on Kernel-edit distance

In this paper a kernel method for shape recognition is proposed. The approach is based on the edit distance between pairs of shapes after transforming them into symbol strings. The transformation of shapes into symbol strings is invariant to similarity transforms and can handle partial occlusions. Representation of shape contours uses the shape contexts and applies dynamic programming for finding the correspondence between points over shape contours. Corresponding points are then transformed into symbolic representation and the normalized edit distance computes the dissimilarity between pairs of strings in the database. Obtained distances are then transformed into suitable kernels which are classified using support vector machines. Experimental results over a variety of shape databases show that the proposed approach is suitable for shape recognition.     

结合拓扑持续性和热扩散理论的3维模型分割

目的 针对已有的3维模型分割方法人为设定过多参数的问题,提出了一种基于拓扑持续性和热亲和度矩阵的3维模型分割方法,只需给定分割部件数即可自动完成分割。方法 首先通过拓扑持续性处理3维模型的热核签名,选取生存期最长的几个特征点作为模型被分割部件的显著特征点,对于模型躯干等无法通过生长周期选取特征点的部件,则选取热核签名的最小值所对应的顶点作为显著特征点,从而获得模型的初始聚类中心;然后使用不同的扩散时间所对应的热亲和度矩阵进行k-means聚类,并根据聚类中心的偏移距离等参数筛选聚类结果,从而获得3维模型的分割结果。结果 选取人体模型进行分割实验,并与其他方法进行对比分析。结果表明,所提出的热亲和度的计算时间明显优于常用的测地距离和幂指数核;相比基于拓扑持续性和基于测地距离的聚类,本文方法可以正确分割模型的各个部件并获得恰当的分割边界。此外,本文方法针对姿态不同的同一非刚体3维模型可以取得一致性的分割结果,而且对模型表面噪声具有较好的鲁棒性。结论 和已有方法相比,本文的基于拓扑持续性和热亲和度矩阵的3维模型分割方法可以在给定分割部件的前提下自动选定聚类中心并获得恰当的分割边界,并广泛适用于常见动物模型的分割。     

CT影像中边缘病变的二维肺野分割研究

为了研究采用基于先验形状约束的活动轮廓模型方法来正确分割胸腔CT影像中高密度病变影响边缘的肺野区域, 对已分割获得的胸腔CT影像中的二维肺野区域的形状根据其相似性进行粗略分类, 并对这些先验形状进行分类学习, 通过学习获得的PCA形状向量与活动轮廓相结合的迭代方法拟合肺野区域的正确边界, 最后通过基于边界的区域分割方法对胸腔CT影像进行分割, 得到正确的肺野区域。通过所得分割结果的对比表明, 采用该模型来拟合肺野区域边界来完成肺野分割是可行的, 同时从分割结果的量化评价指标(准确性和敏感性、特异性)可看出本方法分割能够得到正确的肺野区域。     

融合互补性外形先验信息的改进参数最小割模型

目的 似物性推荐为近年来提出的一种快速物体定位方法,而参数最小割模型作为似物性推荐的一种重要模型受到广泛关注。针对传统的参数最小割模型受颜色分布影响较大的问题,提出融合多个具有信息互补作用的外形先验予以改进。方法 首先构造了一种数据驱动的基于形状共享的外形先验,以发现具有相似外形的物体区域;其次,从格式塔完形心理学的角度入手,引出了一种测地星形凸面性的外形先验,约束外形的拓扑结构,生成外形不同的物体区域;最后,结合外形先验、颜色分布、边缘响应强度以及尺度线索,构建能量函数以表征新的模型,从而增强模型对复杂颜色分布的鲁棒性。结果 分别在Seg VOC12和BSDS300数据集中进行了外形先验有效性验证、复杂颜色分布下算法鲁棒性分析和前沿似物性推荐算法对比分析等实验,结果表明,本文采用融合互补性外形先验能提高候选区域定位精度,具有更好的颜色分布鲁棒性,当颜色简单性位于[0.7,,08]之间时,算法结合外形先验后平均最佳重叠率最高可达到9.8%的提升,且在与13种具有代表性的似物性推荐算法进行区域级物体定位能力对比实验中,本文算法在不同的重叠率阈值下均达到了相近的查全率。结论 本文算法具有更高的前景与背景的区分能力,能够适应各种复杂颜色分布,同时具有较好的物体定位能力。     

Topology-Preserving Image Segmentation by Beltrami Representation of Shapes

A new approach using the Beltrami representation of a shape for topology-preserving image segmentation is proposed in this paper. Using the proposed model, the target object can be segmented from the input image by a region of user-prescribed topology. Given a target image I, a template image J is constructed and then deformed with respect to the Beltrami representation. The deformation on J is designed such that the topology of the segmented region is preserved as which the object is interior in J. The topology-preserving property of the deformation is guaranteed by imposing only one constraint on the Beltrami representation, which is easy to be handled. Introducing the Beltrami representation also allows large deformations on the topological prior J, so that it can be a very simple image, such as an image of disks, torus, disjoint disks. Hence, prior shape information of I is unnecessary for the proposed model. Additionally, the proposed model can be easily incorporated with selective segmentation, in which landmark constraints can be imposed interactively to meet any practical need (e.g., medical imaging). High accuracy and stability of the proposed model to deal with different segmentation tasks are validated by numerical experiments on both artificial and real images.     

基于超像素的点追踪方法

目的由于当前大多数的追踪算法都是使用目标外观模型和特征进行目标的匹配,在长时间的目标追踪过程中,目标的尺度和形状均会发生变化,再加上计算机视觉误差,都会导致追踪的失误。提出一种高效的目标模型用于提高追踪的效率和成功率。方法采用分割后提取的目标特征来进行建模表示外观结构,利用图像分割的方法,将被追踪的目标区域分割成多个超像素块,结合SIFT特征,形成词汇本,并计算每个词在词汇本中的权值,作为目标的外观模型。利用外观模型确定目标对象的关键点位置后,通过使用金字塔Lucas-Kanade追踪器预测关键点在下一帧图像中的位置,并移动追踪窗口位置。结果结合点位移的加权计算有效地克服目标尺度和形状变化产生的问题。结论实验结果表明在目标发生形变或光照变化的情况下,算法也能准确地、实时地追踪到目标。     

结合先验形状和Mumford-Shah模型的活动轮廓分割

基于先验形状和Mumford-Shah模型的活动轮廓分割是一种抗噪声干扰、稳定的图像分割方法。该模型采用水平集方法,并结合活动轮廓模型、先验形状和Mumford-Shah模型来控制曲线演化。特定目标的先验知识可以有效地指导目标准确分割,经过主成分分析（PCA）法可以得到感兴趣对象形状的主要信息。通过对不同图片分割实验表明,针对特定的形状,该方法对杂乱背景、部分遮挡、缺失和强噪声的图片依然能得到满意的结果。     

Shape-Based Mutual Segmentation

We present a novel variational approach for simultaneous segmentation of two images of the same object taken from different viewpoints. Due to noise, clutter and occlusions, neither of the images contains sufficient information for correct object-background partitioning. The evolving object contour in each image provides a dynamic prior for the segmentation of the other object view. We call this process mutual segmentation. The foundation of the proposed method is a unified level-set framework for region and edge based segmentation, associated with a shape similarity term. The suggested shape term incorporates the semantic knowledge gained in the segmentation process of the image pair, accounting for excess or deficient parts in the estimated object shape. Transformations, including planar projectivities, between the object views are accommodated by a registration process held concurrently with the segmentation. The proposed segmentation algorithm is demonstrated on a variety of image pairs. The homography between each of the image pairs is estimated and its accuracy is evaluated.