Partial 3‐D Correspondence from Shape Extremities

We present a 3‐D correspondence method to match the geometric extremities of two shapes which are partially isometric. We consider the most general setting of the isometric partial shape correspondence problem, in which shapes to be matched may have multiple common parts at arbitrary scales as well as parts that are not similar. Our rank‐and‐vote‐and‐combine algorithm identifies and ranks potentially correct matches by exploring the space of all possible partial maps between coarsely sampled extremities. The qualified top‐ranked matchings are then subjected to a more detailed analysis at a denser resolution and assigned with confidence values that accumulate into a vote matrix. A minimum weight perfect matching algorithm is finally iterated to combine the accumulated votes into an optimal (partial) mapping between shape extremities, which can further be extended to a denser map. We test the performance of our method on several data sets and benchmarks in comparison with state of the art.     

A Survey on Shape Correspondence

We review methods designed to compute correspondences between geometric shapes represented by triangle meshes, contours or point sets. This survey is motivated in part by recent developments in space–time registration, where one seeks a correspondence between non‐rigid and time‐varying surfaces, and semantic shape analysis, which underlines a recent trend to incorporate shape understanding into the analysis pipeline. Establishing a meaningful correspondence between shapes is often difficult because it generally requires an understanding of the structure of the shapes at both the local and global levels, and sometimes the functionality of the shape parts as well. Despite its inherent complexity, shape correspondence is a recurrent problem and an essential component of numerous geometry processing applications. In this survey, we discuss the different forms of the correspondence problem and review the main solution methods, aided by several classification criteria arising from the problem definition. The main categories of classification are defined in terms of the input and output representation, objective function and solution approach. We conclude the survey by discussing open problems and future perspectives.     

Shape similarity measure based on correspondence of visual parts

A cognitively motivated similarity measure is presented and its properties are analyzed with respect to retrieval of similar objects in image databases of silhouettes of 2D objects. To reduce influence of digitization noise, as well as segmentation errors, the shapes are simplified by a novel 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 aggregated. We applied our similarity measure to shape matching of object contours in various image databases and compared it to well-known approaches in the literature. The experimental results justify that our shape matching procedure gives an intuitive shape correspondence and is stable with respect to noise distortions.     

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.     

GCT变换及几何图形形状相似性判定

目的 人类的视觉能力可以轻易地判定两个几何图形形状的相似性,但是,这对于计算机来说仍是一个开问题。在计算机视觉应用中,不仅需要对图形形状进行分类和相似性判定,还需要对图形形状的相似性度量给出与人类的视觉判断一致的结果,这是目前图形形状表示和分类算法没有较好解决的问题。方法 通过GCT变换,将图形形状从实数空间的坐标表示变换到复数空间的复数特征向量表示,进而将判定两个几何形状的相似性问题转化为判定它们的复数空间特征向量的相似性问题。GCT变换不仅可以判定图形形状的相似性,它还是可逆的,它可以近似重建原图形形状。结果 GCT变换具有位移、尺度和旋转不变性,它不仅可以判定几何图形形状的相似性,给出与人类视觉判断一致的相似性结果,而且在两个几何图形形状相似的情况下,还能计算出它们的角度旋转和尺度缩放。结论 对于封闭的几何形状,如果几何形状的中心点位于几何形状的内部且过中心点的任一直线与该几何形状有且只有两个交点,理论证明和实验验证,GCT变换可以高效准确地判定这类几何图形形状的相似性,并给出与人类视觉判定一致的结果。     

Deformation‐Driven Shape Correspondence

Non‐rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistance, the performances of existing automatic correspondence methods depend strongly on a good initial shape alignment or shape prior, and they generally do not tolerate large shape variations. We present an automatic feature correspondence algorithm capable of handling large, non‐rigid shape variations, as well as partial matching. This is made possible by leveraging the power of state‐of‐the‐art mesh deformation techniques and relying on a combinatorial tree traversal for correspondence search. The search is deformation‐driven, prioritized by a self‐distortion energy measured on meshes deformed according to a given correspondence. We demonstrate the ability of our approach to naturally match shapes which differ in pose, local scale, part decomposition, and geometric detail through numerous examples.     

Analysis of Two-Dimensional Non-Rigid Shapes

Analysis of deformable two-dimensional shapes is an important problem, encountered in numerous pattern recognition, computer vision and computer graphics applications. In this paper, we address three major problems in the analysis of non-rigid shapes: similarity, partial similarity, and correspondence. We present an axiomatic construction of similarity criteria for deformation-invariant shape comparison, based on intrinsic geometric properties of the shapes, and show that such criteria are related to the Gromov-Hausdorff distance. Next, we extend the problem of similarity computation to shapes which have similar parts but are dissimilar when considered as a whole, and present a construction of set-valued distances, based on the notion of Pareto optimality. Finally, we show that the correspondence between non-rigid shapes can be obtained as a byproduct of the non-rigid similarity problem. As a numerical framework, we use the generalized multidimensional scaling (GMDS) method, which is the numerical core of the three problems addressed in this paper.     

Building optimal 2D statistical shape models

