$15.$ Our corner response function may return a lot of corners that can be quite close to each other.

What we$$d like to do next is define a minimum distance that we want these features $($corners$)$ to

be from each other. We$$ll then want to step through each of our corners and remove the ones

that are close too close to each other. We do this by starting with the strongest corner that we

found $($the first one in the list because it$$s sorted$)$ and remove other corners that are within the

minimum distance to this point.

$16.$ First thing we will want to do is initialize our minimum distance:

minDistance $=10$;

$17.$ Copy and paste the following code into your program and complete the code

while$($size$($cornerList$,2)>0)$

c$1=$ cornerList$(1)$;

cornerList $=$ cornerList$(2$:end$)$; $\%$remove the first one

goodCorners $=[$goodCorners c$1]$;

cornersToRemove $=[]$;

for i$=2$:size$($cornerList$,2)$

if$(<<>>>)$

cornersToRemove $=[$cornersToRemove i$]$;

end

end

cornerList$($cornersToRemove$)=[]$; $\%$remove the corners that we found

that are too close

end

$18.$ Step through the goodCorners list and mark each of the corners in the image with a green cross that is $3$ pixels in width and height using the insertMarker function.

$19.$ Display the image to the user