二值图像轮廓局部描述和检索方法

提出了一种针对二值图像的基于轮廓分解和局部描述的检索策略。首先从二值图像中提取物体轮廓,采用特定的方法对轮廓进行分解,得到轮廓的参考点集。求取每一个参考点的对应弧线段,构造从参考点指向对应弧线上各点的向量集合。对向量集合进行Fourier变换,得到Fourier系数可以作为该参考点的特征向量,从而原图像就被表示为特征空间中的特征点集。最后,采用点匹配的方法来计算图像之间的距离,实现二值图像的检索。实验结果表明,与目前已有的方法相比该方法具有较高的检索精度。     

融合全局和局部描述的图像检索方法

针对基于内容的图像检索中全局描述缺乏空间位置信息及局部描述面临图像分割的问题,提出了一种基于全局颜色特征和局部Gabor小波纹理特征的图像检索方法.在整幅图上提取MPEG-7主颜色描述算子作为全局描述.将图像划分为5个有重叠的子区域,提取Gabor纹理特征与颜色矩构成局部描述,提出了改进的豪斯多夫距离并将其应用在局部描述的整体匹配中,克服了因图像的平移、旋转而造成检索率低的问题.融合全局相似度和局部相似度获得最终相似度.基于Corel数据库的实验结果表明了该方法的有效性.     

Optimal shape error analysis of the matching image for a free-form surface

When using an optical non-contact scanning system to measure an object that has a large surface, large curvature, or a full 360° profile, one can acquire only one set of sectional measurement points each time. For reconstructing the entire object, every set of sectional measurement points acquired at different positions must match. Therefore, the optimal shape error analysis for the matching image of two or more sets of sectional measurement points is desired. This paper presents a measurement system that combines two CCD cameras, one line laser and a three-axis motion stage. It forms an optical non-contact scanning system in association with the mathematical method of direct shape error analysis for the use in reverse engineering. This analysis and measurement system can be used for the profile measurements of free-form objects. It analyzes the matching image of a free-form surface with high efficiency and accuracy. The validity and applicability of this system are demonstrated by two practical examples.     

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.     

基于视觉词汇形状描述的图像表示方法

针对目前图像表示中引入空间位置信息的空间金字塔匹配方法缺乏对图像中视觉物体平移、缩放和旋转的考虑,提出一种基于视觉词汇形状描述模型的图像表示方法。该方法相对于每个视觉单词的几何中心建立空间几何模型,保证平移不变性;给出对数极坐标空间金字塔匹配,对对数极半径做归一化,保证缩放不变性;在空间金字塔划分过程中确定极角的主方向,从而保证旋转不变性。分别在Caltech-101数据集和自建图像数据集上对该方法进行了验证和比较。实验结果表明,该方法提高了分类识别准确率,特别是对于包含明显平移、缩放和旋转变化的图像数据集;该方法的方差较小,说明其鲁棒性更强。     

Modeling real objects for Kansei-based shape retrieval

A large number of 3D models are created on computers and available for networks. Some content-based retrieval technologies are indispensable to find out particular data from such anonymous datasets. Though several shape retrieval technologies have been developed, little attention has been given to the points on human＇s sense and impression （as known as Kansei） in the conventional techniques, In this paper, the authors propose a novel method of shape retrieval based on shape impression of human＇s Kansei. The key to the method is the Gaussian curvature distribution from 3D models as features for shape retrieval. Then it classifies the 3D models by extracted feature and measures similarity among models in storage.     

Hierarchical aggregation for efficient shape extraction

This paper presents an efficient framework which supports both automatic and interactive shape extraction from surfaces. Unlike most of the existing hierarchical shape extraction methods, which are based on computationally expensive top-down algorithms, our framework employs a fast bottom-up hierarchical method with multiscale aggregation. We introduce a geometric similarity measure, which operates at multiple scales and guarantees that a hierarchy of high-level features are automatically found through local adaptive aggregation. We also show that the aggregation process allows easy incorporation of user-specified constraints, enabling users to interactively extract features of interest. Both our automatic and the interactive shape extraction methods do not require explicit connectivity information, and thus are applicable to unorganized point sets. Additionally, with the hierarchical feature representation, we design a simple and effective method to perform partial shape matching, allowing efficient search of self-similar features across the entire surface. Experiments show that our methods robustly extract visually meaningful features and are significantly faster than related methods.     

Relaxation algorithm for shape matching of two-dimensional objects

This paper describes a relaxation algorithm without a parameter for shape matching of partially occluded two-dimensional objects. This technique is based on a relaxation labelling process of Rosenfeld et al. for reducing or eliminating the ambiguity. The shapes are represented by polygonal approximation. The proposed relaxation method is used to find acceptable line segment pairs of polygons.     

On the dynamic time warping of cyclic sequences for shape retrieval

In recent years, in shape retrieval, methods based on dynamic time warping and sequences where each point of the contour is represented by elements of several dimensions have had a significant presence. In this approach each point of the closed contour contains information with respect to the other ones, this global information is very discriminant. The current state-of-the-art shape retrieval is based on the analysis of these distances to learn better ones.