使用形状变化描述三维模型

针对三维模型检索中的形状特征提取问题,提出利用三维模型自身形状变化信息构造形状特征描述符的方法.首先选择一组等间距互相平行的平面切割三维模型,得到三维模型的切片集合;然后定义相邻切片的 差来描述切片间的形状变化,并通过所有相邻切片间的差值来反映三维模型自身的形状变化,以此作为三维模型的形状特征描述符.该方法与三维模型的旋转、平移无关,同时不依赖于模型的点云分布,并且精简模型三角面片对算法的影响较小.实验结果验证了该方法的有效性.     

改进的三维模型形状分布检索算法

针对传统D1距离形状分布函数获取采样点计算复杂、模型内容描述不充分和检索速率低下等问题提出了一种改进方法。该方法的关键点是：首先采用平移和缩放对模型进行标准化处理,用于减少面片之间的差异,使得采样点均匀地落在模型的表面;其次采用三角面片的索引号进行随机数的生成,并且利用三角面片的重心和质心进行有效的计算,以便用于缩短模型的处理时间和提高检索速率。利用普林斯顿大学三维模型数据库中的部分模型作为实验数据,实现结果表明：改进的方法不会降低模型的检索性能,并有效地减少了模型查询和处理时间。     

A survey of content based 3D shape retrieval methods

Recent developments in techniques for modeling, digitizing and visualizing 3D shapes has led to an explosion in the number of available 3D models on the Internet and in domain-specific databases. This has led to the development of 3D shape retrieval systems that, given a query object, retrieve similar 3D objects. For visualization, 3D shapes are often represented as a surface, in particular polygonal meshes, for example in VRML format. Often these models contain holes, intersecting polygons, are not manifold, and do not enclose a volume unambiguously. On the contrary, 3D volume models, such as solid models produced by CAD systems, or voxels models, enclose a volume properly. This paper surveys the literature on methods for content based 3D retrieval, taking into account the applicability to surface models as well as to volume models. The methods are evaluated with respect to several requirements of content based 3D shape retrieval, such as: (1) shape representation requirements, (2) properties of dissimilarity measures, (3) efficiency, (4) discrimination abilities, (5) ability to perform partial matching, (6) robustness, and (7) necessity of pose normalization. Finally, the advantages and limitations of the several approaches in content based 3D shape retrieval are discussed.

3D shape acquisition and integral compact representation using optical scanning and enhanced shape parameterization

An efficient computational methodology for shape acquisition, processing and representation is developed. It includes 3D computer vision by applying triangulation and stereo-photogrammetry for high-accuracy 3D shape acquisition. Resulting huge 3D point clouds are successively parameterized into mathematical surfaces to provide for compact data-set representation, yet capturing local details sufficiently. B-spline surfaces are employed as parametric entities in fitting to point clouds resulting from optical 3D scanning. Beyond the linear best-fitting algorithm with control points as fitting variables, an enhanced non-linear procedure is developed. The set of best fitting variables in minimizing the approximation error norm between the parametric surface and the 3D cloud includes the control points coordinates. However, they are augmented by the set of position parameter values which identify the respectively closest matching points on the surface for the points in the cloud. The developed algorithm is demonstrated to be efficient on demanding test cases which encompass sharp edges and slope discontinuities originating from physical damage of the 3D objects or shape complexity.     

Conformal spherical representation of 3D genus-zero meshes

This paper describes an approach of representing 3D shape by using a set of invariant spherical harmonic (SH) coefficients after conformal mapping. Specifically, a genus-zero 3D mesh object is first conformally mapped onto the unit sphere by using a modified discrete conformal mapping, where the modification is based on Möbius factorization and aims at obtaining a canonical conformal mapping. Then a SH analysis is applied to the resulting conformal spherical mesh. The obtained SH coefficients are further made invariant to translation and rotation, while at the same time retain the completeness, thanks to which the original shape information has been faithfully preserved.     

一种基于球面调和描述子的3维模型相似性比较算法

提出了一种基于球面调和描述子的3维模型相似性比较算法。首先,对3维模型进行一分为二的递归分解,然后对每次递归分解得到的3维模型顶点集合进行球面映射得到其球面图像,最后计算所有球面图像的球面调和描述子得到3维模型的特征二叉树。通过对3维模型特征二叉树进行相似性比较可以得到3维模型的相似性。实验结果表明,该算法不仅能较好地比较3维模型相似性,而且对坐标系旋转变换、模型噪声、网格简化和细分具有较好的鲁棒性。     

基于内容和语义的三维模型检索综述

