Contextual dominant color name extraction
    1.
    发明授权
    Contextual dominant color name extraction 有权
    语境主要颜色名称提取

    公开(公告)号:US08873845B2

    公开(公告)日:2014-10-28

    申请号:US13569333

    申请日:2012-08-08

    IPC分类号: G06K9/00 G06K9/34

    CPC分类号: G06F17/3025

    摘要: Dominant color names may be extracted from an image by analyzing spatial-context of pixels contained in the image. A dominant color region may be defined by taking a double-threshold approach that addresses ambiguous color regions and a degree of confidence that each pixel belongs in the dominant color region. Affiliation maps and binary maps may be used to generate the dominant color region. Images may be converted to a saliency map, from which a region of interest may be assigned a dominant color name. Image search results may be filtered by the dominant color name associated with the image.

    摘要翻译: 可以通过分析包含在图像中的像素的空间上下文从图像中提取主色颜色名称。 主色区域可以通过采用双阈值方法来定义,所述双阈值方法解决不确定的颜色区域和每个像素属于主色区域的置信度。 可以使用隶属关系图和二进制图来生成主色区域。 图像可以转换为显着图,可以从其中将感兴趣区域分配为主要颜色名称。 图像搜索结果可能会被与图像相关联的主要颜色名称过滤。

    Gesture-Based Search Queries
    2.
    发明申请
    Gesture-Based Search Queries 审中-公开
    基于手势的搜索查询

    公开(公告)号:US20140075393A1

    公开(公告)日:2014-03-13

    申请号:US13609259

    申请日:2012-09-11

    IPC分类号: G06F3/033

    CPC分类号: G06F16/9032

    摘要: An image-based text extraction and searching system extracts an image be selected by gesture input by a user and the associated image data and proximate textual data in response to the image selection. Extracted image data and textual data can be utilized to perform or enhance a computerized search. The system can determine one or more database search terms based on the textual data and generate at least a first search query proposal related to the image data and the textual data.

    摘要翻译: 基于图像的文本提取和搜索系统响应于图像选择提取由用户通过手势输入选择的图像以及相关联的图像数据和邻近的文本数据。 提取的图像数据和文本数据可用于执行或增强计算机化搜索。 系统可以基于文本数据确定一个或多个数据库搜索项,并生成至少与图像数据和文本数据相关的第一搜索查询提案。

    Interactively ranking image search results using color layout relevance

    公开(公告)号:US08369656B2

    公开(公告)日:2013-02-05

    申请号:US12341953

    申请日:2008-12-22

    IPC分类号: G06K9/60

    摘要: This disclosure describes various exemplary user interfaces, methods, and computer program products for the interactively ranking image search results refinement method using a color layout. The method includes receiving a text query for an image search, presenting image search results in a structured presentation based on the text query and information from an interest color layout. The process creates image search results that may be selected by the user based on color selection palettes or color layout specification schemes. Then the process ranks the image search results by sorting the results according to similarity scores between color layouts from the image search results and the interest color layout from a user based on the color selection palettes and the color layout specification schemes.

    Transductive multi-label learning for video concept detection
    4.
    发明授权
    Transductive multi-label learning for video concept detection 有权
    用于视频概念检测的转换多标签学习

    公开(公告)号:US08218859B2

    公开(公告)日:2012-07-10

    申请号:US12329293

    申请日:2008-12-05

    IPC分类号: G06K9/62 G06K9/00

    CPC分类号: G06K9/00718 G06K9/6297

    摘要: This disclosure describes various exemplary method and computer program products for transductive multi-label classification in detecting video concepts for information retrieval. This disclosure describes utilizing a hidden Markov random field formulation to detect labels for concepts in a video content and modeling a multi-label interdependence between the labels by a pairwise Markov random field. The process groups the labels into several parts to speed up a labeling inference and calculates a conditional probability score for the labels, the conditional probability scores are ordered for ranking in a video retrieval evaluation.

    摘要翻译: 本公开描述了用于检测用于信息检索的视频概念的用于转换多标签分类的各种示例性方法和计算机程序产品。 本公开描述了利用隐马尔科夫随机场公式来检测视频内容中的概念的标签,并通过成对的马尔可夫随机场对标签之间的多标签相互依赖进行建模。 该过程将标签分组成几个部分,以加快标签推理,并计算标签的条件概率分数,条件概率分数被排序用于视频检索评估中的排名。

    Bayesian video search reranking
    5.
    发明授权
    Bayesian video search reranking 有权
    贝叶斯视频搜索重新排名

    公开(公告)号:US08180766B2

    公开(公告)日:2012-05-15

    申请号:US12235509

    申请日:2008-09-22

    IPC分类号: G06F17/30 G06F7/00

    摘要: A general framework for video search reranking is disclosed which explicitly formulates reranking into a global optimization problem from the Bayesian perspective. Under this framework, with two novel pair-wise ranking distances, two effective video search reranking methods, hinge reranking and preference strength reranking, are disclosed. Experiments conducted on the TRECVID dataset have demonstrated that the disclosed methods outperform several existing reranking approaches.

    摘要翻译: 披露了视频搜索重新排列的一般框架,从贝叶斯角度明确地将重新排列到全局优化问题中。 在这个框架下,通过两个新的成对排名距离,公开了两个有效的视频搜索重新排序方法,铰链重新排列和优先权重新排序。 在TRECVID数据集上进行的实验表明,所公开的方法优于现有的几种重新排序方法。

    CONTEXTUAL IMAGE SEARCH
    6.
    发明申请
    CONTEXTUAL IMAGE SEARCH 审中-公开
    背景图像搜索

    公开(公告)号:US20110191336A1

    公开(公告)日:2011-08-04

    申请号:US12696591

    申请日:2010-01-29

    IPC分类号: G06F17/30

    CPC分类号: G06F16/00

    摘要: Techniques for image search using contextual information related to a user query are described. A user query including at least one of textual data or image data from a collection of data displayed by a computing device is received from a user. At least one other subset of data selected from the collection of data is received as contextual information that is related to and different from the user query. Data files such as image files are retrieved and ranked based on the user query to provide a pre-ranked set of data files. The pre-ranked data files are then ranked based on the contextual information to provide a re-ranked set of data files to be displayed to the user.

    摘要翻译: 描述使用与用户查询相关的上下文信息进行图像搜索的技术。 从用户接收包括来自计算设备显示的数据集合的文本数据或图像数据中的至少一个的用户查询。 作为与用户查询相关并且不同于用户查询的上下文信息,接收到从数据收集中选出的至少一个其他数据子集。 基于用户查询来检索和排序诸如图像文件的数据文件,以提供预先排列的数据文件集合。 然后基于上下文信息对预先排序的数据文件进行排名,以提供要向用户显示的重新排列的数据文件集合。

    CONCEPT-STRUCTURED IMAGE SEARCH
    7.
    发明申请
    CONCEPT-STRUCTURED IMAGE SEARCH 有权
    概念结构图像搜索

    公开(公告)号:US20110072048A1

    公开(公告)日:2011-03-24

    申请号:US12565313

    申请日:2009-09-23

    IPC分类号: G06F17/30

    CPC分类号: G06F17/3053 G06F17/30265

    摘要: The concept-structured image search technique described herein pertains to a technique for enabling a user to indicate their semantic intention and then retrieve and rank images from a database or other image set according to this intention. The concept-structured image search technique described herein includes a new interface for image search. With this interface, a user can freely type several key textual words in arbitrary positions on a blank image, and also describe a region for each keyword that indicates its influence scope, which is called concept structure herein. The concept-structured image search technique will return and rank images that are in accordance with the concept structure indicated by the user. One embodiment of the technique can be used to create a synthesized image without actually using the synthesized image to perform a search of an image set.

    摘要翻译: 本文描述的概念结构图像搜索技术涉及一种使用户能够指示其语义意图,然后根据该意图从数据库或其他图像集中检索和排列图像的技术。 本文描述的概念结构图像搜索技术包括用于图像搜索的新界面。 通过该接口,用户可以在空白图像上任意位置自由地键入几个关键文本字,并且描述指示其影响范围的每个关键字的区域,这在本文中被称为概念结构。 概念结构图像搜索技术将返回并对与用户指示的概念结构相一致的图像进行排序。 该技术的一个实施例可以用于创建合成图像而不实际使用合成图像来执行图像集的搜索。

    Computing visual and textual summaries for tagged image collections
    8.
    发明授权
    Computing visual and textual summaries for tagged image collections 有权
    为标记的图像集合计算视觉和文本摘要

    公开(公告)号:US09092673B2

    公开(公告)日:2015-07-28

    申请号:US12436783

    申请日:2009-05-07

    IPC分类号: G06K9/62 G06K9/00 G06F17/30

    摘要: Described is a technology for computing visual and textual summaries for tagged image collections. Heterogeneous affinity propagation is used to together identify both visual and textual exemplars. The heterogeneous affinity propagation finds the exemplars for relational heterogeneous data (e.g., images and words) by considering the relationships (e.g., similarities) within pairs of images, pairs of words, and relationships of words to images (affinity) in an integrated manner.

    摘要翻译: 描述了一种用于计算标记图像集合的视觉和文本摘要的技术。 非均匀亲和度传播用于一起识别视觉和文本样本。 通过考虑图像成对,单词之间的关系(例如,相似度)和单词与图像的关系(亲和性)以集成的方式,异构亲和度传播找到关系异构数据(例如,图像和单词)的示例。

    Document-related representative information
    9.
    发明授权
    Document-related representative information 有权
    文件相关的代表信息

    公开(公告)号:US08712991B2

    公开(公告)日:2014-04-29

    申请号:US13178034

    申请日:2011-07-07

    IPC分类号: G06F17/30

    CPC分类号: G06F17/3064

    摘要: Some implementations include techniques and arrangements to provide document-related representative information with search results. For example, a representative query and/or representative results may be provided for one or more individual documents identified in a set of search results to supplement the search results returned in response to a received search query. The representative queries may be determined by correlating a plurality of previously submitted queries in search log data with a plurality of documents returned in response to the queries. In some implementations, click-through frequency for a particular document with respect to the plurality of queries may be taken into consideration when determining the representative queries for the particular document. In some implementations, the representative queries serve to categorize the search results based on subject matter, and a link may be provided to representative results corresponding to the representative query for accessing documents directed to similar subject matter.

    摘要翻译: 一些实现包括用于向搜索结果提供与文档相关的代表性信息的技术和布置。 例如,可以为在一组搜索结果中标识的一个或多个单独文档提供代表性查询和/或代表性结果,以补充响应于所接收的搜索查询返回的搜索结果。 可以通过将搜索日志数据中的多个先前提交的查询与响应于查询返回的多个文档相关联来确定代表性查询。 在一些实现中,当确定特定文档的代表性查询时,可以考虑针对多个查询的特定文档的点击频率。 在一些实现中,代表性查询用于基于主题对搜索结果进行分类,并且可以向链接提供对应于代表性查询的代表性结果,用于访问针对相似主题的文档。

    Optimized KD-tree for scalable search
    10.
    发明授权
    Optimized KD-tree for scalable search 有权
    用于可扩展搜索的优化KD树

    公开(公告)号:US08645380B2

    公开(公告)日:2014-02-04

    申请号:US12940880

    申请日:2010-11-05

    IPC分类号: G06F17/30

    CPC分类号: G06F17/3028 G06F17/30333

    摘要: Techniques for constructing an optimized kd-tree are described. In an implementation, an optimized kd-tree process receives input of a set of data points applicable for large-scale computer vision applications. The process divides the set of the data points into subsets of data points with nodes while generating hyperplanes (e.g., coordinate axes). The process identifies a partition axis for each node based on the coordinate axes combined in a binary way. The optimized kd-tree process creates an optimized kd-tree that organizes the data points based on the identified partition axis. The organization of the data points in the optimized kd-tree provides efficient indexing and searching for a nearest neighbor.

    摘要翻译: 描述了构建优化的kd-tree的技术。 在一个实现中,优化的kd-tree过程接收适用于大规模计算机视觉应用的一组数据点的输入。 该过程在产生超平面(例如,坐标轴)的同时将数据点的集合划分成具有节点的数据点的子集。 该过程基于以二进制方式组合的坐标轴来识别每个节点的分区轴。 优化的kd-tree过程创建一个优化的kd-tree,它根据识别的分区轴组织数据点。 优化的kd-tree中数据点的组织为最近邻居提供了有效的索引和搜索。