Statistical shape models are used widely as a basis for segmenting and interpreting images. A major drawback of the approach is the need, during training, to establish a dense correspondence across a training set of segmented shapes. We show that model construction can be treated as an optimisation problem, automating the process and guaranteeing the effectiveness of the resulting models. This is achieved by optimising an objective function with respect to the correspondence. We use an information theoretic objective function that directly promotes desirable features of the model. This is coupled with an effective method of manipulating correspondence, based on re-parameterising each training shape, to build optimal statistical shape models. The method is evaluated on several training sets of shapes, showing that it constructs better models than alternative approaches.     

Partial Functional Correspondence

In this paper, we propose a method for computing partial functional correspondence between non‐rigid shapes. We use perturbation analysis to show how removal of shape parts changes the Laplace–Beltrami eigenfunctions, and exploit it as a prior on the spectral representation of the correspondence. Corresponding parts are optimization variables in our problem and are used to weight the functional correspondence; we are looking for the largest and most regular (in the Mumford–Shah sense) parts that minimize correspondence distortion. We show that our approach can cope with very challenging correspondence settings.     

基于先验形状约束水平集模型的建筑物提取方法

提出了一种先验形状约束的变分水平集模型, 并将其用于单幅遥感图像多建筑物的自动提取中. 将多个先验形状竞争模型引入水平集方法中, 在标记函数的指导下, 利用先验形状能量来约束曲线的演化, 在对图像进行分割的同时完成建筑物的检测和提取. 标记函数的引入, 加强了先验形状与要检测目标之间的匹配关系. 同时本文提出的模型具有先验形状的旋转、缩放和平移不变性. 最后的实验结果及定量定性的分析说明了本文方法的可行性.     

Fully Spectral Partial Shape Matching

We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace‐Beltrami operators previously introduced for matching non‐isometric shapes. We show that a variant of the JAD problem with an appropriately modified coupling term (surprisingly) allows to construct quasi‐harmonic bases localized on the latent corresponding parts. This circumvents the need to explicitly compute the unknown parts by means of the cumbersome alternating minimization used in the previous approaches, and allows performing all the calculations in the spectral domain with constant complexity independent of the number of shape vertices. We provide an extensive evaluation of the proposed technique on standard non‐rigid correspondence benchmarks and show state‐of‐the‐art performance in various settings, including partiality and the presence of topological noise.     

Multiphase segmentation using an implicit dual shape prior: Application to detection of left ventricle in cardiac MRI

Cardiac magnetic resonance imaging (MRI) has been extensively used in the diagnosis of cardiovascular disease and its quantitative evaluation. Cardiac MRI techniques have been progressively improved, providing high-resolution anatomical and functional information. One of the key steps in the assessment of cardiovascular disease is the quantitative analysis of the left ventricle (LV) contractile function. Thus, the accurate delineation of LV boundary is of great interest to improve diagnostic performance. In this work, we present a novel segmentation algorithm of LV from cardiac MRI incorporating an implicit shape prior without any training phase using level sets in a variational framework. The segmentation of LV still remains a challenging problem due to its subtle boundary, occlusion, and inhomogeneity. In order to overcome such difficulties, a shape prior knowledge on the anatomical constraint of LV is integrated into a region-based segmentation framework. The shape prior is introduced based on the anatomical shape similarity between endocardium and epicardium. The shape of endocardium is assumed to be mutually similar under scaling to the shape of epicardium. An implicit shape representation using signed distance function is introduced and their discrepancy is measured in a probabilistic way. Our shape constraint is imposed by a mutual similarity of shapes without any training phase that requires a collection of shapes to learn their statistical properties. The performance of the proposed method has been demonstrated on fifteen clinical datasets, showing its potential as the basis in the clinical diagnosis of cardiovascular disease.     

Diffusion Snakes: Introducing Statistical Shape Knowledge into the Mumford-Shah Functional

We present a modification of the Mumford-Shah functional and its cartoon limit which facilitates the incorporation of a statistical prior on the shape of the segmenting contour. By minimizing a single energy functional, we obtain a segmentation process which maximizes both the grey value homogeneity in the separated regions and the similarity of the contour with respect to a set of training shapes. We propose a closed-form, parameter-free solution for incorporating invariance with respect to similarity transformations in the variational framework. We show segmentation results on artificial and real-world images with and without prior shape information. In the cases of noise, occlusion or strongly cluttered background the shape prior significantly improves segmentation. Finally we compare our results to those obtained by a level set implementation of geodesic active contours.     

基于隐式描述符的三维模型对应关系计算

三维模型对应关系计算在自动驾驶、虚拟现实、智能交通等领域得到广泛关注与应用。三维模型在几何结构和尺度发生很大变化时，低层次几何信息描述符所提取的特征将不足，从而使得对应关系计算结果准确率不高。为此，提出一种通过引入先验知识来完成三维模型对应关系计算的方法。利用深度学习网络模仿人类计算先验知识，以对模型各部分之间的几何相似性进行编码，解决模型在各部分发生显著变化时无法应用低层次几何信息计算模型间对应关系的问题。使用多视图卷积神经网络对模型各部分相应的视图进行预分割并标记，根据模型对应表面点之间的相似度隐式地计算数据驱动描述符，在数据驱动描述符的指导下计算最终的三维模型对应关系。实验结果表明，相较基于先验知识的计算方法，该方法能提高三维模型对应关系计算结果的准确率，且可有效降低测地误差。