Implemented classic image feature detection, description as well as matching within OpenCV:
Keypoints detectors: implemented based on intensity gradients such as HARRIS, SHITOMASI, etc, as well as Non-maximum Suppression (NMP) technique for clearing overlapping of keypoints
Descriptors: applied OpenCV built-in descriptors, including Histograms of Oriented (HoG) based descriptors such as SIFT and SURF, as well as Binary Descriptors such as BRISK, BRISK, ORB and AKAZE.
Descriotpr Matching: implemented manually about L1, L2 norms matching, as well as K Nearest Neighbor matching algorithm based on distances / ratios
Performed analysis on different combinations of detector / descriptor / matching to evaluate overall performance
The 2D CFAR algorithm takes the 2D FFT result, i.e., the complete Range Dopper Map (the variable RDM in the script), as its input
then the algorithm applies sliding window through the input, and during each iteration it conducts averaging of surrounding cell values of the interested cell (i.e., the Cell Under Test (CUT)), to take as threshold of the CUT.
Parameter Selection: to achieve an ideal performance of 2D CFAR, the following paramters are set: