CN103414995B - Zone boundary detection method based on quaternary tree - Google Patents
Zone boundary detection method based on quaternary tree Download PDFInfo
- Publication number
- CN103414995B CN103414995B CN201310360366.5A CN201310360366A CN103414995B CN 103414995 B CN103414995 B CN 103414995B CN 201310360366 A CN201310360366 A CN 201310360366A CN 103414995 B CN103414995 B CN 103414995B
- Authority
- CN
- China
- Prior art keywords
- node
- quaternary tree
- boundary
- object boundary
- detection method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a kind of zone boundary detection method based on quaternary tree, comprise the steps: a) the root node rectangle of the quaternary tree of structure institute search coverage, substantially to cover the object boundary of institute's search coverage; B) be four nodes by each node division of described quaternary tree, extract part matched node wherein; Whether the described part matched node that c) determining step obtains in b) is cell node, if not, return to step and b) described part matched node is continued to divide, if so, extract part matching unit node wherein; D) judge whether to expand described quaternary tree, if desired, expand described quaternary tree, the part after expanding is returned to step b), enter step e) if do not need; E) described quaternary tree is finely tuned; F) extract the profile of described object boundary, obtain the border in described region. The method according to this invention can effectively detect zone boundary in the current position according to user in the application of position-based and Map Services.
Description
Technical field
The present invention relates to LBS positioning service, particularly a kind of zone boundary detection method based on quaternary tree.
Background technology
Location-based service, also claims that positioning service (LocationBasedServices, LBS) is by a kind of value-added service providing that combines of mobile communications network and global position system. Main technical principle is to utilize the space orientation of cellular basestation, measure the radius distance of moving target from base station by 2 above base stations simultaneously, thereby obtain the positional information (as latitude and longitude coordinates data) of mobile terminal, offer mobile device user or other people and communication system, realize the various business relevant to position, determine moving target butt position really. It comprises two layers of meaning: be first the geographical position of determining mobile terminal or user place, next is to provide the various information service relevant to position. In a word, LBS is exactly will be by internet or wireless network, completes location and service two large functions, and is applied to gradually numerous commercial fields such as tourism, house property, amusement and recreation, ecommerce in city.
But, in some location-based services, not only need to locate active user's position, also need to locate the zone boundary at its place. Region can be divided according to the form of city, area or commercial circle, can for trade company or user provide more service may. By compartmentalization is carried out in geographical position, can carry out cluster to region according to the business in a geographic area and business, instead of the simple division of pure longitude and latitude and city map. The regional of dividing is like this actually application demand group's map one by one. Main business demand is gathered in specific region, an aggregation information coverage of formation. The information of user in certain specific region can be shared each other, also can share with application developers, forms the two-way interaction of user and application developers, thereby builds the business group that is similar to city commercial circles. For example, in some taxi application positioning service, need to know that the information of the bounds in the residing region of active user can be more meaningful, can define like this information of vehicles available in current region, more select to offer user. Therefore, zone boundary information is an important component part of cartographic information.
The interface that the current general Map Services of location-based service utilization provides can be judged certain point and whether belong to certain region, but but can not obtain the data boundary in this region. So, not as basic zone boundary data, LBS just cannot obtain the area information that comprises its affiliated area (as city, area, commercial circle etc.) border according to the coordinate at mobile device user place, and the further service based on area information also just cannot be provided.
Therefore, need a kind of method that detects zone boundary in the application of position-based and Map Services according to user's current position.
Summary of the invention
The object of this invention is to provide a kind of zone boundary detection method based on quaternary tree, comprise the steps: a) the root node rectangle of the quaternary tree of structure institute search coverage, substantially to cover the object boundary of institute's search coverage; B) be four nodes by each node division of described quaternary tree, and extract part matched node wherein; Wherein, described part matched node is defined as described node has at least one sampled point drop on outside described object boundary and have at least one sampled point to drop in object boundary; Whether the described part matched node that c) determining step obtains in b) is cell node, if not, if so, and extract part matching unit node wherein return to step and b) described part matched node is continued to divide; D) judge whether to expand described quaternary tree, if desired, expand described quaternary tree, the part after expanding is returned to step b), enter step e) if do not need; Wherein, if described quaternary tree border is crossing with object boundary, need to expand described quaternary tree; E) described quaternary tree is finely tuned, avoid not covering the place that has projection in object boundary; And f) extract the profile of described object boundary, obtain the border in described region.
Preferably, the root node rectangle of described step in a) is to be arranged in some structure centered by any one point in described region.
Preferably, the initial size of described root node rectangle is set to 2 of unit rectanglenDoubly, wherein n is greater than 0 integer.
Preferably, described region in judge whether substantially cover described object boundary by judging whether four angle points of described root node rectangle and the mid point of four edges drop in described step in a).
Preferably, judge that by the service based on geographical position described point is whether in this region.
Preferably, described step e) in to the each part matching unit node on described quaternary tree, check its adjacent node on four direction up and down, if certain adjacent node be not cell node neither cell node immediate superior node, this adjacent node is segmented to the immediate superior node to cell node.
Preferably, in described step f), travel through all part matching unit nodes in described quaternary tree, find out the set of node of one or more connections, obtain the profile line segment of each node in the set of node of each connection, to obtain the profile of described object boundary.
Preferably, described profile line segment obtains as follows: if part matching unit node only has within any is positioned at described object boundary, desirable without profile line segment; Within two points are positioned at described object boundary if having, get line between 2 and extract directed line segment; Within if having, three points are positioned at described object boundary, the line of getting between non-conterminous 2 extracts directed line segment, and the head end of the each directed line segment of mark and end.
According to the zone boundary detection method based on quaternary tree of the present invention, can improve the Map Services in existing LBS service. That only utilizes Map Services judges whether this function in object boundary of certain point, by method of the present invention, can obtain zone boundary profile, for LBS service provides data boundary.
Brief description of the drawings
With reference to the accompanying drawing of enclosing, the more object of the present invention, function and advantage are illustrated the following description by embodiment of the present invention, wherein:
Fig. 1 has schematically shown the flow chart of the zone boundary detection method based on quaternary tree of the present invention.
Fig. 2 schematically shows the schematic diagram of structure quaternary tree root node.
Fig. 3 schematically shows the schematic diagram of a process of segmentation quadtree's node.
Fig. 4 schematically shows the schematic diagram of the quaternary tree border situation crossing with object boundary.
Fig. 5 schematically shows the schematic diagram that expands quaternary tree and segment expanding the new node of rear generation.
Fig. 6 schematically shows the schematic diagram that quaternary tree is finely tuned.
Fig. 7 schematically shows by counterclockwise traveling through all part matching unit nodes in quaternary tree and progressively obtaining the schematic diagram of profile list of line segments.
Fig. 8 schematically shows the schematic diagram of the method that obtains profile line segment.
Detailed description of the invention
By reference to example embodiment, object of the present invention and function and will be illustrated for the method that realizes these objects and function. But the present invention is not limited to following disclosed example embodiment; Can be realized it by multi-form. The essence of description is only to help various equivalent modifications Integrated Understanding detail of the present invention.
Hereinafter, embodiments of the invention will be described with reference to the drawings. In the accompanying drawings, identical Reference numeral represents same or similar parts, or same or similar step.
The present invention surveys specific region A(by the following method as commercial circle) border, first construct the region B of an overlay area A, then the root node using region B as quaternary tree is divided, whether the point (for example, point on border or angle) that the subregion that division obtains can be distinguished on it by the judgement of geo-location service drops in region, thereby subregion can be divided into three types, be the region x in object boundary, region y outside object boundary, and the region z three types that comprises object boundary. Obviously,, in order to obtain the accurate data boundary of specific region A, need gradual perfection region z. Zone boundary detection method based on quaternary tree of the present invention, using region B as quaternary tree root node, by the operation such as progressively segmentation and expansion etc. to quaternary tree, carrys out gradual perfection region z, thereby extracts the accurate data boundary of specific region A.
Fig. 1 schematically shows the flow chart of the zone boundary detection method based on quaternary tree of the present invention. The method comprises the steps:
Step 101, the root node rectangle of the quaternary tree of structure institute search coverage, with basic coverage goal border. As shown in Figure 2, the region that carry out frontier probe is 202, is also object boundary 202, the border that this object boundary can have any shape. Any one some C that selection is arranged in this region constructs the root node of quaternary tree. Whether some C can obtain its whether information in this region by the service based on geographical position in this region. A root node rectangle 201 of central point structure using a C as rectangle, as the root node of quaternary tree. The requirement of root node rectangle 201 is to cover institute's search coverage 202 completely, i.e. complete coverage goal border 202. That is to say, object boundary 202 is dropped in root node rectangle 201 completely.
Root node rectangle 201 can be constructed as follows. First define an enough little cell node 200(also referred to as unit rectangle), length and width are respectively p and q, and unit rectangle is the minimum unit of quaternary tree, does not need the rectangle of dividing again. Centered by C point, constructing a width is w, is highly the root node rectangle 201 of h. The initial size of root node rectangle 201 can be set to 2 of unit rectanglenDoubly (n is greater than 0 integer). Preferably, the initial value of width w is 2p, and the initial value of height h is 2q. Then, judge whether coverage goal border 202 substantially of this root node rectangle 201.
According to a preferred embodiment of the invention, in described region, judge whether basic coverage goal border by judging whether four angle points of root node rectangle and the mid point of four edges drop on. As shown in Figure 2, judge four angle point 203a, 203b, 203c and 203d, and whether mid point 204a, 204b, 204c and the 204d of four edges do not drop in the region that object boundary 202 limits. This judgement that also can be similar to central point C obtains by the service based on geographical position. If the mid point of four angle points of this root node rectangle 201 and four edges does not drop in object boundary 202, the root node rectangle 201 of explanation structure has covered this object boundary 202 substantially, and the construction complete of root node rectangle 201, enters step 102; Otherwise, if there is above-mentioned any point to drop in this object boundary 202, keep central point C constant, width w and height h are expanded, preferably expand identical 2nDoubly (n is greater than 0 integer), again judge, until this initial rectangular reaches basic coverage goal border. Particularly, the mid point of four angle points and four edges does not drop in object boundary 202, thereby makes this root node rectangle 201 coverage goal border 202 completely. The boundary definition of the root node rectangle 201 of construction complete is quaternary tree border.
Be understandable that, can judge and the level of coverage of object boundary by the point of sampling on more root node rectangle, the point of sampling is more, also can be more accurate with the level of coverage of object boundary, but corresponding amount of calculation also can increase.
Step 102, divides each node of quaternary tree, is divided into four child nodes, judges child node type. As shown in Fig. 3 (a), first root node rectangle 201 is divided into four sub-rectangles, as four child nodes.
Four child nodes that obtain of dividing can be divided into three types, i.e. completely matched node, not matched node and part matched node completely, then carry out different operations according to the type of this node. The definition of three kinds of node types is as follows respectively: if whole sampled points of certain node, for example totally 9 points are all in object boundary 202 for the mid point of its central point, four angle points and four edges, and this node is complete matched node, not further processing; If whole sampled points of certain node, for example above-mentioned 9 points are all outside object boundary 202, and this node is not matched node, not further processing completely; If certain node neither completely matched node neither be completely matched node not, there is at least one sampled point drop on outside object boundary 202 and have at least one sampled point to drop in object boundary 202, this node is part matched node, relevant with the detection of object boundary 202. For instance, a cell node 301 as shown in Figure 3 (c), two, this cell node left side angle point is positioned at object boundary, and two, the right angle point is positioned at outside object boundary, so this node is part matched node.
Step 103, whether the part matched node obtaining in determining step 102 is cell node, no longer this node to be segmented, otherwise return to step 102, this part matched node is segmented again, be all subdivided to cell node until divide all part matched node of the quaternary tree obtaining.
Also be similar to above-mentioned classification for cell node, be divided into complete matching unit node, not matching unit node and part matching unit node completely. Whether drop within the scope of object boundary and divide by the point on judging unit node rectangle. Preferably, because the size of cell node is very little, therefore in the time of the kind of judging unit node, sampled point can only be selected four angle points, can only need to consider that its four angle points are whether in object boundary 202, and whether drop in object boundary 202 without mid point and the rectangular centre point of considering again its four edges. Therefore, if four angle points of a cell node all in object boundary 202, it belongs to complete matching unit node; If four angle points of cell node are all outside object boundary 202, it belongs to completely not matching unit node; If four angle points of cell node have one at least within object boundary 202 and have one at least outside object boundary 202, it belongs to part matching unit node. For instance, a cell node 302 as shown in Fig. 3 (d), two, this cell node left side angle point is positioned at object boundary, and two, the right angle point is positioned at outside object boundary, so this cell node is part matching unit node. The set that all part matching unit nodes form is the object boundary of preliminary detection.
Step 104, judges whether to expand quaternary tree. Because the judgement that in above-mentioned steps, whether each child node is covered to border condition only realizes by the limited point of sampling, therefore may there is situation as shown in Figure 4, occur that object boundary still drops on outside the object boundary by the preliminary detection of all part matching unit joint structures in some region 401. Now, just need to revise the object boundary of preliminary detection.
Preferably, can whether there is crossing situation with object boundary by quaternary tree border (being the border of root node rectangle). Particularly, as shown in Figure 4, from root node, recursively check the each node on quaternary tree, if if there is some nodes, the point that it is sampled, be the mid point on four angle points and four limits for non-cell node, for cell node, only have four angle points, have any point to be both positioned on quaternary tree border, be positioned at again object boundary 202, be defined as quaternary tree border crossing with object boundary. As shown in Figure 4, two angles of cell node 402 had both been positioned on quaternary tree border, were positioned at again object boundary 202, and quaternary tree border 201 is crossing with object boundary 202.
If there is the quaternary tree border situation crossing with object boundary, enter step 105 and carry out the expansion of quaternary tree. As shown in Figure 5, expand quaternary tree, specific algorithm is as follows:
First, keep the central point of former root node rectangle constant, the wide and high each of root node rectangle expanded to two times;
Then for the root node after expanding creates four new child nodes, its area is four times of child node area of originally root node being divided for the first time rear generation, and former four child nodes that root node rectangle is originally divided rear generation for the first time become a child node under new child node separately. For example as shown in Figure 5, the surrounding of former child node 501a has created three new child node 501b, 501c and 501d.
Then return to step 102, enter step 102 and segment expanding the new sub-rectangle of rear generation, repeating step 102,103 and 104 is until no longer need to expand quaternary tree.
Step 106, finely tunes quaternary tree, avoids not covering the place that has projection in object boundary, and also, object boundary is through complete matched node or the situation of matched node not completely. As shown in Figure 6 (a), as there is local protuberance 601 in object boundary, for child node 602, although object boundary 601 is crossing with this region, because making this region 602, sampled point limited can be judged as completely not matched node. This step is the fine setting that this situation is carried out.
Particularly, to the each part matching unit node on quaternary tree, check its adjacent node on four direction up and down, if certain adjacent node be not a cell node neither cell node immediate superior node (size is the node of 4 times of cell nodes), need this adjacent node to segment the immediate superior node to cell node. As shown in Figure 6 (b).
The quaternary tree obtaining through above step, meets following character: be positioned at the borderline point of quaternary tree not at object boundary 202; Matched node is not adjacent completely with any one, only has other matched node not completely, or the cell node of part coupling. Now complete the structure of quaternary tree, therefore, can gather all part matching unit nodes, can extract the profile of the object boundary that will survey.
Step 107, the profile of extraction object boundary. According to a preferred embodiment of the invention, can obtain as follows boundary profile. By all part matching unit nodes in either direction (for example, by counter clockwise direction or clockwise direction) traversal quaternary tree, find out the set of node of one or more connections. For example, in the time that the region of exploring forms for annular or by two or the non-conterminous subregion of polylith, there is more than one border. As shown in Figure 7, from part matched node 701, first survey adjacent top node 702, because node 702 is not the cell node of part coupling, therefore rotate to left side along arrow counterclockwise. Because left side adjacent node 703 is cell nodes of part coupling, therefore elected as present node, then continue traversal, obtain the set of node being communicated with.
Each is communicated with to the each node in set of node, obtains the profile line segment of each node. The point quantity difference of mating in object boundary due to the various piece matching unit node being communicated with in set of node, so it is also different to obtain the method for profile line segment from the cell node of various piece coupling, specific as follows: if the cell node of a part of coupling only has some coupling (only have any be positioned at object boundary 202 within), desirable without profile line segment; If there are two some couplings, according to mode shown in Fig. 8 (a), get line between 2 and extract directed line segment; If there is three somes coupling,, according to mode as shown in Figure 8 (b) shows, the line of getting between non-conterminous 2 extracts directed line segment, and the head end of the each directed line segment of mark and end.
Then, be communicated with set of node for each, obtain the profile list of line segments of set of node. The step that obtains profile list of line segments is as follows:
A) set up list of line segments L, be initially sky;
B) from be communicated with set of node, taking out any node as start node, record its profile line segment and its head end, is present node by this nodes records;
C) get as new present node along certain direction (counterclockwise or clockwise direction) traversal part matching unit node adjacent with present node, the profile line segment of obtaining present node adds in L with its head end and end;
If d) in the profile line segment end in this present node and L, the head end of initial segment is same point, outline close, algorithm finishes. The segment data now recording in L is the polygon data of the object boundary that surveyed matching obtains. Otherwise, return to step c).
According to the zone boundary detection method based on quaternary tree of the present invention, can improve the Map Services in existing LBS service. That only utilizes Map Services judges whether this function in object boundary of certain point, by method of the present invention, can obtain zone boundary profile, for LBS service provides data boundary.
In conjunction with the explanation of the present invention and the practice that disclose here, other embodiment of the present invention are easy to expect and understand for those skilled in the art. Illustrate with embodiment and be only considered to exemplary, true scope of the present invention and purport limit by claim.
Claims (8)
1. the zone boundary detection method based on quaternary tree, is characterized in that, comprises following stepRapid:
A) the root node rectangle of the quaternary tree of structure institute search coverage, substantially to cover institute's search coverageObject boundary;
B) be four nodes by each node division of described quaternary tree, and extract part whereinJoin node;
Wherein, described part matched node is defined as described node has at least one sampled point to drop on instituteState outside object boundary and have at least one sampled point to drop in object boundary;
Whether the described part matched node that c) determining step obtains in b) is cell node, if notBe, return to step and b) described part matched node is continued to divide, if so, also extract whereinPart matching unit node;
D) judge whether to expand described quaternary tree, if desired, expand described quaternary tree, rightPart after expansion is returned to step b), enters step e) if do not need;
Wherein, if described quaternary tree border is crossing with object boundary, need to expand described quaternary tree;
E) described quaternary tree is finely tuned, avoid not covering the ground that has projection in object boundarySide; With
F) extract the profile of described object boundary, obtain the border in described region.
2. zone boundary according to claim 1 detection method, is characterized in that, described stepRapid root node rectangle in a) is to be arranged in some structure centered by any one point in described region.
3. zone boundary according to claim 1 detection method, is characterized in that, describedThe initial size of node rectangle is set to 2 of unit rectanglenDoubly, wherein n is greater than 0 integer.
4. zone boundary according to claim 1 detection method, is characterized in that, describedStep a) in by judging whether four angle points of described root node rectangle and the mid point of four edges drop onIn described region, judge whether substantially to cover described object boundary.
5. according to the zone boundary detection method described in claim 2 or 4, it is characterized in that, logicalThe service based on geographical position of crossing judges that described point is whether in this region.
6. zone boundary according to claim 1 detection method, is characterized in that, describedStep e) in to the each part matching unit node on described quaternary tree, check its up and down fourAdjacent node in individual direction, if certain adjacent node be not cell node neither cell nodeImmediate superior node, segments this adjacent node the immediate superior node to cell node.
7. zone boundary according to claim 1 detection method, is characterized in that, describedStep is the middle all part matching unit nodes that travel through in described quaternary tree f), find out one or moreThe set of node being communicated with, obtains the profile line segment of each node in the set of node of each connection, to obtainThe profile of described object boundary.
8. zone boundary according to claim 7 detection method, is characterized in that, described wheelProfile section is obtained as follows: if part matching unit node only has any to be positioned at described target limitWithin boundary, desirable without profile line segment; Within if having, two points are positioned at described object boundary, getBetween 2, line extracts directed line segment; Within if having, three points are positioned at described object boundary, getLine between non-conterminous 2 extracts directed line segment, and the head end of the each directed line segment of mark andEnd.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310360366.5A CN103414995B (en) | 2013-08-16 | 2013-08-16 | Zone boundary detection method based on quaternary tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310360366.5A CN103414995B (en) | 2013-08-16 | 2013-08-16 | Zone boundary detection method based on quaternary tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103414995A CN103414995A (en) | 2013-11-27 |
| CN103414995B true CN103414995B (en) | 2016-05-18 |
Family
ID=49607970
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310360366.5A Active CN103414995B (en) | 2013-08-16 | 2013-08-16 | Zone boundary detection method based on quaternary tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103414995B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104392280B (en) * | 2014-08-14 | 2018-05-22 | 成都边界元科技有限公司 | Find the 2- quadtree approach for closely moving target |
| CN105491512A (en) * | 2016-01-18 | 2016-04-13 | 福建师范大学 | Mobile phone indoor positioning method based on Bluetooth |
| CN106960023B (en) * | 2017-03-14 | 2022-04-26 | 北京京东振世信息技术有限公司 | Method and apparatus for determining geographic location of target based on quadtree structure |
| CN107657474B (en) * | 2017-07-31 | 2020-09-15 | 石河子大学 | Method for determining business circle boundary and server |
| CN111540209B (en) * | 2020-05-12 | 2021-07-27 | 青岛海信网络科技股份有限公司 | Vehicle aggregation monitoring method and computer-readable storage medium |
| CN112308600B (en) * | 2020-09-15 | 2023-04-07 | 天津五八到家货运服务有限公司 | Business circle dividing method and device and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070213929A1 (en) * | 2006-03-10 | 2007-09-13 | Masaaki Tanizaki | Computer readable medium storing a map data updating program and map data updating terminal |
| CN101069178A (en) * | 2004-11-30 | 2007-11-07 | 惠普开发有限公司 | Device, method and program for managing area information |
| CN101319907A (en) * | 2007-06-07 | 2008-12-10 | 索尼株式会社 | Navigation apparatus and nearest point searching method |
-
2013
- 2013-08-16 CN CN201310360366.5A patent/CN103414995B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101069178A (en) * | 2004-11-30 | 2007-11-07 | 惠普开发有限公司 | Device, method and program for managing area information |
| US20070213929A1 (en) * | 2006-03-10 | 2007-09-13 | Masaaki Tanizaki | Computer readable medium storing a map data updating program and map data updating terminal |
| CN101319907A (en) * | 2007-06-07 | 2008-12-10 | 索尼株式会社 | Navigation apparatus and nearest point searching method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103414995A (en) | 2013-11-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103414995B (en) | Zone boundary detection method based on quaternary tree | |
| US11178507B2 (en) | Systems, methods and apparatus for geofence networks | |
| US11523249B2 (en) | Systems, methods and apparatus for geofence networks | |
| US11711666B2 (en) | Systems, methods and apparatus for geofence networks | |
| US9326105B2 (en) | Systems and methods for using three-dimensional location information to improve location services | |
| CN101498785B (en) | GNSS network differential positioning reference station network construction method and dynamic updating method | |
| JP2012525569A (en) | Method for positioning by WI-FI signal | |
| US11592517B2 (en) | Offline radio maps for GNSS-denied areas | |
| CN104581931A (en) | Positioning method, device and terminal | |
| US11226391B2 (en) | Floor levels of a venue | |
| KR102153932B1 (en) | Apparatus for updating of positioning infrastructure database automatically and method using the same | |
| WO2017180033A1 (en) | System, apparatus, and method for using location records associated with wireless communication devices to generate an indoor map | |
| Yang et al. | WKNN indoor location algorithm based on zone partition by spatial features and restriction of former location | |
| Retscher et al. | A benchmarking measurement campaign in GNSS-denied/challenged indoor/outdoor and transitional environments | |
| KR102056720B1 (en) | Method and apparatus for creating a grid fingerprint databsae of link-type | |
| Tennekes et al. | A Bayesian approach to location estimation of mobile devices from mobile network operator data | |
| Kopp et al. | Tomographic reconstruction of RF propagation to aid VANET routing in urban canyons | |
| EP3872518A1 (en) | Feedback loop for improving performance of a radio-based positioning system | |
| CN108981713B (en) | Hybrid wireless self-adaptive navigation method and device | |
| US11754660B2 (en) | Offline radio maps for crowdsourced GNSS rescue areas | |
| US20230176226A1 (en) | Offline Radio Maps for Device-Specific GNSS Rescue Areas | |
| KR102497581B1 (en) | Method and apparatus for wireless localization using neural network | |
| KR20210032694A (en) | Method and apparatus for wireless localization based on image | |
| Kim et al. | Analysis of the signals of opportunity and cooperative based positioning for uas navigation in deep urban area | |
| WO2018200332A1 (en) | Systems, methods and apparatus for geofence networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |