基于哈希学习的动作捕捉数据的编码与检索

针对动作捕捉数据高维度、检索耗时问题,提出一种基于哈希学习的高效编码和快速检索算法.该算法对动作捕捉库中的每个运动序列,顺序将固定帧数的帧序列作为滑动窗口,以滑动窗口为单位抽取特征,将一个帧序列其所有滑动窗口特征作为其特征表达,通过哈希学习方法对每个序列进行哈希编码;检索时采用分层检索策略,对待检索序列提取其关键帧,用哈希编码方法检索库中与关键帧相似的若干窗口帧,并通过均匀帧采样计算帧间误差进一步筛选包含相似窗口帧的序列段,获得数据库中与待检索序列相似的若干相似序列段.实验结果表明,文中算法可实现从大规模动作捕捉数据库中快速检索相似序列段.     

一种基于镜头的视频场景检测方法

在数字视频的分析、浏览、检索中,现有的以镜头为基础的方法由于镜头粒度信息太小而不能表达视频语义上的联系,因此有必要将视频内容按照高层语义单元——场景进行组织。从分析视频剪辑的基本原则入手,给出了一种视频场景构造方法;首先使用改进了的像素匹配二次差分法结合双阈值法进行镜头突变和渐变的检测,然后对镜头内的帧间距离进行判断来提取关键帧;提出了一种基于双滑动镜头窗口的聚类方法,将内容相似语义相同的镜头聚合在一起形成新的场景。试验表明,该方法是有效的。     

基于内容检索中的镜头相似度度量

基于内容的视频检索中的一个最普遍的方法是根据给定例子视频的检索，因此视频相似度度量是基于内容检索中的一个基本问题。该文在视频签名算法基础上提出了镜头粒度上的镜头基调算法，同时为了增加匹配的准确性。提出了赋权的镜头基调，以体现基调中各帧在镜头相似度中的重要性差异，并解决了原算法可能出现的基调帧对逆序的问题。     

利用改进NFL算法对镜头进行基于内容的检索

基于镜头的分类和检索对于视频库的管理和查询非常重要.将“最近特征线”法（nearest feature line,简称NFL）用于镜头的分类和检索.将镜头中的代表帧看做是某个特征空间中的点,通过这些点间的连线表征该镜头的总体特征信息,然后计算查询图像和特征线的距离,以决定镜头与查询图像的相似度.为了更适于视频数据,对原来的NFL方法进行了改进,基于镜头内部内容活动程度对特征线进行限制、实验结果表明,改进的NFL方法比传统的NFL方法以及常用的聚类万法,如最近邻法（nearest neighbor,简称NN）和最近中心法（nearest center,简称NC）,在性能上有所提高.     

一种通过视频片段进行视频检索的方法

视频片段检索是基于内容的视频检索的主要方式,它需要解决两个问题:(1) 从视频库里自动分割出与查询片段相似的多个片段;(2) 按照相似度从高到低排列这些相似片段.首次尝试运用图论的匹配理论来解决这两个问题.针对问题(1),把检索过程分为两个阶段:镜头检索和片段检索.在镜头检索阶段,利用相机运动信息,一个变化较大的镜头被划分为几个内容一致的子镜头,两个镜头的相似性通过对应子镜头的相似性计算得到;在片段检索阶段,通过考察相似镜头的连续性初步得到一个个相似片段,再运用最大匹配的Hungarian算法来确定真正的相似片段.针对问题(2),考虑了片段相似性判断的视觉、粒度、顺序和干扰因子,提出用最优匹配的Kuhn-Munkres算法和动态规划算法相结合,来解决片段相似度的度量问题.实验对比结果表明,所提出的方法在片段检索中可以取得更高的检索精度和更快的检索速度.     

用无监督模糊聚类方法进行视频内容的分层表示

