会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 24. 发明授权
    • System and methods for computerized machine-learning based authentication of electronic documents including use of linear programming for classification
    • 基于计算机机器学习的电子文件认证的系统和方法,包括使用线性规划进行分类
    • US09406030B2
    • 2016-08-02
    • US14235658
    • 2012-07-23
    • Guy DolevSergey MarkinAvi Bar-NissimAsher Uziel
    • Guy DolevSergey MarkinAvi Bar-NissimAsher Uziel
    • G06F15/18G06N99/00G06K9/00G06K9/62
    • G06N99/005G06K9/00442G06K9/6276
    • Electronic document classification comprising providing training documents sorted into classes; linear programming including selecting inputs which maximize an output, given constraints on inputs, the output maximized being a difference between: a. first estimated probability that a document instance will be correctly classified, by a classifier corresponding to given inputs, as belonging to its own class, and b. second estimated probability that document instance will be classified, by the classifier, as not belonging to its own class; and classifying electronic document instances into classes, using a preferred classifier corresponding, to the inputs selected by the linear programming. A computerized electronic document forgery detection method provides training documents and uses a processor to select value-ranges of non-trivial parameters, such that selected values-range(s) of parameters are typical to an authentic document of given class, and atypical to a forged document of same class.
    • 电子文件分类包括提供分类到课堂的训练文件; 线性规划包括选择最大化输出的输入,给定输入约束,最大化的输出是:a。 第一个概率是通过对应给定输入的分类器将文档实例正确分类为属于其自己的类,以及b。 文件实例将被分类器分类为属于自己的类的第二个估计概率; 并且将电子文档实例分类到类中,使用对应于由线性规划选择的输入的优选分类器。 计算机化的电子文件伪造检测方法提供训练文件并且使用处理器来选择非平凡参数的值范围,使得所选择的参数范围对于给定类的真实文档是典型的,并且非典型地 伪造同类文件。
    • 28. 发明授权
    • Method and apparatus for improved reward-based learning using adaptive distance metrics
    • 使用自适应距离度量改进基于奖励的学习的方法和装置
    • US09298172B2
    • 2016-03-29
    • US11870661
    • 2007-10-11
    • Gerald J. TesauroKilian Q. Weinberger
    • Gerald J. TesauroKilian Q. Weinberger
    • G06F15/18G05B13/02G06K9/62G06N5/02
    • G05B13/0265G06K9/6267G06K9/6276G06N5/02G06N99/005
    • The present invention is a method and an apparatus for reward-based learning of policies for managing or controlling a system or plant. In one embodiment, a method for reward-based learning includes receiving a set of one or more exemplars, where at least two of the exemplars comprise a (state, action) pair for a system, and at least one of the exemplars includes an immediate reward responsive to a (state, action) pair. A distance metric and a distance-based function approximator estimating long-range expected value are then initialized, where the distance metric computes a distance between two (state, action) pairs, and the distance metric and function approximator are adjusted such that a Bellman error measure of the function approximator on the set of exemplars is minimized. A management policy is then derived based on the trained distance metric and function approximator.
    • 本发明是用于管理或控制系统或工厂的策略的奖励学习的方法和装置。 在一个实施例中,用于基于奖励的学习的方法包括接收一组一个或多个示例,其中至少两个示例包括用于系统的(状态,动作)对,并且所述示例中的至少一个包括立即 响应(状态,动作)对的奖励。 然后初始化距离度量和基于距离的函数逼近器估计长距离期望值,其中距离度量计算两个(状态,动作)对之间的距离,并且调整距离度量和函数近似器使得Bellman误差 功能近似器对该示例组的测量被最小化。 然后基于经过训练的距离度量和函数近似器导出管理策略。
    • 29. 发明授权
    • Fast dense patch search and quantization
    • 快速密集补丁搜索和量化
    • US09286540B2
    • 2016-03-15
    • US14085488
    • 2013-11-20
    • Adobe Systems Incorporated
    • Zhe LinJianchao YangHailin JinXin Lu
    • G06K9/68G06K9/46G06K9/62
    • G06K9/4642G06K9/6273G06K9/6276
    • In techniques for fast dense patch search and quantization, partition center patches are determined for partitions of example image patches. Patch groups of an image each include similar image patches and a reference image patch that represents a respective patch group. A partition center patch of the partitions is determined as a nearest neighbor to the reference image patch of a patch group. The partition center patch can be determined based on a single-nearest neighbor (1-NN) distance determination, and the determined partition center patch is allocated as the nearest neighbor to the similar image patches in the patch group. Alternatively, a group of nearby partition center patches are determined as the nearest neighbors to the reference image patch based on a k-nearest neighbor (k-NN) distance determination, and the nearest neighbor to each of the similar image patches in the patch group is determined from the nearby partition center patches.
    • 在快速密集补丁搜索和量化的技术中,为示例图像补丁的分区确定分区中心补丁。 图像的补丁组各自包括相似的图像补丁和代表相应补丁组的参考图像补丁。 分区的分区中心补丁被确定为补丁组的参考图像补丁的最近邻。 可以基于单个最近邻居(1-NN)距离确定来确定分区中心补丁,并且将所确定的分区中心补丁分配为补丁组中的相似图像补丁的最近邻。 或者,基于k个最近邻(k-NN)距离确定,将一组附近的分区中心补丁确定为参考图像补丁的最近邻,并且补丁组中每个相似图像补丁的最近邻 是从附近的分区中心补丁确定的。