Graph-based video fingerprinting using double optimal projection

A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination.     

Time-series clustering – A decade review

Clustering is a solution for classifying enormous data when there is not any early knowledge about classes. With emerging new concepts like cloud computing and big data and their vast applications in recent years, research works have been increased on unsupervised solutions like clustering algorithms to extract knowledge from this avalanche of data. Clustering time-series data has been used in diverse scientific areas to discover patterns which empower data analysts to extract valuable information from complex and massive datasets. In case of huge datasets, using supervised classification solutions is almost impossible, while clustering can solve this problem using un-supervised approaches. In this research work, the focus is on time-series data, which is one of the popular data types in clustering problems and is broadly used from gene expression data in biology to stock market analysis in finance. This review will expose four main components of time-series clustering and is aimed to represent an updated investigation on the trend of improvements in efficiency, quality and complexity of clustering time-series approaches during the last decade and enlighten new paths for future works.     

Nickel foam-supported Fe,Ni-Polyporphyrin microparticles: Efficient bifunctional catalysts for overall water splitting in alkaline media

Developing highly active, stable and sustainable electrocatalysts for overall water splitting is of great importance to generate renewable H₂ for fuel cells. Herein, we report the synthesis of electrocatalytically active, nickel foam-supported, spherical core-shell Fe-poly(tetraphenylporphyrin)/Ni-poly(tetraphenylporphyrin) microparticles (FeTPP@NiTPP/NF). We also show that FeTPP@NiTPP/NF exhibits efficient bifunctional electrocatalytic properties toward both the oxygen evolution reaction (OER) and the hydrogen evolution reaction (HER). Electrochemical tests in KOH solution (1 M) reveal that FeTPP@NiTPP/NF electrocatalyzes the OER with 100 mA cm⁻² at an overpotential of 302 mV and the HER with 10 mA cm⁻² at an overpotential of 170 mV. Notably also, its catalytic performance for OER is better than that of RuO₂, the benchmark OER catalyst. Although its catalytic activity for HER is slightly lower than that of Pt/C (the benchmark HER electrocatalyst), it shows greater stability than the latter during the reaction. The material also exhibits electrocatalytic activity for overall water splitting reaction at a current density of 10 mA cm⁻² with a cell voltage of 1.58 V, along with a good recovery property. Additionally, the work demonstrates a new synthetic strategy to an efficient, noble metal-free-coordinated covalent organic framework (COF)-based, bifunctional electrocatalyst for water splitting.     

A Novel Beam Search to Improve Neural Machine Translation for English-Chinese

Neural Machine Translation (NMT) is an end-to-end learning approach for automated translation, overcoming the weaknesses of conventional phrase-based translation systems. Although NMT based systems have gained their popularity in commercial translation applications, there is still plenty of room for improvement. Being the most popular search algorithm in NMT, beam search is vital to the translation result. However, traditional beam search can produce duplicate or missing translation due to its target sequence selection strategy. Aiming to alleviate this problem, this paper proposed neural machine translation improvements based on a novel beam search evaluation function. And we use reinforcement learning to train a translation evaluation system to select better candidate words for generating translations. In the experiments, we conducted extensive experiments to evaluate our methods. CASIA corpus and the 1,000,000 pairs of bilingual corpora of NiuTrans are used in our experiments. The experiment results prove that the proposed methods can effectively improve the English to Chinese translation quality.     

An efficient video summarization for surveillance system using normalized k-means and quick sort method

There has been a vast augmentation in quantity of Video Content (VC) generated amid the last some years. The Video Summarization (VS) approach is introduced for managing the VC. Prevailing VS techniques have endeavored to render the VS but the systems have Execution Time (ET) as well as condensing the video's content in domain specific manner. To triumph over such disadvantages, this paper proposed efficient VS for surveillance system using normalized k-means along with quick sort method. The proposed technique comprises eight stages, like split video into frames, pre-sampling, provide ID number, feature extraction, Feature Selection (FS), clustering, extract frames, video summary. Initially, the video frames are pre-sampled utilizing the proposed Three Step Cross Searching Algorithm (TSCS) technique. Then, give the ID number for every frame. Next, the features are extracted as of the frames. Then, the necessary features are selected using Entropy based Spider Monkey Algorithms (ESMA). In next stage, the features are grouped using Normalized K-Means (N-Kmeans) algorithm for identifying best candidate frames. Then select the minimum distance value based cluster set is the Key Frame (KF) selection. At last, the video is orderly summarized using quick sort method. Finally, in experimental evaluation the proposed work is compared with the prevailing methods. The proposed VS gave better outcome than the existing approaches.     

基于颜色四通道及空间金字塔的鱼类图像检索

随着计算机视觉技术在海洋水产领域中的应用不断加深，鱼类图像检索在渔业资源调查、鱼类行为学分析等方面发挥了巨大的作用。通过研究发现，鱼类图像的背景信息会对鱼类图像检索造成极大干扰，而且鱼类图像中颜色、纹理、形状等特征由于空间位置信息的缺乏而使检索的准确率不高。为解决以上问题，提出了一种新的基于颜色四通道及空间金字塔的鱼类图像检索算法。首先，提取视觉显著性图将鱼类图像的前景和背景分开，从而减少图像背景对检索的干扰；其次，为了使图像特征包含一定的空间位置信息，利用空间金字塔的理论对图像进行分割，在此基础上，将图像转为HSVG四通道图并提取SURF特征；；最后，得到检索结果。为验证所提算法的有效性，在QUT_fish_data数据集和DLOU_fish_data数据集上对算法的查全率、查准率与经典的HSVG算法和显著性分块算法进行对比：在两个数据集上查准率分别比传统的HSVG算法最多分别提高12%和5%，查全率最多分别提高7%和22%；比传统的显著性分块算法查准率最多分别提高15%和5%，查全率最多分别提高36%和22%；从而证明所提算法是有效的，能有效提升鱼类图像的检索效果。     

Cross-Layer Optimization of Dynamic Packet Assignment for Video Transmission Over IEEE 802.11e Networks

Video transmission over IEEE 802.11e wireless networks still shows poor performance for large bandwidth demand and frequently changed environments. Thus, several enhancements of IEEE 802.11e were proposed. On the other hand, big frames and simultaneous sending of adjacent frames always cause packet dropping for buffer overflow. In the past, we proposed an IEEE 802.11e enhancement named DFAA and a content aware mechanism to solve the above problems. The motivation of this paper is to find a proper way to integrate these two mechanisms. A DFAA enhancement (DFAA-E) is proposed to make up the insufficiency of content aware mechanism. Experiments results show that the combination of DFAA-E and content aware mechanism improves the video decoded quality greatly. And its performance can be further enhanced by selecting the suitable settings of certain parameters.     

一种军棋机器博弈的多棋子协同博弈方法

针对在军棋博弈不完全信息对弈中，面对棋子不同价值、不同位置、不同搭配所产生的不同棋力，传统的单子意图搜索算法，不能满足棋子之间的协同性与沟通性，同时也缺乏对敌方的引诱与欺骗等高级对抗能力。本文提出一种结合UCT搜索策略的高价值棋子博弈方法，实现高价值棋子协同博弈的策略。实战经验表明:高价值多棋子军棋协同博弈策略优于单棋子军棋博弈策略。