为了在视频数据库中提供有效的视频检索和浏览功能,必须用简明的方式表示视频的内容。由于视频数据具有层次性结构,在镜头边界检测后,可以利用聚类方法按不同的相似性尺度选取代表帧和代表镜头,对视频内容进行抽象概括的表示。文中提出了一种基于无监督模糊聚类对视频内容进行分层表示的算法,它用无监督聚类方法选取镜头的代表帧,并用模糊聚类算法对代表帧进行层次化聚类以选取代表镜头和代表场景。实验结果表明这种方法可以较好地概括视频的内容,方便用户检索和浏览。     

基于主色跟踪和质心运动的视频场景分割 *

传统的场景分割方法中往往通过比较关键帧来测量镜头间的相似度而忽略了镜头内的时域信息 ,针对这种缺陷提出一种基于主色跟踪和质心运动的视频场景分割的方法。首先 ,在量化的 HSV空间中 ,利用主色跟踪所得镜头的时间信息结合帧颜色直方图得到镜头的主色直方图 ,并且引入镜头质心特征向量的概念 ,通过其与帧向量的差异性获得镜头的运动信息 ;然后将所测得的镜头相似度用在改进的双向滑动窗口法中检测场景。实验结果验证了该方法的有效性。     

一种改进的视频关键帧提取算法研究

视频镜头分割和关键帧提取是基于内容的视频检索的核心问题.提出了一种改进的关键帧提取算法,其为视频检索奠定了基础,镜头分割部分采用改进直方图方法及基于像素方法的综合方法.首先,通过结合直方图交集及非均匀分块加权的改进直方图方法,根据视频内容将视频分割为镜头;然后,利用基于像素的帧差法,对得到的检测镜头进行二次检测,优化检测结果;最后,在HSV颜色空间的基础上,计算每个镜头内每帧的图像熵,从而确定关键帧序列.实验结果表明,提出的改进算法所得到的关键帧结构紧凑且分布均匀.     

一种层次的电影视频摘要生成方法

合理地组织视频数据对于基于内容的视频分析和检索有着重要的意义。提出了一种基于运动注意力模型的电影视频摘要生成方法。首先给出了一种基于滑动镜头窗的聚类算法将相似的镜头组织成为镜头类;然后根据电影视频场景内容的发展模式,在定义两个镜头类的3种时序关系的基础上,提出了一种基于镜头类之间的时空约束关系的场景检测方法;最后利用运动注意力模型选择场景中的重要镜头和代表帧,由选择的代表帧集合和重要镜头的关键帧集合建立层次视频摘要(场景级和镜头级)。该方法较全面地涵盖了视频内容,又突出了视频中的重要内容,能够很好地应用于电影视频的快速浏览和检索。     

舰船补给物料搬运顺序优化问题的改进遗传算法

现有的多搬运工具可并行条件下的物料搬运顺序优化模型, 其采用的标准遗传算法收敛速度慢且易陷入局部最优. 提出了该模型的改进遗传算法, 采用精英保留策略代替传统的轮盘选择方法, 使用自适应策略设计交叉算子和变异算子. 以某一具体的舰船补给物料搬运顺序优化问题为背景, 通过实例进行了计算. 结果表明, 改进遗传算法收敛速度大大提高, 具有较高的求解质量和效率.     

Grouping part/product variants based on networked operations sequence

Operations flow based similarity is an important criterion for grouping variants. Similarity coefficient for product variants with networked sequence of operations has not been considered in the literature. Previously proposed similarity coefficients, which are based on operation/assembly sequence, focused on variants with serial operations sequences where the order of processing operations is fixed; while in practice, there are many part/product variants with flexible operations sequence options. A novel similarity coefficient for part/product variants is proposed based on the networked operations sequence similarity inspired by the analysis used in the field of biology (e.g. enzymes structures comparison). An extension of the proposed coefficient is also presented with an example for illustration. A more comprehensive similarity coefficient is developed by including operations similarity and production volume criteria. The popular operations similarity coefficient, called Jaccard's similarity, is applied and extended. A new coefficient using volume similarity criterion is also developed. Part/product variants are then clustered and grouped based on the combined similarity coefficient using the average linkage clustering (ALC) algorithm. The main applications of the proposed similarity coefficient are addressed. The grouped variants are sequenced as a secondary application of the proposed similarity coefficient. The sequence obtained from the proposed approach is compared with that obtained from a developed mathematical model. The result shows the accuracy of the proposed sequencing approach and can serve as a good preliminary sequence. A case study is also provided for demonstration.     

