一种基于轮廓的图像检索算法

针对Choi Wai-pak等人提出的基于最大内切圆直方图的图像检索算法存在的不足,提出了一种改进的新的基于轮廓的图像检索算法。该算法首先用两种不同尺度的1维高斯函数分别对目标轮廓的凹陷部分和凸起部分进行进化处理来得到一个平滑简单而又能很好代表原始轮廓主要信息的进化曲线;然后利用骨架化算法提取出目标骨架;最后,利用进化后的轮廓与骨架之间的距离直方图来构造目标形状的描述符,并实现了图像检索。与Choi Wai-pak等人提出的算法(只利用了形状的骨架信息)相比,该新算法不仅利用了轮廓所表达的外围整体形状信息,还利用了骨架所表达出的形状的拓扑关系。实验结果表明,该新算法在尺度变换、旋转变换以及抗噪性能等方面具有更优的鲁棒性。     

基于视觉显著性的层次形状分解方法

形状分解是形状理解与分析的重要基础.在充分理解人类视觉特性的基础上,联合形状骨架与轮廓特征构建了一种视觉显著性度量即视觉显著度,并提出一种基于视觉显著度的层次形状分解方法.首先采用基于距离变换的骨架生成方法获取目标骨架,之后利用骨架分叉点生成所有候选分割线,最后通过分叉点对应的内切圆半径以及轮廓段的视觉显著度对分割线进行优选获得最优解.实验结果表明,该方法对噪声、形变具有较好的鲁棒性,分解结果符合人类视觉习惯;此外,通过调整显著性阈值可获得不同尺度下的细节分解结果,具有更好的灵活性.     

基于分块奇异值分解的小波域水印算法

对于一般有意义灰度水印,如何在不可见性下增大水印嵌入容量,增强鲁棒性仍是水印研究学者研究的重要内容.根据奇异值分解的特性,结合小波变换与人类视觉系统的某些特性接近的良好特点,提出了一种基于分块奇异值分解的小波域鲁棒水印算法.算法首先将灰度水印信息分为重要信息和次要信息两部分,然后在小波域对宿主图像小波分解后的高频和低频系数分别进行分块奇异值分解,再把经过置乱变换的重要信息部分和次要信息部分分块DCT变换,将变换后的水印信息分别嵌入低频和高频系数分块奇异值分解的奇异值中.实验结果与分析表明:水印算法能嵌入大容量水印,且能抵抗大多数图像攻击,是一种可行的算法.     

稀疏限制的增量式鲁棒非负矩阵分解及其应用

针对鲁棒非负矩阵分解（RNMF）的运算规模随训练样本数量逐渐增多而不断增大的问题，提出一种稀疏限制的增量式鲁棒非负矩阵分解算法。首先，对初始数据进行鲁棒非负矩阵分解；然后，将其分解结果参与到后续迭代运算；最后，在对系数矩阵增加稀疏限制的情况下与增量式学习相结合，使目标函数值在迭代求解时下降地更快。该算法在节省运算时间的同时提高了分解后数据的稀疏度。在数值实验中，将所提算法与鲁棒非负矩阵分解算法、稀疏限制的鲁棒非负矩阵分解（RNMFSC）算法进行了比较。在ORL和YALE人脸数据库上的实验结果表明，所提算法在运算时间和分解后数据的稀疏度等方面均优于其他两个算法，并且还具有较好的聚类效果，尤其在YALE人脸数据库上当聚类类别数为3时该算法的聚类准确率达到了91.67%。     

图像特征里的小波域水印算法

提出一种基于图像特征区域的鲁棒水印算法。确定载体图像的关键点,利用轮廓跟踪工具勾出嵌入水印区域的轮廓,从而确定嵌入位置。对确定的图像区域做离散小波变换（DWT）。将由密钥产生的水印信息按照从大到小的顺序嵌入到低频变换域里,再做离散小波逆变换,将抽出的部分与含水印部分叠加,得到完整含水印图像。实验结果证明,算法既保证了载体图像的视觉质量,同时对于一般常见攻击也具有较好的鲁棒性。     

奇异值分解下在线鲁棒正则化随机网络

在线鲁棒随机权神经网络(OR-RVFLN)具有较好的逼近性、较快的收敛速度、较高的鲁棒性能以及较小的 存储空间. 但是, OR-RVFLN 算法计算过程中会产生矩阵的不适定问题, 使得隐含层输出矩阵的精度较低. 针对这 个问题, 本文提出了奇异值分解下在线鲁棒正则化随机网络(SVD-OR-RRVFLN). 该算法在OR-RVFLN 算法的基础 上, 将正则化项引入到权值的估计中, 并且对隐含层输出矩阵进行奇异值分解; 同时采用核密度估计(KDE) 法, 对 整个SVD-OR-RRVFLN网络的权值矩阵进行更新, 并分析了所提算法的必要性和收敛性. 最后, 将所提的方法应用 于Benchmark数据集和磨矿粒度的指标预测中, 实验结果证实了该算法不仅可以有效地提高模型的预测精度和鲁 棒性能, 而且具有更快的训练速度.     

