Algorithm

Designing an efficient curve-matching algorithm

Designing an efficient curve-matching algorithm
  1. What is the algorithm for matching?
  2. How do you evaluate a matching algorithm?

What is the algorithm for matching?

The matching algorithm can be summarized as follows. A block of records is read from data source or in a Reference Match from both a data source and reference source. All columns are compared and a composite weight is computed for each possible record pair in the block. A matrix of composite weights is created.

How do you evaluate a matching algorithm?

To evaluate your matching algorithm, you may manually identify some landmarks (keypoint) in the first image (X1) and their correspondence in the second image(Xac). Given the landmarks of the first image(X1), use your matching algorithm to find their correspondence in the second image (Xm).

Can a large drop in the PSD indicate the presence of a periodic noise?
What is PSD power spectral density?How is PSD calculated?How do you find the PSD of a signal in Matlab?Why is power spectral density used? What is P...
Is the negative spectrum (by DFT) of a real signal needed to reconstruct it?
What does DFT do to a signal?What do negative values in FFT mean?Why are there negative frequencies in FFT?What happens if we apply DFT twice to a si...
How to calculate amplitude from a wav file?
What is amplitude in WAV file?How do I find the frequency of a WAV file?What is the unit of a WAV file? What is amplitude in WAV file?The 16 bit val...