Patent US6408085B1 successfully refreshed from Google Patents.
← Back to Patent Explorer
US6408085B1 Expired / Lapsed US ⏱️ 0.0 years remaining

System for matching nodes of spatial data sources

Assignee: Maxar Intelligence Inc
•
Filing: 1998-07-22
•
Granted: 2002-06-18
•
Expires: 2018-07-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system for matching nodes of different spatial data sources. The system matches or ties a node from one data source to another data source. The present invention uses a highly accurate exclusion technique for excluding potential corresponding nodes of a second data source. Potential corresponding nodes are selected using node degree comparison, adjacency, fourier descriptor analysis of shapes formed by connecting paths between a node under investigation and a secondary node associated with that node under investigation, an analysis of total length to secondary nodes, an angle analysis to eliminate reflections, a secondary node degree analysis, and a surrounding node correlation coefficient comparison. Using one or more of these techniques in various combinations can result in the selection of a potential corresponding node with a high degree of accuracy.

Inventors

  • 👤 Patrick W. Yuen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 04:52
CPC Classifications
G; G06; G06T; G06T17/00; G06T17/05; G06V; G06V10/00; G06V10/70; G06V10/74; G06V10/75; G06V10/757; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99944; Y10S707/99945; Y10S707/99948

Claims Analysis

