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

1. 发明申请

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.

2. 发明授权

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.
摘要翻译：可以遍历索引树的多个路径以发现与一组查询描述符匹配候选的一组内容描述符。可以优化候选内容描述符集合的大小，例如，至少部分地通过基于至少在...中确定要遍历的子节点的数量来减少假阳性匹配错误，查询延迟和/或索引树遍历时间部分电流横越电平和/或横越邻域阈值。用于大内容描述符集的索引树可以在具有近似和/或精炼构建技术的资源约束环境中构建。

3. 发明授权

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.
摘要翻译：提供了用于搜索与查询内容相对应的内容集合的系统和方法。特别地，可以通过最小内容区域测试和/或每个比例测试的最小特征来减少查询内容和内容收集之间的假阳性匹配率。例如，通过将内容集合中的内容片段的内容描述符与查询内容的查询描述符相关联，可以确定内容片段与内容片段的特定区域和/或内容片段的特定区域查询描述符的比例大小满足或超过规定的最小值。或者或另外，通过比较多个尺度的特征的内容描述符和查询描述符，可以减少查询内容与内容片段之间的假正匹配率。可以根据多个尺度的描述符比例配额来确定内容片段以匹配查询内容。

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. 发明授权

US10282904B1 Providing augmented reality view of objects 有权
公开(公告)号：US10282904B1
公开(公告)日：2019-05-07
申请号：US13485152
申请日：2012-05-31
申请人： Sunil Ramesh , Matthew Warren Amacker , Max Delgadillo, Jr. , Keshav Menon , Ella Day Bench , Arnab S. Dhua , Gautam Bhargava
发明人： Sunil Ramesh , Matthew Warren Amacker , Max Delgadillo, Jr. , Keshav Menon , Ella Day Bench , Arnab S. Dhua , Gautam Bhargava
IPC分类号： G06F3/01 , G06T19/00 , G06T11/60
摘要： A user can capture image information about an object in order to identify the object. In addition to obtaining information about the object, the user can obtain additional views of the object. For example, if the user captures an image of packaging containing the object, the user can receive views of the object when out of the packaging, as well as a view showing the relative size of the object within the packaging. If the object requires assembly, the views can include views of the object at the component, part, or ingredient level, as well as views during assembly and one or more views of the finished product. A user also can obtain a virtual x-ray view that enables the user to move the client device with respect to the object in order to obtain different views of what is contained within the packaging.

7. 发明授权

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.
摘要翻译：呈现各种算法，使得能够分析和解码由电子设备的照相机拍摄的条形码的图像，以用于获得关于与条形码相关联的对象或物品的信息。这些算法可以解释图像焦点的变化，因为可能会由于移动或缺少自动对焦的特征造成模糊。离线训练阶段可以用于生成一组可能的符号外观模板，其中至少一些模板反映了图像中不同级别和类型的噪声的模拟。解码阶段将这些模板与捕获的图像进行比较，并执行序列范围优化以确定整体最可能的数字序列。

8. 发明授权

US09104701B1 Determining similarity using human generated data 有权
标题翻译：使用人造数据确定相似度
公开(公告)号：US09104701B1
公开(公告)日：2015-08-11
申请号：US13482717
申请日：2012-05-29
申请人： Michael Q. Phung , Arnab S. Dhua , Ketan R. Deshpande , Sunil Ramesh
发明人： Michael Q. Phung , Arnab S. Dhua , Ketan R. Deshpande , Sunil Ramesh
IPC分类号： G06K9/68 , G06F17/30
CPC分类号： G06F17/30256 , G06F17/30047 , G06F17/3005 , G06F17/30277
摘要： Subjective user-generated data can be utilized to determine visually similar items. Various item descriptors can be determined for a pair of items, which can provide an objective measure of visual aspects of those items, such as how similar those items are in color, style, material, or texture. The ways in which users interact with data for those items, either explicitly or implicitly through user behavior, can provide a level of perceived visual similarity on behalf of these users. The perceived, subjective visual similarity data from the users can be used to adjust a weighting of the various item descriptor factors for a pair of items, or otherwise adjust a visual similarity score, such that items selected as being visually similar more accurately reflect the subjective opinions of the users.
摘要翻译：主观用户生成的数据可用于确定视觉上相似的项目。可以为一对项目确定各种项目描述符，这些项目可以提供这些项目的视觉方面的客观测量，诸如这些项目在颜色，样式，材料或纹理中的相似度。用户通过用户行为明确或隐含地与这些项目的数据进行交互的方式可以代表这些用户提供一定程度的感知视觉相似度。可以使用来自用户的感知的，主观的视觉相似性数据来调整一对项目的各种项目描述符因子的加权，或者另外调整视觉相似性得分，使得被选择为视觉上类似的项目更准确地反映主观用户意见。

