| 0f6cc7d | ivreo | 08 July 2016, 18:31:44 UTC | Update README.md | 08 July 2016, 18:31:44 UTC |
| 7ff4210 | ivreo | 08 July 2016, 15:38:14 UTC | Documentation | 08 July 2016, 15:38:14 UTC |
| 06ccdc1 | ivreo | 21 December 2015, 16:31:10 UTC | sift applied on tiles A binary scale-space is the input. | 21 December 2015, 16:31:10 UTC |
| e739041 | ivreo | 01 December 2015, 15:09:22 UTC | cleaning up gradual, - adding the description to gradual routine - removed scale-space export routines not used anymore. | 01 December 2015, 15:09:22 UTC |
| 7a8bd32 | ivreo | 03 November 2015, 14:31:03 UTC | extra_sift_cli only compute and save DoG | 03 November 2015, 14:31:03 UTC |
| c40cdd4 | ivreo | 28 October 2015, 19:02:42 UTC | check_extrema_in_scalespace Tool to check the presence of extrema using a scalespace binary file Corrected Makefile to compile the extrema confirmation routines | 28 October 2015, 19:02:42 UTC |
| 1e868ae | ivreo | 27 October 2015, 16:27:21 UTC | New functionnalities to test and visualize extrema Save scale-space file in binary files - sift_write_scalespace_binary_file function - sift_read_scalespace_binary_file function with the option -bin_ss [label] in extra_sift_cli.cpp For a list of keypoints - grab_ss_neighborhood program extracts the keypoint surroundings and save the corresponding array in binary files. For a surrouding stored in a binary file, 'check_extremum_in_cube.cpp' confirms the presence of the extremum. | 27 October 2015, 16:27:21 UTC |
| 77d82ca | ivreo | 27 October 2015, 16:03:51 UTC | ----------------------------------------------------- fnspo and nspo options on gradual are now redundant. ----------------------------------------------------- gradual does not apply the edge filter anymore ----------------------------------------------------- Three new routines to detect of confirm scale-space extrema: 1) keypoints_find_3d_discrete_extrema_epsilon_sphere 2) keypoints_check_3d_discrete_extrema_epsilon_sphere 3) keypoints_confirm_extremum_present_in_ball Details: 1) To look for extrema, each sample is compared to the samples inside points on an annulus bounded by radii r and (r + dr) 2) The same criterion is applied at the nearest discrete sample to confirm the existence of an extremum on that given point, 3) Another criterion. The mean, min or max value of samples inside a ball of radius r1 is compared to the mean, min of max of samples inside an annulus bounded by radii r2 and r3. Three different criteria are coded, two of which are commented. For these routines to work correcty, octaves are computed entirely (in a gradual way) with - sift_malloc_scalespace_dog_gradual_floatnspo_ENTIREOCTAVE The corresponding binaries are - gradual_check_extrema.cpp - gradual_entireoctave.cpp ----------------------------------------------------- | 27 October 2015, 16:03:51 UTC |
| b12bdda | ivreo | 30 July 2015, 21:54:33 UTC | first commit | 30 July 2015, 21:54:33 UTC |
