-
公开(公告)号:US09472004B2
公开(公告)日:2016-10-18
申请号:US14851617
申请日:2015-09-11
Applicant: Google Inc.
Inventor: Guanfeng Li , Faen Zhang , Feng Wang
CPC classification number: G06T11/40 , G01C21/206 , H04W4/043
Abstract: A method and system for providing an indoor map representation are provided herein. Aspects of this disclosure provide a representation of an indoor map environment whereby navigable areas are represented by a series of convex polygons in adjacency relationships with one another. Image analysis may be performed on a floor plan image to identify navigable areas and to determine the boundaries of the polygons, such as by assigning one or more colors to navigable space and one or more colors to non-navigable space. Route-finding operations may be performed using the adjacency relationships to find a path from a source area to a destination area.
-
公开(公告)号:US20150100605A1
公开(公告)日:2015-04-09
申请号:US14186312
申请日:2014-02-21
Applicant: GOOGLE INC.
Inventor: Keith Golden , Amit Behal , Ben Hutchinson , Alexander Oliver Marks , Faen Zhang , Jason K. Macnak
IPC: G06F17/30
CPC classification number: G06F16/9024
Abstract: An efficient system for evaluating collection membership in a large data graph. The system includes a data graph of nodes connected by edges and an index of constraints from collection definitions, a definition specifying at least one condition with at least one constraint, where a constraint has a constraint type and a constraint expression. Multiple conditions in the definition may be conjunctive. The system may also include instructions that, when executed by the at least one processor, cause the system to: evaluate an edge for a node in the data graph against the index to determine conditions met by the edge and its associated neighborhood, repeat the evaluating for each edge associated with the node in the data graph, determine that conditions for a first collection are met, and generate an indication in the data graph that the node is a member of the first collection.
Abstract translation: 一种用于评估大型数据图表中的收集成员资格的高效系统。 该系统包括通过边缘连接的节点和来自集合定义的约束索引的数据图,指定具有至少一个约束的至少一个条件的定义,其中约束具有约束类型和约束表达式。 定义中的多个条件可能是连接的。 该系统还可以包括指令,当由至少一个处理器执行时,系统使得:根据该索引来评估数据图中的节点的边缘,以确定边缘及其相关邻域满足的条件,重复评估 对于与数据图中的节点相关联的每个边缘,确定满足第一集合的条件,并且在数据图中生成节点是第一集合的成员的指示。
-
公开(公告)号:US20160055661A1
公开(公告)日:2016-02-25
申请号:US14851617
申请日:2015-09-11
Applicant: Google Inc.
Inventor: Guanfeng Li , Faen Zhang , Feng Wang
CPC classification number: G06T11/40 , G01C21/206 , H04W4/043
Abstract: A method and system for providing an indoor map representation are provided herein. Aspects of this disclosure provide a representation of an indoor map environment whereby navigable areas are represented by a series of convex polygons in adjacency relationships with one another. Image analysis may be performed on a floor plan image to identify navigable areas and to determine the boundaries of the polygons, such as by assigning one or more colors to navigable space and one or more colors to non-navigable space. Route-finding operations may be performed using the adjacency relationships to find a path from a source area to a destination area.
Abstract translation: 本文提供了一种用于提供室内地图表示的方法和系统。 本公开的方面提供室内地图环境的表示,其中可导航区域由彼此相邻关系中的一系列凸多边形表示。 可以在平面图像上执行图像分析以识别可导航区域并且确定多边形的边界,例如通过将一个或多个颜色分配给可导航空间和一个或多个颜色到不可导航空间。 可以使用邻接关系来执行路线寻找操作,以找到从源区域到目的地区域的路径。
-
公开(公告)号:US09454599B2
公开(公告)日:2016-09-27
申请号:US14186320
申请日:2014-02-21
Applicant: GOOGLE INC.
Inventor: Keith Golden , Ben Hutchinson , Amit Behal , Alexander Oliver Marks , Faen Zhang , Yuan Gao , Fei Wu
IPC: G06F17/30
CPC classification number: G06F17/30651 , G06F17/30958 , G06N5/02
Abstract: A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.
Abstract translation: 用于自动生成实体集合的系统包括包括通过边缘连接的实体的数据图和指令,其使得计算机系统从数据图确定一组实体,并且确定具有约束量的一组约束。 集合中的约束表示由该组实体中的至少两个实体共享的数据图中的路径。 指令还使得计算机系统从约束的组合中生成候选集合定义,其中每个候选集合定义识别至少一个约束并且不超过约束的数量。 所述指令还使得所述计算机系统确定所述候选集合定义中的至少一些的信息增益,并将具有满足阈值的信息增益的至少一个候选集合定义存储为候选集合。
-
公开(公告)号:US20150100568A1
公开(公告)日:2015-04-09
申请号:US14186320
申请日:2014-02-21
Applicant: GOOGLE INC.
Inventor: Keith Golden , Ben Hutchinson , Amit Behal , Alexander Oliver Marks , Faen Zhang , Yuan Gao , Fei Wu
IPC: G06F17/30
CPC classification number: G06F17/30651 , G06F17/30958 , G06N5/02
Abstract: A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.
Abstract translation: 用于自动生成实体集合的系统包括包括通过边缘连接的实体的数据图和指令,其使得计算机系统从数据图确定一组实体,并且确定具有约束量的一组约束。 集合中的约束表示由该组实体中的至少两个实体共享的数据图中的路径。 指令还使得计算机系统从约束的组合中生成候选集合定义,其中每个候选集合定义识别至少一个约束并且不超过约束的数量。 所述指令还使得所述计算机系统确定所述候选集合定义中的至少一些的信息增益,并将具有满足阈值的信息增益的至少一个候选集合定义存储为候选集合。
-
-
-
-