耳廓点云形状特征匹配的路径跟随算法

路径跟随算法结合凸松弛方法与凹松弛方法,通过跟随凸凹问题的解路径,近似地求解图匹配问题,具有较高的匹配精度.将路径跟随算法用于耳廓特征图的匹配问题:首先,基于PCA方法构造耳廓点云的显著性关键点集合;然后,采用乘积型参数域上的单值二次曲面方法拟合关键点邻域内的点集,并将曲面的局部形状特征定义为耳廓的局部形状相似测度;第三,对关键点集合进行Delaunay三角剖分,得到关键点集合在三维空间内的拓扑结构图,并定义关键点图的整体结构差异测度;最后,记耳廓关键点图的组合差异测度为关键点图的整体结构差异测度与关键点上的局部形状相似测度的线性组合,并基于路径跟随算法快速求解关键点图之间的精确匹配.相关实验结果表明:与其他相关算法相比,该算法具有较高的匹配效率和匹配精度.     

关键点匹配三维人脸识别方法*

提出了一种新颖的三维人脸识别算法,其基本思路是,把代表人脸的三维点云沿X、Y或Z轴旋转,反复多次把3D人脸关键点投影到2.5D图像上,然后提取2.5D图像的关键点并进行标记,而用这些比原来小得多的关键点代替原来的面扫描。面对未知的待测人脸首先通过执行相同的多视角特征点提取技术提取关键点,然后应用一个新的加权特征点匹配算法进行识别。通过用GavabDB三维面部识别数据集进行试验评估,这个方法对中性表情人脸可获得高达94％的识别精度,对人脸表情辨识（如微笑）的准确率也超过了88％。实验结果表明,此方法在识别精     

基于Sparse ICP 的三维点云耳廓识别

提出一种新颖的三维耳廓识别方法,首先基于PCA 和SVD 分解对三维耳廓点云模 型进行归一化预处理,以统一数据库中所有耳廓点云模型的位置与姿态;然后基于Iannarelli 分 类系统提取三维耳廓的4 个局部特征区域,并利用Sparse ICP 算法对局部特征区域进行匹配;最 后根据局部特征区域中对应点间的距离判断耳廓之间的差异测度,实现耳廓形状识别。实验证明, 本文算法与其他算法相比具有较高的识别精度和识别效率。     

Isometric 3D Shape Partial Matching Using GD-DNA

Isometric 3D shape partial matching has attracted a great amount of interest, with a plethora of applications ranging from shape recognition to texture mapping. In this paper, we propose a novel isometric 3D shape partial matching algorithm using the geodesic disk Laplace spectrum (GD-DNA). It transforms the partial matching problem into the geodesic disk matching problem. Firstly, the largest enclosed geodesic disk extracted from the partial shape is matched with geodesic disks from the full shape by the Laplace spectrum of the geodesic disk. Secondly, Generalized Multi-Dimensional Scaling algorithm (GMDS) and Euclidean embedding are conducted to establish final point correspondences between the partial and the full shape using the matched geodesic disk pair. The proposed GD-DNA is discriminative for matching geodesic disks, and it can well solve the anchor point selection problem in challenging partial shape matching tasks. Experimental results on the Shape Retrieval Contest 2016 (SHREC’16) benchmark validate the proposed method, and comparisons with isometric partial matching algorithms in the literature show that our method has a higher precision.     

深度特征融合的非刚性三维形状局部匹配

针对海量、异构三维形状匹配与智能检索技术的需求,提出了一种基于级联卷积神经网络(F-PointCNN)深度特征融合的三维形状局部匹配方法.首先,采用特征袋模型,提出几何图像表示方法,该几何图像不仅能够有效区分同类异构的非刚性三维模型,而且能够揭示大尺度不完整三维模型的结构相似性.其次,构建级联卷积神经网络学习框架F-PointCNN,其中,BoF-CNN从几何图像中学习深度全局特征,建立融合局部特征与全局特征的点特征表示;进而对Point-CNN进行点特征的细化与提纯,生成具有丰富信息的深度融合特征,有效提高形状特征的区分性与鲁棒性.最终,通过交叉矩阵度量方法高效实现非刚性三维模型的局部形状匹配.在公开的非刚性三维模型数据库的实验结果表明,该方法提取的特征在大尺度变换的形状分类及局部形状匹配中具有更强的识别力与更高的匹配精度.     

Conformal geometry and its applications on 3D shape matching, recognition, and stitching

Three-dimensional shape matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition, and classification. However, shape matching with noise, occlusion, and clutter is a challenging problem. In this paper, we analyze a family of quasi-conformal maps including harmonic maps, conformal maps, and least-squares conformal maps with regards to 3D shape matching. As a result, we propose a novel and computationally efficient shape matching framework by using least-squares conformal maps. According to conformal geometry theory, each 3D surface with disk topology can be mapped to a 2D domain through a global optimization and the resulting map is a diffeomorphism, i.e., one-to-one and onto. This allows us to simplify the 3D shape-matching problem to a 2D image-matching problem, by comparing the resulting 2D parametric maps, which are stable, insensitive to resolution changes and robust to occlusion, and noise. Therefore, highly accurate and efficient 3D shape matching algorithms can be achieved by using the above three parametric maps. Finally, the robustness of least-squares conformal maps is evaluated and analyzed comprehensively in 3D shape matching with occlusion, noise, and resolution variation. In order to further demonstrate the performance of our proposed method, we also conduct a series of experiments on two computer vision applications, i.e., 3D face recognition and 3D nonrigid surface alignment and stitching.     

基于空间结构的图像特征匹配算法

