US6552670B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Location encoder
Assignee: SWITCHBOARD LLC
•
Filing: 2001-05-23
•
Granted: 2003-04-22
•
Expires: 2021-05-23
Abstract
Abstract A method and apparatus to convert geographic information to a binary representation, or bingeo. The geographic information can be converted to a bingeo for a selected reference or coordinate system, and with respect to a reference within the selected coordinate system. The coordinate system location to bingeo conversion can be hierarchical or iterative and can include segmenting the coordinate system or segments thereof. The iterative algorithm can include identifying a segment including the specified location, and segmenting the identified segment. During an iteration, segments can be assigned a binary code that can be incorporated into the bingeo. Successive segmentation iterations can be performed to provide increased precision. In one embodiment, a precision of 0.16 inches squared can be attained. Two bingeos can be compared, in the simplest form, using a bitwise logical XOR.
Inventors
- 👤 Vale Sundaravel
- 👤 Benjamin J. Paul
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 11:29
CPC Classifications
H; H02; H02J; H02J9/00; H02J9/04; H02J9/06; H02J9/061; G; G06; G06F; G06F16/00; G06F16/20; G06F16/29; H04; H04L; H04L67/00; H04L67/50; H04L67/52; H04L9/00; H04L9/40; H04M; H04M3/00; H04M3/42; H04L69/00; H04L69/30; H04L69/32; H04L69/322; H04L69/329; H04M2242/00; H04M2242/30
Claims Analysis
Total Claims: 101
Claim 1
Independent Claim
76 words
A method of forming a binary representation of geographic information based on a coordinate system, the method comprising, relating the geographic information to the coordinate system, providing a hierarchical segmentation scheme to create subdivisions based on the geographic information, assigning a binary code to the subdivisions, determining a level of the hierarchical scheme to provide a desired precision for the binary representation, forming the binary representation based on the assigned binary codes and the desired precision.
Claim 2
Independent Claim
76 words
A method of forming a binary representation of geographic information based on a coordinate system, the method comprising, relating the geographic information to the coordinate system, providing a hierarchical segmentation scheme to create subdivisions based on the geographic information, assigning a binary code to the subdivisions, determining a level of the hierarchical scheme to provide a desired precision for the binary representation, forming the binary representation based on the assigned binary codes and the desired precision.
Claim 3
Dependent Claim
20 words
A method according to claim 1 , wherein relating the geographic information includes determining a location in the coordinate system.
Claim 4
Dependent Claim
18 words
A method according to claim 1 , wherein providing a hierarchical segmentation scheme includes providing an iterative scheme.
Claim 5
Dependent Claim
18 words
A method according to claim 1 , wherein providing a hierarchical segmentation scheme includes providing a recursive scheme.
Claim 6
Dependent Claim
35 words
A method according to claim 1 , wherein providing a hierarchical segmentation scheme includes providing a scheme to create subdivisions from at least one of the coordinate system or a subdivision of the coordinate system.
Claim 7
Dependent Claim
36 words
A method according to claim 1 , wherein providing a hierarchical segmentation scheme includes providing a scheme to create four segments from at least one of the coordinate system or a subdivision of the coordinate system.
Claim 8
Dependent Claim
19 words
A method according to claim 1 , wherein assigning a binary code includes assigning a two bit binary code.
Claim 9
Dependent Claim
26 words
A method according to claim 1 , wherein forming the binary representation includes associating bits of the binary representation with a level of the hierarchical scheme.
Claim 10
Dependent Claim
16 words
A method according to claim 1 , further including initializing the binary representation to be zero.
Claim 11
Dependent Claim
19 words
A method according to claim 1 , further including initializing the binary representation to includes ones in every location.
Claim 12
Dependent Claim
31 words
A method according to claim 1 , further including at least one of storing the binary representation in a database and storing a precision indicator based on the binary representation precision.
Claim 13
Dependent Claim
17 words
A method according to claim 1 , further including selecting a reference relative to the coordinate system.
Claim 14
Dependent Claim
25 words
A method according to claim 1 , wherein relating the geographic information to the coordinate system includes computing a centroid based on the geographic information.
Claim 15
Dependent Claim
36 words
A method according to claim 1 , wherein relating the geographic information includes relating at least one of latitude, longitude, direction, parcel, ward, street address, city, town, zip code, telephone number, area code, destination, and direction.
Claim 16
Independent Claim
67 words
A method of forming a binary representation of geographic information based on a coordinate system, the method comprising, relating the geographic information to the coordinate system, iteratively creating subdivisions from at least one of the coordinate system or a subdivision of the coordinate system, assigning a binary code to the created subdivisions, and, forming the binary representation based on the binary code of the identified created subdivision.
Claim 17
Independent Claim
67 words
A method of forming a binary representation of geographic information based on a coordinate system, the method comprising, relating the geographic information to the coordinate system, iteratively creating subdivisions from at least one of the coordinate system or a subdivision of the coordinate system, assigning a binary code to the created subdivisions, and, forming the binary representation based on the binary code of the identified created subdivision.
Claim 18
Dependent Claim
34 words
A method according to claim 15 , wherein iteratively creating includes iteratively creating from a subdivision of the coordinate system that is related to a location of the geographical information in the coordinate system.
Claim 19
Dependent Claim
16 words
A method according to claim 15 , wherein iteratively creating subdivisions further includes dividing into quadrants.
Claim 20
Dependent Claim
21 words
A method according to claim 15 , further including determining a scheme for assigning the binary codes at the iteration levels.
Claim 21
Dependent Claim
21 words
A method according to claim 15 , wherein assigning a unique binary code includes assigning a unique two bit binary code.
Claim 22
Dependent Claim
23 words
A method according to claim 15 , wherein forming the binary representation includes associating an iteration level with positions in the binary representation.
Claim 23
Dependent Claim
18 words
A method according to claim 15 , further comprising ending the iteration based on a level of precision.
Claim 24
Dependent Claim
20 words
A method according to claim 15 , further comprising ending the iteration based on a size of the binary representation.
Claim 25
Dependent Claim
26 words
A method according to claim 15 , wherein relating the geographic information to a location includes computing a latitude and longitude based on the geographic information.
Claim 26
Dependent Claim
25 words
A method according to claim 15 , wherein relating the geographic information to the coordinate system includes computing a centroid based on the geographic information.
Claim 27
Dependent Claim
17 words
A method according to claim 15 , wherein iteratively creating subdivisions includes creating subdivisions of equal size.
Claim 28
Dependent Claim
15 words
A method according to claim 15 , further comprising initializing the binary representation to zero.
Claim 29
Dependent Claim
19 words
A method according to claim 15 , further comprising initializing the binary representation to include ones in every location.
Claim 30
Dependent Claim
16 words
A method according to claim 15 , further including specifying a size for the binary representation.
Claim 31
Dependent Claim
19 words
A method according to claim 15 , further including specifying a size of sixty-four bits for the binary representation.
Claim 32
Dependent Claim
17 words
A method according to claim 15 , further including selecting a reference frame within the coordinate system.
Claim 33
Dependent Claim
17 words
A method according to claim 15 , further including providing a scheme to assign a binary code.
Claim 34
Dependent Claim
34 words
A method according to claim 15 , further including receiving the geographic information as one of latitude, longitude, direction, parcel, ward, street address, town, city, zip code, telephone number, area code, destination, and direction.
Claim 35
Independent Claim
68 words
A method for comparing a first location and a second location, comprising, using an iterative process to obtain a binary representation of the first location, using the iterative process to obtain a binary representation of the second location, performing a binary computation utilizing the first location binary representation and the second location binary representation to obtain a binary result, and computing a distance measure from the binary result.
Claim 36
Independent Claim
68 words
A method for comparing a first location and a second location, comprising, using an iterative process to obtain a binary representation of the first location, using the iterative process to obtain a binary representation of the second location, performing a binary computation utilizing the first location binary representation and the second location binary representation to obtain a binary result, and computing a distance measure from the binary result.
Claim 37
Dependent Claim
62 words
A method according to claim 33 , wherein using an iterative process includes, relating the location to a coordinate system, and, iteratively creating subdivisions from at least one of the coordinate system or a subdivision of the coordinate system, assigning a binary code to the created subdivisions, and, forming the binary representation based on the binary code of the identified created subdivision.
Claim 38
Dependent Claim
18 words
A method according to claim 33 , wherein performing a binary computation includes performing an exclusive OR (XOR).
Claim 39
Dependent Claim
27 words
A method according to claim 33 , wherein computing a distance measure further includes associating binary digits of the binary result to at least one distance measure.
Claim 40
Dependent Claim
25 words
A method according to claim 33 , further including identifying at least one binary representation corresponding to at least one neighbor of the first location.
Claim 41
Dependent Claim
25 words
A method according to claim 33 , further including identifying at least one binary representation corresponding to at least one neighbor of the second location.
Claim 42
Dependent Claim
25 words
A method according to claim 33 , further including computing at least one binary representation corresponding to at least one neighbor of the first location.
Claim 43
Dependent Claim
25 words
A method according to claim 33 , further including computing at least one binary representation corresponding to at least one neighbor of the second location.
Claim 44
Dependent Claim
53 words
A method according to claim 33 , further including determining at least one of whether the binary representation of the first location is a neighbor of the binary representation of the second location, and whether the binary representation of the second location is a neighbor of the binary representation of the first location.
Claim 45
Independent Claim
85 words
A system for comparing at least two locations, comprising, an interface to receive geographical information based on at least one of the at least two locations, a processor having instructions to convert the geographical information to a binary representation using a hierarchical segmentation scheme, where levels of the hierarchical scheme are associated with a precision for thc binary representation, a database that includes binary representations of at least another of the at least two locations, a comparator to perform a binary computation between binary representations.
Claim 46
Independent Claim
85 words
A system for comparing at least two locations, comprising, an interface to receive geographical information based on at least one of the at least two locations, a processor having instructions to convert the geographical information to a binary representation using a hierarchical segmentation scheme, where levels of the hierarchical scheme are associated with a precision for thc binary representation, a database that includes binary representations of at least another of the at least two locations, a comparator to perform a binary computation between binary representations.
Claim 47
Dependent Claim
20 words
A system according to claim 42 , further including a difference translator to determine difference measure from the comparator result.
Claim 48
Dependent Claim
26 words
A system according to claim 42 , further comprising a neighbor location module to identify the binary representations of neighbors for the at least two locations.
Claim 49
Dependent Claim
14 words
A system according to claim 42 , wherein the comparator is an exclusive OR.
Claim 50
Dependent Claim
62 words
A system according to claim 42 , wherein the processor has instructions for, relating the geographical information to a coordinate system, iteratively creating subdivisions from at least one of the coordinate system or a subdivision of the coordinate system, assigning a binary code to the created subdivisions, and, forming the binary representation based on the binary code of the identified created subdivision.
Claim 51
Dependent Claim
19 words
A system according to claim 42 , further including precision indicators associated with the binary representations in the database.
Claim 52
Dependent Claim
17 words
A system according to claim 42 , further including a precision indicator associated with the binary representation.
Claim 53
Dependent Claim
19 words
A system according to claim 42 , further including identity information associated with the binary representations in the database.
Claim 54
Independent Claim
83 words
A system for forming a binary representation of geographic information based on a coordinate system, the system comprising, means for providing the geographic information, means for implementing a hierarchical segmentation scheme to create subdivisions based on the geographic information, means for determining a level of the hierarchial scheme to provide a desired precision for the binary representation means for assigning a binary code to the subdivisions, and, means for forming the binary representation based on the assigned binary codes and the desired precision.
Claim 55
Independent Claim
83 words
A system for forming a binary representation of geographic information based on a coordinate system, the system comprising, means for providing the geographic information, means for implementing a hierarchical segmentation scheme to create subdivisions based on the geographic information, means for determining a level of the hierarchial scheme to provide a desired precision for the binary representation means for assigning a binary code to the subdivisions, and, means for forming the binary representation based on the assigned binary codes and the desired precision.
Claim 56
Dependent Claim
16 words
A system according to claim 50 , wherein the means for providing include any internet-accessible device.
Claim 57
Dependent Claim
21 words
A system according to claim 50 , wherein means for implementing a hierarchical segmentation scheme include a processor and processor instructions.
Claim 58
Dependent Claim
88 words
A computer product for brining a binary representation of geographic information based on a coordinate system, the computer product disposed on a computer readable medium and having instructions for causing a processor to, relate the geographic information to thc coordinate system, provide a hierarchical segmentation scheme to create subdivisions based on the geographic information, determine a level of the hierarchical scheme to provide a desired precision, assign a binary code to the subdivisions, and, form thc binary representation based on the assigned binary codes and the desired precision.
Claim 59
Dependent Claim
88 words
A computer product for brining a binary representation of geographic information based on a coordinate system, the computer product disposed on a computer readable medium and having instructions for causing a processor to, relate the geographic information to thc coordinate system, provide a hierarchical segmentation scheme to create subdivisions based on the geographic information, determine a level of the hierarchical scheme to provide a desired precision, assign a binary code to the subdivisions, and, form thc binary representation based on the assigned binary codes and the desired precision.
Claim 60
Dependent Claim
25 words
A computer product according to claim 53 , wherein instructions to relate the geographic information include instructions to determine a location in the coordinate system.
Claim 61
Dependent Claim
23 words
A computer product according to claim 53 , wherein instructions to provide a hierarchical segmentation scheme include instructions to provide an iterative scheme.
Claim 62
Dependent Claim
23 words
A computer product according to claim 53 , wherein instructions to provide a hierarchical segmentation scheme include instructions to provide a recursive scheme.
Claim 63
Dependent Claim
40 words
A computer product according to claim 53 , wherein instructions to provide a hierarchical segmentation scheme include instructions to provide a scheme to create subdivisions from at least one of the coordinate system or a subdivision of the coordinate system.
Claim 64
Dependent Claim
41 words
A computer product according to claim 53 , wherein instructions to provide a hierarchical segmentation scheme include instructions to provide a scheme to create four segments from at least one of the coordinate system or a subdivision of the coordinate system.
Claim 65
Dependent Claim
22 words
A computer product according to claim 53 , wherein instructions to assign a binary code includes assigning a two bit binary code.
Claim 66
Dependent Claim
31 words
A computer product according to claim 53 , wherein instructions to form the binary representation include instructions to associate bits of the binary representation with a level of the hierarchical scheme.
Claim 67
Dependent Claim
19 words
A computer product according to claim 53 , further including instructions to initialize the binary representation to be zero.
Claim 68
Dependent Claim
22 words
A computer product according to claim 53 , further including instructions to initialize the binary representation to includes ones in every location.
Claim 69
Dependent Claim
34 words
A computer product according to claim 53 , further including instructions to at least one of store the binary representation in a database and store a precision indicator based on the binary representation precision.
Claim 70
Dependent Claim
20 words
A computer product according to claim 53 , further including instructions to select a reference relative to the coordinate system.
Claim 71
Dependent Claim
30 words
A computer product according to claim 53 , wherein instructions to relate the geographic information to the coordinate system include instructions to compute a centroid based on the geographic information.
Claim 72
Dependent Claim
41 words
A computer product according to claim 53 , wherein instructions to relate the geographic information include instructions to relate at least one of latitude, longitude, direction, parcel, ward, street address, city, town, zip code, telephone number, area code, destination, and direction.
Claim 73
Dependent Claim
82 words
A computer product for forming a binary representation of geographic information based on a coordinate system, the computer product disposed on a computer readable medium and having instructions for causing a processor to, relate the geographic information to the coordinate system, iteratively create subdivisions from at least one of the coordinate system or a subdivision of the coordinate system, assign a binary code to the created subdivisions, and, form the binary representation based on the binary code of the identified created subdivision.
Claim 74
Dependent Claim
82 words
A computer product for forming a binary representation of geographic information based on a coordinate system, the computer product disposed on a computer readable medium and having instructions for causing a processor to, relate the geographic information to the coordinate system, iteratively create subdivisions from at least one of the coordinate system or a subdivision of the coordinate system, assign a binary code to the created subdivisions, and, form the binary representation based on the binary code of the identified created subdivision.
Claim 75
Dependent Claim
39 words
A computer product according to claim 67 , wherein instructions to iteratively create include instructions to iteratively create from a subdivision of the coordinate system that is related to a location of the geographical information in the coordinate system.
Claim 76
Dependent Claim
21 words
A computer product according to claim 67 , wherein instructions to iteratively create subdivisions further include instructions to divide into quadrants.
Claim 77
Dependent Claim
24 words
A computer product according to claim 67 , further including instructions to determine a scheme for assigning the binary codes at the iteration levels.
Claim 78
Dependent Claim
26 words
A computer product according to claim 67 , wherein instructions to assign a unique binary code include instructions to assign a unique two bit binary code.
Claim 79
Dependent Claim
28 words
A computer product according to claim 67 , wherein instructions to form the binary representation include instructions to associate an iteration level with positions in the binary representation.
Claim 80
Dependent Claim
21 words
A computer product according to claim 67 , further comprising instructions to end the iteration based on a level of precision.
Claim 81
Dependent Claim
23 words
A computer product according to claim 67 , further comprising instructions to end the iteration based on a size of the binary representation.
Claim 82
Dependent Claim
31 words
A computer product according to claim 67 , wherein instructions to relate the geographic information to a location include instructions to compute a latitude and longitude based on the geographic information.
Claim 83
Dependent Claim
30 words
A computer product according to claim 67 , wherein instructions to relate the geographic information to the coordinate system include instructions to compute a centroid based on the geographic information.
Claim 84
Dependent Claim
22 words
A computer product according to claim 67 , wherein instructions to iteratively create subdivisions include instructions to create subdivisions of equal size.
Claim 85
Dependent Claim
18 words
A computer product according to claim 67 , further comprising instructions to initialize the binary representation to zero.
Claim 86
Dependent Claim
22 words
A computer product according to claim 67 , further comprising instructions to initialize the binary representation to include ones in every location.
Claim 87
Dependent Claim
19 words
A computer product according to claim 67 , further including instructions to specify a size for the binary representation.
Claim 88
Dependent Claim
22 words
A computer product according to claim 67 , further including instructions to specify a size of sixty-four bits for the binary representation.
Claim 89
Dependent Claim
20 words
A computer product according to claim 67 , further including instructions to select a reference frame within the coordinate system.
Claim 90
Dependent Claim
20 words
A computer product according to claim 67 , further including instructions to provide a scheme to assign a binary code.
Claim 91
Dependent Claim
37 words
A computer product according to claim 67 , further including instructions to receive the geographic information as one of latitude, longitude, direction, parcel, ward, street address, town, city, zip code, telephone number, area code, destination, and direction.
Claim 92
Dependent Claim
85 words
A computer product for comparing a first location and a second location, the computer product disposed on a computer readable medium and having instructions for causing a processor to, use an iterative process to obtain a binary representation of the first location, use the iterative process to obtain a binary representation of the second location, perform a binary computation utilizing the first location binary representation and the second location binary representation to obtain a binary result, and compute a distance measure from the binary result.
Claim 93
Dependent Claim
85 words
A computer product for comparing a first location and a second location, the computer product disposed on a computer readable medium and having instructions for causing a processor to, use an iterative process to obtain a binary representation of the first location, use the iterative process to obtain a binary representation of the second location, perform a binary computation utilizing the first location binary representation and the second location binary representation to obtain a binary result, and compute a distance measure from the binary result.
Claim 94
Dependent Claim
67 words
A computer product according to claim 85 , wherein instructions to use an iterative process include instructions to, relate the location to a coordinate system, and, iteratively create subdivisions from at least one of the coordinate system or a subdivision of the coordinate system, assign a binary code to the created subdivisions, and, form the binary representation based on the binary code of the identified created subdivision.
Claim 95
Dependent Claim
23 words
A computer product according to claim 85 , wherein instructions to perform a binary computation include instructions to perform an exclusive OR (XOR).
Claim 96
Dependent Claim
32 words
A computer product according to claim 85 , wherein instructions to compute a distance measure further include instructions to associate binary digits of the binary result to at least one distance measure.
Claim 97
Dependent Claim
28 words
A computer product according to claim 85 , further including instructions to identify at least one binary representation corresponding to at least one neighbor of the first location.
Claim 98
Dependent Claim
28 words
A computer product according to claim 85 , further including instructions to identify at least one binary representation corresponding to at least one neighbor of the second location.
Claim 99
Dependent Claim
28 words
A computer product according to claim 85 , further including instructions to compute at least one binary representation corresponding to at least one neighbor of the first location.
Claim 100
Dependent Claim
28 words
A computer product according to claim 85 , further including instructions to compute at least one binary representation corresponding to at least one neighbor of the second location.
Claim 101
Dependent Claim
56 words
A computer product according to claim 85 , further including instructions to determine at least one of whether the binary representation of the first location is a neighbor of the binary representation of the second location, and whether the binary representation of the second location is a neighbor of the binary representation of the first location.
References Cited (Backward Citations)
US3764719A
Cited
US3864681A
Cited
GB1485799A
Cited
US5404135A
Cited
US5848131A
Cited
US5727057A
Cited
US6047236A
Cited
US5953722A
Cited
US5991739A
Cited
US6199014B1
Cited
WO2000023862A2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-04-21 | 2006-10-21 | 2007-04-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-04-21 | 2010-10-21 | 2011-04-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-04-21 | 2014-10-21 | 2015-04-22 | $7700.00 | Window Closed / Lapsed |