利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

16 条记录 (耗时 0.029 秒)

    Method and system for searching for information on a network in response to an image query sent by a user from a mobile communications device
    2.
    发明授权
    Method and system for searching for information on a network in response to an image query sent by a user from a mobile communications device 有权
    响应于用户从移动通信设备发送的图像查询，在网络上搜索信息的方法和系统

    公开(公告)号：US07949191B1

    公开(公告)日：2011-05-24

    申请号：US11732858

    申请日：2007-04-04

    申请人： Gurumurthy D Ramkumar ,  Raghavan Manmatha ,  Supratik Bhattacharyya ,  Gautam Bhargava ,  Mark Ruzon

    发明人： Gurumurthy D Ramkumar ,  Raghavan Manmatha ,  Supratik Bhattacharyya ,  Gautam Bhargava ,  Mark Ruzon

    IPC分类号： G06K9/62

    CPC分类号： G06F17/30253 ,  G06K9/723 ,  G06K2209/01

    摘要： Image-based searching for information on a network is provided in response to an image query sent by a user. The image query includes an image captured using a mobile communications device with a camera. The image is processed to detect any text present in the image, and any detected text can be analyzed using a process such as optical character recognition (OCR). The analyzed text is used to search for matches in at least one corresponding domain database, selected from various domain databases present in the network. Thereafter, one or more selected matches and any additional related information can be sent to the user as one or more results for the submitted image query.

    摘要翻译： 响应于用户发送的图像查询，提供基于图像的网络搜索信息。 图像查询包括使用具有相机的移动通信设备捕获的图像。 处理图像以检测图像中存在的任何文本，并且可以使用诸如光学字符识别（OCR）的处理来分析任何检测到的文本。 分析的文本用于搜索从网络中存在的各种域数据库中选择的至少一个相应的域数据库中的匹配。 此后，一个或多个选择的匹配和任何附加的相关信息可以作为提交的图像查询的一个或多个结果发送给用户。

    Method and system for detecting and recognizing text in images
    4.
    发明授权
    Method and system for detecting and recognizing text in images 有权
    检测和识别图像文本的方法和系统

    公开(公告)号：US08009928B1

    公开(公告)日：2011-08-30

    申请号：US12284283

    申请日：2008-09-19

    申请人： Raghavan Manmatha ,  Mark A. Ruzon

    发明人： Raghavan Manmatha ,  Mark A. Ruzon

    IPC分类号： G06K7/10 ,  G06K9/20 ,  G06K9/36 ,  G06K9/34 ,  G06K9/18

    CPC分类号： G06K9/344 ,  G06K9/18 ,  G06K9/325 ,  G06K9/342 ,  G06K9/346 ,  G06K9/38 ,  G06K9/40 ,  G06K9/62 ,  G06K9/6288 ,  G06K9/748 ,  G06K2209/01

    摘要： Various embodiments of the present invention relate to a method, system and computer program product for detecting and recognizing text in the images captured by cameras and scanners. First, a series of image-processing techniques is applied to detect text regions in the image. Subsequently, the detected text regions pass through different processing stages that reduce blurring and the negative effects of variable lighting. This results in the creation of multiple images that are versions of the same text region. Some of these multiple versions are sent to a character-recognition system. The resulting texts from each of the versions of the image sent to the character-recognition system are then combined to a single result, wherein the single result is detected text.

    摘要翻译： 本发明的各种实施例涉及用于检测和识别由相机和扫描仪捕获的图像中的文本的方法，系统和计算机程序产品。 首先，应用一系列图像处理技术来检测图像中的文本区域。 随后，检测到的文本区域通过不同的处理阶段，减少模糊和可变照明的负面影响。 这导致创建多个相同文本区域的图像。 这些多个版本中的一些被发送到字符识别系统。 然后，将发送到字符识别系统的图像的每个版本的结果文本合并为单个结果，其中单个结果是检测到的文本。

    Content collection search with robust content matching
    5.
    发明授权
    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.

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

    Method and system for representing image patches
    6.
    发明授权
    Method and system for representing image patches 有权
    表示图像补丁的方法和系统

    公开(公告)号：US08406507B2

    公开(公告)日：2013-03-26

    申请号：US12319992

    申请日：2009-01-14

    申请人： Mark A. Ruzon ,  Raghavan Manmatha ,  Donald Tanguay

    发明人： Mark A. Ruzon ,  Raghavan Manmatha ,  Donald Tanguay

    IPC分类号： G06K9/00 ,  G06K9/32

    CPC分类号： G06K9/4671 ,  G06K9/4609 ,  G06K9/6212 ,  G06K9/6232 ,  G06T9/00

    摘要： A method, system and computer program product for representing an image is provided. The image that needs to be represented is represented in the form of a Gaussian pyramid which is a scale-space representation of the image and includes several pyramid images. The feature points in the pyramid images are identified and a specified number of feature points are selected. The orientations of the selected feature points are obtained by using a set of orientation calculating algorithms. A patch is extracted around the feature point in the pyramid images based on the orientations of the feature point and the sampling factor of the pyramid image. The boundary patches in the pyramid images are extracted by padding the pyramid images with extra pixels. The feature vectors of the extracted patches are defined. These feature vectors are normalized so that the components in the feature vectors are less than a threshold.

    摘要翻译： 提供了一种用于表示图像的方法，系统和计算机程序产品。 需要表示的图像以高斯金字塔的形式表示，高斯金字塔是图像的尺度空间表示，并且包括几个金字塔图像。 识别金字塔图像中的特征点，并选择指定数量的特征点。 通过使用一组取向计算算法获得所选特征点的取向。 基于特征点的取向和金字塔图像的采样因子，在金字塔图像的特征点周围提取补丁。 通过用额外的像素填充金字塔图像来提取金字塔图像中的边界补丁。 定义提取的补丁的特征向量。 这些特征向量被归一化，使得特征向量中的分量小于阈值。

    Method and system for representing image patches
    7.
    发明申请
    Method and system for representing image patches 有权
    表示图像补丁的方法和系统

    公开(公告)号：US20100177966A1

    公开(公告)日：2010-07-15

    申请号：US12319992

    申请日：2009-01-14

    申请人： Mark A. Ruzon ,  Raghavan Manmatha ,  Donald Tanguay

    发明人： Mark A. Ruzon ,  Raghavan Manmatha ,  Donald Tanguay

    IPC分类号： G06K9/46

    CPC分类号： G06K9/4671 ,  G06K9/4609 ,  G06K9/6212 ,  G06K9/6232 ,  G06T9/00

    摘要： A method, system and computer program product for representing an image is provided. The image that needs to be represented is represented in the form of a Gaussian pyramid which is a scale-space representation of the image and includes several pyramid images. The feature points in the pyramid images are identified and a specified number of feature points are selected. The orientations of the selected feature points are obtained by using a set of orientation calculating algorithms. A patch is extracted around the feature point in the pyramid images based on the orientations of the feature point and the sampling factor of the pyramid image. The boundary patches in lo the pyramid images are extracted by padding the pyramid images with extra pixels. The feature vectors of the extracted patches are defined. These feature vectors are normalized so that the components in the feature vectors are less than a threshold.

    摘要翻译： 提供了用于表示图像的方法，系统和计算机程序产品。 需要表示的图像以高斯金字塔的形式表示，高斯金字塔是图像的尺度空间表示，并且包括几个金字塔图像。 识别金字塔图像中的特征点，并选择指定数量的特征点。 通过使用一组取向计算算法获得所选特征点的取向。 基于特征点的取向和金字塔图像的采样因子，在金字塔图像的特征点周围提取补丁。 通过用额外的像素填充金字塔图像来提取金字塔图像中的边界斑块。 定义提取的补丁的特征向量。 这些特征向量被归一化，使得特征向量中的分量小于阈值。

    Determining section information of a digital volume
    8.
    发明授权
    Determining section information of a digital volume 有权
    确定数字音量的部分信息

    公开(公告)号：US08549008B1

    公开(公告)日：2013-10-01

    申请号：US12269421

    申请日：2008-11-12

    申请人： Xuefu Wang ,  Raghavan Manmatha ,  Bo Pang

    发明人： Xuefu Wang ,  Raghavan Manmatha ,  Bo Pang

    IPC分类号： G06F7/00

    CPC分类号： G06F17/30011 ,  G06F17/30864

    摘要： A system, method, and computer program determines section information of a digital volume. Digital volumes include digital representations of human-readable content, such as digitized books. Phrases are extracted from a table of contents of a digital volume. Matching phrases that at least approximately match the extracted phrases are identified in the body of the digital volume. A best matching phrase is determined for each extracted phrase based on the ordering of the extracted phrases and the matching phrases, and based on match scores indicating the quality of the matches. Section information is generated, including section headings and section start locations based on the best matching phrases. The digital volume is presented to users with links from the table of contents to the section headings on the section start pages. The section information is also used to enhance searching of the digital volume by users.

    摘要翻译： 系统，方法和计算机程序确定数字卷的部分信息。 数字卷包括人类可读内容的数字表示，例如数字化书籍。 从数字卷的内容表中提取短语。 在数字体积的主体中识别与至少近似匹配提取的短语的匹配短语。 基于所提取的短语和匹配短语的顺序，并且基于表示匹配的质量的匹配分数，为每个提取的短语确定最佳匹配短语。 生成部分信息，包括基于最佳匹配短语的部分标题和部分起始位置。 将数字音量呈现给具有从目录到节起始页的部分标题的链接的用户。 部分信息还用于增强用户对数字卷的搜索。

    CONTENT COLLECTION SEARCH WITH ROBUST CONTENT MATCHING
    9.
    发明申请
    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.

    Scalable tree-based search of content descriptors
    10.
    发明授权
    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.

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