公开(公告)号：US20180174276A1

公开(公告)日：2018-06-21

申请号：US15841837

申请日：2017-12-14

Applicant: DASSAULT SYSTEMES

Inventor： Fabrice Francis Michel ,  Ismael Belghiti

IPC: G06T5/00 ,  G06K9/62

CPC classification number: G06T5/005 ,  G06K9/6223 ,  G06T5/50 ,  G06T2207/10016 ,  G06T2207/20016 ,  G06T2207/20072

Abstract: The invention notably relates to a computer-implemented method for completing an image having at least one hole, the method comprising providing a dictionary of atoms representative of the known part of the image; determining an optimal distribution of atom linear combinations with a process comprising at least one minimization of a respective energy defined on a respective Markov Random Field having nodes and labels, each node corresponding to a respective location of the hole and being associated to a respective label; and filling the hole with the optimal distribution. The invention improves the field of image completion.

公开(公告)号：US10083220B2

公开(公告)日：2018-09-25

申请号：US14980168

申请日：2015-12-28

Applicant: DASSAULT SYSTEMES

Inventor： Ismael Belghiti

IPC: G06F7/02 ,  G06F17/30 ,  G06N99/00 ,  G06F17/16 ,  G06K9/62

CPC classification number: G06F16/285 ,  G06F16/2228 ,  G06F16/24578 ,  G06F17/16 ,  G06K9/6223 ,  G06N20/00

Abstract: The invention notably relates to a computer-implemented method of designing a choropleth map, wherein the method comprises providing a map, and a number (n) of numerical values (x1, . . . , xn) that represent a statistical variable at respective areas of the map; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; assigning a respective coloration to each cluster of the computed clustering; and at all areas of the map at which a respective numerical value is provided, applying the coloration assigned to the cluster to which the respective numerical value belongs.Such a method improves the design of a choropleth map.

公开(公告)号：US10191967B2

公开(公告)日：2019-01-29

申请号：US14979077

申请日：2015-12-22

Applicant: DASSAULT SYSTEMES

Inventor： Ismael Belghiti

IPC: G06F17/30 ,  G06K9/62

Abstract: The invention notably relates to a computer-implemented method of clustering reference queries in a database for prediction of the runtime of a target query in the database based on similarity of the target query with the reference queries. The method comprises providing a number of numerical values that represent the runtimes of the reference queries; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; and clustering the reference queries according to the computed clustering of the numerical values.Such a method improves the field of database query runtime prediction.

公开(公告)号：US20160188697A1

公开(公告)日：2016-06-30

申请号：US14980168

申请日：2015-12-28

Applicant: DASSAULT SYSTEMES

Inventor： Ismael Belghiti

IPC: G06F17/30 ,  G06F17/16 ,  G06N99/00

CPC classification number: G06F17/30598 ,  G06F17/16 ,  G06F17/30321 ,  G06F17/3053 ,  G06K9/6223 ,  G06N99/005

Abstract: The invention notably relates to a computer-implemented method of designing a choropleth map, wherein the method comprises providing a map, and a number (n) of numerical values (x1, . . . , xn) that represent a statistical variable at respective areas of the map; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; assigning a respective coloration to each cluster of the computed clustering; and at all areas of the map at which a respective numerical value is provided, applying the coloration assigned to the cluster to which the respective numerical value belongs.Such a method improves the design of a choropleth map.

Abstract translation: 本发明特别涉及一种计算机实现的方法，其中所述方法包括提供地图，以及数字（n）的数值（x1，...，xn），其表示各个区域的统计变量 的地图; 计算预定数量的簇的数值的最优K均值聚类，其中所述计算包括迭代与所述预定数量的簇对应的次数，将线性时间行最小值搜索算法应用于 订单数量等于数值; 为所计算的聚类的每个聚类分配相应的着色; 并且在提供相应数值的地图的所有区域中，应用分配给相应数值所属的簇的着色。 这种方法改进了choropleth图的设计。

公开(公告)号：US20160188696A1

公开(公告)日：2016-06-30

申请号：US14979077

申请日：2015-12-22

Applicant: DASSAULT SYSTEMES

Inventor： Ismael Belghiti

IPC: G06F17/30

CPC classification number: G06F17/30598 ,  G06F17/30336 ,  G06F17/30463 ,  G06F17/30469 ,  G06K9/6223

Abstract: The invention notably relates to a computer-implemented method of clustering reference queries in a database for prediction of the runtime of a target query in the database based on similarity of the target query with the reference queries. The method comprises providing a number of numerical values that represent the runtimes of the reference queries; computing the optimal K-means clustering of the numerical values for a predetermined number of clusters, wherein the computing includes iterating, a number of times corresponding to the predetermined number of clusters, a linear-time Row Minima Searching algorithm applied to a square matrix of order equal to the number of numerical values; and clustering the reference queries according to the computed clustering of the numerical values.Such a method improves the field of database query runtime prediction.

Abstract translation: 本发明特别涉及一种计算机实现的在数据库中聚类参考查询的方法，用于基于目标查询与参考查询的相似度来预测数据库中目标查询的运行时间。 该方法包括提供表示参考查询的运行时间的多个数值; 计算预定数量的簇的数值的最优K均值聚类，其中所述计算包括对与预定数量的簇对应的次数进行迭代，应用于矩阵的方阵的线性时间行最小搜索算法 订单数量等于数值; 并根据计算的数值聚类对参考查询进行聚类。 这种方法改进了数据库查询运行时预测的领域。