-
公开(公告)号：US06298351B1
公开(公告)日：2001-10-02
申请号：US08840214
申请日：1997-04-11
IPC分类号： G06F1730
CPC分类号： G06K9/0063 , G06K9/6256 , G06K9/6271 , Y10S707/99943
摘要： An unreliable training set is modified to provide for a reliable training set to be used in supervised classification. The training set is modified by determining which data of the set are incorrect and reconstructing those incorrect data. The reconstruction includes modifying the labels associated with the data to provide for correct labels. The modification can be performed iteratively.
摘要翻译： 修改不可靠的训练集以提供可在监督分类中使用的可靠训练集。 通过确定该组的哪些数据不正确并重建这些不正确的数据来修改训练集。 重建包括修改与数据相关联的标签，以提供正确的标签。 可以迭代地进行修改。
-
2.发明授权Progressive content-based retrieval of image and video with adaptive and iterative refinement 失效基于内容的基于内容的图像和视频检索，具有自适应和迭代细化
公开(公告)号：US5734893A
公开(公告)日：1998-03-31
申请号：US535500
申请日：1995-09-28
IPC分类号： G06F17/30
CPC分类号： G06F17/30477 , G06F17/30247 , G06F17/30536 , Y10S707/968 , Y10S707/99934 , Y10S707/99935
摘要： A method and apparatus for minimizing the time required to obtain results for a content based query in a data base. More specifically, with this invention, the data base is partitioned into a plurality of groups. Then, a schedule or sequence of groups is assigned to each of the operations of the query, where the schedule represents the order in which an operation of the query will be applied to the groups in the schedule. Each schedule is arranged so that each application of the operation operates on the group which will yield intermediate results that are closest to final results.
摘要翻译： 一种用于最小化在数据库中获得基于内容的查询的结果所需的时间的方法和装置。 更具体地说，利用本发明，数据库被分成多个组。 然后，将分组的一个或多个序列分配给查询的每个操作，其中该调度表示该查询的操作将被应用于该调度中的组的顺序。 安排每个时间表，使得操作的每个应用操作在将产生最接近最终结果的中间结果的组上。
-
3.发明授权公开(公告)号：US06408300B1
公开(公告)日：2002-06-18
申请号：US09360366
申请日：1999-07-23
申请人： Lawrence David Bergman , Vittorio Castelli , Yuan-Chi Chang , Chung-Sheng Li , John Richard Smith
发明人： Lawrence David Bergman , Vittorio Castelli , Yuan-Chi Chang , Chung-Sheng Li , John Richard Smith
IPC分类号： G06F1730
CPC分类号： G06F17/30333 , Y10S707/99934 , Y10S707/99942 , Y10S707/99945 , Y10S707/99948
摘要： Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards. At least one record per layer will satisfy the query criterion and the number of layers needed to be searched depends on the spatial distribution of records, the query-issued linear coefficients, and N, the number of records to be returned. When N is small compared to the total size of the database, answering the query typically requires searching only a small fraction of all relevant records, resulting in a tremendous speedup as compared to linearly scanning the entire dataset.
摘要翻译： 通常在各种决策支持和资源规划应用中出现的线性优化查询是检索满足特定优化标准的前N个数据记录（其中N是大于零的整数）的查询。 优化标准是最大化或最小化线性方程。 查询时给出线性方程的系数。 公开了用于构建，维护和利用数据库记录的多维索引结构以提高线性优化查询的执行速度的方法和装置。 具有数值属性的数据库记录被分为多个层，每个层表示一个称为凸包的几何结构。 通过从该多层索引结构的最外层向内搜索来处理这样的线性优化查询。 每层至少一个记录将满足查询条件，需要搜索的层数取决于记录的空间分布，查询发出的线性系数，N，要返回的记录数。 当N与数据库的总大小相比较小时，回答查询通常只需要搜索所有相关记录的一小部分，与线性扫描整个数据集相比，导致了巨大的加速。
-
4.发明授权
公开(公告)号：US5978788A
公开(公告)日：1999-11-02
申请号：US843290
申请日：1997-04-14
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30489 , G06F17/30536 , G06F2216/03 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943 , Y10S707/99945
摘要： An apparatus and method for approximating the data stored in a databases by generating multiple projections and representations from the database such that the OLAP queries for the original database (such as aggregation and histogram operations) may be applied to the approximated version of the database, which can be much smaller than the original databases. Other aspects optimize a mapping, via a mapping (or dimension) table, of non-numeric or numeric attributes to other numeric attributes such that the error incurred on applying queries to the approximated version of the database is minimized. Still further aspects define boundaries of approximations so that the boundaries are preserved when approximated versions of the databases are generated.
摘要翻译： 一种用于通过从数据库生成多个投影和表示来近似存储在数据库中的数据的装置和方法，使得对原始数据库的OLAP查询（诸如聚合和直方图操作）可以应用于数据库的近似版本， 可以比原始数据库小得多。 其他方面通过映射（或维度）表将非数字或数字属性的映射优化为其他数字属性，从而将对数据库近似版本的查询应用所产生的错误最小化。 另外的方面定义了近似的边界，使得当生成数据库的近似版本时边界被保留。
-
5.发明授权Methods and apparatus for extraction and tracking of objects from multi-dimensional sequence data 失效从多维序列数据中提取和跟踪对象的方法和装置公开(公告)号：US07373359B2
公开(公告)日：2008-05-13
申请号：US11034288
申请日：2005-01-12
CPC分类号： G06K9/32 , G06T7/20 , Y10S707/915 , Y10S707/99933 , Y10S707/99943
摘要： An object tracking technique is provided which, given: (i) a potentially large data set; (ii) a set of dimensions along which the data has been ordered; and (iii) a set of functions for measuring the similarity between data elements, a set of objects are produced. Each of these objects is defined by a list of data elements. Each of the data elements on this list contains the probability that the data element is part of the object. The method produces these lists via an adaptive, knowledge-based search function which directs the search for high-probability data elements. This serves to reduce the number of data element combinations evaluated while preserving the most flexibility in defining the associations of data elements which comprise an object.
摘要翻译： 提供了一种对象跟踪技术，其给出：（i）潜在的大数据集; （ii）已订购数据的一组尺寸; 和（iii）用于测量数据元素之间的相似性的一组函数，产生一组对象。 这些对象中的每一个由数据元素的列表定义。 该列表中的每个数据元素都包含数据元素是对象一部分的概率。 该方法通过自适应的基于知识的搜索功能产生这些列表，其引导搜索高概率数据元素。 这用于减少评估的数据元素组合的数量，同时在定义包括对象的数据元素的关联方面保持最大的灵活性。
-
6.发明授权Methods and apparatus for indexing in a database and for retrieving data from a database in accordance with queries using example sets 失效用于在数据库中建立索引并根据使用示例集的查询从数据库检索数据的方法和装置公开(公告)号：US07266545B2
公开(公告)日：2007-09-04
申请号：US09923530
申请日：2001-08-07
IPC分类号： G06F17/30
CPC分类号： G06F17/30274 , G06F17/30277 , Y10S707/99933 , Y10S707/99945
摘要： A computer-based technique is provided for retrieving one or more items from a database in response to a query specified by a user via one or more example sets. Preferably the example sets include multiple positive and negative example sets. The method comprises the following steps. First, a scoring function is constructed from the one or more example sets. The scoring function gives higher scores to database items that are more closely related to the query than to database items that are not as closely related to the query. The scoring function is operable for use with a multidimensional indexing structure associated with the database. Then, the one or more database items that have the highest score as computed using the scoring function are retrieved via the multidimensional indexing structure.
摘要翻译： 提供基于计算机的技术来响应于用户经由一个或多个示例集指定的查询来从数据库检索一个或多个项目。 优选地，示例集合包括多个正和负示例集合。 该方法包括以下步骤。 首先，从一个或多个示例集合构建评分函数。 评分函数给出与查询更密切相关的数据库项的分数高于与查询无关的数据库项。 评分功能可用于与数据库相关联的多维索引结构。 然后，通过多维索引结构检索具有使用评分函数计算得分最高的一个或多个数据库项。
-
公开(公告)号：US5940825A
公开(公告)日：1999-08-17
申请号：US726889
申请日：1996-10-04
CPC分类号： G01V1/288 , Y10S707/99932 , Y10S707/99933 , Y10S707/99936 , Y10S707/99937
摘要： A computer system and method for performing similarity searches which is phase and scale insensitive and which allows similarity searches to be performed at a semantic level. Each sequence in a database is preferably segmented at multiple projections and/or resolution levels. The sequences may represent object having multi-dimensional features such as temporal and/or spatial-temporal data. Preferably, the segmenting logic starts with the finest resolution, and each sequence is parsed into a number of disjointed segments, wherein each segment has uniform features. The uniform features could be segments having a constant slope, or waveform segments representable by a single function. The segments may then be re-sampled into a fixed length vector with appropriate normalization. A label may also be assigned to each segment via conventional clustering/classification methods. The above steps are iterated at successive projections and/or resolution levels until each sequence in the database has been independently segmented and clustered. Thus, the labels are preferably extracted in a pseudo-hierarchical manner in which the label of the lowest resolution representation of the sequence is extracted first. The representation of each time series at various resolutions and/or projections captures different characteristics of the same time series (or 2D/3D objects). Recall that each segment represents a region having uniform features. The segmentation at each individual resolution and/or projection thus enables recognition or emphasis of different characteristics within segments having uniform features.
摘要翻译： 一种用于执行相位和尺度不敏感并且允许在语义级别执行相似性搜索的相似性搜索的计算机系统和方法。 数据库中的每个序列优选地以多个投影和/或分辨率级别分段。 序列可以表示具有多维特征的对象，诸如时间和/或空间 - 时间数据。 优选地，分割逻辑以最好的分辨率开始，并且每个序列被解析成多个不相交的段，其中每个段具有均匀的特征。 均匀特征可以是具有恒定斜率的段或由单个函数表示的波形段。 然后可以将段重新采样到具有适当归一化的固定长度向量中。 也可以通过常规聚类/分类方法将标签分配给每个片段。 上述步骤在连续的投影和/或分辨率级别迭代，直到数据库中的每个序列已被独立地分段和聚类。 因此，优选地以伪分级方式提取标签，其中首先提取序列的最低分辨率表示的标签。 每个时间序列在各种分辨率和/或投影下的表示可以捕获相同时间序列（或2D / 3D对象）的不同特征。 回想一下，每个片段表示具有均匀特征的区域。 因此，在每个单独的分辨率和/或投影下的分割使得能够识别或强调具有统一特征的段内的不同特征。
-
8.发明申请公开(公告)号：US20050138023A1
公开(公告)日：2005-06-23
申请号：US11034288
申请日：2005-01-12
CPC分类号： G06K9/32 , G06T7/20 , Y10S707/915 , Y10S707/99933 , Y10S707/99943
摘要： An object tracking technique is provided which, given: (i) a potentially large data set; (ii) a set of dimensions along which the data has been ordered; and (iii) a set of functions for measuring the similarity between data elements, a set of objects are produced. Each of these objects is defined by a list of data elements. Each of the data elements on this list contains the probability that the data element is part of the object. The method produces these lists via an adaptive, knowledge-based search function which directs the search for high-probability data elements. This serves to reduce the number of data element combinations evaluated while preserving the most flexibility in defining the associations of data elements which comprise an object.
-
公开(公告)号：US06529916B2
公开(公告)日：2003-03-04
申请号：US10047129
申请日：2002-01-15
申请人： Lawrence David Bergman , Vittorio Castelli , Yuan-Chi Chang , Chung-Sheng Li , John Richard Smith
发明人： Lawrence David Bergman , Vittorio Castelli , Yuan-Chi Chang , Chung-Sheng Li , John Richard Smith
IPC分类号： G06F1730
CPC分类号： G06F17/30333 , Y10S707/99934 , Y10S707/99942 , Y10S707/99945 , Y10S707/99948
摘要： Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards. At least one record per layer will satisfy the query criterion and the number of layers needed to be searched depends on the spatial distribution of records, the query-issued linear coefficients, and N, the number of records to be returned. When N is small compared to the total size of the database, answering the query typically requires searching only a small fraction of all relevant records, resulting in a tremendous speedup as compared to linearly scanning the entire dataset.
-
10.发明授权System and method for sequential processing for content-based retrieval of composite objects 有权用于基于内容的复合对象检索的顺序处理的系统和方法公开(公告)号：US06446060B1
公开(公告)日：2002-09-03
申请号：US09237734
申请日：1999-01-26
IPC分类号： G06F1730
CPC分类号： G06F17/30262 , G06F17/3025 , G06F17/30259 , G06F17/30265 , Y10S707/915 , Y10S707/956 , Y10S707/99933 , Y10S707/99945
摘要： Similarity measure has been one of the critical issues for successful content-based retrieval. Simple quadratic forms of distance is inadequate as it does not necessary correspond to perceived similarity nor is it adaptive to different applications. This patent application describes a new sequential query processing algorith for evaluating content-based composite object queries. The composite objects consist of spatial and temporal arrangements of simple objects. The simple objects are defined in terms of spatial, temporal, feature and semantic attributes. The query method defines a process for executing a best-first search for the matches to the query, while providing a flexible framework for broadening the search space as required. The query method guarantees that there are no false dismissals of the candidate composite objects.
摘要翻译： 相似性度量一直是成功基于内容检索的关键问题之一。 距离的简单二次形式是不充分的，因为它不需要对应于感知的相似性，也不适用于不同的应用。 该专利申请描述了用于评估基于内容的复合对象查询的新的顺序查询处理算法。 复合对象由简单对象的空间和时间排列组成。 简单的对象是根据空间，时间，特征和语义属性来定义的。 查询方法定义了一种用于执行对查询的匹配的最佳搜索的过程，同时提供了一种灵活的框架，用于根据需要扩展搜索空间。 查询方法保证对候选复合对象没有虚假的解雇。
-
-
-
-
-
-
-
-
-
搜索结果
88 条记录 (耗时 0.027 秒)