基于参考集索引的高效序列相似性查找算法

序列数据在文本、Web访问日志文件、生物数据库中普遍存在,对其进行相似性查找是一种重要的获取和分析知识的手段.基于参考集索引技术是一类解决序列相似性查找的有效方法,主要思想是找到序列数据库中的少数序列作为参考集,通过参考集过滤掉数据库中与查询序列不相关的数据,从而高效地回答查询.在现有基于参考集索引技术的基础上,提出一种过滤能力更强的序列相似性查询算法IRI(improved reference indexing).首先,充分利用了先前的查询结果集来加速当前的查询,其次考虑了基于序列特征的上界和下界,使得应用参考集进行过滤的上下界更紧,过滤能力进一步加强.最后,为了避免候选集中费时的编辑距离计算,则只计算前缀序列间的编辑距离,从而进一步加速算法运行.实验采用真实的DNA序列和蛋白质序列数据,结果表明,算法IRI在查询性能上明显优于现有的基于参考集索引方法RI(reference indexing).     

Fuzzy C-Means clustering through SSIM and patch for image segmentation

In this study, we propose a new robust Fuzzy C-Means (FCM) algorithm for image segmentation called the patch-based fuzzy local similarity c-means (PFLSCM). First of all, the weighted sum distance of image patch is employed to determine the distance of the image pixel and the cluster center, where the comprehensive image features are considered instead of a simple level of brightness (gray value). Second, the structural similarity (SSIM) index takes into account similar degrees of luminance, contrast, and structure of image. The DSSIM (distance for structural similarity) metric is developed on a basis of SSIM in order to characterize the distance between two pixels in the whole image. Next a new similarity measure is proposed. Furthermore, a new fuzzy coefficient is proposed via the new similarity measure together with the weighted sum distance of image patch, and then the PFLSCM algorithm is put forward based on the idea of image patch and this coefficient. Through a collection of experimental studies using synthetic and publicly available images, we demonstrate that the proposed PFLSCM algorithm achieves improved segmentation performance in comparison with the results produced by some related FCM-based algorithms.     

基于云模型熟悉相似度的协同过滤推荐算法

研究了一种新的协同过滤推荐方法。针对推荐算法中相似度存在的不足,提出了兼顾"形状-距离"的云模型综合相似度测算方法;考虑用户之间的兴趣匹配,提出了云模型熟悉相似度的概念;提出了基于云模型熟悉相似度的邻居用户选择方法,进而产生推荐。实验结果表明,本方法提高了推荐准确度。     

Scene Detection in Videos Using Shot Clustering and Sequence Alignment

Video indexing requires the efficient segmentation of video into scenes. The video is first segmented into shots and a set of key-frames is extracted for each shot. Typical scene detection algorithms incorporate time distance in a shot similarity metric. In the method we propose, to overcome the difficulty of having prior knowledge of the scene duration, the shots are clustered into groups based only on their visual similarity and a label is assigned to each shot according to the group that it belongs to. Then, a sequence alignment algorithm is applied to detect when the pattern of shot labels changes, providing the final scene segmentation result. In this way shot similarity is computed based only on visual features, while ordering of shots is taken into account during sequence alignment. To cluster the shots into groups we propose an improved spectral clustering method that both estimates the number of clusters and employs the fast global k-means algorithm in the clustering stage after the eigenvector computation of the similarity matrix. The same spectral clustering method is applied to extract the key-frames of each shot and numerical experiments indicate that the content of each shot is efficiently summarized using the method we propose herein. Experiments on TV-series and movies also indicate that the proposed scene detection method accurately detects most of the scene boundaries while preserving a good tradeoff between recall and precision.     