基于人体骨骼和深度图像信息的指尖检测方法

针对复杂环境下的指尖检测,从手部图像分割和指尖检测方法两方面进行改进,提出了一种基于人体骨骼和深度图像信息的指尖检测方法。首先采用Kinect获取人体骨骼和深度图像信息,通过人体骨骼信息锁定目标用户,利用锁定用户的手部节点位置从深度图像中提取手部区域图像;然后从手部骨架中搜索骨架端点,提出局部最优查找方法对轮廓凸包计算结果进行优化;最后结合手部轮廓特征找到指尖位置。实验结果表明,该方法具有良好的检测效果,满足实时性要求,能够实现复杂环境下的鲁棒检测。     

低质量监控图像鲁棒性人脸超分辨率算法

由于人对图像结构信息的理解对于像素值的噪声干扰具有极强的鲁棒功能,为了增强传统算法针对低质量监控图像的鲁棒性,提出一种基于人工形状语义模型的人脸超分辨率算法.该算法将形状描述成一系列面部特征点的组合,通过人工获取人脸图像形状语义信息,利用形状样本库构建超分辨率代价函数的正则约束项;将图像与形状的系数相关性用于统一重建误差项与形状正则项的变量,并将最速下降法用于优化求解.仿真和实际图像实验结果都表明,在主客观质量上,文中算法的性能都优于传统算法.     

基于NSCT变换的轮廓匹配水印算法

针对常见抗几何攻击水印算法存在的不足,设计一种基于非采样NSCTContourlet(NonsubsampledContourletTransform)变换的鲁棒水印算法.算法利用NSCT提取图像轮廓并用于几何校正.水印嵌入过程分为三步:首先利用NSCT域高频系数提取图像轮廓;其次依据图像轮廓提取特征点用于几何校正;最后水印信息自适应量化嵌入NSCT域低频系数.实验结果表明,该算法不仅具有很好的透明性,同时对常见图像处理攻击和几何攻击均具有很强的鲁棒性.     

视频监控中的行为序列分割与识别

智能监控系统中的行为分析与识别是当前计算机视觉领域的研究热点,而行为序列分割则是行为分析与识别的基础.提出了一种无监督的行为序列分割算法,并对分割结果进行识别.首先,采用鲁棒的形状编码方案得到人体轮廓的紧凑表示,提取轮廓点集特征描述运动人体;然后,基于奇异值分解(SVD)估计行为序列数据的本征维数,确定数据对应的低维流形,并通过检测特征数据在该流形上的投影误差的突变实现行为序列分割;最后,采用隐马尔可夫模型(HMM)对分割结果进行识别.在公共数据库上的实验结果表明了此分割和识别算法的有效性.     

Curve skeleton extraction by coupled graph contraction and surface clustering

In this paper, we present a practical algorithm to extract a curve skeleton of a 3D shape. The core of our algorithm comprises coupled processes of graph contraction and surface clustering. Given a 3D shape represented by a triangular mesh, we first construct an initial skeleton graph by directly copying the connectivity and geometry information from the input mesh. Graph contraction and surface clustering are then performed iteratively. The former merges certain graph nodes based on computation of an approximate centroidal Voronoi diagram, seeded by subsampling the graph nodes from the previous iteration. Meanwhile, a coupled surface clustering process serves to regularize the graph contraction. Constraints are used to ensure that extremities of the graph are not shortened undesirably, to ensure that skeleton has the correct topological structure, and that surface clustering leads to an approximately-centered skeleton of the input shape. These properties lead to a stable and reliable skeleton graph construction algorithm.Experiments demonstrate that our skeleton extraction algorithm satisfies various desirable criteria. Firstly, it produces a skeleton homotopic with the input (the genus of both shapes agree) which is both robust (results are stable with respect to noise and remeshing of the input shape) and reliable (every boundary point is visible from at least one curve-skeleton location). It can also handle point cloud data if we first build an initial skeleton graph based on k-nearest neighbors. In addition, a secondary output of our algorithm is a skeleton-to-surface mapping, which can e.g. be used directly for skinning animation.Highlights(1) An algorithm for curve skeleton extraction from 3D shapes based on coupled graph contraction and surface clustering. (2) The algorithm meets various desirable criteria and can be extended to work for incomplete point clouds.     

Hierarchical part-type segmentation using voxel-based curve skeletons

We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of critical points on the efficiently computed curve skeleton, either fully automatically as the junctions of the curve skeleton, or based on user input. We use these points to construct a partitioning of the object surface using geodesics. Because the segmentation is based on the curve skeleton, it intrinsically reflects the shape symmetry and articulation, and can handle shapes with tunnels. We describe a voxel-based implementation of our method which is robust and noise resistant, able to handle shapes of complex articulation and topology, produces smooth segment borders, and delivers hierarchical level-of-detail segmentations. We demonstrate the framework on various real-world 3D shapes. Additionally, we discuss the use of both curve and surface skeletons to produce part-type and patch-type, respectively, segmentations of 3D shapes.     

