Coordinates of corners of quadrilateral in binary mask
16 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
João Miguel Ribeiro
il 21 Ott 2019
Commentato: Matt J
il 28 Ott 2020
I'm doing a project on computer vision in which I have to compute some homographies and perform image stitching. I also have to provide the coordinates of the corners of each image in the final panorama.
Essentially, what I need is to determine the [x,y] coordinates (or i,j indices) of the four corners of a quadrilateral in a binary mask (example in the image below).
I coded a pretty computationally inefficient function to do it. But it misses one of the corners whenever the quadrilateral is a trapezoid (which is most of the time). I tried fixing it but haven't managed to get it quite right. I have tried to detect edges and lines using the hough algorithm and then getting the intersections of those lines but the results aren't precise and looks like a complicated way of solving a somewhat simple problem. Any matlab functions or implementation ideas for this task?
Risposta accettata
Matt J
il 22 Ott 2019
Modificato: Matt J
il 22 Ott 2019
The Computer Vision Toolbox has some ready-made corner detection functions, e.g.,
You could also try this improvised algorithm:
N=360;
theta=linspace(0,360,N);
[I,J]=find(Image);
IJ=[I,J];
c=nan(size(theta));
for i=1:N
[~,c(i)]=max(IJ*[cosd(theta(i));sind(theta(i))]);
end
H=histcounts(c,1:numel(I)+1);
[~,k] = maxk(H,4);
corners=IJ(k,:)
5 Commenti
Anna Maria Franzen
il 28 Ott 2020
Dear Matt,
could you please explain what your improvised algorithm exactly does? Especially the formula in the for - loop, what´s the mathematical background?
Matt J
il 28 Ott 2020
Anna,
You can find some explanation here,
Also, you should probably use the implementation that I posted on the File Exchange,
Più risposte (0)
Vedere anche
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!