专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08943090B2 Content collection search with robust content matching 有权
标题翻译：内容集合搜索与强大的内容匹配
公开(公告)号：US08943090B2
公开(公告)日：2015-01-27
申请号：US13621171
申请日：2012-09-15
申请人： Arnab S. Dhua , Sunil Ramesh , Max Delgadillo , Raghavan Manmatha
发明人： Arnab S. Dhua , Sunil Ramesh , Max Delgadillo , Raghavan Manmatha
IPC分类号： G06F17/30 , G06K9/46 , G06K9/62
CPC分类号： G06F17/30256 , G06F17/30247 , G06F17/30259 , G06F17/30542 , G06F17/30867 , G06K9/46 , G06K9/6203
摘要： Systems and approaches for searching a content collection corresponding to query content are provided. In particular, false positive match rates between the query content and the content collection may be reduced with a minimum content region test and/or a minimum features per scale test. For example, by correlating content descriptors of a content piece in the content collection with query descriptors of the query content, the content piece can be determined to match the query content when a particular region of the content piece and/or a particular region of a query descriptor have a proportionate size meeting or exceeding a specified minimum. Alternatively, or in addition, the false positive match rate between query content and a content piece can be reduced by comparing content descriptors and query descriptors of features at a plurality of scales. A content piece can be determined to match the query content according to descriptor proportion quotas for the plurality of scales.
摘要翻译：提供了用于搜索与查询内容相对应的内容集合的系统和方法。特别地，可以通过最小内容区域测试和/或每个比例测试的最小特征来减少查询内容和内容收集之间的假阳性匹配率。例如，通过将内容集合中的内容片段的内容描述符与查询内容的查询描述符相关联，可以确定内容片段与内容片段的特定区域和/或内容片段的特定区域查询描述符的比例大小满足或超过规定的最小值。或者或另外，通过比较多个尺度的特征的内容描述符和查询描述符，可以减少查询内容与内容片段之间的假正匹配率。可以根据多个尺度的描述符比例配额来确定内容片段以匹配查询内容。

2. 发明申请

US20130254235A1 CONTENT COLLECTION SEARCH WITH ROBUST CONTENT MATCHING 有权
公开(公告)号：US20130254235A1
公开(公告)日：2013-09-26
申请号：US13621171
申请日：2012-09-15
申请人： Arnab S. Dhua , Sunil Ramesh , Max Delgadillo , Raghavan Manmatha
发明人： Arnab S. Dhua , Sunil Ramesh , Max Delgadillo , Raghavan Manmatha
IPC分类号： G06F17/30
CPC分类号： G06F17/30256 , G06F17/30247 , G06F17/30259 , G06F17/30542 , G06F17/30867 , G06K9/46 , G06K9/6203
摘要： Systems and approaches for searching a content collection corresponding to query content are provided. In particular, false positive match rates between the query content and the content collection may be reduced with a minimum content region test and/or a minimum features per scale test. For example, by correlating content descriptors of a content piece in the content collection with query descriptors of the query content, the content piece can be determined to match the query content when a particular region of the content piece and/or a particular region of a query descriptor have a proportionate size meeting or exceeding a specified minimum. Alternatively, or in addition, the false positive match rate between query content and a content piece can be reduced by comparing content descriptors and query descriptors of features at a plurality of scales. A content piece can be determined to match the query content according to descriptor proportion quotas for the plurality of scales.

3. 发明授权

US08352483B1 Scalable tree-based search of content descriptors 有权
标题翻译：可扩展的基于树的搜索内容描述符
公开(公告)号：US08352483B1
公开(公告)日：2013-01-08
申请号：US12778957
申请日：2010-05-12
申请人： Sunil Ramesh , Arnab S. Dhua , Max Delgadillo , Raghavan Manmatha
发明人： Sunil Ramesh , Arnab S. Dhua , Max Delgadillo , Raghavan Manmatha
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/3002
摘要： Multiple paths of an index tree may be traversed to discover a set of content descriptors that are match candidates for a set of query descriptors. A size of the set of candidate content descriptors may be optimized, for example, to reduce false positive matching errors, query latencies and/or index tree traversal times, at least in part by determining a number of child nodes to traverse based at least in part on current traverse level and/or traverse neighborhood thresholds. Index trees for large content descriptor sets may be built in resource constrained environments with approximation and/or refining build techniques.
摘要翻译：可以遍历索引树的多个路径以发现与一组查询描述符匹配候选的一组内容描述符。可以优化候选内容描述符集合的大小，例如，至少部分地通过基于至少在...中确定要遍历的子节点的数量来减少假阳性匹配错误，查询延迟和/或索引树遍历时间部分电流横越电平和/或横越邻域阈值。用于大内容描述符集的索引树可以在具有近似和/或精炼构建技术的资源约束环境中构建。