Shot retrieval based on fuzzy evolutionary aiNet and hybrid features

As the multimedia data increasing exponentially, how to get the video data we need efficiently become so important and urgent. In this paper, a novel method for shot retrieval is proposed, which is based on fuzzy evolutionary aiNet and hybrid features. To begin with, the fuzzy evolutionary aiNet algorithm proposed in this paper is utilized to extract key-frames in a video sequence. Meanwhile, to represent a key-frame, hybrid features of color feature, texture feature and spatial structure feature are extracted. Then, the features of key-frames in the same shot are taken as an ensemble and mapped to high dimension space by non-linear mapping, and the result obeys Gaussian distribution. Finally, shot similarity is measured by the probabilistic distance between distributions of the key-frame feature ensembles for two shots, and similar shots are retrieved effectively by using this method. Experimental results show the validity of this proposed method.     

OM-based video shot retrieval by one-to-one matching

This paper proposes a new approach for shot-based retrieval by optimal matching (OM), which provides an effective mechanism for the similarity measure and ranking of shots by one-to-one matching. In the proposed approach, a weighted bipartite graph is constructed to model the color similarity between two shots. Then OM based on Kuhn–Munkres algorithm is employed to compute the maximum weight of a constructed bipartite graph as the shot similarity value by one-to-one matching among frames. To improve the speed efficiency of OM, two improved algorithms are also proposed: bipartite graph construction based on subshots and bipartite graph construction based on the same number of keyframes. Besides color similarity, motion feature is also employed for shot similarity measure. A motion histogram is constructed for each shot, the motion similarity between two shots is then measured by the intersection of their motion histograms. Finally, the shot similarity is based on the linear combination of color and motion similarity. Experimental results indicate that the proposed approach achieves better performance than other methods in terms of ranking and retrieval capability.

一种基于相对距离竞争激活的网络入侵检测算法

本文针对目前网络入侵检测学习算法效率不高的问题,首先提出相对距离的概念,然后构造基于相对距离的竞争激活函数和相似性度量,在此基础上提出一种改进的网络入侵检测算法.该算法的优势在于:(1)相对距离能较好地区分极差较大的列属性值并实现归一化;(2)基于相对距离的竞争激活函数可以处理包含符号属性的数据,不需转换为数值,且计算...     

基于概率距离及融合时空特征的镜头相似性度量*

提出一种基于概率距离及融合镜头时空特征的镜头相似性度量方法。横向方面,构造镜头加权颜色直方图来表示时间信息并使用直方图交计算镜头时间相似性;纵向方面,通过非线性映射将空间特征向量映射到高维空间进行高斯分布建模,计算两镜头空间特征高斯分布间的概率距离来度量两镜头空间相似性;最后,对时、空相似性加权融合计算两镜头总相似性。实验结果证明了该方法的有效性。     

A novel document similarity measure based on earth mover’s distance

In this paper we propose a novel measure based on the earth mover’s distance (EMD) to evaluate document similarity by allowing many-to-many matching between subtopics. First, each document is decomposed into a set of subtopics, and then the EMD is employed to evaluate the similarity between two sets of subtopics for two documents by solving the transportation problem. The proposed measure is an improvement of the previous OM-based measure, which allows only one-to-one matching between subtopics. Experiments have been performed on the TDT3 dataset to evaluate existing similarity measures and the results show that the EMD-based measure outperforms the optimal matching (OM) based measure and all other measures. In addition to the TextTiling algorithm, the sentence clustering algorithm is adopted for document decomposition, and the experimental results show that the proposed EMD-based measure does not rely on the document decomposition algorithm and thus it is more robust than the OM-based measure.