To accelerate shot boundary detection by reducing detection region and scope

Video Shot Boundary Detection (SBD) is the fundamental process towards video summarization and retrieval. A fast and efficient SBD algorithm is necessary for real-time video processing applications. Extensive work has focused on accurate shot boundary detection at the expense of demanding computational costs. In this paper, we propose a fast SBD approach that reduces the computation pixel-wise and frame-wise while still giving satisfactory accuracy. The proposed approach substantially speeds up the computation through reducing both detection region and scope. Color histogram and mutual information are used together to measure the difference between frames. Corner distribution of frames is utilized to exclude most of false boundaries. We conduct extensive experiments to evaluate the proposed approach, and the results show that our approach can not only speed up SBD, but also detect shot boundaries with high accuracy in both Cut (CUT) and Gradual Transition (GT) boundaries.     

Multi-user web service selection based on multi-QoS prediction

In order to find best services to meet multi-user’s QoS requirements, some multi-user Web service selection schemes were proposed. However, the unavoidable challenges in these schemes are the efficiency and effect. Most existing schemes are proposed for the single request condition without considering the overload of Web services, which cannot be directly used in this problem. Furthermore, existing methods assumed the QoS information for users are all known and accurate, and in real case, there are always many missing QoS values in history records, which increase the difficulty of the selection. In this paper, we propose a new framework for multi-user Web service selection problem. This framework first predicts the missing multi-QoS values according to the historical QoS experience from users, and then selects the global optimal solution for multi-user by our fast match approach. Comprehensive empirical studies demonstrate the utility of the proposed method.     

Reprint of “Virtual cut-through: A new computer communication switching technique”

In this paper a new switching technique called virtual cut-through is proposed and its performance is analyzed. This switching system is very similar to message switching, with the difference that when a message arrives in an intermediate node and its selected outgoing channel is free (just after the reception of the header), then, in contrast to message switching, the message is sent out to the adjacent node towards its destination before it is received completely at the node; only if the message is blocked due to a busy output channel is a message buffered in an intermediate node. Therefore, the delay due to unnecessary buffering in front of an idle channel is avoided. We analyze and compare the performance of this new switching technique with that of message switching with respect to three measures: network delay, traffic gain and buffer storage requirement. Our analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.

1. Download : Download full-size image

     

Multi-party quantum private comparison protocol with n-level entangled states

In this paper, two multi-party quantum private comparison (MQPC) protocols are proposed in distributed mode and traveling mode, respectively. Compared with the first MQPC protocol, which pays attention to compare between arbitrary two participants, our protocols focus on the comparison of equality for \(n\) participants with a more reasonable assumption of the third party. Through executing our protocols once, it is easy to get if \(n\) participants’ secrets are same or not. In addition, our protocols are proved to be secure against the attacks from both outside attackers and dishonest participants.     

Schemes for remotely preparing an arbitrary four-qubit \chi -state

Two schemes via different entangled resources as the quantum channel are proposed to realize remote preparation of an arbitrary four-particle \(\chi \) -state with high success probabilities. To design these protocols, some useful and general measurement bases are constructed, which have no restrictions on the coefficients of the prepared states. It is shown that through a four-particle projective measurement and two-step three-particle projective measurement under the novel sets of mutually orthogonal basis vectors, the original state can be prepared with the probability 50 and 100 %, respectively. And for the first scheme, the special cases of the prepared state that the success probability reaches up to 100 % are discussed by the permutation group. Furthermore, the present schemes are extended to the non-maximally entangled quantum channel, and the classical communication costs are calculated.     

基于MPUI模型的JPEG2000图像最大隐写容量

隐写容量是信息隐藏的4项性能指标之一,目前,相关科研工作者对其他3项指标,即鲁棒性、透明性和计算复杂性进行过大量的研究,但隐写容量方面的研究却很少.该研究有力地完善了信息隐藏的理论体系,根据JPEG2000压缩标准以及人眼对小波系数改变的敏感程度,借助小波系数的失真代价函数,区分出小波系数的承载秘密信息能力：失真代价函数值越小,该小波系数承载能力就越强;反之,该小波系数承载能力就越弱.当失真代价函数值大于1时,该系数不具有承载信息的能力,即为湿系数.通过最大隐写容量估算实验以及位满嵌入、过位嵌入和湿嵌入等评估实验,验证了所提方法的有效性.     

一种基于移动用户位置的网络服务推荐方法

伴随着无线通信技术和智能移动终端的快速发展,基于位置的服务(location-based services,简称LBS)以其移动性、实用性、随时性和个性化的特点,在军事、交通、物流等诸多领域得到了广泛的应用,成为最具发展潜力的移动增值业务之一。在一个基于位置的网络服务推荐框架的基础上,给出了一种基于位置的移动用户偏好相似度计算方法,同时证明了其满足近邻相似测度的一般性质;然后,提出一种符合社会学概念的信任值计算方法。把它们应用于基于移动用户位置的网络服务推荐过程中,从而形成了一种基于移动用户位置的网络服务推荐方法。该方法有效地提高了网络服务推荐的准确性和可靠性,同时缓解了推荐过程中可能存在的数据稀疏性以及冷启动问题。最后,通过公开的MIT数据集验证了该推荐方法的准确度和可行性。     

一种基于CloudStack的企业级云资源平台网络优化研究

在对云资源平台的现状进行分析后,提出了一种基于Cloud Stack的企业级云资源平台网络优化方案,通过与现有3种解决方案进行对比,展示了该方案的可靠性和有效性。同时,针对可能存在的风险和不足进行了充分的考虑和论证,并给出了应对措施。     

基于半监督学习的一种图像检索方法

为了提高图像检索的质量, 提出了一种基于半监督学习的图像检索方法。该方法提取图像的颜色、形状、纹理特征, 计算得到已知类别样本的中心图像, 检索过程中利用中心图像自适应调整相关度计算函数, 然后根据与查询图像相关度的大小对图像进行检索和排序。实验结果表明：该方法较已有的基于内容的图像检索方法有更高的查准率, 同时, 由查准率—查全率曲线可知该方法能够达到很好的检索质量。