4. 发明授权

US08756216B1 Scalable tree builds for content descriptor search 有权
标题翻译：可扩展树构建内容描述符搜索
公开(公告)号：US08756216B1
公开(公告)日：2014-06-17
申请号：US12779741
申请日：2010-05-13
申请人： Sunil Ramesh , Arnab S. Dhua , Max Delgadillo , Raghavan Manmatha
发明人： Sunil Ramesh , Arnab S. Dhua , Max Delgadillo , Raghavan Manmatha
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30946 , G06F17/3002
摘要： Multiple paths of an index tree may be traversed to discover a set of content descriptors that are match candidates for a set of query descriptors. A size of the set of candidate content descriptors may be optimized, for example, to reduce false positive matching errors, query latencies and/or index tree traversal times, at least in part by determining a number of child nodes to traverse based at least in part on current traverse level and/or traverse neighborhood thresholds. Index trees for large content descriptor sets may be built in resource constrained environments with approximation and/or refining build techniques.
摘要翻译：可以遍历索引树的多个路径以发现与一组查询描述符匹配候选的一组内容描述符。可以优化候选内容描述符集合的大小，例如，至少部分地通过基于至少在...中确定要遍历的子节点的数量来减少假阳性匹配错误，查询延迟和/或索引树遍历时间部分电流横越电平和/或横越邻域阈值。用于大内容描述符集的索引树可以在具有近似和/或精炼构建技术的资源约束环境中构建。

5. 发明授权

US08332419B1 Content collection search with robust content matching 有权
标题翻译：内容集合搜索与强大的内容匹配
公开(公告)号：US08332419B1
公开(公告)日：2012-12-11
申请号：US12779254
申请日：2010-05-13
申请人： Arnab S. Dhua , Sunil Ramesh , Max Delgadillo , Raghavan Manmatha
发明人： Arnab S. Dhua , Sunil Ramesh , Max Delgadillo , Raghavan Manmatha
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30256 , G06F17/30247 , G06F17/30259 , G06F17/30542 , G06F17/30867 , G06K9/46 , G06K9/6203
摘要： False positive match rates between query content and content in a collection may be reduced with a minimum content region test and/or a minimum features per scale test. The quality of correlations between query descriptors and content descriptors may be improved with a modified sub-region descriptor construction. Content regions associated with detected content features may be partitioned into disjoint sets of sub-regions that cover the content regions, the sub-regions modified so as to at least partially overlap, and descriptor components generated for the modified sub-regions. Matching of feature-sparse content may be improved by adding blurred versions to the collection.
摘要翻译：可以通过最小内容区域测试和/或每个比例测试的最小特征来减少查询内容与集合中的内容之间的错误的正匹配率。可以通过修改的子区域描述符构造来改进查询描述符和内容描述符之间的相关性的质量。与检测到的内容特征相关联的内容区域可以被划分为覆盖内容区域，修改为至少部分重叠的子区域和为修改的子区域生成的描述符组件的不相交的子区域集合。通过向集合添加模糊版本，可以改善特征稀疏内容的匹配。

6. 发明授权

US08733650B1 Decoding barcodes from images with varying degrees of focus 有权
标题翻译：从不同程度的图像解码条形码
公开(公告)号：US08733650B1
公开(公告)日：2014-05-27
申请号：US13465900
申请日：2012-05-07
申请人： Aleksandr V. Segal , Arnab S. Dhua , Max Delgadillo
发明人： Aleksandr V. Segal , Arnab S. Dhua , Max Delgadillo
IPC分类号： G06K5/00
CPC分类号： G06K7/1404 , A63B53/02 , A63B53/0466 , A63B2053/0433 , A63B2053/0445 , A63B2053/0458 , A63B2209/00
摘要： Various algorithms are presented that enable an image of a barcode, captured by a camera of an electronic device, to be analyzed and decoded for use in obtaining information about an object or item associated with the barcode. The algorithms can account for variations in focus of the image, as may result in blur due to movement or a lack of auto-focus features. An offline training phase can be used to generate a set of possible symbol appearance templates, where at least some of the templates reflect simulations for varying levels and types of noise in an image. A decoding phase compares these templates to a captured image and performs a sequence-wide optimization to determine the overall most likely sequence of digits.
摘要翻译：呈现各种算法，使得能够分析和解码由电子设备的照相机拍摄的条形码的图像，以用于获得关于与条形码相关联的对象或物品的信息。这些算法可以解释图像焦点的变化，因为可能会由于移动或缺少自动对焦的特征造成模糊。离线训练阶段可以用于生成一组可能的符号外观模板，其中至少一些模板反映了图像中不同级别和类型的噪声的模拟。解码阶段将这些模板与捕获的图像进行比较，并执行序列范围优化以确定整体最可能的数字序列。

