The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 05, 2013

Filed:

May. 02, 2011
Applicants:

Enrique Frias Martinez, Madrid, ES;

Vanessa Frias Martinez, Madrid, ES;

Marcos Vieira, Madrid, ES;

Nuria Oliver, Madrid, ES;

Inventors:

Enrique Frias Martinez, Madrid, ES;

Vanessa Frias Martinez, Madrid, ES;

Marcos Vieira, Madrid, ES;

Nuria Oliver, Madrid, ES;

Assignee:

Telefonica, S.A., Madrid, ES;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04W 40/00 (2009.01); H04W 24/00 (2009.01);
U.S. Cl.
CPC ...
Abstract

Method for an automatic identification of urban dense areas from cell phones records, by using a computing device that receives as inputs: a geographical region R, a time period Δt for which dense areas in the region R need to be computed, a set of BTSs in the region R, a set of CDRs generated by individuals during the time period Δt using the set of BTSs of the region R, a coverage C and a granularity ε. The method includes constructing a graph G=(V, E), being V=vertexes and E=edges, using Delaunay triangulation, where each vertex vof V corresponds to btsof BTS in the geographical region R, and each edge eof E represents connection between btsand bts; eliminating from E all the edges in E with a distance between two connecting BTS larger than c, so that a desired spatial granularity is ensured; associating a weight wto each edge eof E that has not been eliminated, the weight representing the average density of the area covered by btsand btsduring the time period Δt; constructing a data structure L that contains the dense areas using the edges of E; and applying a 'Maximum Spanning Tree' type algorithm to detect dense areas given by the data structure L.


Find Patent Forward Citations

Loading…