排序方式: 共有11条查询结果,搜索用时 15 毫秒
1.
提出了一个通用的层次化新闻视频处理框架,将新闻视频处理分为句法分段、语义标注以及视频摘要三个层次,并给出了三个层次中涉及的故事单元探测、字幕探测、视频摘要等关键技术的解决方案。框架突破了传统的新闻视频处理框架仅局限于句法分段以及单媒体特征进行处理的缺陷,通过对视音频特征进行多模态的综合分析来获取新闻视频高层的语义内容。实验通过一个新闻视频处理原型系统NVPS验证了框架的可行性,重点对故事单元探测、标题探测以及口播帧探测三个算法进行了实验,实验结果分别达到88%,86%和86%的探测准确率,从而进一步证实了层次框架在新闻视频处理方面的有效性。 相似文献
2.
传统的主动学习方法往往仅基于当前的目标模型来挑选样本,而忽略了历史模型所蕴含的对未标注样本预测稳定性的信息。因此,提出基于不稳定性采样的主动学习方法,依据历史模型的预测差异来估计每个未标注样本对提高模型性能的潜在效用。该方法基于历史模型对样本的预测后验概率之间的差异来衡量无标注样本的不稳定性,并挑选最不稳定的样本进行查询。在多个数据集上的大量实验结果验证了方法的有效性。 相似文献
3.
何新华 《装甲兵工程学院学报》1995,(2)
一个有效的和简化的BDD将大大提高验证和测试生成效率.作者根据电路结构的特点,以标准门的BDD为基础,从原始输入到输出,通过逐级拼接,有效地完成电路的BDD构造.实验证明,该方法简单、直观而有效. 相似文献
4.
根据已有文献给出的W矩阵元的一般公式,利用重耦理论深入研究了5价顶角,得出了相应的W(5)矩阵元的可直接计算的精确公式. 相似文献
5.
Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015 相似文献
6.
For nonnegative integers d1, d2, and L(d1, d2)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ di whenever the distance between u and v is i in G, for i = 1, 2. The L(d1, d2)‐number of G, λ(G) is the smallest k such that there exists an L(d1, d2)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d1 ≤ d2. In this article, we will study the labelings with (d1, d2) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
7.
8.
9.
现实世界中的图往往在结点和边上包含描述信息,可达性查询是图数据管理和挖掘中的基本操作之一。针对图数据中标签约束的可达性计算问题,提出一种基于递归划分的可达性计算方法 RP-Hop。该算法基于层次划分思想,利用独立集性质,在保持标签和可达性前提下对大规模图进行递归划分,并结合贪婪扩展思想和递归编码,为标签约束的可达性查询提供压缩索引。经过合成和真实数据集上的实验,结果表明,RP-Hop算法不仅降低了索引大小和构建时间,而且提高了查询效率。 相似文献
10.