9. 发明授权

US08990199B1 Content search with category-aware visual similarity 有权
标题翻译：内容搜索与类别感知视觉相似性
公开(公告)号：US08990199B1
公开(公告)日：2015-03-24
申请号：US12895601
申请日：2010-09-30
申请人： Sunil Ramesh , Arnab S. Dhua , Supratik Bhattacharyya , Gurumurthy D. Ramkumar , Gautam Bhargava
发明人： Sunil Ramesh , Arnab S. Dhua , Supratik Bhattacharyya , Gurumurthy D. Ramkumar , Gautam Bhargava
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30259 , G06F17/30256 , G06F17/30864
摘要： Visual incongruity in search result sets may be reduced at least in part by searching an optimized visually significant subset of a category tree that categorizes a collection of content. The category tree may be optimized at build time at least in part by pruning with respect to visual coherence and by the size of the content collection subset referenced by particular categories. Content collection subset sizes both too large and too small can detract from the visual significance of a particular category. The visually significant subset of the category tree may be further optimized at query time by intersecting the visually significant subset with the query-associated sub-tree(s) and further pruning categories in the visually significant subset that have child categories in the visually significant subset. Searching with respect to the optimized visually significant subset can also improve search efficiency.
摘要翻译：搜索结果集中的视觉不协调可以至少部分地通过搜索对内容集合进行分类的类别树的优化的视觉上重要的子集来减少。类别树可以在构建时间至少部分地通过针对视觉一致性的修剪以及由特定类别引用的内容收集子集的大小进行优化。内容收集子集大小太大和太小可能会降低特定类别的视觉含义。可以在查询时间通过将视觉上有意义的子集与查询关联的子树相交并在视觉上有意义的子集中进一步修剪在视觉上有意义的子集中具有子类别的视觉上重要子集中的类别，来进一步优化类别树的视觉上重要的子集。关于优化的视觉显着子集的搜索也可以提高搜索效率。

10. 发明授权

US08582821B1 Tracking objects between images 有权
标题翻译：跟踪图像之间的对象
公开(公告)号：US08582821B1
公开(公告)日：2013-11-12
申请号：US13113989
申请日：2011-05-23
申请人： Bryan E. Feldman , Nalin Pradeep Senthamil , Arnab S. Dhua , Gurumurthy D. Ramkumar
发明人： Bryan E. Feldman , Nalin Pradeep Senthamil , Arnab S. Dhua , Gurumurthy D. Ramkumar
IPC分类号： G06K9/00
CPC分类号： G06T7/248 , G06T7/20 , G06T7/254 , G06T2207/10016
摘要： Systems and methods track one or more points between images. A point for tracking may be selected, at least in part, on a determination of how discriminable the point is relative to other points in a region containing the point. A point of an image being tracked may be located in another image by matching a patch containing the point with another patch of the other image. A search for a matching patch may be focused in a region that is determined based at least in part on an estimate of movement of the point between images. Points may be tracked across multiple images. If an ability to track one or more points is lost, information about the points being tracked may be used to relocate the points in another image.
摘要翻译：系统和方法跟踪图像之间的一个或多个点。可以至少部分地选择用于跟踪的点，以确定点相对于包含该点的区域中的其他点的可区分性。跟踪的图像的点可以通过将包含该点的补丁与另一图像的另一个补丁相匹配来定位在另一图像中。可以在至少部分地基于图像之间的点的移动的估计来确定的区域中聚焦对匹配补丁的搜索。点数可以跨越多个图像进行跟踪。如果跟踪一个或多个点的能力丢失，则关于要跟踪的点的信息可以用于重新定位另一个图像中的点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式