会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Partition min-hash for partial-duplicate image determination
    • 部分重复图像确定的分区最小散列
    • US08452106B2
    • 2013-05-28
    • US12729250
    • 2010-03-23
    • Qifa KeMichael A. IsardDavid Changsoo Lee
    • Qifa KeMichael A. IsardDavid Changsoo Lee
    • G06K9/66
    • G06K9/6202G06K9/4642
    • Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.
    • 数据库或图像集合中的图像被分成多个分区,每个分区对应于图像的区域。 图像中的分区可能会彼此重叠。 为每个分区生成最小散列草图,并与图像一起存储。 用户可以提交图像并请求作为所提交图像的部分匹配的图像位于图像集合中。 提交的图像类似地划分为分区,并且从分区生成最小哈希草图。 将最小哈希草图与存储的最小哈希草图进行比较,并将具有其草图匹配的分区的图像作为部分匹配图像返回。
    • 2. 发明申请
    • PARTITION MIN-HASH FOR PARTIAL-DUPLICATE IMAGE DETERMINATION
    • 用于部分重复图像确定的分区最小化
    • US20110235908A1
    • 2011-09-29
    • US12729250
    • 2010-03-23
    • Qifa KeMichael A. IsardDavid Changsoo Lee
    • Qifa KeMichael A. IsardDavid Changsoo Lee
    • G06K9/34G06K9/68
    • G06K9/6202G06K9/4642
    • Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.
    • 数据库或图像集合中的图像被分成多个分区,每个分区对应于图像的区域。 图像中的分区可能会彼此重叠。 为每个分区生成最小散列草图,并与图像一起存储。 用户可以提交图像并请求作为所提交图像的部分匹配的图像位于图像集合中。 提交的图像类似地划分为分区,并且从分区生成最小哈希草图。 将最小哈希草图与存储的最小哈希草图进行比较,并将具有其草图匹配的分区的图像作为部分匹配图像返回。
    • 7. 发明授权
    • Runtime optimization of distributed execution graph
    • 分布式执行图的运行时优化
    • US07844959B2
    • 2010-11-30
    • US11537514
    • 2006-09-29
    • Michael A. Isard
    • Michael A. Isard
    • G06F9/45G06F9/46G06F15/76
    • G06F9/5066G06F11/1438
    • A general purpose high-performance distributed execution engine for coarse-grained data-parallel applications is proposed that allows developers to easily create large-scale distributed applications without requiring them to master concurrency techniques beyond being able to draw a graph of the data-dependencies of their algorithms. Based on the graph, a job manager intelligently distributes the work load so that the resources of the execution engine are used efficiently. During runtime, the job manager (or other entity) can automatically modify the graph to improve efficiency. The modifications are based on runtime information, topology of the distributed execution engine, and/or the distributed application represented by the graph.
    • 提出了一种用于粗粒度数据并行应用程序的通用高性能分布式执行引擎,允许开发人员轻松创建大规模分布式应用程序,而不需要它们掌握并发技术,除了能够绘制数据依赖关系的图形 他们的算法。 基于该图,作业管理器智能地分配工作负载,以便有效地使用执行引擎的资源。 在运行时,作业管理器(或其他实体)可以自动修改图形以提高效率。 这些修改基于运行时信息,分布式执行引擎的拓扑和/或由图表表示的分布式应用程序。
    • 8. 发明授权
    • Object recognition and library
    • 对象识别和库
    • US08473481B2
    • 2013-06-25
    • US12404358
    • 2009-03-16
    • Oliver M. C. WilliamsMichael A. Isard
    • Oliver M. C. WilliamsMichael A. Isard
    • G06F17/30
    • G06F17/30011G06Q10/06
    • An image may be received, a portion of which corresponds to a surface of an object, such as a book, a CD, a DVD, a wine bottle, etc. The portion of the image that corresponds to the surface of the object is located. The portion of the image is compared with previously stored images of surfaces of objects to identify the object. A record of the object is created and added to a library. The record of the object may comprise the image of the object, the portion of the image which corresponds to the surface of the object, and/or the received image itself. The record may comprise an indicator of a location of the object.
    • 可以接收图像,其一部分对应于诸如书籍,CD,DVD,酒瓶等的物体的表面。对应于物体表面的图像的部分位于 。 将图像的部分与先前存储的对象的表面的图像进行比较以识别对象。 创建对象的记录并将其添加到库中。 对象的记录可以包括对象的图像,对应于对象的表面的图像的部分和/或接收到的图像本身。 记录可以包括对象的位置的指示符。
    • 10. 发明授权
    • Searching for information utilizing a probabilistic detector
    • 使用概率检测器搜索信息
    • US07730058B2
    • 2010-06-01
    • US11243924
    • 2005-10-05
    • Gaurav SareenMark Steven ManasseMartin AbadiMichael A. Isard
    • Gaurav SareenMark Steven ManasseMartin AbadiMichael A. Isard
    • G06F7/00G06F17/30
    • G06F17/30687
    • A probabilistic detector is utilized to query a database. Utilization of a probabilistic detector provides assurance with 100 per cent probability that a search expression in the query is not in the database index. The probabilistic detector is implemented in the form of a Bloom filter. The probabilistic detector is created by hashing expressions in the database index and mapping the resulting hash values into the probabilistic detector. Upon receiving a query, expressions of the query are hashed. The probabilistic detector is queried using these hash values. If the results of querying the probabilistic detector indicate that searched for information may be in the database, the database is not queried. If the results of querying the probabilistic detector indicate that the information may be in the database, the database is queried for the information using the original query. This technique is advantageous in mitigating detrimental effects of denial of service attacks.
    • 利用概率检测器查询数据库。 概率检测器的利用率提供了100%的可能性,即查询中的搜索表达式不在数据库索引中。 概率检测器以Bloom滤波器的形式实现。 概率检测器是通过在数据库索引中散列表达式并将生成的散列值映射到概率检测器中创建的。 在接收到查询后,查询的表达式将被哈希。 使用这些散列值查询概率检测器。 如果查询概率检测器的结果表明搜索到的信息可能在数据库中,则不会查询数据库。 如果查询概率检测器的结果表明信息可能在数据库中,则使用原始查询查询数据库中的信息。 这种技术有利于减轻拒绝服务攻击的有害影响。