多模式3维视频形状编码

目的 具有立体感和高端真实感的3D视频正越来越受到学术界和产业界的关注和重视,未来在3D影视、机器视觉、远程医疗、军事航天等领域将有着广泛的应用前景。对象基3D视频是未来3D视频技术的重要发展趋势,其中高效形状编码是对象基3D视频应用中的关键问题。但现有形状编码方法主要针对图像和视频对象,面向3D视频的形状编码算法还很少。为此,基于对象基3D视频的应用需求,提出一种基于轮廓和链码表示的高效多模式3D视频形状编码方法。方法 对于给定的3D视频形状序列逐帧进行对象轮廓提取并预处理后,进行对象轮廓活动性分析,将形状图像分成帧内模式编码图像和帧间预测模式编码图像。对于帧内编码图像,基于轮廓内链码方向约束和线性特征进行高效编码。对于帧间编码图像,采用基于链码表示的轮廓基运动补偿预测、视差补偿预测、联合运动与视差补偿预测等多种模式进行编码,以充分利用视点内对象轮廓的帧间时域相关性和视点间对象轮廓的空域相关性,从而达到高效编码的目的。结果 实验仿真结果显示所提算法性能优于经典和现有的最新同类方法,压缩效率平均能提高9.3%到64.8%不等。结论 提出的多模式3D视频形状编码方法可以有效去除对象轮廓的帧间和视点间冗余,能够进行高效编码压缩,性能优于现有同类方法,可广泛应用于对象基编码、对象基检索、对象基内容分析与理解等。     

3D网格的分层多描述编码方法

结合分层编码与多描述编码的优势,提出三维网格分层多描述编码（LMDC）方法：先对3D网格进行几何分解,得到一个粗糙网格和细化网格所需的连通性信息,采用分层编码思想,粗糙网格作为基本层,而将细化信息作为增强层。同时采用基于顶点分裂树的多描述编码方法对基本层加以保护,保证基本层在差错信道中的有效传输。采用分层多描述编码对3D模型进行编码的方法,非常适合于带宽受限和多路径传输的异构网络。实验证明,该方法能获得较高的压缩率,并在有丢包的情况下能有效地保护并恢复出可接受的基本层网格。     

基于分层策略的三维非刚性模型配准算法

在三维非刚性模型分析中,通常需要对不同姿态下的模型进行配准。针对传统配准算法存在复杂度高、计算量大、精确度低等问题,提出一种新的基于分层策略的三维非刚性模型配准算法。首先,定义热核签名函数为模型的标量域,使用同源聚类算法提取模型的特征点和特征区域,进而提出三维几何模型的树形表示方法:它的根节点为三维几何模型,内部节点为模型的特征区域,叶节点为包含在相应区域的特征点。然后,根据三维几何模型的树形表示提出模型的分层配准算法。在SHREC 2010模型配准数据集上对比分析了分层配准算法、推广的多维尺度变换算法（GMDS）和博弈论方法在等距变换、孔洞、小孔洞、尺度变换、局部尺度变换、重采样、噪声、散粒噪声以及拓扑变换等情况下的性能。实验结果表明,在以上三维几何模型数据受干扰的情况下,分层配准算法的准确性明显优于GMDS方法和博弈论方法,同时具有较低的计算复杂度。     

A 3D shape segmentation approach for robot grasping by parts

Neuro-psychological findings have shown that human perception of objects is based on part decomposition. Most objects are made of multiple parts which are likely to be the entities actually involved in grasp affordances. Therefore, automatic object recognition and robot grasping should take advantage from 3D shape segmentation. This paper presents an approach toward planning robot grasps across similar objects by part correspondence. The novelty of the method lies in the topological decomposition of objects that enables high-level semantic grasp planning.In particular, given a 3D model of an object, the representation is initially segmented by computing its Reeb graph. Then, automatic object recognition and part annotation are performed by applying a shape retrieval algorithm. After the recognition phase, queries are accepted for planning grasps on individual parts of the object. Finally, a robot grasp planner is invoked for finding stable grasps on the selected part of the object. Grasps are evaluated according to a widely used quality measure. Experiments performed in a simulated environment on a reasonably large dataset show the potential of topological segmentation to highlight candidate parts suitable for grasping.     

3D human pose estimation from image using couple sparse coding

Recent studies have demonstrated that high-level semantics in data can be captured using sparse representation. In this paper, we propose an approach to human body pose estimation in static images based on sparse representation. Given a visual input, the objective is to estimate 3D human body pose using feature space information and geometrical information of the pose space. On the assumption that each data point and its neighbors are likely to reside on a locally linear patch of the underlying manifold, our method learns the sparse representation of the new input using both feature and pose space information and then estimates the corresponding 3D pose by a linear combination of the bases of the pose dictionary. Two strategies for dictionary construction are presented: (i) constructing the dictionary by randomly selecting the frames of a sequence and (ii) selecting specific frames of a sequence as dictionary atoms. We analyzed the effect of each strategy on the accuracy of pose estimation. Extensive experiments on datasets of various human activities show that our proposed method outperforms state-of-the-art methods.     