多媒体信息的检索是信息复用的重要途径。三维模型检索作为三维建模过程中的关键技术之一,近年来随着三维建模的广泛运用而被深入研究。针对目前三维模型检索技术的进展,首先介绍了基于内容的检索技术,按照提取的特征将其分为四类：基于统计数据、基于几何外形、基于拓扑结构和基于视觉特征,分别介绍各类技术的主要成果和优缺点;然后介绍考虑语义信息,解决“语义鸿沟”现象的基于语义的检索方法,根据切入角度将其分为三类：相关性反馈、主动学习和本体技术,随后介绍了各类技术的相互关系与特点;最后总结和提出了三维模型检索的未来研究的发展方向。     

形状的全尺度可视化表示与识别

目的视觉目标的形状特征表示和识别是图像领域中的重要问题。在实际应用中,视角、形变、遮挡和噪声等干扰因素造成识别精度较低,且大数据场景需要算法具有较高的学习效率。针对这些问题,本文提出一种全尺度可视化形状表示方法。方法在尺度空间的所有尺度上对形状轮廓提取形状的不变量特征,获得形状的全尺度特征。将获得的全部特征紧凑地表示为单幅彩色图像,得到形状特征的可视化表示。将表示形状特征的彩色图像输入双路卷积网络模型,完成形状分类和检索任务。结果通过对原始形状加入旋转、遮挡和噪声等不同干扰的定性实验,验证了本文方法具有旋转和缩放不变性,以及对铰接变换、遮挡和噪声等干扰的鲁棒性。在通用数据集上进行形状分类和形状检索的定量实验,所得准确率在不同数据集上均超过对比算法。在MPEG-7数据集上精度达到99.57%,对比算法的最好结果为98.84%。在铰接和射影变换数据集上皆达到100%的识别精度,而对比算法的最好结果分别为89.75%和95%。结论本文提出的全尺度可视化形状表示方法,通过一幅彩色图像紧凑地表达了全部形状信息。通过卷积模型既学习了轮廓点间的形状特征关系,又学习了不同尺度间的形状特征关系。本文方法...     

基于正交投影的三维模型相似性比较算法研究*

提出了一种基于二维正交投影图像的三维模型相似性比较算法。首先计算三维模型的二维正交投影图像,然后提取二维正交投影图像的边缘轮廓夹角特征,并比较这些二维正交投影图像的相似性,最后通过二维正交投影图像的轮廓相似性来获取三维模型的相似性。实验验证了该算法的可行性,并且其对于三维模型检索所要求的平移、旋转和缩放不变性具有较好的鲁棒性。     

一种基于球面调和分析的三维模型检索算法

提取关于坐标旋转不变的特征描述符以及提高特征描述符对噪声的鲁棒性是基于内容三维模型检索技术中有待进一步研究解决的问题之一。将三维模型表面离散成三维点数据,然后使用球面调和方法对得到的点数据进行调和分析得到三维模型旋转不变的特征向量,并且能够增加算法对模型表面噪声的鲁棒性提高检索准确度。实验证明该算法在检索准确度和对噪声的鲁棒性上都有所提高。     

Planar shape representation and matching under projective transformation

This paper introduces a new representation for planar objects which is invariant to projective transformation. Proposed representation relies on a new shape basis which we refer to as the conic basis. The conic basis takes conic-section coefficients as its dimensions and represents the object as a convex combination of conic-sections. Pairs of conic-sections in this new basis and their projective invariants provides the proposed view invariant representation. We hypothesize that two projectively transformed versions of an object result in the same representation. We show that our hypothesis provides promising recognition performance when we use the nearest neighbor rule to match projectively deformed objects.     

基于IsoRank的三维耳廓形状匹配

基于IsoRank算法实现了耳廓剖分图的匹配,进而实现了基于耳廓三维形状的身份鉴别.基于主成分分析提取待匹配三维耳廓上的关键点,构造耳廓关键点的三维网格图;基于IsoRank算法求2个关键点三维网格图结点之间的对应关系,实现耳廓关键点的图匹配.由于采用了IsoRank算法,耳廓关键点网格图得到了全局对齐,两耳廓之间的整体匹配得到最大化.实验结果表明,基于IsoRank算法的耳廓匹配方法具有较低的时间复杂度以及较高的匹配精度和匹配效率.     

一种基于加强三维模型细节的形状分布检索算法*

基于形状分布算法提出了一种加强细节检索的算法。该算法首先将经过预处理的模型分割为N个子模块并分别进行特征提取,然后构造每个子模块的形状分布直方图,最后通过比较子模块的相似度来计算模型的相似度。该算法相比形状分布算法比较准确地计算出了模型间的相似性,有效地提高了细节的分辨,解决了外形相近但细节不同的问题。