一种基于加速近端梯度法的视频散列算法研究

散列算法已经被广泛应用于视频数据的索引。然而,当前大多数视频散列方法将视频看成是多个独立帧的简单集合,通过综合帧的索引来对每个视频编制索引,在设计散列函数时往往忽略了视频的结构信息。首先将视频散列问题建模为结构正规化经验损失的最小化问题。然后提出一种有监管算法,通过利用结构学习方法来设计高效的散列函数。其中,结构正规化利用了出现于视频帧(与相同的语义类别存在关联)中的常见局部视觉模式,同时对来自同一视频的后续帧保持时域一致性。证明了通过使用加速近端梯度(APG)法可有效求解最小化目标问题。最后,基于两个大规模基准数据集展开全面实验(150 000个视频片断,1 200万帧),实验结果证明了该方法性能优于当前其他算法。

Research on A Video Hashing Algorithm Based on Accelerated Proximal Gradient Method

Hashing methods have become popular for indexing video data. However, most of the existing video hashing methods treat videos as a simple aggregation of independent frames and index each video through combining the indexes of frames. The structure information of videos is often neglected in the design of hash functions. In this paper, firstly, the video hashing problem is modeled into a minimization problem over a structure-regularized empirical loss. And we propose a supervised method that explores the structure learning techniques to design efficient hash functions. In particular, the structure regularization exploits the common local visual patterns occurring in video frames that are associated with the same semantic class, and simultaneously preserves the temporal consistency over successive frames from the same video. We show that the minimization objective can be efficiently solved by an Accelerated Proximal Gradient (APG) method. Extensive experiments on two large video benchmark datasets (up to around 150K video clips with over 12 million frames) show that the proposed method significantly outperforms the state-of the- art hashing methods.