Dense statistic versus sparse feature-based approach for 3D object recognition

In this article we introduce and compare two approaches towards automatic classification of 3D objects in 2D images. The first one is based on statistical modeling of wavelet features. It estimates probability density functions for all possible object classes considered in a particular recognition task. The second one uses sparse local features. For training, SURF features are extracted from the training images. During the recognition phase, features from the image are matched geometrically, providing the best fitting object for the query image. Experiments were performed for different training sets using more than 40 000 images with different backgrounds. Results show very good classification rates for both systems and point out special characteristics for each approach, which make them more suitable for different applications.     

A mathematical morphology approach to image based 3D particle shape analysis

Angularity is a critically important property in terms of the performance of natural particulate materials. It is also one of the most difficult to measure objectively using traditional methods. Here we present an innovative and efficient approach to the determination of particle angularity using image analysis. The direct use of three-dimensional data offers a more robust solution than the two-dimensional methods proposed previously. The algorithm is based on the application of mathematical morphological techniques to range imagery, and effectively simulates the natural wear processes by which rock particles become rounded. The analysis of simulated volume loss is used to provide a valuable measure of angularity that is geometrically commensurate with the traditional definitions. Experimental data obtained using real particle samples are presented and results correlated with existing methods in order to demonstrate the validity of the new approach. The implementation of technologies such as these has the potential to offer significant process optimisation and environmental benefits to the producers of aggregates and their composites. The technique is theoretically extendable to the quantification of surface texture.     

A fast algorithm for ICP-based 3D shape biometrics

In a biometrics scenario, gallery images are enrolled into the database ahead of the matching step, which gives us the opportunity to build related data structures before the probe shape is examined. In this paper, we present a novel approach, called “Pre-computed Voxel Nearest Neighbor”, to reduce the computational time for shape matching in a biometrics context. The approach shifts the heavy computation burden to the enrollment stage, which is done offline. Experiments in 3D ear biometrics with 369 subjects and 3D face biometrics with 219 subjects demonstrate the effectiveness of our approach.     

Bilinear sparse coding for invariant vision

Recent algorithms for sparse coding and independent component analysis (ICA) have demonstrated how localized features can be learned from natural images. However, these approaches do not take image transformations into account. We describe an unsupervised algorithm for learning both localized features and their transformations directly from images using a sparse bilinear generative model. We show that from an arbitrary set of natural images, the algorithm produces oriented basis filters that can simultaneously represent features in an image and their transformations. The learned generative model can be used to translate features to different locations, thereby reducing the need to learn the same feature at multiple locations, a limitation of previous approaches to sparse coding and ICA. Our results suggest that by explicitly modeling the interaction between local image features and their transformations, the sparse bilinear approach can provide a basis for achieving transformation-invariant vision.     

A multiresolution descriptor for deformable 3D shape retrieval

In this paper, we present a spectral graph wavelet framework for the analysis and design of efficient shape signatures for nonrigid 3D shape retrieval. Although this work focuses primarily on shape retrieval, our approach is, however, fairly general and can be used to address other 3D shape analysis problems. In a bid to capture the global and local geometry of 3D shapes, we propose a multiresolution signature via a cubic spline wavelet generating kernel. The parameters of the proposed signature can be easily determined as a trade-off between effectiveness and compactness. Experimental results on two standard 3D shape benchmarks demonstrate the much better performance of the proposed shape retrieval approach in comparison with three state-of-the-art methods. Additionally, our approach yields a higher retrieval accuracy when used in conjunction with the intrinsic spatial partition matching.     

新的基于稀疏表示单张彩色超分辨率算法

传统的基于学习的超分辨率算法普遍采用样本库来训练字典对,训练时间长且对样本库依赖较大。针对传统算法的不足,提出一种新的单张彩色图像超分辨率算法。该方法基于稀疏编码超分辨率模型,利用图像自相似性和冗余特性,并结合图像金字塔结构,采用低分辨率图像本身来训练高、低分辨率图像块的字典对。同时,针对彩色图像,该算法采用一种基于稀疏表示的彩色图像存储技术,将彩色图像的三通道值组合成一个向量进行图像稀疏处理,以更好地维持原始图像细节信息。实验结果表明,与传统的超分辨率算法相比,该算法不但有更好的视觉效果和更高的峰值信噪比(PSNR),而且计算速度快。