专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2022194674A1 GENERATING THREE-DIMENSIONAL DATA MODELS OF TWO-DIMENSIONAL FLOOR PLANS 审中-公开
公开(公告)号：WO2022194674A1
公开(公告)日：2022-09-22
申请号：PCT/EP2022/056223
申请日：2022-03-10
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
发明人： PENA-RIOS, Anasol , CONWAY, Anthony , OWUSU, Gilbert , LEON GARZA, Hugo , HAGRAS, Hani
IPC分类号： G06T7/00 , G06T17/00
摘要： A computer implemented method to generate a three-dimensional (3D) data model of a two-dimensional (2D) floor plan, the floor plan being constituted as a digital image including indications of types of building elements, the method comprising: training a classifier to classify each pixel in each of a plurality of portions of the floor plan to a type of building element, the classifier being defined based on a training set of 2D floor plan images by extracting features for each of a plurality of portions of each image and clustering the features to labelled clusters, each label indicating a type of building element, wherein training the classifier further comprises defining a plurality of rules defining relationships between pixels in portions of a plan to each cluster by a degree of membership, the relationships being determined based on executing the rules for pixels in portions of the training set; receiving 2D floor plan; classifying pixels in the received floor plan to types of building element based on the trained classifier by executing the rules for each pixel of each of a plurality of portions of the received floor plan to classify the pixel as a type of building element; associating parts of the received 2D floor plan with each of a plurality of types of building element by identifying groups of pixels classified as the type of building element; and generating a 3D data model indicating 3D building elements based on the classification of each pixel in the received 2D floor plan.

2. 发明申请

WO2020193329A1 MACHINE LEARNING 审中-公开
公开(公告)号：WO2020193329A1
公开(公告)日：2020-10-01
申请号：PCT/EP2020/057529
申请日：2020-03-18
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
发明人： OWUSU, Gilbert , HAGRAS, Hani , CHIMATAPU, Ravikiran , STARKEY, Andrew
IPC分类号： G06N5/00 , G06N7/02 , G06N3/12
摘要： A computer implemented method for machine learning comprising: training an autoencoder having a set of input units, a set of output units and at least one set of hidden units, wherein connections between each of the sets of units are provided by way of interval type-2 fuzzy logic systems each including one or more rules, and the fuzzy logic systems are trained using an optimisation algorithm; and generating a representation of rules in each of the interval type-2 fuzzy logic systems triggered beyond a threshold by input data provided to the input units so as to indicate the rules involved in generating an output at the output units in response to the data provided to the input units.

3. 发明申请

WO2015185938A1 NETWORK 审中-公开
标题翻译：网络
公开(公告)号：WO2015185938A1
公开(公告)日：2015-12-10
申请号：PCT/GB2015/051644
申请日：2015-06-05
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
发明人： SHAKYA, Sid , LIRET, Anne , OWUSU, Gilbert , NTOFON, Okung , MOHAMED, Ahmed , HAGRAS, Hani
IPC分类号： G06F9/48 , G06Q10/06 , H04L12/917
CPC分类号： G06F9/5038 , G06F9/4881 , G06F9/4887 , G06Q10/06 , G06Q10/06314 , H04L67/322
摘要： The present invention provides a method which can be used to optimise the delivery of series over communications networks. Tasks which need to executed within a short timescale and those which are not due to be executed for a long time are excluded from the optimisation process. A score is determined, using fuzzy logic, for each task and its related resources and for each resource and its related tasks. This score is then used to determined which tasks should be optimised.
摘要翻译：本发明提供了一种可用于优化通过通信网络串联传送的方法。需要在短时间内执行的任务以及不长时间执行的任务将从优化过程中排除。使用模糊逻辑确定每个任务及其相关资源以及每个资源及其相关任务的分数。然后使用该分数来确定应优化哪些任务。

4. 发明申请

