形状模板约束的图像协同分割

已有的协同分割方法没有考虑到同一类图像所具有的目标形状相似性,从而使得分割结果不一致。提出了形状模板约束的图像交互协同分割算法,通过少量用户交互提高协同分割质量。该算法首先定义形状模板;然后通过形状上下文实现分割结果传递,自动形成图像分割所需的前景和背景掩码;最后采用最小割理论进行分割边界优化。实验结果表明,与已有的协同分割算法相比,该算法能在简单用户交互下明显提高分割质量,使分割结果更具有语义性。     

Shape ultimate attribute opening

The ultimate opening (UO) is a powerful segmentation operator recently introduced by Beucher [1]. It automatically selects the most contrasted regions of an image. However, in the presence of nested structures (e.g. text in a signboard or windows in a contrasted facade), interesting structures may be masked by the containing region. In this paper we focus on ultimate attribute openings and we propose a method that improves the results by favoring regions with a predefined shape via a similarity function. An efficient implementation using a max-tree representation of the image is proposed. The method is validated in the framework of three applications: facade analysis, scene-text detection and cell segmentation. Experimental results show that the proposed method yields better segmentation results than UO.     

先验形状约束的超声前列腺图像分割方法

提出一种结合超声前列腺图像的局部特征和前列腺的先验形状知识的分割方法。该方法在传统图像分割方法中引入了前列腺的先验形状约束,使得分割能够一定程度地避免由于超声图像中噪声、伪影、灰度分布不均匀等因素对前列腺分割所造成的影响。算法分为两个部分：先验形状模型的学习和先验形状约束的分割。在先验形状模型学习阶段,采用主成分分析方法对形状作特征提取,以高斯分布作为形变参数的估计;在先验形状约束分剖阶段,将基于局部高斯拟合特征的活动轮廓模型与形状模型相结合对前列腺图像分割。实验表明,所提出的方法在超声前列腺图像中取得了良好的分割效果,为临床诊断和治疗提供了定量分析的工具。     

Transductive 3D Shape Segmentation using Sparse Reconstruction

We propose a transductive shape segmentation algorithm, which can transfer prior segmentation results in database to new shapes without explicitly specification of prior category information. Our method first partitions an input shape into a set of segmentations as a data preparation, and then a linear integer programming algorithm is used to select segments from them to form the final optimal segmentation. The key idea is to maximize the segment similarity between the segments in the input shape and the segments in database, where the segment similarity is computed through sparse reconstruction error. The segment‐level similarity enables to handle a large amount of shapes with significant topology or shape variations with a small set of segmented example shapes. Experimental results show that our algorithm can generate high quality segmentation and semantic labeling results in the Princeton segmentation benchmark.     

3D anatomical shape atlas construction using mesh quality preserved deformable models

3D anatomical shape atlas construction has been extensively studied in medical image analysis research, owing to its importance in model-based image segmentation, longitudinal studies and populational statistical analysis, etc. Among multiple steps of 3D shape atlas construction, establishing anatomical correspondences across subjects, i.e., surface registration, is probably the most critical but challenging one. Adaptive focus deformable model (AFDM) [1] was proposed to tackle this problem by exploiting cross-scale geometry characteristics of 3D anatomy surfaces. Although the effectiveness of AFDM has been proved in various studies, its performance is highly dependent on the quality of 3D surface meshes, which often degrades along with the iterations of deformable surface registration (the process of correspondence matching). In this paper, we propose a new framework for 3D anatomical shape atlas construction. Our method aims to robustly establish correspondences across different subjects and simultaneously generate high-quality surface meshes without removing shape details. Mathematically, a new energy term is embedded into the original energy function of AFDM to preserve surface mesh qualities during deformable surface matching. More specifically, we employ the Laplacian representation to encode shape details and smoothness constraints. An expectation–maximization style algorithm is designed to optimize multiple energy terms alternatively until convergence. We demonstrate the performance of our method via a set of diverse applications, including a population of sparse cardiac MRI slices with 2D labels, 3D high resolution CT cardiac images and rodent brain MRIs with multiple structures. The constructed shape atlases exhibit good mesh qualities and preserve fine shape details. The constructed shape atlases can further benefit other research topics such as segmentation and statistical analysis.     

参数自适应的KPCA先验形状约束目标分割

为克服固定先验形状在分割可变形目标时的困难,提出一种基于核主元分析(KPCA)的参数自适应先验形状约束水平集分割方法.首先使用KPCA变换获取目标先验形状特征空间的基底向量;其次用Parzen窗估计待分割图像的灰度分布以构造图像数据能量项;然后使用仿射变换对齐图像感兴趣区域与先验形状,从而将目标形状先验知识集成到分割模型中;最后在基于水平集方法求解演化方程时自适应地估计参数,实现形变目标的分割.实验结果表明,相比于CV (Chan-Vese)模型和单先验形状约束的水平集方法,该模型能够有效地分割不同姿态的目标形状.     