图像二进制特征描述器比浮点数特征描述器存储容量小、计算速度更快。在对常用二进制特征描述器进行分析的基础上,利用图像特征点之间的空间结构信息改进FREAK描述器的采样模式,提出MPFREAK描述器,提高特征描述能力;针对特征匹配时最近邻算法运行较慢的缺点,改进LSH算法,减少候选集列表空间,提出了海明空间的二进制特征快速匹配算法MLSH。实验表明,MPFREAK描述器描述能力优于其他算法,特征匹配算法效果明显、速度更快。     

结合形状滤波和几何图像的3D人脸识别算法

表情变化是3维人脸精确识别面临的主要问题,为此提出一种新的对表情鲁棒的匹配方法。通过形状滤波器将人脸空域形状分成不同频率的3个部分：低频部分对应表情变化;高频部分代表白噪声;包含身份区分度最大的中频信息作为表情不变特征。再利用网格平面参数化,将人脸网格映射到边界为正四边形的平面区域内,经过线性插值采样得到3维形状的2维几何图像。最后通过图像匹配识别人脸。FRGC v2人脸数据库上的实验结果表明,使用形状滤波能显著提高算法的精度和鲁棒性。     

一种2D+3D人耳融合识别方法研究

提出一种2D和3D模式相融合的人耳识别方法.利用基于Adaboost算法的人耳检测器在2D图像上进行人耳检测,在对应的深度图像中定位出人耳区域.对于2D人耳图像,利用核Fisher鉴别分析法进行特征提取,再利用最近邻分类器进行识别;对于3D人耳深度图,利用3D局部二值模式进行特征提取,结合几何约束和位置约束在测试耳和注册原型耳上进行特征点匹配,并利用匹配点数进行识别.最后将两者进行决策层融合.在UND人耳图像库上的实验结果表明,与单独2D或3D人耳识别相比,文中提出的2D+3D人耳融合识别方法在光照变化情况下能取得更好的识别性能.     

Multiperson interaction recognition in images: A body keypoint based feature image analysis

Most interaction recognition approaches have been limited to single‐person action classification in videos. However, for still images where motion information is not available, the task becomes more complex. Aiming to this point, we propose an approach for multiperson human interaction recognition in images with keypoint‐based feature image analysis. Proposed method is a three‐stage framework. In the first stage, we propose feature‐based neural network (FCNN) for action recognition trained with feature images. Feature images are body features, that is, effective distances between a set of body part pairs and angular relation between body part triplets, rearranged in 2D gray‐scale image to learn effective representation of complex actions. In the later stage, we propose a voting‐based method for direction encoding to anticipate probable motion in steady images. Finally, our multiperson interaction recognition algorithm identifies which human pairs are interacting with each other using an interaction parameter. We evaluate our approach on two real‐world data sets, that is, UT‐interaction and SBU kinect interaction. The empirical experiments show that results are better than the state‐of‐the‐art methods with recognition accuracy of 95.83% on UT‐I set 1, 92.5% on UT‐I set 2, and 94.28% on SBU clean data set.     

基于HOG特征与子区域模糊融合的人耳识别研究

作为一种新兴的生物特征识别技术,人耳识别具有其自身独特优势.利用局部特征信息,研究一类新型的基于梯度方向直方图的人耳身份识别方法,提出一种基于梯度方向直方图与子区域模糊融合相结合的人耳识别方案.将人耳图像划分为不同子区域,分别提取各子区域梯度方向直方图特征,引入模糊隶属度匹配融合策略,获取最终的分类结果.与多种方法的对比实验表明,基于梯度方向直方图的特征提取方法具有高识别性能,针对USTB人耳图像库3的测试实验,可达到99.75％的识别率.     

An active trinocular vision system of sensing indoor navigation environment for mobile robots

Intelligent autonomous mobile robots must be able to sense and recognize 3D indoor space where they live or work. However, robots are frequently situated in cluttered environments with various objects hard to be robustly perceived. Although the monocular and binocular vision sensors have been widely used for mobile robots, they suffer from image intensity variations, insufficient feature information and correspondence problems. In this paper, we propose a new 3D sensing system, in which the laser-structured-lighting method is basically utilized because of the robustness on the nature of the navigation environment and the easy extraction of feature information of interest. The proposed active trinocular vision system is composed of the flexible multi-stripe laser projector and two cameras arranged with a triangular shape. By modeling the laser projector as a virtual camera and using the trinocular epipolar constraints, the matching pairs of line features observed into two real camera images are established, and 3D information from one-shot image can be extracted on the patterned scene. For robust feature matching, here we propose a new correspondence matching technique based on line grouping and probabilistic voting. Finally, a series of experimental tests is performed to show the simplicity, efficiency, and accuracy of this proposed sensor system for 3D environment sensing and recognition.     

Spatial consistency of dense features within interest regions for efficient landmark recognition

Recently, feature grouping has been proposed as a method for improving retrieval results for logos and web images. This relies on the idea that a group of features matching over a local region in an image is more discriminative than a single feature match. In this paper, we evolve this concept further and apply it to the more challenging task of landmark recognition. We propose a novel combination of dense sampling of SIFT features with interest regions which represent the more salient parts of the image in greater detail. In place of conventional dense sampling used in category recognition that computes features on a regular grid at a number of fixed scales, we allow the sampling density and scale to vary based on the scale of the interest region. We develop new techniques for exploring stronger geometric constraints inside the feature groups and computing the match score. The spatial information is stored efficiently in an inverted index structure. The proposed approach considers part-based matching of interest regions instead of matching entire images using a histogram under bag-of-words. This helps reducing the influence of background clutter and works better under occlusion. Experiments reveal that directing more attention to the salient regions of the image and applying proposed geometric constraints helps in vastly improving recognition rates for reasonable vocabulary sizes.