WO2021144118A1 INTERACTION-BASED RENDERING OF SPATIAL ENVIRONMENTS 审中-公开
公开(公告)号：WO2021144118A1
公开(公告)日：2021-07-22
申请号：PCT/EP2020/087120
申请日：2020-12-18
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
发明人： PENA-RIOS, Anasol , OPLATEK, Tomas , HAGRAS, Hani , CONWAY, Anthony , OWUSU, Gilbert
IPC分类号： G06F3/0481 , G06F3/01 , G06F3/011 , G06F3/04815
摘要： A computer implemented method of navigating a digital representation of a spatial environment by a user in which a portion of the digital representation is rendered by a rendering computer system for visualisation by the user, the method comprising: accessing a digital model of the environment including a specification of each of a plurality of virtual resources in the environment, each specification identifying at least a location of a resource in the environment and at least one trigger criterion for determining when a resource is accessed by the user; monitoring the satisfaction of trigger criteria for the virtual resources; and responsive to the monitoring, determining the portion of the digital representation for rendering by the rendering computer system for visualisation by the user.

5. 发明申请

WO2020144026A1 RESILIENT NETWORK ROUTING 审中-公开
公开(公告)号：WO2020144026A1
公开(公告)日：2020-07-16
申请号：PCT/EP2019/085936
申请日：2019-12-18
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
发明人： STARKEY, Andrew , VERYARD, Lewis , HAGRAS, Hani , OWUSU, Gilbert
IPC分类号： H04L12/735 , H04L12/707 , H04L12/721
摘要： A computer implemented method of determining non-intersecting primary and secondary routes between source and destination nodes in a communications network represented by a graph data structure of nodes and edges, edges having associated a weight corresponding to a resource involved in traversing the edge, the method comprising: defining a population set of primary routes based on at least one initial primary route between the source and the destination nodes and at least one additional primary route defined based on a mutation of the initial primary route, wherein the initial primary route is determined by a greedy route-finding algorithm, and wherein each primary route in the population set identifies a secondary route based on the greedy route-finding algorithm applied to the graph having edges in the primary route excluded from the graph, such that the primary and secondary routes are non-intersecting routes through the graph; applying a genetic algorithm to the population set to iteratively select and crossover pairs of primary routes in the sorted population set, the genetic algorithm being applied until a stopping condition is reached, wherein at least a subset of the selected primary routes are mutated in the population set; and selecting, from the population set, a primary route and corresponding secondary route having a lowest aggregate weight of edges.

6. 发明申请

WO2019001807A1 METHOD AND APPARATUS FOR RETRIEVING A DATA PACKAGE 审中-公开
公开(公告)号：WO2019001807A1
公开(公告)日：2019-01-03
申请号：PCT/EP2018/061598
申请日：2018-05-04
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
发明人： CAIRANO - GILFEDDER, Carla , RIOS, Anasol , HAGRAS, Hani , OWUSU, Gilbert
IPC分类号： G06Q10/06 , G06F17/30
摘要： This invention provides a method for ranking contextual data of a plurality of data packages in a Knowledge Management System (KMS) as a computer system configured to store information on the maintenance of an apparatus, wherein each data package of the plurality of data packages includes a data part relating to maintenance of the apparatus, a first metadata part for the data part having a first metadata value and representing a first contextual information type and a second metadata part for the data part having a second metadata value and representing a second contextual information type, the method comprising the steps of: receiving a first and second relevance value for the first and second contextual information type respectively for a first data package, wherein the first and second relevance values represent the relevance of the first and second contextual information types of the first data part to the maintenance of the apparatus; receiving a third and fourth relevance value for the first and second contextual information type respectively for a second data package, wherein the third and fourth relevance values represent the relevance of the first and second contextual information types of the second data part to the maintenance of the apparatus; determining a first ranking value for the first contextual information type based on the first and third relevance values; determining a second ranking value for the second contextual information type based on the second and fourth relevance values; and storing the first and second ranking values in the KMS. The present invention also provides a method for retrieving data packages, including the steps of: receiving a data package request including a first metadata value for the first contextual information type and a second metadata value for the second contextual information type; and retrieving a first data package of the plurality of data packages based on at least one of the first and second metadata values of the data package request, the first and second ranking values, and at least one of the first and second metadata values of each data package of the plurality of data packages.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式