刺绣中的形状分割算法

提出一种适用于刺绣CAD系统中Satin针法的形状分割算法.该算法可将任意形状的平面区域分割成若干个条状的子区域,并且使得每个子区域关于它们的形状线大致对称.以一个改进的直骨架为形状分析基础,通过分析修剪后的骨架上的分叉点找出所有可能的分割线,然后优化这些分割线来对区域进行分割.实验结果表明：该算法对边界噪声具有一定的抗干扰能力,能够满足Satin刺绣的要求.     

Shape retrieval using triangle-area representation and dynamic space warping

In this paper, we present a shape retrieval method using triangle-area representation for nonrigid shapes with closed contours. The representation utilizes the areas of the triangles formed by the boundary points to measure the convexity/concavity of each point at different scales (or triangle side lengths). This representation is effective in capturing both local and global characteristics of a shape, invariant to translation, rotation, and scaling, and robust against noise and moderate amounts of occlusion. In the matching stage, a dynamic space warping (DSW) algorithm is employed to search efficiently for the optimal (least cost) correspondence between the points of two shapes. Then, a distance is derived based on the optimal correspondence. The performance of our method is demonstrated using four standard tests on two well-known shape databases. The results show the superiority of our method over other recent methods in the literature.     

On the definition of shape parts: a dominant sets approach

In the present paper, a novel graph-based approach to the shape decomposition problem is addressed. The shape is appropriately transformed into a visibility graph enriched with local neighborhood information. A two-step diffusion process is then applied to the visibility graph that efficiently enhances the information provided, thus leading to a more robust and meaningful graph construction. Inspired by the notion of a clique as a strict cluster definition, the dominant sets algorithm is invoked, slightly modified to comport with the specific problem of defining shape parts. The cluster cohesiveness and a node participation vector are two important outputs of the proposed graph partitioning method. Opposed to most of the existing techniques, the final number of the clusters is determined automatically, by estimating the cluster cohesiveness on a random network generation process. Experimental results on several shape databases show the effectiveness of our framework for graph-based shape decomposition.     

Effective Piecewise Linear Skeletonization of Sparse Shapes

Conventional image skeletonization techniques implicitly assume the pixel level connectivity. However, noise inside the object regions destroys the connectivity and exhibits sparseness in the image. We present a skeletonization algorithm designed for these kinds of sparse shapes. The skeletons are produced quickly by using three operations. First, initial skeleton nodes are selected by farthest point sampling with circles containing the maximum effective information. A skeleton graph of these nodes is imposed via inheriting the neighborhood of their associated pixels, followed by an edge collapse operation. Then a skeleton tting process based on feature-preserving Laplacian smoothing is applied. Finally, a re nement step is proposed to further improve the quality of the skeleton and deal with noise or different local shape scales. Numerous experiments demonstrate that our algorithm can effectively handle several disconnected shapes in an image simultaneously, and generate more faithful skeletons for shapes with intersections or different local scales than classic methods.     

Structural feature indexing for retrieval of partially visible shapes

Efficient and robust information retrieval from large image databases is an essential functionality for the reuse, manipulation, and editing of multimedia documents. Structural feature indexing is a potential approach to efficient shape retrieval from large image databases, but the indexing is sensitive to noise, scales of observation, and local shape deformations. It has now been confirmed that efficiency of classification and robustness against noise and local shape transformations can be improved by the feature indexing approach incorporating shape feature generation techniques (Nishida, Comput. Vision Image Understanding 73 (1) (1999) 121-136). In this paper, based on this approach, an efficient, robust method is presented for retrieval of model shapes that have parts similar to the query shape presented to the image database. The effectiveness is confirmed by experimental trials with a large database of boundary contours obtained from real images, and is validated by systematically designed experiments with a large number of synthetic data.     

基于四元素插值的空间曲线边界约束变形方法

曲线形状的变形技术在计算机动画和产品造型设计中有着重要的应用。以单位球面四元素插值为基础建立非线性的局部变换，通过在中间帧重构方程引进边界控制条件，提出了具有边界约束的空间曲线和平面曲线形状的变形方法。该方法在曲线形状渐变序列中具有保周长的线性变化，适合一般曲线的渐变和骨架行走的特征。还给出了建立渐变序列的边界曲线算法，通过实例说明了造型和编辑边界曲线能得到良好的拼接效果。实验表明,该算法在空间曲线变形中具有良好的视觉效果和应用前景，算法具有简易性和统一性。     

基于参数化求和不变量与特征重整的形状匹配

从特征提取和特征匹配两方面考虑,提出了一种鲁棒的形状匹配方法。首先,基于求和不变量,设计了基于面积的形状参数化和归一化方法,提出了参数化求和不变量,该不变量基于形状局部描述且采用积分算子计算,具有较好的鲁棒性和仿射不变性。然后,为进一步提高形状匹配的鲁棒性,在特征匹配上,分析了参数化求和不变量的先验信息,设计了基于特征重整的匹配距离函数,并通过动态规划进行实现。仿真实验表明了所提方法的有效性。