利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

14 条记录 (耗时 0.015 秒)

    Robust Adaptive Data Clustering in Evolving Environments
    1.
    发明申请
    Robust Adaptive Data Clustering in Evolving Environments 审中-公开
    强大的适应性数据聚类在演进环境中

    公开(公告)号：US20140067811A1

    公开(公告)日：2014-03-06

    申请号：US14074398

    申请日：2013-11-07

    申请人： Marlin L. Gendron

    发明人： Roger W. Meredith ,  Bryan L. Mensi

    IPC分类号： G06F17/30

    CPC分类号： G06F16/35 ,  G06F16/287 ,  G06K9/6219

    摘要： A computer-implemented method for automated data clustering and analysis. A computer takes a database having multiple entries and transforms the entries in the database into a set of intrinsic attributes for each entry. The computer then receives data defining one or more clustering trials to be run on the attributes from the entries in the database, each clustering trial being defined by a set of relevant intrinsic and extrinsic attributes. The computer automatically identifies the most significant intrinsic and/or extrinsic attributes of the entries being clustered for each clustering trial, and runs a clustering script to cluster the attributes in accordance with the significant attributes. The computer forms hierarchical linkages of the profiles and automatically calculates the cophenetic correlation coefficient for the linkages in each clustering trial. The invention then automatically calculates linkage threshold values for the linkages in each trial, creates cluster groups based on the threshold values, and outputs dendrograms and maps showing the results.

    摘要翻译： 一种用于自动数据聚类和分析的计算机实现的方法。 计算机接收具有多个条目的数据库，并将数据库中的条目转换为每个条目的一组内在属性。 然后，计算机接收定义要从数据库中的条目运行的一个或多个聚类试验的数据，每个聚类试验由一组相关的内在和外在属性定义。 计算机自动识别针对每个聚类试验聚集的条目的最重要的固有和/或外在属性，并且运行聚类脚本以根据重要属性对属性进行聚类。 计算机形成配置文件的分层连接，并自动计算每个聚类试验中联系的协同相关系数。 然后，本发明自动计算每个试验中的联动的链接阈值，基于阈值创建聚类组，并输出显示结果的树状图和地图。

    System and method for smoothing and compression of polyline data
    4.
    发明授权
    System and method for smoothing and compression of polyline data 失效
    折线数据的平滑和压缩的系统和方法

    公开(公告)号：US07382370B2

    公开(公告)日：2008-06-03

    申请号：US11177651

    申请日：2005-07-07

    申请人： Geary J. Layne ,  Marlin L. Gendron ,  Maura C. Lohrenz

    发明人： Geary J. Layne ,  Marlin L. Gendron ,  Maura C. Lohrenz

    IPC分类号： G06T17/00

    CPC分类号： G06T11/203 ,  G06T9/20

    摘要： A computer-implemented process for smoothing and compression of data having an ordered list of points including a first point, a second point and a third point, each of the points being on the perimeter of a polygon. The method includes determining whether the triangle defined by line segments joining the first, second, and third points has a point of significance in its interior; and if no point of significance is present in the region, removing the second point of the ordered list of points.

    摘要翻译： 一种用于平滑和压缩具有包括第一点，第二点和第三点的点的有序列表的数据的计算机实现的过程，每个点在多边形的周边上。 该方法包括确定由连接第一，第二和第三点的线段确定的三角形是否在其内部具有重要意义; 如果该区域没有重要意义，则删除有序列表中的第二点。

    System, method and apparatus for clustering features
    8.
    发明授权
    System, method and apparatus for clustering features 失效
    用于聚类特征的系统，方法和装置

    公开(公告)号：US07567714B2

    公开(公告)日：2009-07-28

    申请号：US10997091

    申请日：2004-11-23

    申请人： Marlin L. Gendron ,  Geary J. Layne ,  Maura C. Lohrenz

    发明人： Marlin L. Gendron ,  Geary J. Layne ,  Maura C. Lohrenz

    IPC分类号： G06K9/62 ,  G06K9/48 ,  G06K9/40 ,  G06K9/46 ,  G06K9/66

    CPC分类号： G06K9/6218

    摘要： A method, system, computer-readable medium, and apparatus for identifying a boundary of a cluster in a bitmap, the bitmap having at least one initially set bit, for applying an expansion shape to each of the initially set bits in the bitmap and identifying vertex bits on the boundary of the cluster formed by at least one expansion shape. A method system, computer-readable medium, and apparatus for identifying vertex bits in a bitmap having at least two adjacent bits with non-zero values forming a boundary of a cluster, the interior bits of the cluster having a zero value, including starting from a current non-zero bit, evaluating at least a first adjacent bit and a second adjacent bit, setting an adjacent non-zero bit as the new current bit, and identifying the current bit as a vertex bit if a direction of motion from the current bit to the new current bit changes.

    摘要翻译： 一种用于识别位图中的聚类边界的方法，系统，计算机可读介质和装置，所述位图具有至少一个初始设置的位，用于将扩展形状应用于位图中的每个初始设置的位，并且识别 通过至少一个扩展形状形成的簇的边界上的顶点比特。 一种用于识别位图中的顶点比特的方法系统，计算机可读介质和装置，所述位图具有至少两个具有非零值的相邻比特，所述相邻比特具有簇的边界，所述簇的内部比特具有零值，包括从 当前非零位，评估至少第一相邻位和第二相邻位，将邻近的非零位设置为新的当前位，并将当前位识别为顶点位，如果来自电流的运动方向 位到新的当前位改变。

    Moving map composer (MMC)
    10.
    发明授权
    Moving map composer (MMC) 失效
    移动地图作曲家（MMC）

    公开(公告)号：US06218965B1

    公开(公告)日：2001-04-17

    申请号：US09126386

    申请日：1998-07-30

    申请人： Marlin L. Gendron ,  Perry B. Wischow ,  Michael E. Trenchard ,  Maura C. Lohrenz ,  Lancelot M. Riedlinger ,  J. Michelle Mehaffey

    发明人： Marlin L. Gendron ,  Perry B. Wischow ,  Michael E. Trenchard ,  Maura C. Lohrenz ,  Lancelot M. Riedlinger ,  J. Michelle Mehaffey

    IPC分类号： G06F16500

    CPC分类号： G06T17/05

    摘要： The moving map composer (MMC) is a device that allows a user to manipulate different sources of map data into a single map for presentation on a display. The MMC has an ability to extract a predetermined area of map coverage defined by sets of latitude and longitude points, or non-orthogonal areas of map coverage, the smallest of which is a segment. A bitmap is a representation of an available map coverage for a given area selected by a user having a “set”, or “1” bit to indicate a segment is present, and a “clear”, or “0” bit to indicate a segment is missing. The size of the bitmap is determined dynamically to assure a two-bit buffer zone of clear bits around a polygon's maximum extent. If the user selected polygon crosses one or more maps, the polygon is subdivided into several new polygons. Once the total map coverage desired has been defined, what available map sources are determined and the resulting subset is displayed, if the resulting coverage is acceptable, the user may transfer the data to the display.

    摘要翻译： 移动地图构图器（MMC）是允许用户将不同的地图数据源操纵到单个地图中以在显示器上呈现的设备。 MMC具有提取由纬度和经度点集合定义的地图覆盖区域的预定区域的能力，或者地图覆盖区域的最小区域的非正交区域。 位图是由具有“set”或“1”位的用户选择的给定区域的可用地图覆盖的表示，以指示段存在，以及“清除”或“0”位以指示 段缺失。 动态地确定位图的大小，以确保围绕多边形最大范围的清除位的两位缓冲区。 如果用户选择的多边形与一个或多个地图交叉，则多边形被细分为几个新的多边形。 一旦定义了所需的总地图覆盖率，确定可用的地图源，并且显示所得到的子集，如果所得到的覆盖可接受，则用户可以将数据传送到显示器。