Coupled region-edge shape priors for simultaneous localization and figure-ground segmentation

We propose a new algorithm for simultaneous localization and figure-ground segmentation where coupled region-edge shape priors are involved with two different but complementary roles. We resort to a segmentation-based hypothesis-and-test paradigm in this research, where the region prior is used to form a segmentation and the edge prior is used to evaluate the validity of the formed segmentation. Our fundamental assumption is that the optimal shape-constrained segmentation that maximizes the agreement with the edge prior occurs at the correctly hypothesized location. Essentially, the proposed algorithm addresses a mid-level vision issue that aims at producing a map image for part detection useful for high-level vision tasks. Our experiments demonstrated that this algorithm offers promising results in terms of both localization and segmentation.     

Parameters of Multi-Segmentation based on Segmentation Evaluation Function

The segmentation parameters is key to the segmentation result in the object\|oriented classification.Further,it would effect the result of the classification.Segmentation evaluation function is a standard which is significant to the quality of segmentation.Scale,shape and compactness could evaluate the quality of the segmentation by combining from the different levels of the three parameters.We improved the methods on the segmentation evaluation function,and digged into the affectation of the weight of area.The methods of variance analysis and correlation analysis were used to analyze the effect of the four segmentation evaluation functions with scale,shape and compactness.There were 10 pieces of images of Landsat 8 OLI and GF\|1 as samples of the experience,which were selected from the county.It turned out that：First,the segmentation scale is the most important parameter to the result and the shape is heavier than the compactness.Second,the high quality of the segmentation ask for small shape and big compactness.Third,the area could improve the stability of the segmentation evaluation function.Forth,the proposed method correspond to the existed method and it could evaluate the segmentation.Fifth,the different resolution had the same effect on the selection of segmentation parameters.     

Progressive 3D shape segmentation using online learning

In this article, we propose a progressive 3D shape segmentation method, which allows users to guide the segmentation with their interactions, and does segmentation gradually driven by their intents. More precisely, we establish an online framework for interactive 3D shape segmentation, without any boring collection preparation or training stages. That is, users can collect the 3D shapes while segment them, and the segmentation will become more and more precise as the accumulation of the shapes.Our framework uses Online Multi-Class LPBoost (OMCLP) to train/update a segmentation model progressively, which includes several Online Random forests (ORFs) as the weak learners. Then, it performs graph cuts optimization to segment the 3D shape by using the trained/updated segmentation model as the optimal data term. There exist three features of our framework. Firstly, the segmentation model can be trained gradually during the collection of the shapes. Secondly, the segmentation results can be refined progressively until users’ requirements are met. Thirdly, the segmentation model can be updated incrementally without retraining all shapes when users add new shapes. Experimental results demonstrate the effectiveness of our approach.     

Adaptive shape prior for recognition and variational segmentation of degraded historical characters

We propose a variational method for model based segmentation of gray-scale images of highly degraded historical documents. Given a training set of characters (of a certain letter), we construct a small set of shape models that cover most of the training set's shape variance. For each gray-scale image of a respective degraded character, we construct a custom made shape prior using those fragments of the shape models that best fit the character's boundary. Therefore, we are not limited to any particular shape in the shape model set. In addition, we demonstrate the application of our shape prior to degraded character recognition. Experiments show that our method achieves very accurate results both in segmentation of highly degraded characters and both in recognition. When compared with manual segmentation, the average distance between the boundaries of respective segmented characters was 0.8 pixels (the average size of the characters was 70*70 pixels).     

Application of planar shape comparison to object retrieval in image databases

A similarity measure for silhouettes of 2D objects is presented, and its properties are analyzed with respect to retrieval of similar objects in image databases. To reduce influence of digitization noise as well as segmentation errors the shapes are simplified by a new process of digital curve evolution. To compute our similarity measure, we first establish the best possible correspondence of visual parts (without explicitly computing the visual parts). Then the similarity between corresponding parts is computed and summed. Experimental results show that our shape matching procedure gives an intuitive shape correspondence and is stable with respect to noise distortions.     

Cross-Shape Attention for Part Segmentation of 3D Point Clouds

We present a deep learning method that propagates point-wise feature representations across shapes within a collection for the purpose of 3D shape segmentation. We propose a cross-shape attention mechanism to enable interactions between a shape's point-wise features and those of other shapes. The mechanism assesses both the degree of interaction between points and also mediates feature propagation across shapes, improving the accuracy and consistency of the resulting point-wise feature representations for shape segmentation. Our method also proposes a shape retrieval measure to select suitable shapes for cross-shape attention operations for each test shape. Our experiments demonstrate that our approach yields state-of-the-art results in the popular PartNet dataset.     

