A system and method for selecting a best match of a received input signal from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated. In a preprocessing phase a unified signal transform (UST) is determined from the candidate signals. The UST converts each candidate signal to a generalized frequency domain. The UST is applied at a generalized frequency to each candidate signal to calculate corresponding generalized frequency component values (GFCVs) for each candidate signal. At runtime, the input signal of interest is received, and the UST is applied at the generalized frequency to the input signal of interest to calculate a corresponding GFCV. The best match is determined between the GFCV of the input signal of interest and the GFCVs of each of the set of candidate signals. Finally, information indicating the best match candidate signal from the set of candidate signals is output.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A computer-implemented method for determining a “best match” of an input signal of interest from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated, the method comprising: receiving an initial set of N candidate signals, wherein at least one of said initial set of candidate signals comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate signals, thereby generating said set of candidate signals, wherein each one of said set of candidate signals comprises N values; determining a unified signal transform from the set of candidate signals; applying the unified signal transform for at least one generalized frequency to each of the set of candidate signals to calculate a corresponding at least one generalized frequency component value for each of the set of candidate signals; receiving the input signal of interest; applying the unified signal transform for the at least one generalized frequency to the input signal of interest to calculate a corresponding at least one generalized frequency component value for the input signal of interest; determining a best match between the at least one generalized frequency component value of the input signal of interest and the at least one generalized frequency component value of each of the set of candidate signals; and outputting information indicating a best match candidate signal from the set of candidate signals.
2. The method of claim 1 , wherein said determining a best match between the at least one generalized frequency component value of the input signal of interest and the at least one generalized frequency component value of each of the set of candidate signals comprises: subtracting each of the respective at least one generalized frequency component values of each candidate signal from the at least one generalized frequency component value of the input signal of interest; and determining a smallest difference between each of the respective at least one generalized frequency component values of each candidate signal and the at least one generalized frequency component value of the input signal of interest; wherein a candidate signal corresponding to the smallest difference is the best match candidate signal.
3. The method of claim 1 , wherein the unified signal transform includes a set of basis functions which describe an algebraic structure of the set of candidate signals.
4. The method of claim 1 , wherein the unified signal transform is operable to convert each of the set of candidate signals to a generalized frequency domain.
5. The method of claim 1 , wherein the unified signal transform is operable to convert each of the set of candidate signals into a representation of generalized basis functions, wherein the basis functions represent the algebraic structure of the set of candidate signals.
6. The method of claim 1 , wherein the unified signal transform is operable to decompose the signal into generalized basis functions, wherein the basis functions represent the algebraic structure of the set of candidate signals.
7. The method of claim 1 , wherein all of the candidate signals are uncorrelated with each other.
8. The method of claim 1 , wherein the input signal of interest and the candidate signals are one of 1-dimensional signals, 2-dimensional signals, or 3-dimensional signals.
9. The method of claim 1 , wherein the input signal of interest and the candidate signals are of a dimensionality greater than 3.
10. The method of claim 1 , wherein the input signal of interest and the candidate signals comprise one or more of image data, measurement data, acoustic data, seismic data, financial data, stock data, futures data, business data, scientific data, medical data, insurance data, musical data, biometric data, and telecommunications signals.
11. The method of claim 1 , wherein said determining a unified signal transform for the set of candidate signals comprises: forming a matrix B from all of the values of the candidate signals, wherein each of the candidate signals comprises a corresponding column of the matrix B; defining a matrix {acute over (B)}, wherein the matrix {acute over (B)} comprises a column-wise cyclic shifted matrix B; defining a matrix A, wherein the matrix A comprises a cyclic shift matrix operator, wherein multiplying matrix A times matrix B performs a column-wise cyclic shift on matrix B, thereby generating matrix {acute over (B)}, wherein AB={acute over (B)}, wherein A={acute over (B)}B −1 , wherein B −1 comprises an inverse matrix of matrix B, and wherein A N =an N×N identity matrix, I; performing a Jordan decomposition on A={acute over (B)}B −1 , thereby generating a relation A=X B ΛX B −1 , wherein X B comprises a matrix of normalized columnar eigenvectors of matrix B, wherein Λ comprises a diagonal matrix of eigenvalues of matrix B, and wherein X B −1 comprises an inverse matrix of matrix X B ; and calculating matrix X B −1 , wherein the matrix X B −1 comprises the unified signal transform.
12. The method of claim 11 , wherein the set of candidate signals comprises a number of candidate signals, wherein each of the candidate signals comprises a number of values, and wherein the number of values is equal to the number of candidate signals.
13. The method of claim 12 , wherein the matrix B is regular.
14. The method of claim 1 , wherein said providing additional N−M values comprises interpolating two or more of the M values to generate the additional N−M values.
15. The method of claim 1 , wherein said providing additional N−M values comprises extrapolating two or more of the M values to generate the additional N−M values.
16. The method of claim 1 , wherein said receiving an initial set of N candidate signals comprises: receiving an initial set of M candidate signals, wherein each of said initial set of candidate signals comprises a set of N values, and wherein M is less than N; and providing an additional N−M candidate signals to said initial set of candidate signals, thereby generating said set of candidate signals, wherein said set of candidate signals comprises N candidate signals, and wherein each one of said set of candidate signals comprises N values.
17. The method of claim 16 , wherein said providing additional N−M candidate signals to said initial set of candidate signals comprises providing N−M arbitrary candidate signals.
18. The method of claim 1 , wherein said outputting information comprises displaying the information on a display screen.
19. The method of claim 1 , wherein said outputting information comprises storing the best match candidate signal in a memory medium of a computer system.
20. The method of claim 1 , further comprising: processing the best match candidate signal to determine if the best match candidate is an acceptable match.
21. The method of claim 1 , further comprising: processing the best match candidate signal to determine characteristics of the received input signal of interest.
22. A computer-readable memory medium comprising program instructions which are computer-executable to determine a “closest match” between an input signal of interest and one of a set of candidate signals, wherein two or more of the candidate signals are uncorrelated, wherein the program instructions are computer-executable to perform: receiving an initial set of N candidate signals, wherein at least one of said initial set of candidate signals comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate signals, thereby generating said set of candidate signals, wherein each one of said set of candidate signals comprises N values; determining a signal transform from the set of candidate signals; calculating one or more values of the signal transform applied to each of the set of candidate signals at at least one generalized frequency receiving the input signal of interest; calculating one or more values of the signal transform applied to the input signal of interest at the at least one generalized frequency; determining a best match between the one or more values of the transformation of the input signal of interest and the one or more values of the transformation for each of the set of candidate signals; and outputting information indicating a closest match candidate signal of the set of candidate signals.
23. The memory medium of claim 22 , wherein the signal transform includes a set of basis functions which describe an algebraic structure of the set of candidate signals.
24. The memory medium of claim 22 , wherein the signal transform is operable to convert each of the set of candidate signals to a generalized frequency domain.
25. The memory medium of claim 22 , wherein the signal transform is operable to convert each of the set of candidate signals into a representation comprising generalized basis functions, wherein the basis functions represent the algebraic structure of the set of candidate signals.
26. The memory medium of claim 22 , wherein the signal transform is operable to decompose the signal into a form represented by generalized basis functions, wherein the basis functions represent the algebraic structure of the set of candidate signals.
27. The memory medium of claim 22 , wherein the signal transform is the unified signal transform.
28. The memory medium of claim 22 , wherein all of the candidate signals are uncorrelated with each other.
29. The memory medium of claim 22 , wherein the input signal of interest and the candidate signals are one of 1-dimensional signals, 2-dimensional signals, or 3-dimensional signals.
30. The memory medium of claim 22 , wherein the input signal of interest and the candidate signals are of a dimensionality greater than 3.
31. The memory medium of claim 22 , wherein the input signal of interest and the candidate signals comprise one or more of image data, measurement data, acoustic data, seismic data, financial data, stock data, futures data, business data, scientific data, medical data, insurance data, musical data, biometric data, and telecommunications signals.
32. The memory medium of claim 22 , wherein said outputting information comprises displaying the information on a display screen.
33. The memory medium of claim 22 , wherein said outputting information comprises storing the best match candidate signal in a memory medium of a computer system.
34. A computer-implemented method for determining a “best match” of an input image of interest from a set of candidate images, wherein two or more of the candidate images are uncorrelated, the method comprising: receiving an initial set of N candidate images, wherein at least one of said initial set of candidate images comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate images, thereby generating said set of candidate images, wherein each one of said set of candidate images comprises N values; determining a unified signal transform from the set of candidate images; applying the unified signal transform for at least one generalized frequency to each of the set of candidate images to calculate a corresponding at least one generalized frequency component value for each of the set of candidate images; receiving the input image of interest; applying the unified signal transform for the at least one generalized frequency to the input image of interest to calculate a corresponding at least one generalized frequency component value for the input image of interest; determining a best match between the at least one component value of the input image of interest and the at least one component value of each of the set of candidate images; and outputting information indicating a best match candidate image from the set of candidate images.
35. A computer-implemented method for determining a “best match” of an input data set of interest from a set of candidate data sets, wherein two or more of the candidate data sets are uncorrelated, the method comprising: receiving an initial set of N candidate data sets, wherein at least one of said initial set of candidate data sets comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate data sets, thereby generating said set of candidate data sets, wherein each one of said set of candidate data sets comprises N values; determining a unified signal transform from the set of candidate data sets; applying the unified signal transform for at least one generalized frequency to each of the set of candidate data sets to calculate a corresponding at least one generalized frequency component value for each of the set of candidate data sets; receiving the input data set of interest; applying the unified signal transform for the at least one generalized frequency to the input data set of interest to calculate a corresponding at least one generalized frequency component value for the input data set of interest; determining a best match between the at least one component value of the input data set of interest and the at least one component value of each of the set of candidate data sets; and outputting information indicating a best match candidate data set from the set of candidate data sets.
36. A computer-implemented method for determining a “best match” of an input biometric signal of interest from a set of candidate biometric signals, wherein two or more of the candidate biometric signals are uncorrelated, the method comprising: receiving an initial set of N candidate biometric signals, wherein at least one of said initial set of candidate biometric signals comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate biometric signals, thereby generating said set of candidate biometric signals, wherein each one of said set of candidate biometric signals comprises N values; determining a unified signal transform from the set of candidate biometric signals; applying the unified signal transform for at least one generalized frequency to each of the set of candidate biometric signals to calculate a corresponding at least one generalized frequency component value for each of the set of candidate biometric signals; receiving the input biometric signal of interest; applying the unified signal transform for the at least one generalized frequency to the input biometric signal of interest to calculate a corresponding at least one generalized frequency component value for the input biometric signal of interest; determining a best match between the at least one component value of the input biometric signal of interest and the at least one component value of each of the set of candidate biometric signals; and outputting information indicating a best match candidate biometric signal from the set of candidate biometric signals.
37. A computer-implemented method for determining a “best match” of an input stock history waveform of interest from a set of candidate stock behavior waveforms, wherein two or more of the candidate stock behavior waveforms are uncorrelated, the method comprising: receiving an initial set of N candidate stock behavior waveforms, wherein at least one of said initial set of candidate stock behavior waveforms comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate stock behavior waveforms, thereby generating said set of candidate stock behavior waveforms, wherein each one of said set of candidate stock behavior waveforms comprises N values; determining a unified signal transform from the set of candidate stock behavior waveforms; applying the unified signal transform for at least one generalized frequency to each of the set of candidate stock behavior waveforms to calculate a corresponding at least one generalized frequency component value for each of the set of candidate stock behavior waveforms; receiving the input stock history waveform of interest; applying the unified signal transform for the at least one generalized frequency to the input stock history waveform of interest to calculate a corresponding at least one generalized frequency component value for the input stock history waveform of interest; determining a best match between the at least one component value of the input stock history waveform of interest and the at least one component value of each of the set of candidate stock behavior waveforms; and outputting information indicating a best match candidate stock history waveform from the set of candidate stock behavior waveforms.
38. A computer-implemented method for determining a “best match” of an input telecommunications signal of interest from a set of candidate telecommunications signals, wherein two or more of the candidate telecommunications signals are uncorrelated, the method comprising: receiving an initial set of N candidate telecommunications signals, wherein at least one of said initial set of candidate telecommunications signals comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate telecommunications signals, thereby generating said set of candidate telecommunications signals, wherein each one of said set of candidate telecommunication signals comprises N values; determining a unified signal transform from the set of candidate telecommunications signals; applying the unified signal transform for at least one generalized frequency to each of the set of candidate telecommunications signals to calculate a corresponding at least one generalized frequency component value for each of the set of candidate telecommunications signals; receiving the input telecommunications signal of interest; applying the unified signal transform for the at least one generalized frequency to the input telecommunications signal of interest to calculate a corresponding at least one generalized frequency component value for the input telecommunications signal of interest; determining a best match between the at least one component value of the input telecommunications signal of interest and the at least one component value of each of the set of candidate telecommunications signals; and outputting information indicating a best match candidate telecommunications signal from the set of candidate telecommunications signals.
39. A computer-implemented method for determining a “best match” of an input medical image of interest from a set of candidate medical images, wherein two or more of the candidate medical images are uncorrelated, the method comprising: receiving an initial set of N candidate medical images, wherein at least one of said initial set of candidate medical images comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate medical images, thereby generating said set of candidate medical images, wherein each one of said set of candidate comprises N values; determining a unified signal transform from the set of candidate medical images; applying the unified signal transform for at least one generalized frequency to each of the set of candidate medical images to calculate a corresponding at least one generalized frequency component value for each of the set of candidate medical images; receiving the input medical image of interest; applying the unified signal transform for the at least one generalized frequency to the input medical image of interest to calculate a corresponding at least one generalized frequency component value for the input medical image of interest; determining a best match between the at least one component value of the input medical image of interest and the at least one component value of each of the set of candidate medical images; and outputting information indicating a best match candidate medical image from the set of candidate medical images.
40. A computer-implemented method for determining a “best match” of an input signal of interest from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated, the method comprising: receiving the input signal of interest; receiving an initial set of N candidate signals, wherein at least one of said initial set of candidate signals comprises a set of M values, wherein M is less than N; providing additional N−M values for the at least one of said initial set of candidate signals, thereby generating said set of candidate signals, wherein each one of said set of candidate signals comprises N values; applying a unified signal transform for at least one generalized frequency to the input signal of interest to calculate a corresponding at least one generalized frequency component value for the input signal of interest, wherein the unified signal transform is determined from the set of candidate signals; determining a best match between the at least one generalized frequency component value of the input signal of interest and at least one generalized frequency component value of each of the set of candidate signals; and outputting information indicating a best match candidate signal from the set of candidate signals.
41. A computer-implemented method for determining a “best match” of an input signal of interest from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated, the method comprising: determining a unified signal transform from the set of candidate signals, wherein said determining a unified signal transform for the set of candidate signals comprises: forming a matrix B from all of the values of the candidate signals, wherein each of the candidate signals comprises a corresponding column of the matrix B; defining a matrix {acute over (B)}, wherein the matrix {acute over (B)} comprises a column-wise cyclic shifted matrix B; defining a matrix A, wherein the matrix A comprises a cyclic shift matrix operator, wherein multiplying matrix A times matrix B performs a column-wise cyclic shift on matrix B, thereby generating matrix {acute over (B)}, wherein AB={acute over (B)}, wherein A={acute over (B)}B −1 , wherein B −1 comprises an inverse matrix of matrix B, and wherein A N =an N×N identity matrix, I; performing a Jordan decomposition on A={acute over (B)}B −1 , thereby generating a relation A=X B ΛX B −1 , wherein X B comprises a matrix of normalized columnar cigenvectors of matrix B, wherein A comprises a diagonal matrix of eigenvalues of matrix B, and wherein X B −1 comprises an inverse matrix of matrix X B ; and calculating matrix X B −1 , wherein the matrix X B −1 comprises the unified signal transform; applying the unified signal transform for at least one generalized frequency to each of the set of candidate signals to calculate a corresponding at least one generalized frequency component value for each of the set of candidate signals; receiving the input signal of interest; applying the unified signal transform for the at least one generalized frequency to the input signal of interest to calculate a corresponding at least one generalized frequency component value for the input signal of interest; determining a best match between the at least one generalized frequency component value of the input signal of interest and the at least one generalized frequency component value of each of the set of candidate signals; and outputting information indicating a best match candidate signal from the set of candidate signals.
42. The method of claim 41 , wherein the set of candidate signals comprises a number of candidate signals, wherein each of the candidate signals comprises a number of values, and wherein the number of values is equal to the number of candidate signals.
43. The method of claim 42 , wherein the matrix B is regular.
44. A computer-implemented method for determining a “best match” of an input signal of interest from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated, the method comprising: receiving an initial set of N candidate signals, wherein at least one of said initial set of candidate signals comprises a set of M values, wherein M is less than N; fitting a curve to the M values for the at least one of said initial set of candidate signals; sampling the curve to generate N values for the at least one of said initial set of candidate signals, thereby generating said set of candidate signals, wherein each one of said set of candidate signals comprises N values; determining a unified signal transform from the set of candidate signals; applying the unified signal transform for at least one generalized frequency to each of the set of candidate signals to calculate a corresponding at least one generalized frequency component value for each of the set of candidate signals; receiving the input signal of interest; applying the unified signal transform for the at least one generalized frequency to the input signal of interest to calculate a corresponding at least one generalized frequency component value for the input signal of interest; determining a best match between the at least one generalized frequency component value of the input signal of interest and the at least one generalized frequency component value of each of the set of candidate signals; and outputting information indicating a best match candidate signal from the set of candidate signals.
45. A computer-implemented method for determining a “best match” of an input signal of interest from a set of candidate signals, wherein two or more of the candidate signals are uncorrelated, the method comprising: receiving an initial set of M candidate signals, wherein each of said initial set of candidate signals comprises a set of N values, and wherein M is less than N, providing an additional N−M candidate signals to said initial set of candidate signals, thereby generating said set of candidate signals, wherein said set of candidate signals comprises N candidate signals, and wherein each one of said set of candidate signals comprises N values, determining a unified signal transform from the set of candidate signals; applying the unified signal transform for at least one generalized frequency to each of the set of candidate signals to calculate a corresponding at least one generalized frequency component value for each of the set of candidate signals; receiving the input signal of interest; applying the unified signal transform for the at least one generalized frequency to the input signal of interest to calculate a corresponding at least one generalized frequency component value for the input signal of interest; determining a best match between the at least one generalized frequency component value of the input signal of interest and the at least one generalized frequency component value of each of the set of candidate signals; and outputting information indicating a best match candidate signal from the set of candidate signals.
46. The method of claim 45 , wherein said providing additional N−M candidate signals to said initial set of candidate signals comprises providing N−M arbitrary candidate signals.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
January 12, 2001
November 8, 2005
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.