会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Robust Large-Scale Visual Codebook Construction
    • 坚固的大型视觉代码簿构建
    • US20120251007A1
    • 2012-10-04
    • US13077735
    • 2011-03-31
    • Linjun YangDarui LiXian-Sheng HuaHong-Jiang Zhang
    • Linjun YangDarui LiXian-Sheng HuaHong-Jiang Zhang
    • G06K9/46
    • G06K9/6223
    • Techniques for construction of a visual codebook are described herein. Feature points may be extracted from large numbers of images. In one example, images providing N feature points may be used to construct a codebook of K words. The centers of each of K clusters of feature points may be initialized. In a looping or iterative manner, an assignment step assigns each feature point to a cluster and an update step locates a center of each cluster. The feature points may be assigned to a cluster based on a lesser of a distance to a center of a previously assigned cluster and a distance to a center derived by operation of an approximate nearest neighbor algorithm having aspects of randomization. The loop terminates when the feature points have sufficiently converged to their respective clusters. Centers of the clusters represent visual words, which may be used to construct the visual codebook.
    • 本文描述了构建视觉码本的技术。 特征点可以从大量图像中提取出来。 在一个示例中,提供N个特征点的图像可以用于构造K个字的码本。 可以初始化K个特征点中的每一个的中心。 以循环或迭代的方式,分配步骤将每个特征点分配给集群,并且更新步骤定位每个集群的中心。 可以基于距先前分配的簇的中心的距离中较小的一个特征点来分配特征点,以及通过具有随机化方面的近似最近邻算法的操作导出的到中心的距离。 当特征点已经充分收敛到它们各自的簇时,环路终止。 集群的中心表示视觉词,可用于构建视觉码本。
    • 2. 发明授权
    • Robust large-scale visual codebook construction
    • 坚固的大型视觉代码簿建设
    • US08422802B2
    • 2013-04-16
    • US13077735
    • 2011-03-31
    • Linjun YangDarui LiXian-Sheng HuaHong-Jiang Zhang
    • Linjun YangDarui LiXian-Sheng HuaHong-Jiang Zhang
    • G06K9/36
    • G06K9/6223
    • Techniques for construction of a visual codebook are described herein. Feature points may be extracted from large numbers of images. In one example, images providing N feature points may be used to construct a codebook of K words. The centers of each of K clusters of feature points may be initialized. In a looping or iterative manner, an assignment step assigns each feature point to a cluster and an update step locates a center of each cluster. The feature points may be assigned to a cluster based on a lesser of a distance to a center of a previously assigned cluster and a distance to a center derived by operation of an approximate nearest neighbor algorithm having aspects of randomization. The loop terminates when the feature points have sufficiently converged to their respective clusters. Centers of the clusters represent visual words, which may be used to construct the visual codebook.
    • 本文描述了构建视觉码本的技术。 特征点可以从大量图像中提取出来。 在一个示例中,提供N个特征点的图像可以用于构造K个字的码本。 可以初始化K个特征点中的每一个的中心。 以循环或迭代的方式,分配步骤将每个特征点分配给集群,并且更新步骤定位每个集群的中心。 可以基于距先前分配的簇的中心的距离中较小的一个特征点来分配特征点,以及通过具有随机化方面的近似最近邻算法的操作导出的到中心的距离。 当特征点已经充分收敛到它们各自的簇时,环路终止。 集群的中心表示视觉词,可用于构建视觉码本。
    • 6. 发明申请
    • CONCURRENT MULTIPLE-INSTANCE LEARNING FOR IMAGE CATEGORIZATION
    • 一致的多元学习图像分类
    • US20090290802A1
    • 2009-11-26
    • US12125057
    • 2008-05-22
    • Xian-Sheng HuaGuo-Jun QiYong RuiTao MeiHong-Jiang Zhang
    • Xian-Sheng HuaGuo-Jun QiYong RuiTao MeiHong-Jiang Zhang
    • G06K9/62
    • G06K9/34
    • The concurrent multiple instance learning technique described encodes the inter-dependency between instances (e.g. regions in an image) in order to predict a label for a future instance, and, if desired the label for an image determined from the label of these instances. The technique, in one embodiment, uses a concurrent tensor to model the semantic linkage between instances in a set of images. Based on the concurrent tensor, rank-1 supersymmetric non-negative tensor factorization (SNTF) can be applied to estimate the probability of each instance being relevant to a target category. In one embodiment, the technique formulates the label prediction processes in a regularization framework, which avoids overfitting, and significantly improves a learning machine's generalization capability, similar to that in SVMs. The technique, in one embodiment, uses Reproducing Kernel Hilbert Space (RKHS) to extend predicted labels to the whole feature space based on the generalized representer theorem.
    • 所描述的并发多实例学习技术编码实例(例如,图像中的区域)之间的相互依赖性,以便预测将来实例的标签,以及如果需要,从这些实例的标签确定的图像的标签。 在一个实施例中,该技术使用并发张量来对一组图像中的实例之间的语义联系进行建模。 基于并发张量,可以应用秩1超对称非负张量因子分解(SNTF)来估计每个实例与目标类别相关的概率。 在一个实施例中,该技术在正则化框架中制定标签预测过程,其避免过拟合,并且显着地提高学习机器的泛化能力,类似于SVM中的标准预测过程。 在一个实施例中,该技术使用再生核希尔伯特空间(RKHS)来基于广义代表定理将预测标签扩展到整个特征空间。