7. 发明授权

US08413903B1 Decoding barcodes 有权
标题翻译：解码条形码
公开(公告)号：US08413903B1
公开(公告)日：2013-04-09
申请号：US13095230
申请日：2011-04-27
申请人： Arnab S Dhua , Max Delgadillo
发明人： Arnab S Dhua , Max Delgadillo
IPC分类号： G02B26/10
CPC分类号： G06K7/1408 , G06K7/10821 , G06K7/1439 , G06K7/1465
摘要： Various algorithms are presented that enable an image of a barcode, captured by a camera of an electronic device, to be decoded on the device without need to upload the image information to a server for processing. The algorithms can account for variations in focus of the image, as may result in blur due to move movement or auto-focus features. The approaches can handle multiple barcode formats, and can handle barcodes on curved surfaces, barcodes with damaged areas, or barcodes that are otherwise uneven. Such algorithms are highly accurate while being fast and lightweight enough to execute on portable electronic devices, such as tablet computers and smart phones.
摘要翻译：提出了使得能够在设备上解码由电子设备的照相机拍摄的条形码的图像的各种算法，而不需要将图像信息上传到服务器进行处理。这些算法可以解释图像焦点的变化，因为可能会由于移动移动或自动对焦功能而导致模糊。这些方法可以处理多种条形码格式，并且可以处理弯曲表面上的条形码，损坏区域的条形码或否则不均匀的条形码。这样的算法是高度精确的，同时快速和轻量化足以在诸如平板电脑和智能电话的便携式电子设备上执行。

8. 发明申请

US20100211602A1 Method and system for image matching 有权
标题翻译：图像匹配方法和系统
公开(公告)号：US20100211602A1
公开(公告)日：2010-08-19
申请号：US12378599
申请日：2009-02-18
申请人： Keshav Menon , Max Delgadillo , Sunil Ramesh , Gd Ramkumar
发明人： Keshav Menon , Max Delgadillo , Sunil Ramesh , Gd Ramkumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30247 , G06T1/00
摘要： The present invention provides a method and system for image matching. The method includes receiving a query image at a query-server. Further, the method includes, sending a request to one or more image-matching servers of a set of distributed image-matching servers to conduct an image-search corresponding to the query image. Furthermore, the method includes receiving at the query-server, a list of identified matches from the image-matching servers corresponding to the query image, wherein the list of matches is identified based on the image-search at the image-matching servers. Moreover, the method includes selecting one or more matches from the list of identified matches based on a score corresponding to the identified matches.
摘要翻译：本发明提供了一种用于图像匹配的方法和系统。该方法包括在查询服务器处接收查询图像。此外，该方法包括：向一组分布式图像匹配服务器的一个或多个图像匹配服务器发送请求，以进行与查询图像相对应的图像搜索。此外，该方法包括在查询服务器处接收来自对应于查询图像的图像匹配服务器的所识别匹配的列表，其中基于图像匹配服务器上的图像搜索来识别匹配列表。此外，该方法包括基于与所识别的匹配相对应的得分从所识别的匹配列表中选择一个或多个匹配。

9. 发明授权

US08738647B2 Method and system for image matching 有权
标题翻译：图像匹配方法和系统
公开(公告)号：US08738647B2
公开(公告)日：2014-05-27
申请号：US12378599
申请日：2009-02-18
申请人： Keshav Menon , Max Delgadillo , Sunil Ramesh , Gd Ramkumar
发明人： Keshav Menon , Max Delgadillo , Sunil Ramesh , Gd Ramkumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30247 , G06T1/00
摘要： The present invention provides a method and system for image matching. The method includes receiving a query image at a query-server. Further, the method includes, sending a request to one or more image-matching servers of a set of distributed image-matching servers to conduct an image-search corresponding to the query image. Furthermore, the method includes receiving at the query-server, a list of identified matches from the image-matching servers corresponding to the query image, wherein the list of matches is identified based on the image-search at the image-matching servers. Moreover, the method includes selecting one or more matches from the list of identified matches based on a score corresponding to the identified matches.
摘要翻译：本发明提供了一种用于图像匹配的方法和系统。该方法包括在查询服务器处接收查询图像。此外，该方法包括：向一组分布式图像匹配服务器的一个或多个图像匹配服务器发送请求，以进行与查询图像相对应的图像搜索。此外，该方法包括在查询服务器处接收来自对应于查询图像的图像匹配服务器的所识别匹配的列表，其中基于图像匹配服务器上的图像搜索来识别匹配列表。此外，该方法包括基于与所识别的匹配相对应的得分从所识别的匹配列表中选择一个或多个匹配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式