多先验形状的图割分割方法*

为了分割图像中的多个目标,提出多先验形状约束的多目标图割分割方法。首先,使用离散水平集框架的形状距离定义先验形状模型,并将这一模型合并到图割框架的区域项中,同时通过加入多类形状先验扩展形状先验能量。然后,通过自适应调节形状先验项的权重系数,实现自适应控制形状项在能量函数中所占的比重,克服人工选择参数的困难,提高分割效率。最后,为使方法对于形状仿射变换具有不变性,使用尺度不变特征变换和随机抽样一致结合的方法进行对准。实验表明,文中方法能够较好分割图像中的多个目标,且能较好克服图像的噪声污染、目标被遮挡等信息缺失问题。     

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.     

Image segmentation with one shape prior — A template-based formulation

Image segmentation with one shape prior is an important problem in computer vision. Most algorithms not only share a similar energy definition, but also follow a similar optimization strategy. Therefore, they all suffer from the same drawbacks in practice such as slow convergence and difficult-to-tune parameters. In this paper, by reformulating the energy cost function, we establish an important connection between shape-prior based image segmentation with intensity-based image registration. This connection enables us to combine advanced shape and intensity modeling techniques from segmentation society with efficient optimization techniques from registration society. Compared with the traditional regularization-based approach, our framework is more systematic and more efficient, able to converge in a matter of seconds. We also show that user interaction (such as strokes and bounding boxes) can easily be incorporated into our algorithm if desired. Through challenging image segmentation experiments, we demonstrate the improved performance of our algorithm compared to other proposed approaches.     

ALSBIR: A local-structure-based image retrieval

The general-purpose shape retrieval problem is a challenging task. Particularly, an ideal technique, which can work in clustered environment, meet the requirements of perceptual similarity measure on partial query and overcoming dimensionality curse and adverse environment, is in demand. This paper reports our study on one local structural approach that addresses these issues. Shape representation and indexing are two key points in shape retrieval. The proposed approach combines a novel local-structure-based shape representation and a new histogram indexing structure. The former makes possible partial shape matching of objects without the requirement of segmentation (separation) of objects from complex background, while the latter has an advantage on indexing performance. The search time is linearly proportional to the input complexity. In addition, the method is relatively robust under adverse environments. It is able to infer retrieval results from incomplete information of an input by first extracting consistent and structurally unique local neighborhood information from inputs or models, and then voting on the optimal matches. Thousands of images have been used to test the proposed concepts on sensitivity analysis, similarity-based retrieval, partial query and mixed object query. Very encouraging experimental results with respect to efficiency and effectiveness have been obtained.     

基于二维自动主动形状模型的椎间盘核磁共振图像分割算法

针对椎间盘手动建模主观耗时以及现有分割方法不够准确的问题,提出了一种二维自动主动形状模型(2D-AASM)方法,由基于最小描述长度的椎间盘自动统计形状建模、二维局部梯度建模和分割三部分组成。将25组脊柱核磁共振图像(MRI)的椎间盘专家分割结果作为训练集,采用基于最小描述长度的方法确定点对应关系,建立椎间盘T4-5的统计形状模型和二维局部梯度模型,生成形状模型的方差和目标函数值均小于手工和弧长参数方法。模型建立后,通过3组脊柱MRI数据测试提出的分割方法,与传统主动形状模型（ASM）和加入一维局部梯度模型的ASM方法相比,其分割结果具有更高的戴斯系数值,更低的过分割率和欠分割率。实验结果表明,所提方法建立的模型更准确,分割结果更精确。     

Graph cut segmentation with a statistical shape model in cardiac MRI

Segmenting the right ventricle (RV) in magnetic resonance (MR) images is required for cardiac function assessment. The segmentation of the RV is a difficult task due to low contrast with surrounding tissues and high shape variability. To overcome these problems, we introduce a segmentation method based on a statistical shape model obtained with a principal component analysis (PCA) on a set of representative shapes of the RV. Shapes are not represented by a set of points, but by distance maps to their contour, relaxing the need for a costly landmark detection and matching process. A shape model is thus obtained by computing a PCA on the shape variations. This prior is registered onto the image via a very simple user interaction and then incorporated into the well-known graph cut framework in order to guide the segmentation. Our semi-automatic segmentation method has been applied on 248 MR images of a publicly available dataset (from MICCAI’12 Right Ventricle Segmentation Challenge). We show that encouraging results can be obtained for this challenging application.