Total Claims: 54
Claim 1
Independent Claim 166 words
A process of tying a selected node of a first data source to a corresponding node of a second data source comprising the steps of: generating trace coordinates between said selected node of said first data source and one or more secondary nodes of said first data source associated with said selected node; generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes of said second data source associated with said potential corresponding nodes; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes; tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 2
Dependent Claim 166 words
A process of tying a selected node of a first data source to a corresponding node of a second data source comprising the steps of: generating trace coordinates between said selected node of said first data source and one or more secondary nodes of said first data source associated with said selected node; generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes of said second data source associated with said potential corresponding nodes; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes; tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 3
Dependent Claim 29 words
The process of claim 1 further comprising the step of: eliminating nonrelevant potential corresponding nodes that have a degree that is different from the degree of said selected node.
Claim 4
Dependent Claim 39 words
The process of claim 1 further comprising the step of: eliminating nonrelevant potential corresponding nodes by comparing total length measurements of said trace coordinates associated with said selected node with said trace coordinates associated with said potential corresponding nodes.
Claim 5
Dependent Claim 39 words
The process of claim 1 further comprising the step of: eliminating nonrelevant potential corresponding nodes by performing an angle analysis between said trace coordinates associated with said selected node and said trace coordinates associated with said potential corresponding nodes.
Claim 6
Dependent Claim 39 words
The process of claim 1 further comprising the step of: eliminating nonrelevant potential corresponding nodes by comparing the degree of secondary nodes associated with said selected node with the degree of secondary nodes associated with said potential corresponding nodes.
Claim 7
Dependent Claim 27 words
The process of claim 1 further comprising the step of: eliminating nonrelevant potential corresponding nodes by comparing correlation coefficients of nodes that surround said potential corresponding node.
Claim 8
Dependent Claim 39 words
The process of claim 2 further comprising the step of: eliminating nonrelevant potential corresponding nodes by comparing total length measurements of said trace coordinates associated with said selected node with said trace coordinates associated with said potential corresponding nodes.
Claim 9
Dependent Claim 39 words
The process of claim 3 further comprising the step of: eliminating nonrelevant potential corresponding nodes by performing an angle analysis between said trace coordinates associated with said selected node and said trace coordinates associated with said potential corresponding nodes.
Claim 10
Dependent Claim 39 words
The process of claim 4 further comprising the step of: eliminating nonrelevant potential corresponding nodes by comparing the degree of secondary nodes associated with said selected node with the degree of secondary nodes associated with said potential corresponding nodes.
Claim 11
Dependent Claim 27 words
The process of claim 5 further comprising the step of: eliminating nonrelevant potential corresponding nodes by comparing correlation coefficients of nodes that surround said potential corresponding nodes.
Claim 12
Dependent Claim 116 words
The process of claim 1 wherein said step of generating trace coordinates between said selected node of said first data source and secondary nodes associated with said selected node further comprises the steps of: (a) generating first trace coordinates from said selected node to an initial secondary node; (b) storing said first trace coordinates; (c) generating second trace coordinates from said initial secondary node back to said selected node; (d) storing said second trace coordinates; (e) repeating steps (a) through (d) for each secondary node associated with said selected node so that said trace coordinates between said selected node of said first data source and said secondary nodes have a first selected number of sampling points.
Claim 13
Dependent Claim 142 words
The process of claim 11 wherein said step of generating trace coordinates between said potential corresponding nodes and secondary nodes associated with said potential corresponding nodes further comprises the steps of: (a) generating first trace coordinates from each of said potential corresponding nodes to an initial secondary node; (b) storing said first trace coordinates; (c) generating second trace coordinates from said initial secondary node back to each of said potential corresponding nodes; (d) storing said second trade coordinates; (e) repeating steps (a) through (d) for each secondary node associated with each of said potential corresponding nodes; (f) resampling said trace coordinates between said potential corresponding nodes and secondary nodes so that said trace coordinates between said potential corresponding nodes and said secondary nodes have a second selected number of sampling points that is equal to said first selected number of sampling points.
Claim 14
Dependent Claim 58 words
The process of claim 1 wherein said steps of generating fourier descriptors comprises the steps of: changing said trace coordinates into a series of complex numbers; performing a fourier transformation on said series of complex numbers to generate a series of fourier descriptors; eliminating higher order descriptors of said series of fourier descriptors to produce said fourier descriptors.
Claim 15
Dependent Claim 65 words
The process of claim 1 wherein said step of comparing further comprises: generating correlation coefficients by correlating said fourier descriptors of said trace coordinate associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes; eliminating nonrelevant potential corresponding nodes having a correlation coefficient associated with the selected node that is below at least one predetermined threshold.
Claim 16
Dependent Claim 88 words
The process of claim 4 wherein said step of eliminating nonrelevant potential corresponding nodes by performing an angle analysis comprises the steps of: superimposing said select node with each of said potential corresponding nodes; measuring acute angles formed between each branch of said trace coordinates associated with said selected node and said trace coordinates associated with each of said potential corresponding nodes; determining the largest acute angle for each superimposed pair; eliminating nonrelevant potential corresponding nodes whenever said largest acute angle falls below a predetermined number of degrees.
Claim 17
Dependent Claim 174 words
A computer system that is programmed to tie a selected node of a first data source to a corresponding node of a second data source by performing at least the following steps: generating trace coordinates between said selected node of said first data source and one or more secondary nodes of said first data source associated with said selected node; generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes of said second data source associated with said potential corresponding nodes; generating fourier descriptors of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with each of said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes; tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 18
Dependent Claim 174 words
A computer system that is programmed to tie a selected node of a first data source to a corresponding node of a second data source by performing at least the following steps: generating trace coordinates between said selected node of said first data source and one or more secondary nodes of said first data source associated with said selected node; generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes of said second data source associated with said potential corresponding nodes; generating fourier descriptors of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with each of said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes; tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 19
Dependent Claim 44 words
The computer system of claim 16 that is programmed to perform the additional following steps: eliminating nonrelevant potential corresponding nodes by comparing total length measurements of said trace coordinates associated with said selected node with said trace coordinates associated with said potential corresponding nodes.
Claim 20
Dependent Claim 44 words
The computer system of claim 16 that is programmed to perform the additional following step: eliminating nonrelevant potential corresponding nodes by performing an angle analysis between said trace coordinates associated with said selected node and said trace coordinates associated with said potential corresponding nodes.
Claim 21
Dependent Claim 44 words
The computer system of claim 16 that is programmed to perform the additional following step: eliminating nonrelevant potential corresponding nodes by comparing the degree of secondary nodes associated with said selected node with the degree of secondary nodes associated with said potential corresponding nodes.
Claim 22
Dependent Claim 32 words
The computer system of claim 16 that is programmed to perform the additional following step: eliminating nonrelevant potential corresponding nodes by comparing correlation coefficients of nodes that surround said potential corresponding node.
Claim 23
Dependent Claim 116 words
The computer system of claim 16 that is programmed such that the step of generating trace coordinates between said selected node of said first data source and secondary nodes includes the additional following steps: (a) generating first trace coordinates from said selected node to an initial secondary node; (b) storing said first trace coordinates; (c) generating second trace coordinates from said initial secondary node back to said selected node; (d) storing said second trace coordinates; (e) repeating steps (a) through (d) for each secondary node associated with said selected node so that said trace coordinates between said selected node of said first data source and said secondary nodes have a first selected number of sampling points.
Claim 24
Dependent Claim 141 words
The computer system of claim 21 that is programmed such that the step of generating trace coordinates between said potential corresponding nodes and secondary nodes includes the additional following steps: (a) generating first trace coordinates from each of said potential corresponding nodes to an initial secondary node; (b) storing said first trace coordinates; (c) generating second trace coordinates from said initial secondary node back to each of said potential corresponding nodes; (d) storing said second trade coordinates; (e) repeating steps (a) through (d) for each secondary node associated with each of said potential corresponding nodes; (f) resampling said trace coordinates between said potential corresponding nodes and secondary nodes so that said trace coordinates between said potential corresponding nodes and said secondary nodes have a second selected number of sampling points that is equal to said first selected number of sampling points.
Claim 25
Dependent Claim 64 words
The computer system of claim 16 that is programmed such that the step of generating fourier descriptors includes the additional following steps: changing said trace coordinates into a series of complex numbers; performing a fourier transformation on said series of complex numbers to generate a series of fourier descriptors; eliminating higher order descriptors of said series of fourier descriptors to produce said fourier descriptors.
Claim 26
Dependent Claim 70 words
The computer system of claim 16 that is programmed such that the steps of comparing further includes the additional following steps: generating correlation coefficients by correlating said fourier descriptors of said trace coordinate associated with said selected node with said trace coordinates associated with said potential corresponding nodes; eliminating nonrelevant potential corresponding nodes having a correlation coefficient associated with the selected node that is below at least one predetermined threshold.
Claim 27
Dependent Claim 93 words
The computer system of claim 18 that is programmed such that the step of eliminating nonrelevant potential corresponding nodes by performing angle analysis includes the additional following steps: superimposing said selected node with each of said potential corresponding nodes; measuring acute angle formed between each branch of said trace coordinates associated with said selected node and said trace coordinates associated with each of said potential corresponding nodes; determining the largest acute angle for each superimposed pair; eliminating nonrelevant potential corresponding nodes whenever said largest acute angle falls below a predetermined number of degrees.
Claim 28
Dependent Claim 190 words
A computer-readable medium that contains program code that is capable of causing a computer to perform a process of tying a selected node of a first data source to a corresponding node of a second data source in accordance with the following steps comprising: generating trace coordinates between said selected node of said first data source and one or more secondary nodes of said first data source associated with said selected node; generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes of said second data source associated with said potential corresponding nodes; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes of said potential corresponding nodes; tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 29
Dependent Claim 190 words
A computer-readable medium that contains program code that is capable of causing a computer to perform a process of tying a selected node of a first data source to a corresponding node of a second data source in accordance with the following steps comprising: generating trace coordinates between said selected node of said first data source and one or more secondary nodes of said first data source associated with said selected node; generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes of said second data source associated with said potential corresponding nodes; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes of said potential corresponding nodes; tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 30
Dependent Claim 41 words
The storage medium of claim 26 wherein said program code is capable of causing said computer to perform the additional steps of: eliminating nonrelevant potential corresponding nodes that have a degree that is different from the degree of said selected node.
Claim 31
Dependent Claim 51 words
The storage medium of claim 26 wherein said program code is capable of causing said computer to perform the additional steps of: eliminating nonrelevant potential corresponding nodes by comparing total length measurements of said trace coordinates associated with said selected node with said trace coordinates associated with said potential corresponding nodes.
Claim 32
Dependent Claim 51 words
The storage medium of claim 26 wherein said program code is capable of causing said computer to perform the additional steps of: eliminating nonrelevant potential corresponding nodes by performing an angle analysis between said trace coordinates associated with said selected node and said trace coordinates associated with said potential corresponding nodes.
Claim 33
Dependent Claim 51 words
The storage medium of claim 26 wherein said program code is capable of causing said computer to perform the additional steps of: eliminating nonrelevant potential corresponding nodes by comparing the degree of secondary nodes associated with said selected node with the degree of secondary nodes associated with said potential corresponding nodes.
Claim 34
Dependent Claim 39 words
The storage medium of claim 26 wherein said program code is capable of causing said computer to perform the additional steps of: eliminating nonrelevant potential corresponding nodes by comparing correlation coefficients of nodes that surround said potential corresponding node.
Claim 35
Dependent Claim 120 words
The storage medium of claim 26 wherein said program code is capable of causing said step of generating trace coordinates between said selected node of said first data source and secondary nodes to include the additional steps of: (a) generating first trace coordinates from said selected node to an initial secondary node; (b) storing said first trace coordinates; (c) generating second trace coordinates from said initial secondary node back to said selected node; (d) storing said second trace coordinates; (e) repeating steps (a) through (d) for each secondary node associated with said selected node so that said trace coordinates between said selected node of said first data source and said secondary nodes have a first selected number of sampling points.
Claim 36
Dependent Claim 144 words
The storage medium of claim 32 wherein said program code is capable of causing said step of generating trace coordinates between said potential corresponding nodes and secondary nodes includes the additional steps of: (a) generating first trace coordinates from each of said potential corresponding nodes to an initial secondary node; (b) storing said first trace coordinates; (c) generating second trace coordinates from said initial secondary node back to each of said potential corresponding nodes; (d) storing said second trade coordinates; (e) repeating steps (a) through (d) for each secondary node associated with each of said potential corresponding nodes; (f) resampling said trace coordinates between said potential corresponding nodes and secondary nodes so that said trace coordinates between said potential corresponding nodes and said secondary nodes have a second selected number of sampling points that is equal to said first selected number of sampling points.
Claim 37
Dependent Claim 68 words
The storage medium of claim 26 wherein said program code is capable of causing said step of generating fourier descriptors to include the additional steps of: changing said trace coordinates into a series of complex numbers; performing a fourier transformation on said series of complex numbers to generate a series of fourier descriptors; eliminating higher order descriptors of said series of fourier descriptors to produce said fourier descriptors.
Claim 38
Dependent Claim 73 words
The storage medium of claim 26 wherein said program code is capable of causing said step of comparing to include the additional steps of: generating correlation coefficients by correlating said fourier descriptors of said trace coordinate associated with said selected node with said trace coordinates associated with said potential corresponding nodes; eliminating nonrelevant potential corresponding nodes having a correlation coefficient associated with the selected node that is below at least one predetermined threshold.
Claim 39
Dependent Claim 91 words
The storage medium of claim 29 wherein said program code is capable of causing said step of performing angle analysis to include the additional steps of: superimposing said selected node with each of said potential corresponding nodes; measuring acute angles formed between each branch of said trace coordinates associated with said selected node and said trace coordinates associated with each of said potential corresponding nodes; determining the largest acute angle for each superimposed pair; eliminating nonrelevant potential corresponding nodes whenever said largest acute angle falls below a predetermined number of degrees.
Claim 40
Dependent Claim 163 words
A computer system that is programmed to tie a selected node of a first data source to a corresponding node of a second data source comprising: means for generating trace coordinates between said selected node and one or more secondary nodes associated with said selected node; means for generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes associated with said potential corresponding nodes; means for generating fourier descriptors of said trace coordinates associated with said selected node; means for generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; means for comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes; means for tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 41
Dependent Claim 163 words
A computer system that is programmed to tie a selected node of a first data source to a corresponding node of a second data source comprising: means for generating trace coordinates between said selected node and one or more secondary nodes associated with said selected node; means for generating trace coordinates between potential corresponding nodes of said second data source and one or more secondary nodes associated with said potential corresponding nodes; means for generating fourier descriptors of said trace coordinates associated with said selected node; means for generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; means for comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes; means for tying said selected node to a single remaining node of said potential corresponding nodes that corresponds to said corresponding node.
Claim 42
Dependent Claim 29 words
The computer system of claim 37 further comprising: means for eliminating nonrelevant potential corresponding nodes that have a degree that is different from the degree of said selected node.
Claim 43
Dependent Claim 39 words
The computer system of claim 37 further comprising: means for eliminating nonrelevant potential corresponding nodes by comparing total length measurements of said trace coordinates associated with said selected node with said trace coordinates associated with said potential corresponding nodes.
Claim 44
Dependent Claim 39 words
The computer system of claim 37 further comprising: means for eliminating nonrelevant potential corresponding nodes by performing an angle analysis between said trace coordinates associated with said selected node and said trace coordinates associated with said potential corresponding nodes.
Claim 45
Dependent Claim 39 words
The computer system of claim 37 further comprising: means for eliminating nonrelevant potential corresponding nodes by comparing the degree of secondary nodes associated with said selected node with the degree of secondary nodes associated with said potential corresponding nodes.
Claim 46
Dependent Claim 30 words
The computer system of claim 37 further comprising: means for eliminating nonrelevant potential corresponding nodes by comparing correlation coefficients of nodes that surround said potential corresponding note have been eliminated.
Claim 47
Dependent Claim 168 words
A process of associating a selected node of a first data source with a corresponding node of a second data source comprising the steps of: identifying said selected node and one or more secondary nodes of said first data source; identifying potential corresponding nodes and one or more secondary nodes of said second data source; generating trace coordinates between said selected node and said secondary nodes of said first data source; generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.
Claim 48
Dependent Claim 168 words
A process of associating a selected node of a first data source with a corresponding node of a second data source comprising the steps of: identifying said selected node and one or more secondary nodes of said first data source; identifying potential corresponding nodes and one or more secondary nodes of said second data source; generating trace coordinates between said selected node and said secondary nodes of said first data source; generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.
Claim 49
Dependent Claim 172 words
A computer system that is programmed to associate a selected node of a first data source with a corresponding node of a second data source comprising the steps of: identifying said selected node and one or more secondary nodes of said first data source; identifying potential corresponding nodes and one or more secondary nodes of said second data source; generating trace coordinates between said selected node and said secondary nodes of said first data source; generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.
Claim 50
Dependent Claim 172 words
A computer system that is programmed to associate a selected node of a first data source with a corresponding node of a second data source comprising the steps of: identifying said selected node and one or more secondary nodes of said first data source; identifying potential corresponding nodes and one or more secondary nodes of said second data source; generating trace coordinates between said selected node and said secondary nodes of said first data source; generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.
Claim 51
Dependent Claim 184 words
A computer-readable medium that contains program code that is capable of causing a computer to perform a process of associating a selected node of a first data source with a corresponding node of a second data source comprising the steps of: identifying said selected node and one or more secondary nodes of said first data source; identifying potential corresponding nodes and one or more secondary nodes of said second data source; generating trace coordinates between said selected node and said secondary nodes of said first data source; generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.
Claim 52
Dependent Claim 184 words
A computer-readable medium that contains program code that is capable of causing a computer to perform a process of associating a selected node of a first data source with a corresponding node of a second data source comprising the steps of: identifying said selected node and one or more secondary nodes of said first data source; identifying potential corresponding nodes and one or more secondary nodes of said second data source; generating trace coordinates between said selected node and said secondary nodes of said first data source; generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; generating a fourier descriptor of said trace coordinates associated with said selected node; generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.
Claim 53
Dependent Claim 186 words
A computer system that is programmed to associate a selected node of a first data source with a corresponding node of a second data source comprising the steps of: means for identifying said selected node and one or more secondary nodes of said first data source; means for identifying potential corresponding nodes and one or more secondary nodes of said second data source; means for generating trace coordinates between said selected node and said secondary nodes of said first data source; means for generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; means for generating a fourier descriptor of said trace coordinates associated with said selected node; means for generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and means for comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.
Claim 54
Dependent Claim 186 words
A computer system that is programmed to associate a selected node of a first data source with a corresponding node of a second data source comprising the steps of: means for identifying said selected node and one or more secondary nodes of said first data source; means for identifying potential corresponding nodes and one or more secondary nodes of said second data source; means for generating trace coordinates between said selected node and said secondary nodes of said first data source; means for generating trace coordinates between potential corresponding nodes and said secondary nodes of said second data source; means for generating a fourier descriptor of said trace coordinates associated with said selected node; means for generating fourier descriptors of said trace coordinates associated with said potential corresponding nodes; and means for comparing said fourier descriptors of said trace coordinates associated with said selected node with said fourier descriptors of said trace coordinates associated with said potential corresponding nodes to eliminate nonrelevant potential corresponding nodes of said potential corresponding nodes, whereby a single remaining node of said potential corresponding nodes is identified as said corresponding node.

References Cited (Backward Citations)

US5416894A Cited
US5629905A Cited
US5546107A Cited
US5719949A Cited
US6044171A Cited
US5862245A Cited
US5978520A Cited
US6278445B1 Cited
US5864632A Cited
US6084989A Cited
US6178381B1 Cited
US6215519B1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2005-06-17 2005-12-17 2006-06-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2009-06-17 2009-12-17 2010-06-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2013-06-17 2013-12-17 2014-06-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag