Is there a way to extract the 4 corners points from all the points found with detectMinEigenFeatures?

I am trying to make an Augmented Reality video feature using automatic detection after designating an area using 4 points with drawpolygon. I am getting a lot of matches, and I want to make a generic solution that can find the 4 corner points for the homography as marked in red below:

I have tried using max- and min-points, but this does not work for all camera angles as different directions might render the upper right corner as the minX instead of the upper left corner and so on.

edit; In particular, this breaks when seeing the checkerboard "straight on" as for example both minX goes to the same value as maxY and can occupy neighbouring detections.

Answer 1

[Matt J]

If you have a binary map of the chequerboard, you can use imerode to separate the black squares and then pgonCorners

https://www.mathworks.com/matlabcentral/fileexchange/74181-find-vertices-in-image-of-convex-polygon

to identify the corners of each.

[Arseni Ivanov]

Interesting answer.

edit; I assumed first column was x-values so I got the wrong result. Matt's code works and a sample can be found below.

corners = pgonCorners(BW,4);

It gives me 2 points outside of the screen for the most of the video, and the two others do not seem to detect the corners.

[Matt J]

Something in how you displayed the results, I'm guessing. In the code below, you can see that I'm getting a very decent corner detection with your image.

load Image

corners=pgonCorners(BW,4);

imshow(BW)
hold on
plot( corners(:,2),corners(:,1),'yo','MarkerFaceColor','r','MarkerSize',15);
hold off

[Arseni Ivanov]

You are right it works, I just assumed that the first column of the output was x and not y, so by flipping my output it now works properly. I will edit the message as it was my fault. If anyone is interested in the code from the image above to the result posted by Matt J:

se = strel('disk',45);
T = imerode(imcomplement(imerode(imbinarize(rgb2gray(I),0.19),se)),se);
T = bwareafilt(T,1);
points = pgonCorners(T,4);
points = flip(xA,2);

Note that this is very slow due to probably unnecessary operations but it works. Also it's very adapted to my scene so anyone stumbling upon this might have to change the threshold, single structuring element and order of operations on the image.

Answer 2

[Gatech AE]

I think an interesting way might be using the convex hull of your points. Running on the assumption that you have an Nx2 array of points,

x = Pts(:,1);
y = Pts(:,2);
k = convhull(x,y);

The variable k returns the indices of the points that form the perimeter sorted in counter-clockwise order. So for the corners,

corners = Pts(k,:);

[Arseni Ivanov]

Thank you for the suggestion, I think that this can be a very good solution if you have a better pattern. In my case, I get k ranging from size of 4 to 14 indexes depending on the frame as a lot of the points lie exactly on the edge due to the checkered pattern. Perhaps I can play around with these points and treat nearby points as a mean of the group.and see if this gives an alright approximation.

edit; I might be wrong though, and perhaps the extra points are a result of the image being uneven, creating a bigger hull